Package-level declarations

An FST Outputs implementation where each output is a sequence of bytes.

Enumerates all input (BytesRef) + output pairs in an FST.

An FST Outputs implementation where each output is a sequence of characters.

Represents an finite state machine (FST), using a compact byte[] format.

Builds a minimal FST (maps an IntsRef term to an arbitrary output) from pre-sorted terms with outputs. The FST becomes an FSA if you use NoOutputs. The FST is written on-the-fly into a compact serialized format byte array, which can be saved to / loaded from a Directory or used directly for traversal. The FST is always finite (no cycles).

Can next() and advance() through the terms in an FST

Abstraction for reading bytes necessary for FST.

An Outputs implementation where each output is a sequence of ints.

Enumerates all input (IntsRef) + output pairs in an FST.

A null FST Outputs implementation; use this if you just want to build an FSA.

Provides off heap storage of finite state machine (FST), using underlying index input instead of byte store on heap

Provides storage of finite state machine (FST), using byte array or byte store allocated on heap.

Represents the outputs for an FST, providing the basic algebra required for building and traversing the FST.

An Outputs implementation that pairs two other outputs.

An FST Outputs implementation where each output is a non-negative long value.

Implements reverse read from a RandomAccessInput.

Static helper methods.