org.apache.lucene.search.join.ToParentDocValues Maven / Gradle / Ivy
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.apache.lucene.search.join;
import java.io.IOException;
import java.util.Arrays;
import org.apache.lucene.index.NumericDocValues;
import org.apache.lucene.index.SortedDocValues;
import org.apache.lucene.search.ConjunctionUtils;
import org.apache.lucene.search.DocIdSetIterator;
import org.apache.lucene.search.join.BlockJoinSelector.Type;
import org.apache.lucene.util.BitSet;
import org.apache.lucene.util.BytesRef;
class ToParentDocValues extends DocIdSetIterator {
interface Accumulator {
void reset() throws IOException;
void increment() throws IOException;
}
private static final class SortedDVs extends SortedDocValues implements Accumulator {
private final SortedDocValues values;
private final BlockJoinSelector.Type selection;
private int ord = -1;
private final ToParentDocValues iter;
private SortedDVs(
SortedDocValues values,
BlockJoinSelector.Type selection,
BitSet parents,
DocIdSetIterator children) {
this.values = values;
this.selection = selection;
this.iter = new ToParentDocValues(values, parents, children, this);
}
@Override
public int docID() {
return iter.docID();
}
@Override
public void reset() throws IOException {
ord = values.ordValue();
}
@Override
public void increment() throws IOException {
if (selection == BlockJoinSelector.Type.MIN) {
ord = Math.min(ord, values.ordValue());
} else if (selection == BlockJoinSelector.Type.MAX) {
ord = Math.max(ord, values.ordValue());
} else {
throw new AssertionError();
}
}
@Override
public int nextDoc() throws IOException {
return iter.nextDoc();
}
@Override
public int advance(int target) throws IOException {
return iter.advance(target);
}
@Override
public boolean advanceExact(int targetParentDocID) throws IOException {
return iter.advanceExact(targetParentDocID);
}
@Override
public int ordValue() {
return ord;
}
@Override
public BytesRef lookupOrd(int ord) throws IOException {
return values.lookupOrd(ord);
}
@Override
public int getValueCount() {
return values.getValueCount();
}
@Override
public long cost() {
return values.cost();
}
}
private static final class NumDV extends NumericDocValues implements Accumulator {
private final NumericDocValues values;
private long value;
private final BlockJoinSelector.Type selection;
private final ToParentDocValues iter;
private NumDV(
NumericDocValues values,
BlockJoinSelector.Type selection,
BitSet parents,
DocIdSetIterator children) {
this.values = values;
this.selection = selection;
iter = new ToParentDocValues(values, parents, children, this);
}
@Override
public void reset() throws IOException {
value = values.longValue();
}
@Override
public void increment() throws IOException {
switch (selection) {
case MIN:
value = Math.min(value, values.longValue());
break;
case MAX:
value = Math.max(value, values.longValue());
break;
default:
throw new AssertionError();
}
}
@Override
public int nextDoc() throws IOException {
return iter.nextDoc();
}
@Override
public int advance(int targetParentDocID) throws IOException {
return iter.advance(targetParentDocID);
}
@Override
public boolean advanceExact(int targetParentDocID) throws IOException {
return iter.advanceExact(targetParentDocID);
}
@Override
public long longValue() {
return value;
}
@Override
public int docID() {
return iter.docID();
}
@Override
public long cost() {
return values.cost();
}
}
private ToParentDocValues(
DocIdSetIterator values, BitSet parents, DocIdSetIterator children, Accumulator collect) {
this.parents = parents;
childWithValues = ConjunctionUtils.intersectIterators(Arrays.asList(children, values));
this.collector = collect;
}
private final BitSet parents;
private int docID = -1;
private final Accumulator collector;
boolean seen = false;
private DocIdSetIterator childWithValues;
@Override
public int docID() {
return docID;
}
@Override
public int nextDoc() throws IOException {
assert docID != NO_MORE_DOCS;
assert childWithValues.docID() != docID || docID == -1;
if (childWithValues.docID() < docID || docID == -1) {
childWithValues.nextDoc();
}
if (childWithValues.docID() == NO_MORE_DOCS) {
docID = NO_MORE_DOCS;
return docID;
}
assert parents.get(childWithValues.docID()) == false;
int nextParentDocID = parents.nextSetBit(childWithValues.docID());
collector.reset();
seen = true;
while (true) {
int childDocID = childWithValues.nextDoc();
assert childDocID != nextParentDocID;
if (childDocID > nextParentDocID) {
break;
}
collector.increment();
}
docID = nextParentDocID;
return docID;
}
@Override
public int advance(int target) throws IOException {
if (target >= parents.length()) {
docID = NO_MORE_DOCS;
return docID;
}
if (target == 0) {
assert docID() == -1;
return nextDoc();
}
int prevParentDocID = parents.prevSetBit(target - 1);
if (childWithValues.docID() <= prevParentDocID) {
childWithValues.advance(prevParentDocID + 1);
}
return nextDoc();
}
// @Override
public boolean advanceExact(int targetParentDocID) throws IOException {
if (targetParentDocID < docID) {
throw new IllegalArgumentException(
"target must be after the current document: current="
+ docID
+ " target="
+ targetParentDocID);
}
int previousDocId = docID;
docID = targetParentDocID;
if (targetParentDocID == previousDocId) {
return seen; // ord != -1; rlly???
}
docID = targetParentDocID;
seen = false;
// ord = -1;
if (parents.get(targetParentDocID) == false) {
return false;
}
int prevParentDocId = docID == 0 ? -1 : parents.prevSetBit(docID - 1);
int childDoc = childWithValues.docID();
if (childDoc <= prevParentDocId) {
childDoc = childWithValues.advance(prevParentDocId + 1);
}
if (childDoc >= docID) {
return false;
}
if (childWithValues.docID() < docID) {
collector.reset();
seen = true;
childWithValues.nextDoc();
}
if (seen == false) {
return false;
}
for (int doc = childWithValues.docID(); doc < docID; doc = childWithValues.nextDoc()) {
collector.increment();
}
return true;
}
@Override
public long cost() {
return 0;
}
static NumericDocValues wrap(
NumericDocValues values, Type selection, BitSet parents2, DocIdSetIterator children) {
return new ToParentDocValues.NumDV(values, selection, parents2, children);
}
static SortedDocValues wrap(
SortedDocValues values, Type selection, BitSet parents2, DocIdSetIterator children) {
return new ToParentDocValues.SortedDVs(values, selection, parents2, children);
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy