From d5bfbc18310d369f7d377bdbeef0bac877cb2220 Mon Sep 17 00:00:00 2001 From: Simon Gene Gottlieb Date: Wed, 6 Nov 2024 01:09:32 +0100 Subject: [PATCH] fix: typos --- docs/concepts/Bitvector.md | 2 +- docs/concepts/RankVector.md | 2 +- src/example/main.cpp | 2 +- .../bitvector/SparseBLEBitvector.h | 2 +- .../checkGeneratorsIsComplete.cpp | 20 +++++++++---------- 5 files changed, 14 insertions(+), 14 deletions(-) diff --git a/docs/concepts/Bitvector.md b/docs/concepts/Bitvector.md index a933eae0..153bc0aa 100644 --- a/docs/concepts/Bitvector.md +++ b/docs/concepts/Bitvector.md @@ -17,7 +17,7 @@ functionality: | `#!c++ T(size_t length, Proj proj)` | | | `#!c++ auto size() const -> size_t` | Returns the number of bits of this vector. | | `#!c++ auto symbol(size_t idx) const -> bool` | Returns the bit at position `idx`. Parameter must be 0 ≤ idx < size(). | -| `#!c++ auto rank(size_t idx) const -> bool` | Returns the number of ones in the first `idx` bits. Paremeter must be 0 ≤ idx ≤ size(). | +| `#!c++ auto rank(size_t idx) const -> bool` | Returns the number of ones in the first `idx` bits. Parameter must be 0 ≤ idx ≤ size(). | ## Examples usages === "Construction and Usage" diff --git a/docs/concepts/RankVector.md b/docs/concepts/RankVector.md index 9e81b543..e9ac7337 100644 --- a/docs/concepts/RankVector.md +++ b/docs/concepts/RankVector.md @@ -74,7 +74,7 @@ All implementation are located inside the namespace `fmindex_collection::rankvec | `#!c++ EPRV5` | Similar to `EPRV3` but using one additional layer of blocks. (8bit and 16bit). | | `#!c++ DenseEPRV6` | Same as `EPRV5` but using a dense vector for the super blocks instead of 64bit values. (Not worth it). | | `#!c++ InterleavedEPRV7` | Similar to `EPRV5` but blocks and lowest layer are interleaved. | -| `#!c++ InterleavedWavelet` | Special version of Wavelet-trees (!TODO I think this was a combination fo EPR and Wavelet, not sure)| +| `#!c++ InterleavedWavelet` | Special version of Wavelet-trees (!TODO I think this was a combination of EPR and Wavelet, not sure)| | `#!c++ RLE` | (!TODO some parameters are missing) | | `#!c++ rRLE` | (!TODO some parameters are missing) | | `#!c++ Sdsl_wt_bldc` | Wrapper of the Wavelet-Tree implementation of the SDSL library. | diff --git a/src/example/main.cpp b/src/example/main.cpp index 665d5a2d..2f213190 100644 --- a/src/example/main.cpp +++ b/src/example/main.cpp @@ -64,7 +64,7 @@ int main(int argc, char const* const* argv) { " --stepSize_k (steps of errors)\\\n" " --no-reverse (don't use reverse compliment)\\\n" " --mode [all, besthits] (all: all hits with k errors (default), besthits: all hits with the lowest hit)\\\n" - " --maxhitsperquery (some int, 0 = infinit hits)\n" + " --maxhitsperquery (some int, 0 = infinite hits)\n" , ext, gens); return 0; } diff --git a/src/fmindex-collection/bitvector/SparseBLEBitvector.h b/src/fmindex-collection/bitvector/SparseBLEBitvector.h index bc070870..1a6e6c07 100644 --- a/src/fmindex-collection/bitvector/SparseBLEBitvector.h +++ b/src/fmindex-collection/bitvector/SparseBLEBitvector.h @@ -67,7 +67,7 @@ struct SparseBLEBitvector { if constexpr (!CompressOnes) { if (first) allTheSame = false; // Don't compress ones } else { - if (!first) allTheSame = false; // Don't compres zeros + if (!first) allTheSame = false; // Don't compress zeros } indicatorBitvector.push_back(allTheSame); if (!allTheSame) { diff --git a/src/test_search_schemes/checkGeneratorsIsComplete.cpp b/src/test_search_schemes/checkGeneratorsIsComplete.cpp index ecee49db..94e9c275 100644 --- a/src/test_search_schemes/checkGeneratorsIsComplete.cpp +++ b/src/test_search_schemes/checkGeneratorsIsComplete.cpp @@ -18,7 +18,7 @@ namespace ss = search_schemes; namespace gen = ss::generator; -TEST_CASE("check search scheme generator backtracking for completness", "[isComplete][backtracking]") { +TEST_CASE("check search scheme generator backtracking for completeness", "[isComplete][backtracking]") { for (size_t N{1}; N < 10; ++N) { // Number of pieces INFO("N " << N); for (size_t minK{0}; minK < 5ull; ++minK) { @@ -31,7 +31,7 @@ TEST_CASE("check search scheme generator backtracking for completness", "[isComp } } -TEST_CASE("check search scheme generator bestKnown for completness", "[isComplete][bestKnown]") { +TEST_CASE("check search scheme generator bestKnown for completeness", "[isComplete][bestKnown]") { for (size_t N{1}; N < 10; ++N) { // Number of pieces INFO("N " << N); for (size_t minK{0}; minK < 5ull; ++minK) { @@ -44,7 +44,7 @@ TEST_CASE("check search scheme generator bestKnown for completness", "[isComplet } } -TEST_CASE("check search scheme generator h2 for completness", "[isComplete][h2]") { +TEST_CASE("check search scheme generator h2 for completeness", "[isComplete][h2]") { // Note N must be larger than maxK for (size_t N{1}; N < 10ull; ++N) { // Number of pieces INFO("N " << N); @@ -58,21 +58,21 @@ TEST_CASE("check search scheme generator h2 for completness", "[isComplete][h2]" } } -TEST_CASE("check search scheme generator hato for completness", "[isComplete][hato]") { +TEST_CASE("check search scheme generator hato for completeness", "[isComplete][hato]") { for (size_t maxK{0}; maxK < 8; ++maxK) { INFO("maxK " << maxK); CHECK(ss::isComplete(gen::hato(maxK), 0, maxK)); } } -TEST_CASE("check search scheme generator kianfar for completness", "[isComplete][kianfar]") { +TEST_CASE("check search scheme generator kianfar for completeness", "[isComplete][kianfar]") { // Kianfar only exists for certain k's for (size_t k{0}; k < 4; ++k) { CHECK(ss::isComplete(gen::kianfar(k), 0, k)); } } -TEST_CASE("check search scheme generator kucherov for completness", "[isComplete][kucherov]") { +TEST_CASE("check search scheme generator kucherov for completeness", "[isComplete][kucherov]") { // Kucherov only exists for certain N and k combinations for (size_t k{0}; k < 5; ++k) { CHECK(ss::isComplete(gen::kucherov(k+1, k), 0, k)); @@ -82,7 +82,7 @@ TEST_CASE("check search scheme generator kucherov for completness", "[isComplete } } -TEST_CASE("check search scheme generator optimum for completness", "[isComplete][optimum]") { +TEST_CASE("check search scheme generator optimum for completeness", "[isComplete][optimum]") { for (size_t minK{0}; minK < 4; ++minK) { for (size_t maxK{minK}; maxK < 4; ++maxK) { CHECK(ss::isComplete(gen::optimum(minK, maxK), minK, maxK)); @@ -90,7 +90,7 @@ TEST_CASE("check search scheme generator optimum for completness", "[isComplete] } } -TEST_CASE("check search scheme generator pigeon for completness", "[isComplete][pigeon]") { +TEST_CASE("check search scheme generator pigeon for completeness", "[isComplete][pigeon]") { for (size_t minK{0}; minK < 10; ++minK) { for (size_t maxK{minK}; maxK < 10; ++maxK) { CHECK(ss::isComplete(gen::pigeon_trivial(minK, maxK), minK, maxK)); @@ -103,7 +103,7 @@ TEST_CASE("check search scheme generator pigeon for completness", "[isComplete][ } } -TEST_CASE("check search scheme generator suffixFilter for completness", "[isComplete][suffixFilter]") { +TEST_CASE("check search scheme generator suffixFilter for completeness", "[isComplete][suffixFilter]") { // Note N must be larger than maxK for (size_t N{1}; N < 10; ++N) { // Number of pieces INFO("N " << N); @@ -117,7 +117,7 @@ TEST_CASE("check search scheme generator suffixFilter for completness", "[isComp } } -TEST_CASE("check search scheme generator 01*0 (zeroOnesZero) for completness", "[isComplete][zeroOnesZero]") { +TEST_CASE("check search scheme generator 01*0 (zeroOnesZero) for completeness", "[isComplete][zeroOnesZero]") { for (size_t minK{0}; minK < 10; ++minK) { for (size_t maxK{minK}; maxK < 10; ++maxK) { CHECK(ss::isComplete(gen::zeroOnesZero_trivial(minK, maxK), minK, maxK));