Package | Description |
---|---|
org.apache.lucene.search |
Code to search indices.
|
Modifier and Type | Class and Description |
---|---|
private static class |
BM25FQuery.WeightedDisiWrapper |
private static class |
SynonymQuery.DisiWrapperFreq |
Modifier and Type | Field and Description |
---|---|
private DisiWrapper[] |
DisiPriorityQueue.heap |
(package private) DisiWrapper |
WANDScorer.lead |
(package private) DisiWrapper |
MinShouldMatchSumScorer.lead |
DisiWrapper |
DisiWrapper.next |
(package private) DisiWrapper[] |
WANDScorer.tail |
(package private) DisiWrapper[] |
MinShouldMatchSumScorer.tail |
(package private) DisiWrapper |
CoveringScorer.topList |
(package private) DisiWrapper |
DisjunctionScorer.TwoPhase.verifiedMatches |
Modifier and Type | Field and Description |
---|---|
(package private) PriorityQueue<DisiWrapper> |
DisjunctionScorer.TwoPhase.unverifiedMatches |
Modifier and Type | Method and Description |
---|---|
DisiWrapper |
DisiPriorityQueue.add(DisiWrapper entry) |
(package private) DisiWrapper |
DisjunctionScorer.getSubMatches() |
(package private) DisiWrapper |
DisjunctionScorer.TwoPhase.getSubMatches() |
private DisiWrapper |
WANDScorer.insertTailWithOverFlow(DisiWrapper s)
Insert an entry in 'tail' and evict the least-costly scorer if full.
|
private DisiWrapper |
MinShouldMatchSumScorer.insertTailWithOverFlow(DisiWrapper s)
Insert an entry in 'tail' and evict the least-costly scorer if full.
|
DisiWrapper |
DisiPriorityQueue.pop() |
private DisiWrapper |
WANDScorer.popTail()
Pop the least-costly scorer from 'tail'.
|
private DisiWrapper |
MinShouldMatchSumScorer.popTail()
Pop the least-costly scorer from 'tail'.
|
private DisiWrapper |
DisiPriorityQueue.prepend(DisiWrapper w1,
DisiWrapper w2) |
DisiWrapper |
DisiPriorityQueue.top() |
DisiWrapper |
DisiPriorityQueue.topList()
Get the list of scorers which are on the current doc.
|
private DisiWrapper |
DisiPriorityQueue.topList(DisiWrapper list,
DisiWrapper[] heap,
int size,
int i) |
DisiWrapper |
DisiPriorityQueue.updateTop() |
(package private) DisiWrapper |
DisiPriorityQueue.updateTop(DisiWrapper topReplacement) |
Modifier and Type | Method and Description |
---|---|
java.util.Iterator<DisiWrapper> |
DisiPriorityQueue.iterator() |
Modifier and Type | Method and Description |
---|---|
DisiWrapper |
DisiPriorityQueue.add(DisiWrapper entry) |
private void |
WANDScorer.addLead(DisiWrapper lead)
Add a disi to the linked list of leads.
|
private void |
MinShouldMatchSumScorer.addLead(DisiWrapper lead) |
private void |
WANDScorer.addTail(DisiWrapper s)
Add an entry to 'tail'.
|
private void |
MinShouldMatchSumScorer.addTail(DisiWrapper s)
Add an entry to 'tail'.
|
private void |
WANDScorer.advanceTail(DisiWrapper disi) |
private void |
MinShouldMatchSumScorer.advanceTail(DisiWrapper top) |
private static void |
MinShouldMatchSumScorer.downHeapCost(DisiWrapper[] heap,
int size) |
private static void |
WANDScorer.downHeapMaxScore(DisiWrapper[] heap,
int size) |
private static boolean |
WANDScorer.greaterMaxScore(DisiWrapper w1,
DisiWrapper w2)
In the tail, we want to get first entries that produce the maximum scores
and in case of ties (eg.
|
private DisiWrapper |
WANDScorer.insertTailWithOverFlow(DisiWrapper s)
Insert an entry in 'tail' and evict the least-costly scorer if full.
|
private DisiWrapper |
MinShouldMatchSumScorer.insertTailWithOverFlow(DisiWrapper s)
Insert an entry in 'tail' and evict the least-costly scorer if full.
|
private DisiWrapper |
DisiPriorityQueue.prepend(DisiWrapper w1,
DisiWrapper w2) |
protected abstract float |
DisjunctionScorer.score(DisiWrapper topList)
Compute the score for the given linked list of scorers.
|
protected float |
DisjunctionSumScorer.score(DisiWrapper topList) |
protected float |
DisjunctionMaxScorer.score(DisiWrapper topList) |
private DisiWrapper |
DisiPriorityQueue.topList(DisiWrapper list,
DisiWrapper[] heap,
int size,
int i) |
private DisiWrapper |
DisiPriorityQueue.topList(DisiWrapper list,
DisiWrapper[] heap,
int size,
int i) |
(package private) DisiWrapper |
DisiPriorityQueue.updateTop(DisiWrapper topReplacement) |
private static void |
MinShouldMatchSumScorer.upHeapCost(DisiWrapper[] heap,
int i)
Heap helpers
|
private static void |
WANDScorer.upHeapMaxScore(DisiWrapper[] heap,
int i)
Heap helpers
|