Skip to content

Apache Lucene open-source search software

Add comment to the SIMD intersection logic. (#14073)

Adrien Grand42c4c115d6ff
diff --git a/lucene/core/src/java21/org/apache/lucene/internal/vectorization/PanamaVectorUtilSupport.java b/lucene/core/src/java21/org/apache/lucene/internal/vectorization/PanamaVectorUtilSupport.java
index 9273f7c5a81..1369aa5e3f4 100644
--- a/lucene/core/src/java21/org/apache/lucene/internal/vectorization/PanamaVectorUtilSupport.java
+++ b/lucene/core/src/java21/org/apache/lucene/internal/vectorization/PanamaVectorUtilSupport.java
@@ -771,6 +771,10 @@ final class PanamaVectorUtilSupport implements VectorUtilSupport {
@Override
public int findNextGEQ(int[] buffer, int target, int from, int to) {
if (ENABLE_FIND_NEXT_GEQ_VECTOR_OPTO) {
+ // This effectively implements the V1 intersection algorithm from
+ // D. Lemire, L. Boytsov, N. Kurz SIMD Compression and the Intersection of Sorted Integers
+ // with T = INT_SPECIES.length(), ie. T=8 with AVX2 and T=16 with AVX-512
+ // https://arxiv.org/pdf/1401.6399
for (; from + INT_SPECIES.length() < to; from += INT_SPECIES.length() + 1) {
if (buffer[from + INT_SPECIES.length()] >= target) {
IntVector vector = IntVector.fromArray(INT_SPECIES, buffer, from);