java.lang.Object
org.apache.lucene.index.memory.MemoryIndex.Info
- Enclosing class:
- MemoryIndex
Index data structure for a field; contains the tokenized term texts and their positions.
-
Field Summary
FieldsModifier and TypeFieldDescriptionprivate FieldInfo
private int
the last offset encountered in this field for multi field supportprivate int
the last position encountered in this field for multi field supportprivate byte[]
private int
private byte[]
private Long
private int
Number of overlapping tokens for this fieldprivate int
Number of added tokens for this fieldprivate BytesRef[]
private int
private boolean
private MemoryIndex.SliceByteStartArray
private int[]
Terms sorted ascending by term text; computed on demandprivate long
private BytesRefHash
Term strings and their positions for this field: Map <String termText, ArrayIntList positions> -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescription(package private) void
freeze()
(package private) NumericDocValues
(package private) void
(package private) void
Sorts hashed terms into ascending order, reusing memory along the way.
-
Field Details
-
fieldInfo
-
norm
-
terms
Term strings and their positions for this field: Map <String termText, ArrayIntList positions> -
sliceArray
-
sortedTerms
private transient int[] sortedTermsTerms sorted ascending by term text; computed on demand -
numTokens
private int numTokensNumber of added tokens for this field -
numOverlapTokens
private int numOverlapTokensNumber of overlapping tokens for this field -
sumTotalTermFreq
private long sumTotalTermFreq -
maxTermFrequency
private int maxTermFrequency -
lastPosition
private int lastPositionthe last position encountered in this field for multi field support -
lastOffset
private int lastOffsetthe last offset encountered in this field for multi field support -
bytesRefHashProducer
-
binaryProducer
-
numericProducer
-
preparedDocValuesAndPointValues
private boolean preparedDocValuesAndPointValues -
storedValues
-
pointValues
-
minPackedValue
private byte[] minPackedValue -
maxPackedValue
private byte[] maxPackedValue -
pointValuesCount
private int pointValuesCount
-
-
Constructor Details
-
Info
-
-
Method Details
-
freeze
void freeze() -
sortTerms
void sortTerms()Sorts hashed terms into ascending order, reusing memory along the way. Note that sorting is lazily delayed until required (often it's not required at all). If a sorted view is required then hashing + sort + binary search is still faster and smaller than TreeMap usage (which would be an alternative and somewhat more elegant approach, apart from more sophisticated Tries / prefix trees). -
prepareDocValuesAndPointValues
void prepareDocValuesAndPointValues() -
getNormDocValues
NumericDocValues getNormDocValues()
-