-
An FST
Outputs
implementation where each output is a sequence of bytes.
Holds a single input (BytesRef) + output pair.
An FST
Outputs
implementation where each output is a sequence of characters.
Represents an finite state machine (FST), using a compact byte[] format.
Reads bytes stored in an FST.
Represents the FST metadata.
Specifies allowed range of each int input label for this FST.
Builds a minimal FST (maps an IntsRef term to an arbitrary output) from pre-sorted terms with
outputs.
Abstraction for reading bytes necessary for FST.
A type of
FSTReader
which needs data to be initialized before use
An FST
Outputs
implementation where each output is a sequence of ints.
Holds a single input (IntsRef) + output pair.
A null FST
Outputs
implementation; use this if you just want to build an FSA.
Represents the outputs for an FST, providing the basic algebra required for building and
traversing the FST.
Holds a single pair of two outputs.
An FST
Outputs
implementation where each output is a non-negative long value.
Represents a path in TopNSearcher.