tidy: 1 vs true, 0 vs false

alib2algo/src/stringology/simulations/LevenshteinBitParalelism.h

@@ -24,31 +24,31 @@ ext::set<unsigned int> LevenshteinBitParalelism::search(const string::LinearStri
   ext::map<SymbolType, ext::vector<bool> > D_vectors = BitParalelism::constructDVectors(common_alphabet, pattern);
-  auto V_vector = ext::vector<bool>(pattern.getContent().size(), 0);
-  V_vector[pattern.getContent().size() - 1] = 1;
+  ext::vector<bool> V_vector (pattern.getContent().size(), false);
+  V_vector[pattern.getContent().size() - 1] = true;
   // computation part
   ext::set<unsigned int> result;
   ext::vector<ext::vector<bool> > B_vectors;
   for(unsigned int i=0; i<=errors; i++) {
-    B_vectors.push_back(ext::vector<bool>(pattern.getContent().size(), 0));
+    B_vectors.push_back(ext::vector<bool>(pattern.getContent().size(), false));
   }
   for(unsigned int l = 0; l <= errors; l++) {
     for(unsigned int j = l; j <= pattern.getContent().size(); j++) {
-      B_vectors[l][j] = 1;
+      B_vectors[l][j] = true;
     }
   }
   // 0-th column
   ext::vector<bool> b0 = ext::vector < bool > ( pattern.getContent().size(), true );
   for(unsigned int j=1; j<=errors; j++) {
-	b0 <<= 1;
-	if(b0[pattern.getContent().size()-1] == false) {
-        result.insert(0);
-        break;
-	}
+    b0 <<= 1;
+    if ( ! b0 [ pattern.getContent ( ).size ( ) - 1 ] ) {
+      result.insert(0);
+      break;
+    }
   }
@@ -64,7 +64,7 @@ ext::set<unsigned int> LevenshteinBitParalelism::search(const string::LinearStri
     }
     for (const auto & data : B_vectors) {
-      if(data[pattern.getContent().size()-1] == false) {
+      if ( ! data [ pattern.getContent ( ).size ( ) - 1 ] ) {
         result.insert(i+1);
         break;
       }