Mirror/MarginaliaSearch
1
0
Fork 0
mirror of https://github.com/MarginaliaSearch/MarginaliaSearch.git synced 2025-02-23 21: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:19:37 +02:00
parent 00ab2684fa
commit 0d01a48260
1 changed files with 7 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -54,7 +54,8 @@ public class SequenceOperations {
public static IntList findIntersections(IntList... positions) {
return findIntersections(new int[positions.length], positions);
}
public static IntList findIntersections(int[] iterOffsets, IntList... positions) {
public static IntList findIntersections(int[] offsets, IntList... positions) {
if (positions.length < 1)
return IntList.of();
@ -65,7 +66,7 @@ public class SequenceOperations {
for (int i = 0; i < positions.length; i++) {
if (indexes[i] < positions[i].size())
values[i] = positions[i].getInt(indexes[i]++) + iterOffsets[i];
values[i] = positions[i].getInt(indexes[i]++) + offsets[i];
else
return IntList.of();
}
@ -84,8 +85,8 @@ public class SequenceOperations {
ret.add(max);
successes = 1;
if (indexes[i]++ < positions[i].size()) {
values[i] = positions[i].getInt(indexes[i]++) + iterOffsets[i];
if (indexes[i] < positions[i].size()) {
values[i] = positions[i].getInt(indexes[i]++) + offsets[i];
} else {
break;
}
@ -97,8 +98,8 @@ public class SequenceOperations {
// Discard values until we reach the maximum value seen so far,
// or until the end of the sequence is reached
while (values[i] < max) {
if (indexes[i]++ < positions[i].size()) {
values[i] = positions[i].getInt(indexes[i]++) + iterOffsets[i];
if (indexes[i] < positions[i].size()) {
values[i] = positions[i].getInt(indexes[i]++) + offsets[i];
} else {
break outer;
}