Uses of Class
org.apache.lucene.search.DisiWrapper
Packages that use DisiWrapper
Package
Description
This package contains a flexible graph-based proximity query, TermAutomatonQuery, and geospatial
queries.
Code to search indices.
-
Uses of DisiWrapper in org.apache.lucene.sandbox.search
Subclasses of DisiWrapper in org.apache.lucene.sandbox.searchFields in org.apache.lucene.sandbox.search declared as DisiWrapper -
Uses of DisiWrapper in org.apache.lucene.search
Subclasses of DisiWrapper in org.apache.lucene.searchFields in org.apache.lucene.search declared as DisiWrapperModifier and TypeFieldDescription(package private) final DisiWrapper[]
MaxScoreBulkScorer.allScorers
private final DisiWrapper
MaxScoreBulkScorer.filter
private final DisiWrapper[]
DisiPriorityQueue.heap
(package private) DisiWrapper
WANDScorer.lead
(package private) final DisiWrapper[]
BooleanScorer.leads
DisiWrapper.next
private final DisiWrapper[]
MaxScoreBulkScorer.scratch
(package private) final DisiWrapper[]
WANDScorer.tail
(package private) DisiWrapper
DisjunctionScorer.TwoPhase.verifiedMatches
Fields in org.apache.lucene.search with type parameters of type DisiWrapperModifier and TypeFieldDescription(package private) final PriorityQueue
<DisiWrapper> DisjunctionScorer.TwoPhase.unverifiedMatches
Methods in org.apache.lucene.search that return DisiWrapperModifier and TypeMethodDescriptionDisiPriorityQueue.add
(DisiWrapper entry) private DisiWrapper
BooleanScorer.advance
(int min) private DisiWrapper
WANDScorer.advanceHead
(int target) Make sure all disis in 'head' are on or after 'target'.BooleanScorer.TailPriorityQueue.get
(int i) (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.DisiPriorityQueue.pop()
private DisiWrapper
WANDScorer.popTail()
Pop the least-costly scorer from 'tail'.private DisiWrapper
DisiPriorityQueue.prepend
(DisiWrapper w1, DisiWrapper w2) private DisiWrapper
BooleanScorer.scoreWindow
(DisiWrapper top, LeafCollector collector, Bits acceptDocs, int min, int max) DisiPriorityQueue.top()
DisiPriorityQueue.top2()
Return the 2nd least value in this heap, or null if the heap contains less than 2 values.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) DisiPriorityQueue.updateTop()
(package private) DisiWrapper
DisiPriorityQueue.updateTop
(DisiWrapper topReplacement) Methods in org.apache.lucene.search that return types with arguments of type DisiWrapperMethods in org.apache.lucene.search with parameters of type DisiWrapperModifier and TypeMethodDescriptionDisiPriorityQueue.add
(DisiWrapper entry) void
DisiPriorityQueue.addAll
(DisiWrapper[] entries, int offset, int len) private void
WANDScorer.addLead
(DisiWrapper lead) Add a disi to the linked list of leads.private void
WANDScorer.addTail
(DisiWrapper s) Add an entry to 'tail'.private void
WANDScorer.addUnpositionedLead
(DisiWrapper lead) Add a disi to the linked list of leads.private void
WANDScorer.advanceTail
(DisiWrapper disi) 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.protected boolean
BooleanScorer.HeadPriorityQueue.lessThan
(DisiWrapper a, DisiWrapper b) protected boolean
BooleanScorer.TailPriorityQueue.lessThan
(DisiWrapper a, DisiWrapper b) 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 void
BooleanScorer.scoreDisiWrapperIntoBitSet
(DisiWrapper w, Bits acceptDocs, int min, int max) private void
MaxScoreBulkScorer.scoreInnerWindow
(LeafCollector collector, Bits acceptDocs, int max, DisiWrapper filter) private void
MaxScoreBulkScorer.scoreInnerWindowWithFilter
(LeafCollector collector, Bits acceptDocs, int max, DisiWrapper filter) private DisiWrapper
BooleanScorer.scoreWindow
(DisiWrapper top, LeafCollector collector, Bits acceptDocs, int min, int max) private void
BooleanScorer.scoreWindowIntoBitSetAndReplay
(LeafCollector collector, Bits acceptDocs, int base, int min, int max, DisiWrapper[] scorers, int numScorers) private void
BooleanScorer.scoreWindowSingleScorer
(DisiWrapper w, LeafCollector collector, Bits acceptDocs, int windowMin, int windowMax, int max) private DisiWrapper
DisiPriorityQueue.topList
(DisiWrapper list, DisiWrapper[] heap, int size, int i) (package private) DisiWrapper
DisiPriorityQueue.updateTop
(DisiWrapper topReplacement) private static void
WANDScorer.upHeapMaxScore
(DisiWrapper[] heap, int i) Heap helpers