Uses of Class
org.apache.lucene.util.fst.FST

Packages that use FST

org.apache.lucene.analysis.ja.dict	Kuromoji dictionary implementation.
org.apache.lucene.analysis.synonym	Analysis components for Synonyms.
org.apache.lucene.search.suggest.fst	Finite-state based autosuggest.
org.apache.lucene.util.fst	Finite state transducers

Uses of FST in org.apache.lucene.analysis.ja.dict

Constructors in org.apache.lucene.analysis.ja.dict with parameters of type FST

TokenInfoFST(FST<Long> fst, boolean fasterButMoreRam)

Uses of FST in org.apache.lucene.analysis.synonym

Fields in org.apache.lucene.analysis.synonym declared as FST

FST<BytesRef>

SynonymMap.fst map>

Constructors in org.apache.lucene.analysis.synonym with parameters of type FST

SynonymMap(FST<BytesRef> fst, BytesRefHash words, int maxHorizontalContext)

Uses of FST in org.apache.lucene.search.suggest.fst

Methods in org.apache.lucene.search.suggest.fst that return FST

FST<Object>

FSTCompletion.getFST() Returns the internal automaton.

Constructors in org.apache.lucene.search.suggest.fst with parameters of type FST

FSTCompletion(FST<Object> automaton)
Defaults to higher weights first and exact first.

FSTCompletion(FST<Object> automaton, boolean higherWeightsFirst, boolean exactFirst)

Uses of FST in org.apache.lucene.util.fst

Methods in org.apache.lucene.util.fst that return FST

FST<T>	Builder.finish() Returns final FST.
FST<T>	FST.pack(int minInCountDeref, int maxDerefNodes) Expert: creates an FST by packing this one.
static <T> FST<T>	FST.read(File file, Outputs<T> outputs) Reads an automaton from a file.

Methods in org.apache.lucene.util.fst with parameters of type FST

static <T> T	Util.get(FST<T> fst, BytesRef input) Looks up the output for this input, or null if the input is not accepted
static <T> T	Util.get(FST<T> fst, IntsRef input) Looks up the output for this input, or null if the input is not accepted.
static IntsRef	Util.getByOutput(FST<Long> fst, long targetOutput) Reverse lookup (lookup by output instead of by input), in the special case when your FSTs outputs are strictly ascending.
static <T> Util.MinResult<T>[]	Util.shortestPaths(FST<T> fst, FST.Arc<T> fromNode, Comparator<T> comparator, int topN) Starting from node, find the top N min cost completions to a final node.
static <T> void	Util.toDot(FST<T> fst, Writer out, boolean sameRank, boolean labelStates) Dumps an FST to a GraphViz's dot language description for visualization.

Constructors in org.apache.lucene.util.fst with parameters of type FST

BytesRefFSTEnum(FST<T> fst)
doFloor controls the behavior of advance: if it's true doFloor is true, advance positions to the biggest term before target.

IntsRefFSTEnum(FST<T> fst)
doFloor controls the behavior of advance: if it's true doFloor is true, advance positions to the biggest term before target.