Uses of Class
org.apache.lucene.search.DisiWrapper

Packages that use DisiWrapper

Package	Description
org.apache.lucene.search	Code to search indices.

Uses of DisiWrapper in org.apache.lucene.search

Subclasses of DisiWrapper in org.apache.lucene.search

Modifier and Type	Class	Description
private static class	BM25FQuery.WeightedDisiWrapper
private static class	SynonymQuery.DisiWrapperFreq

Fields in org.apache.lucene.search declared as DisiWrapper

Modifier and Type	Field	Description
private final DisiWrapper[]	DisiPriorityQueue.heap
(package private) DisiWrapper	MinShouldMatchSumScorer.lead
(package private) DisiWrapper	WANDScorer.lead
DisiWrapper	DisiWrapper.next
(package private) final DisiWrapper[]	MinShouldMatchSumScorer.tail
(package private) final DisiWrapper[]	WANDScorer.tail
(package private) DisiWrapper	CoveringScorer.topList
(package private) DisiWrapper	DisjunctionScorer.TwoPhase.verifiedMatches

Fields in org.apache.lucene.search with type parameters of type DisiWrapper

Modifier and Type	Field	Description
(package private) final PriorityQueue<DisiWrapper>	DisjunctionScorer.TwoPhase.unverifiedMatches

Methods in org.apache.lucene.search that return DisiWrapper

Modifier and Type	Method	Description
DisiWrapper	DisiPriorityQueue.add(DisiWrapper entry)
(package private) DisiWrapper	DisjunctionScorer.getSubMatches()
(package private) DisiWrapper	DisjunctionScorer.TwoPhase.getSubMatches()
private DisiWrapper	MinShouldMatchSumScorer.insertTailWithOverFlow(DisiWrapper s)	Insert an entry in 'tail' and evict the least-costly scorer if full.
private DisiWrapper	WANDScorer.insertTailWithOverFlow(DisiWrapper s)	Insert an entry in 'tail' and evict the least-costly scorer if full.
DisiWrapper	DisiPriorityQueue.pop()
private DisiWrapper	MinShouldMatchSumScorer.popTail()	Pop the least-costly scorer from 'tail'.
private DisiWrapper	WANDScorer.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)

Methods in org.apache.lucene.search that return types with arguments of type DisiWrapper

Modifier and Type	Method	Description
Iterator<DisiWrapper>	DisiPriorityQueue.iterator()

Methods in org.apache.lucene.search with parameters of type DisiWrapper

Modifier and Type	Method	Description
DisiWrapper	DisiPriorityQueue.add(DisiWrapper entry)
private void	MinShouldMatchSumScorer.addLead(DisiWrapper lead)
private void	WANDScorer.addLead(DisiWrapper lead)	Add a disi to the linked list of leads.
private void	MinShouldMatchSumScorer.addTail(DisiWrapper s)	Add an entry to 'tail'.
private void	WANDScorer.addTail(DisiWrapper s)	Add an entry to 'tail'.
private void	MinShouldMatchSumScorer.advanceTail(DisiWrapper top)
private void	WANDScorer.advanceTail(DisiWrapper disi)
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	MinShouldMatchSumScorer.insertTailWithOverFlow(DisiWrapper s)	Insert an entry in 'tail' and evict the least-costly scorer if full.
private DisiWrapper	WANDScorer.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 float	DisjunctionMaxScorer.score(DisiWrapper topList)
protected abstract float	DisjunctionScorer.score(DisiWrapper topList)	Compute the score for the given linked list of scorers.
protected float	DisjunctionSumScorer.score(DisiWrapper topList)
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