public static class MultiDocValues.MultiSortedSetDocValues extends SortedSetDocValues
Modifier and Type | Field and Description |
---|---|
int[] |
docStarts
docbase for each leaf: parallel with
values |
OrdinalMap |
mapping
ordinal map mapping ords from
values to global ord space |
SortedSetDocValues[] |
values
leaf values
|
NO_MORE_ORDS
NO_MORE_DOCS
Constructor and Description |
---|
MultiSortedSetDocValues(SortedSetDocValues[] values,
int[] docStarts,
OrdinalMap mapping,
long totalCost)
Creates a new MultiSortedSetDocValues over
values |
Modifier and Type | Method and Description |
---|---|
int |
advance(int targetDocID)
Advances to the first beyond the current whose document number is greater
than or equal to target, and returns the document number itself.
|
boolean |
advanceExact(int targetDocID)
Advance the iterator to exactly
target and return whether
target has a value. |
long |
cost()
Returns the estimated cost of this
DocIdSetIterator . |
int |
docID()
Returns the following:
-1 if DocIdSetIterator.nextDoc() or
DocIdSetIterator.advance(int) were not called yet. |
long |
getValueCount()
Returns the number of unique values.
|
BytesRef |
lookupOrd(long ord)
Retrieves the value for the specified ordinal.
|
int |
nextDoc()
Advances to the next document in the set and returns the doc it is
currently on, or
DocIdSetIterator.NO_MORE_DOCS if there are no more docs in the
set.NOTE: after the iterator has exhausted you should not call this method, as it may result in unpredicted behavior. |
long |
nextOrd()
Returns the next ordinal for the current document.
|
intersect, lookupTerm, termsEnum
all, empty, range, slowAdvance
public final int[] docStarts
values
public final SortedSetDocValues[] values
public final OrdinalMap mapping
values
to global ord spacepublic MultiSortedSetDocValues(SortedSetDocValues[] values, int[] docStarts, OrdinalMap mapping, long totalCost) throws IOException
values
IOException
public int docID()
DocIdSetIterator
-1
if DocIdSetIterator.nextDoc()
or
DocIdSetIterator.advance(int)
were not called yet.
DocIdSetIterator.NO_MORE_DOCS
if the iterator has exhausted.
docID
in class DocIdSetIterator
public int nextDoc() throws IOException
DocIdSetIterator
DocIdSetIterator.NO_MORE_DOCS
if there are no more docs in the
set.nextDoc
in class DocIdSetIterator
IOException
public int advance(int targetDocID) throws IOException
DocIdSetIterator
DocIdSetIterator.NO_MORE_DOCS
if target
is greater than the highest document number in the set.
The behavior of this method is undefined when called with
target ≤ current
, or after the iterator has exhausted.
Both cases may result in unpredicted behavior.
When target > current
it behaves as if written:
int advance(int target) { int doc; while ((doc = nextDoc()) < target) { } return doc; }Some implementations are considerably more efficient than that.
NOTE: this method may be called with DocIdSetIterator.NO_MORE_DOCS
for
efficiency by some Scorers. If your implementation cannot efficiently
determine that it should exhaust, it is recommended that you check for that
value in each call to this method.
advance
in class DocIdSetIterator
IOException
public boolean advanceExact(int targetDocID) throws IOException
target
and return whether
target
has a value.
target
must be greater than or equal to the current
doc ID
and must be a valid doc ID, ie. ≥ 0 and
< maxDoc
.
After this method returns, DocIdSetIterator.docID()
returns target
.IOException
public long nextOrd() throws IOException
SortedSetDocValues
advanceExact(int)
returned false
.nextOrd
in class SortedSetDocValues
SortedSetDocValues.NO_MORE_ORDS
.
ordinals are dense, start at 0, then increment by 1 for
the next value in sorted order.IOException
public BytesRef lookupOrd(long ord) throws IOException
SortedSetDocValues
BytesRef
may be re-used across calls to lookupOrd so make sure to
copy it
if you want to keep it
around.lookupOrd
in class SortedSetDocValues
ord
- ordinal to lookupIOException
SortedSetDocValues.nextOrd()
public long getValueCount()
SortedSetDocValues
getValueCount
in class SortedSetDocValues
public long cost()
DocIdSetIterator
DocIdSetIterator
.
This is generally an upper bound of the number of documents this iterator might match, but may be a rough heuristic, hardcoded value, or otherwise completely inaccurate.
cost
in class DocIdSetIterator
Copyright © 2000-2020 Apache Software Foundation. All Rights Reserved.