Package | Description |
---|---|
org.apache.lucene.index |
Code to maintain and access indices.
|
org.apache.lucene.search |
Code to search indices.
|
Modifier and Type | Field and Description |
---|---|
protected Sort |
LiveIndexWriterConfig.indexSort
The sort order to use to write merged segments.
|
Modifier and Type | Method and Description |
---|---|
Sort |
LiveIndexWriterConfig.getIndexSort()
Get the index-time
Sort order, applied to all (flushed and merged) segments. |
Sort |
SegmentInfo.getIndexSort()
Return the sort order of this segment, or null if the index has no sort.
|
Sort |
LeafMetaData.getSort()
Return the order in which documents from this index are sorted, or
null if documents are in no particular order. |
Modifier and Type | Method and Description |
---|---|
IndexWriterConfig |
IndexWriterConfig.setIndexSort(Sort sort)
Set the
Sort order to use for all (flushed and merged) segments. |
static CheckIndex.Status.IndexSortStatus |
CheckIndex.testSort(CodecReader reader,
Sort sort,
PrintStream infoStream,
boolean failFast)
Tests index sort order.
|
static CodecReader |
SortingCodecReader.wrap(CodecReader reader,
Sort sort)
Return a sorted view of
reader according to the order
defined by sort . |
Constructor and Description |
---|
LeafMetaData(int createdVersionMajor,
Version minVersion,
Sort sort)
Expert: Sole constructor.
|
SegmentInfo(Directory dir,
Version version,
Version minVersion,
String name,
int maxDoc,
boolean isCompoundFile,
Codec codec,
Map<String,String> diagnostics,
byte[] id,
Map<String,String> attributes,
Sort indexSort)
Construct a new complete SegmentInfo instance from input.
|
Modifier and Type | Field and Description |
---|---|
static Sort |
Sort.INDEXORDER
Represents sorting by index order.
|
static Sort |
Sort.RELEVANCE
Represents sorting by computed relevance.
|
Modifier and Type | Method and Description |
---|---|
Sort |
Sort.rewrite(IndexSearcher searcher)
Rewrites the SortFields in this Sort, returning a new Sort if any of the fields
changes during their rewriting.
|
Modifier and Type | Method and Description |
---|---|
static TopFieldCollector |
TopFieldCollector.create(Sort sort,
int numHits,
FieldDoc after,
int totalHitsThreshold)
Creates a new
TopFieldCollector from the given
arguments. |
static TopFieldCollector |
TopFieldCollector.create(Sort sort,
int numHits,
int totalHitsThreshold)
Creates a new
TopFieldCollector from the given
arguments. |
static CollectorManager<TopFieldCollector,TopFieldDocs> |
TopFieldCollector.createSharedManager(Sort sort,
int numHits,
FieldDoc after,
int totalHitsThreshold)
Create a CollectorManager which uses a shared hit counter to maintain number of hits
and a shared
MaxScoreAccumulator to propagate the minimum score accross segments if
the primary sort is by relevancy. |
static TopFieldDocs |
TopDocs.merge(Sort sort,
int start,
int topN,
TopFieldDocs[] shardHits,
boolean setShardIndex)
Same as
TopDocs.merge(Sort, int, TopFieldDocs[]) but also ignores the top
start top docs. |
static TopFieldDocs |
TopDocs.merge(Sort sort,
int topN,
TopFieldDocs[] shardHits)
Returns a new TopFieldDocs, containing topN results across
the provided TopFieldDocs, sorting by the specified
Sort . |
TopFieldDocs |
IndexSearcher.search(Query query,
int n,
Sort sort)
Search implementation with arbitrary sorting.
|
TopFieldDocs |
IndexSearcher.search(Query query,
int n,
Sort sort,
boolean doDocScores)
Search implementation with arbitrary sorting, plus
control over whether hit scores and max score
should be computed.
|
TopDocs |
IndexSearcher.searchAfter(ScoreDoc after,
Query query,
int n,
Sort sort)
Finds the top
n
hits for query where all results are after a previous
result (after ). |
TopFieldDocs |
IndexSearcher.searchAfter(ScoreDoc after,
Query query,
int numHits,
Sort sort,
boolean doDocScores)
Finds the top
n
hits for query where all results are after a previous
result (after ), allowing control over
whether hit scores and max score should be computed. |
Constructor and Description |
---|
SortRescorer(Sort sort)
Sole constructor.
|
Copyright © 2000-2021 Apache Software Foundation. All Rights Reserved.