Package org.apache.lucene.codecs.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 BlockTreeTermsWriter
for the file format.
-
Class Summary Class Description BlockTreeTermsReader A block-based terms index and dictionary that assigns terms to variable length blocks according to how they share prefixes.BlockTreeTermsWriter Block-based terms index and dictionary writer.BlockTreeTermsWriter.PendingBlock BlockTreeTermsWriter.PendingEntry BlockTreeTermsWriter.PendingTerm BlockTreeTermsWriter.StatsWriter 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 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