Package org.apache.lucene.codecs.lucene90.blocktree
BlockTree terms dictionary.
This terms dictionary organizes all terms into blocks according to shared prefix, such that
each block has enough terms, and then stores the prefix trie in memory as an FST as the index
structure. It allows you to plug in your own PostingsWriterBase
to implement the postings.
See Lucene90BlockTreeTermsWriter
for the
file format.
-
Class Summary Class Description FieldReader BlockTree's implementation ofTerms
.IntersectTermsEnum This is used to implement efficientTerms.intersect(org.apache.lucene.util.automaton.CompiledAutomaton, org.apache.lucene.util.BytesRef)
for block-tree.IntersectTermsEnumFrame Lucene90BlockTreeTermsReader A block-based terms index and dictionary that assigns terms to variable length blocks according to how they share prefixes.Lucene90BlockTreeTermsWriter Block-based terms index and dictionary writer.Lucene90BlockTreeTermsWriter.PendingBlock Lucene90BlockTreeTermsWriter.PendingEntry Lucene90BlockTreeTermsWriter.PendingTerm Lucene90BlockTreeTermsWriter.StatsWriter SegmentTermsEnum Iterates through terms in this field.SegmentTermsEnumFrame Stats BlockTree statistics for a single field returned byFieldReader.getStats()
. -
Enum Summary Enum Description CompressionAlgorithm Compression algorithm used for suffixes of a block of terms. -
Exception Summary Exception Description IntersectTermsEnum.NoMoreTermsException