From f9f37399ca92c73e750e125ccc467c3defb4cfd1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Radovan=20=C4=8Cerven=C3=BD?= <radovan.cerveny@gmail.com>
Date: Fri, 1 Apr 2016 18:21:30 +0200
Subject: [PATCH] fixed BNDM comments

---
 .../stringology/exact/BackwardNondeterministicDAWGMatching.cpp | 2 +-
 .../stringology/exact/BackwardNondeterministicDAWGMatching.hpp | 3 ++-
 2 files changed, 3 insertions(+), 2 deletions(-)

diff --git a/alib2algo/src/stringology/exact/BackwardNondeterministicDAWGMatching.cpp b/alib2algo/src/stringology/exact/BackwardNondeterministicDAWGMatching.cpp
index f170318045..c4cea5124c 100644
--- a/alib2algo/src/stringology/exact/BackwardNondeterministicDAWGMatching.cpp
+++ b/alib2algo/src/stringology/exact/BackwardNondeterministicDAWGMatching.cpp
@@ -69,7 +69,7 @@ std::set < unsigned > BackwardNondeterministicDAWGMatching::matchTemplate ( cons
                          // Yay, there is match!!!
                         occ.insert ( posInSubject );
                     } else {
-                         // if the pattern is longer then BITMASK_BIT_COUNT characters switch to brute force check
+                         // if the pattern is longer then BitmaskBitCount characters switch to brute force check
                         size_t k = bitmaskLength;
 
                         while ( k < pattern.getContent ( ).size ( ) && pattern.getContent ( ).at ( k ) == subject.getContent ( ).at ( posInSubject + k ) ) k++;
diff --git a/alib2algo/src/stringology/exact/BackwardNondeterministicDAWGMatching.hpp b/alib2algo/src/stringology/exact/BackwardNondeterministicDAWGMatching.hpp
index 5b43fe87b1..a6af70d894 100644
--- a/alib2algo/src/stringology/exact/BackwardNondeterministicDAWGMatching.hpp
+++ b/alib2algo/src/stringology/exact/BackwardNondeterministicDAWGMatching.hpp
@@ -17,7 +17,7 @@ namespace stringology {
 namespace exact {
 
 /**
- * Implementation of Backward Nondeterministic DAWG Matching using bit parallelism with 64bit bitmask and brute force switch for longer patterns.
+ * Implementation of Backward Nondeterministic DAWG Matching using bit parallelism with 32/64/128bit bitmask and brute force switch for longer patterns.
  */
 class BackwardNondeterministicDAWGMatching : public std::DoubleDispatch < std::set < unsigned >, string::StringBase, string::StringBase > {
 private:
@@ -32,6 +32,7 @@ private:
     static std::set < unsigned > matchTemplate ( const string::LinearString & subject, const string::LinearString & pattern );
 public:
 
+    // Defaults to 32 bits
     static std::set < unsigned > match ( const string::String & subject, const string::String & pattern );
     static std::set < unsigned > match ( const string::LinearString & subject, const string::LinearString & pattern );
 
-- 
GitLab