public TopNSearcher(FST<T> fst,int topN,int maxQueueDepth,Comparator<T> comparator){
  this(fst,topN,maxQueueDepth,comparator,new TieBreakByInputComparator<>(comparator));
}

public TopNSearcher ( FST < T > fst , int topN , int maxQueueDepth , Comparator < T > comparator ) { this ( fst , topN , maxQueueDepth , comparator , new TieBreakByInputComparator < > ( comparator ) ) ; }
creates an unbounded topnsearcher
