Table of Contents

Public interface IAutomaton

Namespace
Rowles.LeanLucene.Codecs.Fst
Assembly
Rowles.LeanLucene.dll

Interface for deterministic finite automata used with term dictionary intersection. States are represented as integers. State -1 is the dead/reject state.

public interface IAutomaton

Public property Start

Initial state of the automaton.

Public method CanMatch(int)

Returns true if the automaton could potentially accept any string starting from the given state. Used for early pruning during intersection. Returns false only if the state is dead (no path to any accept state).

Public method IsAccept(int)

Returns true if the given state is an accepting state.

Public method Step(int, byte)

Transition function: returns next state given current state and input byte, or -1 if no transition.

Edit this page