/** * Creates an unbounded TopNSearcher * @param fst the {@link org.apache.lucene.util.fst.FST} to search on * @param topN the number of top scoring entries to retrieve * @param maxQueueDepth the maximum size of the queue of possible top entries * @param comparator the comparator to select the top N */ public TopNSearcher(FST<T> fst, int topN, int maxQueueDepth, Comparator<T> comparator) { this(fst, topN, maxQueueDepth, comparator, new TieBreakByInputComparator<>(comparator)); }
/** * Creates an unbounded TopNSearcher * @param fst the {@link org.apache.lucene.util.fst.FST} to search on * @param topN the number of top scoring entries to retrieve * @param maxQueueDepth the maximum size of the queue of possible top entries * @param comparator the comparator to select the top N */ public TopNSearcher(FST<T> fst, int topN, int maxQueueDepth, Comparator<T> comparator) { this(fst, topN, maxQueueDepth, comparator, new TieBreakByInputComparator<>(comparator)); }
/** * Creates an unbounded TopNSearcher * @param fst the {@link org.apache.lucene.util.fst.FST} to search on * @param topN the number of top scoring entries to retrieve * @param maxQueueDepth the maximum size of the queue of possible top entries * @param comparator the comparator to select the top N */ public TopNSearcher(FST<T> fst, int topN, int maxQueueDepth, Comparator<T> comparator) { this(fst, topN, maxQueueDepth, comparator, new TieBreakByInputComparator<>(comparator)); }
/** * Creates an unbounded TopNSearcher * @param fst the {@link org.apache.lucene.util.fst.FST} to search on * @param topN the number of top scoring entries to retrieve * @param maxQueueDepth the maximum size of the queue of possible top entries * @param comparator the comparator to select the top N */ public TopNSearcher(FST<T> fst, int topN, int maxQueueDepth, Comparator<T> comparator) { this(fst, topN, maxQueueDepth, comparator, new TieBreakByInputComparator<>(comparator)); }