fixed BNDM comments

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++;

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 );