SortedDocValues
A per-document byte[] with presorted values. This is fundamentally an iterator over the int ord values per document, with random access APIs to resolve an int ord to BytesRef.
Per-Document values in a SortedDocValues are deduplicated, dereferenced, and sorted into a dictionary of unique values. A pointer to the dictionary value (ordinal) can be retrieved for each document. Ordinals are dense and in increasing sorted order.
Inheritors
Functions
Advance the iterator to exactly target and return whether target has a value. target must be greater than or equal to the current .docID and must be a valid doc ID, ie. 0 and <maxDoc. After this method returns, .docID returns target.
Returns the estimated cost of this DocIdSetIterator.
Returns a TermsEnum over the values, filtered by a CompiledAutomaton The enum supports TermsEnum.ord.
Load doc IDs into a FixedBitSet. This should behave exactly as if implemented as below, which is the default implementation:
If key exists, returns its ordinal, else returns -insertionPoint-1, like Arrays.binarySearch.
Returns a TermsEnum over the values. The enum supports TermsEnum.ord and TermsEnum.seekExact.