public abstract class BaseCompositeReader<R extends IndexReader> extends CompositeReader
CompositeReader
s based on an array
of sub-readers. The implementing class has to add code for
correctly refcounting and closing the sub-readers.
User code will most likely use MultiReader
to build a
composite reader on a set of sub-readers (like several
DirectoryReader
s).
For efficiency, in this API documents are often referred to via document numbers, non-negative integers which each name a unique document in the index. These document numbers are ephemeral -- they may change as documents are added to and deleted from an index. Clients should thus not rely on a given document having the same number between sessions.
NOTE: IndexReader
instances are completely thread
safe, meaning multiple threads can call any of its methods,
concurrently. If your application requires external
synchronization, you should not synchronize on the
IndexReader
instance; use your own
(non-Lucene) objects instead.
MultiReader
IndexReader.CacheHelper, IndexReader.CacheKey, IndexReader.ClosedListener
Modifier and Type | Field and Description |
---|---|
protected Comparator<R> |
subReadersSorter
A comparator for sorting sub-readers
|
Modifier | Constructor and Description |
---|---|
protected |
BaseCompositeReader(R[] subReaders,
Comparator<R> subReadersSorter)
Constructs a
BaseCompositeReader on the given subReaders. |
Modifier and Type | Method and Description |
---|---|
int |
docFreq(Term term)
Returns the number of documents containing the
term . |
void |
document(int docID,
StoredFieldVisitor visitor)
Expert: visits the fields of a stored document, for
custom processing/loading of each field.
|
int |
getDocCount(String field)
Returns the number of documents that have at least one term for this field.
|
protected List<? extends R> |
getSequentialSubReaders()
Expert: returns the sequential sub readers that this
reader is logically composed of.
|
long |
getSumDocFreq(String field)
Returns the sum of
TermsEnum.docFreq() for all terms in this field. |
long |
getSumTotalTermFreq(String field)
Returns the sum of
TermsEnum.totalTermFreq() for all terms in this
field. |
Fields |
getTermVectors(int docID)
Retrieve term vectors for this document, or null if
term vectors were not indexed.
|
int |
maxDoc()
Returns one greater than the largest possible document number.
|
int |
numDocs()
Returns the number of documents in this index.
|
protected int |
readerBase(int readerIndex)
Helper method for subclasses to get the docBase of the given sub-reader index.
|
protected int |
readerIndex(int docID)
Helper method for subclasses to get the corresponding reader for a doc ID
|
long |
totalTermFreq(Term term)
Returns the total number of occurrences of
term across all
documents (the sum of the freq() for each doc that has this term). |
getContext, toString
close, decRef, doClose, document, document, ensureOpen, equals, getReaderCacheHelper, getRefCount, getTermVector, hasDeletions, hashCode, incRef, leaves, numDeletedDocs, registerParentReader, tryIncRef
protected final Comparator<R extends IndexReader> subReadersSorter
protected BaseCompositeReader(R[] subReaders, Comparator<R> subReadersSorter) throws IOException
BaseCompositeReader
on the given subReaders.subReaders
- the wrapped sub-readers. This array is returned by
getSequentialSubReaders()
and used to resolve the correct
subreader for docID-based methods. Please note: This array is not
cloned and not protected for modification, the subclass is responsible
to do this.subReadersSorter
- – a comparator for sorting sub readers. If not null
, this
comparator is used to sort sub readers, before using the for resolving doc IDs.IOException
public final Fields getTermVectors(int docID) throws IOException
IndexReader
getTermVectors
in class IndexReader
IOException
public final int numDocs()
IndexReader
NOTE: This operation may run in O(maxDoc). Implementations that can't return this number in constant-time should cache it.
numDocs
in class IndexReader
public final int maxDoc()
IndexReader
maxDoc
in class IndexReader
public final void document(int docID, StoredFieldVisitor visitor) throws IOException
IndexReader
IndexReader.document(int)
. If you want to load a subset, use
DocumentStoredFieldVisitor
.document
in class IndexReader
IOException
public final int docFreq(Term term) throws IOException
IndexReader
term
. This method returns 0 if the term or
field does not exists. This method does not take into
account deleted documents that have not yet been merged
away.docFreq
in class IndexReader
IOException
TermsEnum.docFreq()
public final long totalTermFreq(Term term) throws IOException
IndexReader
term
across all
documents (the sum of the freq() for each doc that has this term).
Note that, like other term measures, this measure does not take
deleted documents into account.totalTermFreq
in class IndexReader
IOException
public final long getSumDocFreq(String field) throws IOException
IndexReader
TermsEnum.docFreq()
for all terms in this field.
Note that, just like other term measures, this measure does not take deleted
documents into account.getSumDocFreq
in class IndexReader
IOException
Terms.getSumDocFreq()
public final int getDocCount(String field) throws IOException
IndexReader
getDocCount
in class IndexReader
IOException
Terms.getDocCount()
public final long getSumTotalTermFreq(String field) throws IOException
IndexReader
TermsEnum.totalTermFreq()
for all terms in this
field. Note that, just like other term measures, this measure does not take
deleted documents into account.getSumTotalTermFreq
in class IndexReader
IOException
Terms.getSumTotalTermFreq()
protected final int readerIndex(int docID)
protected final int readerBase(int readerIndex)
protected final List<? extends R> getSequentialSubReaders()
CompositeReader
null
.
NOTE: In contrast to previous Lucene versions this method
is no longer public, code that wants to get all LeafReader
s
this composite is composed of should use IndexReader.leaves()
.
getSequentialSubReaders
in class CompositeReader
IndexReader.leaves()
Copyright © 2000-2021 Apache Software Foundation. All Rights Reserved.