Mirror/MarginaliaSearch
1
0
Fork 0
mirror of https://github.com/MarginaliaSearch/MarginaliaSearch.git synced 2025-02-24 05:18:58 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

(index) Optimize SequenceOperations

Browse Source
This commit is contained in:
Viktor Lofgren 2024-08-25 13:17:38 +02:00
parent a5585110a6
commit 00ab2684fa
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
code/libraries/coded-sequence/java/nu/marginalia/sequence/SequenceOperations.java
View File

@ -64,8 +64,8 @@ public class SequenceOperations {
int[] values = new int[positions.length]; int[] values = new int[positions.length];
for (int i = 0; i < positions.length; i++) { for (int i = 0; i < positions.length; i++) {
if (indexes[i]++ < positions[i].size()) if (indexes[i] < positions[i].size())
values[i] = positions[i].getInt(indexes[i]) + iterOffsets[i]; values[i] = positions[i].getInt(indexes[i]++) + iterOffsets[i];
else else
return IntList.of(); return IntList.of();
} }
@ -85,7 +85,7 @@ public class SequenceOperations {
successes = 1; successes = 1;
if (indexes[i]++ < positions[i].size()) { if (indexes[i]++ < positions[i].size()) {
values[i] = positions[i].getInt(indexes[i]) + iterOffsets[i]; values[i] = positions[i].getInt(indexes[i]++) + iterOffsets[i];
} else { } else {
break; break;
} }
@ -98,7 +98,7 @@ public class SequenceOperations {
// or until the end of the sequence is reached // or until the end of the sequence is reached
while (values[i] < max) { while (values[i] < max) {
if (indexes[i]++ < positions[i].size()) { if (indexes[i]++ < positions[i].size()) {
values[i] = positions[i].getInt(indexes[i]) + iterOffsets[i]; values[i] = positions[i].getInt(indexes[i]++) + iterOffsets[i];
} else { } else {
break outer; break outer;
} }