mirror of
https://github.com/MarginaliaSearch/MarginaliaSearch.git
synced 2025-02-24 05:18:58 +00:00
(coded-sequence) Evaluate new minDist implementation
This commit is contained in:
parent
f3182a9264
commit
7d471ec30d
@ -183,9 +183,13 @@ public class SequenceOperations {
|
|||||||
int prevValue = values[i];
|
int prevValue = values[i];
|
||||||
int value = prevValue;
|
int value = prevValue;
|
||||||
|
|
||||||
for (; indexes[i] < len && value <= maxVal;) {
|
while (indexes[i] < len) {
|
||||||
prevValue = value;
|
prevValue = value;
|
||||||
value = positions[i].getInt(indexes[i]++) + offset;
|
value = positions[i].getInt(indexes[i]++) + offset;
|
||||||
|
if (value >= maxVal) {
|
||||||
|
indexes[i]--; // correct for overshooting the largest value smaller than maxVal
|
||||||
|
break;
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
values[i] = prevValue;
|
values[i] = prevValue;
|
||||||
|
Loading…
Reference in New Issue
Block a user