Make sure last position is properly evaluated in Prefilter

martin-steinegger · martin-steinegger · commit 06f74297a7c3 · 2024-10-31T20:33:35.000+01:00
diff --git a/src/prefiltering/CacheFriendlyOperations.cpp b/src/prefiltering/CacheFriendlyOperations.cpp
@@ -40,7 +40,7 @@ size_t CacheFriendlyOperations<BINSIZE>::findDuplicates(IndexEntryLocal **input,
     do {
         setupBinPointer();
         CounterResult *lastPosition = (binDataFrame + BINCOUNT * binSize) - 1;
-        for (unsigned int i = indexFrom; i < indexTo; ++i) {
+        for (unsigned int i = indexFrom; i <= indexTo; ++i) {
             const size_t N = input[i + 1] - input[i];
             hashIndexEntry(i, input[i], N, lastPosition);
         }

Original file line number	Diff line number	Diff line change
`@@ -40,7 +40,7 @@ size_t CacheFriendlyOperations<BINSIZE>::findDuplicates(IndexEntryLocal **input,`
`40`	`40`	`do {`
`41`	`41`	`setupBinPointer();`
`42`	`42`	`CounterResult lastPosition = (binDataFrame + BINCOUNT binSize) - 1;`
`43`		`- for (unsigned int i = indexFrom; i < indexTo; ++i) {`
	`43`	`+ for (unsigned int i = indexFrom; i <= indexTo; ++i) {`
`44`	`44`	`const size_t N = input[i + 1] - input[i];`
`45`	`45`	`hashIndexEntry(i, input[i], N, lastPosition);`
`46`	`46`	`}`