TopNSearcher

open class TopNSearcher<T>(fst: FST<T>, topN: Int, maxQueueDepth: Int, comparator: Comparator<T>, pathComparator: Comparator<Util.FSTPath<T>>)

Utility class to find top N shortest paths from start point(s).

Constructors

constructor(fst: FST<T>, topN: Int, maxQueueDepth: Int, comparator: Comparator<T>, pathComparator: Comparator<Util.FSTPath<T>>)

constructor(fst: FST<T>, topN: Int, maxQueueDepth: Int, comparator: Comparator<T>)

Creates an unbounded TopNSearcher

fun addStartPaths(node: FST.Arc<T>, startOutput: T, allowEmptyString: Boolean, input: IntsRefBuilder)

fun addStartPaths(node: FST.Arc<T>, startOutput: T, allowEmptyString: Boolean, input: IntsRefBuilder, boost: Float, context: CharSequence?, payload: Int)

Adds all leaving arcs, including 'finished' arc, if the node is final, from this node into the queue!!.