rank-select crates

coding_benchmark/README.md

@@ -1,6 +1,6 @@
 `coding_benchmark` is the program (by Piotr Beling) for benchmarking implementations of Huffman coding algorithms.
 
-It can test the implementations included in the following creates:
+It can test the implementations included in the following crates:
 - [minimum_redundancy](https://crates.io/crates/minimum_redudancy),
 - [constriction](https://crates.io/crates/constriction),
 - [huffman-compress](https://crates.io/crates/huffman-compress).
@@ -24,12 +24,11 @@ Once Rust is installed, just execute the following to install `coding_benchmark`
 
 ```RUSTFLAGS="-C target-cpu=native" cargo install coding_benchmark```
 
-Note that the instruction have been tested under GNU/Linux and may require some modifications for other systems.
-
 
 # Reproducing experiments from the papers
 
 ## Rust libraries and programs focused on succinct data structures
+(Piotr Beling *Rust libraries and programs focused on succinct data structures* submitted to SoftwareX)
 
 To see the results for all implementations, 100MB (100\*1024\*1024=104857600)
 text of randomly drawn (with a non-uniform distribution) 1 byte symbols

cseq_benchmark/README.md

@@ -1,13 +1,20 @@
 `cseq_benchmark` is the program (by Piotr Beling) for benchmarking compact sequences and bitmaps.
 
-It can test the algorithms included in the following creates:
-- [cseq](https://crates.io/crates/cseq): Elias-Fano,
-- [bitm](https://crates.io/crates/bitm): rank and select operation on bit vectors,
-- [sucds](https://crates.io/crates/sucds): rank and select operation on bit vectors.
+It can test the listed algorithms contained in the following crates:
+- [cseq](https://crates.io/crates/cseq): Elias-Fano;
+- [bitm](https://crates.io/crates/bitm): rank and select queries on bit vectors;
+- [vers](https://crates.io/crates/vers-vecs): rank and select queries on bit vectors;
+- [sucds](https://crates.io/crates/sucds): rank and select queries on bit vectors;
+- [succinct](https://crates.io/crates/succinct): rank and select queries on bit vectors;
+- [sux](https://crates.io/crates/sux): select queries on bit vectors.
+
 
 Please run the program with the `--help` switch to see the available options.
 
-Below you can find instruction for [installing](#installation) `cseq_benchmark`.
+Below you can find instruction for [installing](#installation) `cseq_benchmark` and
+[reproducing experiments](#reproducing-experiments-from-the-papers) performed with it,
+which can be found in published or under review papers.
+Note that these instructions have been tested under GNU/Linux and may require some modifications for other systems.
 
 
 # Installation
@@ -21,4 +28,8 @@ Once Rust is installed, just execute the following to install `cseq_benchmark` w
 
 ```RUSTFLAGS="-C target-cpu=native" cargo install cseq_benchmark```
 
-Note that the instruction have been tested under GNU/Linux and may require some modifications for other systems.
+
+# Reproducing experiments from the papers
+
+## Rust libraries and programs focused on succinct data structures
+(Piotr Beling *Rust libraries and programs focused on succinct data structures* submitted to SoftwareX)

csf_benchmark/README.md

@@ -1,6 +1,6 @@
 `csf_benchmark` is the program (by Piotr Beling) for benchmarking Compressed Static Functions.
 
-It can test the algorithms included in the following creates:
+It can test the algorithms included in the following crates:
 - [csf](https://crates.io/crates/csf).
 
 Please run the program with the `--help` switch to see the available options.

mphf_benchmark/README.md

@@ -1,6 +1,6 @@
 `mphf_benchmark` is the program (by Piotr Beling) for benchmarking Minimal Perfect Hash Functions.
 
-It can test the algorithms included in the following creates:
+It can test the algorithms included in the following crates:
 - [ph](https://crates.io/crates/ph),
 - [boomphf](https://crates.io/crates/boomphf),
 - [cmph-sys](https://crates.io/crates/cmph-sys) (only if compiled with `cmph-sys` feature, and only *CHD* algorithm is supported).