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.allScorersprivate final DisiWrapper[]DisiPriorityQueue.heap(package private) DisiWrapperWANDScorer.leadDisiWrapper.nextprivate final DisiWrapper[]MaxScoreBulkScorer.scratch(package private) final DisiWrapper[]WANDScorer.tail(package private) DisiWrapperDisjunctionScorer.TwoPhase.verifiedMatchesFields in org.apache.lucene.search with type parameters of type DisiWrapperModifier and TypeFieldDescription(package private) final PriorityQueue<DisiWrapper> DisjunctionScorer.TwoPhase.unverifiedMatchesMethods in org.apache.lucene.search that return DisiWrapperModifier and TypeMethodDescriptionDisiPriorityQueue.add(DisiWrapper entry) (package private) DisiWrapperDisjunctionScorer.getSubMatches()(package private) DisiWrapperDisjunctionScorer.TwoPhase.getSubMatches()private DisiWrapperWANDScorer.insertTailWithOverFlow(DisiWrapper s) Insert an entry in 'tail' and evict the least-costly scorer if full.DisiPriorityQueue.pop()private DisiWrapperWANDScorer.popTail()Pop the least-costly scorer from 'tail'.private DisiWrapperDisiPriorityQueue.prepend(DisiWrapper w1, DisiWrapper w2) 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 DisiWrapperDisiPriorityQueue.topList(DisiWrapper list, DisiWrapper[] heap, int size, int i) DisiPriorityQueue.updateTop()(package private) DisiWrapperDisiPriorityQueue.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) voidDisiPriorityQueue.addAll(DisiWrapper[] entries, int offset, int len) private voidWANDScorer.addLead(DisiWrapper lead) Add a disi to the linked list of leads.private voidWANDScorer.addTail(DisiWrapper s) Add an entry to 'tail'.private voidWANDScorer.advanceTail(DisiWrapper disi) private static voidWANDScorer.downHeapMaxScore(DisiWrapper[] heap, int size) private static booleanWANDScorer.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 DisiWrapperWANDScorer.insertTailWithOverFlow(DisiWrapper s) Insert an entry in 'tail' and evict the least-costly scorer if full.private DisiWrapperDisiPriorityQueue.prepend(DisiWrapper w1, DisiWrapper w2) protected floatDisjunctionMaxScorer.score(DisiWrapper topList) protected abstract floatDisjunctionScorer.score(DisiWrapper topList) Compute the score for the given linked list of scorers.protected floatDisjunctionSumScorer.score(DisiWrapper topList) private DisiWrapperDisiPriorityQueue.topList(DisiWrapper list, DisiWrapper[] heap, int size, int i) (package private) DisiWrapperDisiPriorityQueue.updateTop(DisiWrapper topReplacement) private static voidWANDScorer.upHeapMaxScore(DisiWrapper[] heap, int i) Heap helpers