Bump version to 0.3.0

juba · Feb 19, 2022 · bc95e0f · bc95e0f
1 parent fe2ea89
commit bc95e0f
Show file tree

Hide file tree

Showing 2 changed files with 4 additions and 4 deletions.
diff --git a/DESCRIPTION b/DESCRIPTION
@@ -1,8 +1,8 @@
 Package: rainette
 Type: Package
 Title: The Reinert Method for Textual Data Clustering
-Version: 0.2.1.9000
-Date: 2021-10-06
+Version: 0.3.0
+Date: 2022-02-18
 Authors@R: c(person("Julien", "Barnier", email="julien.barnier@cnrs.fr",
     role=c("aut","cre")), person("Florian", "Privé",
     email="florian.prive.21@gmail.com", role="ctb"))

diff --git a/NEWS.md b/NEWS.md
@@ -1,11 +1,11 @@
-# rainette (development version)
+# rainette 0.3.0
 
 ## New features
 
 Rework of the double classification computation :
 
 - New `full` argument to `rainette2()`. If `TRUE` (default, same behavior as previous versions), all crossings between groups of the two single classifications are taken into account to find the best partition. If `FALSE`, only the crossings with maximal associations are kept.
-- New `parallel` argument to `rainette2()` to compute partitions with `mclapply` (`FALSE` by default, won't work on Windows)
+- New `parallel` argument to `rainette2()` to compute partitions with `mclapply` (`FALSE` by default, won't work on Windows, uses more RAM)
 - Global optimization and speed up of `rainette2()` computations, with added progress bars to better estimate long runs
 
 ## Documentation