Automata

.makeStringUnion limits terms of this max length to ensure the stack doesn't overflow while building, since our algorithm currently relies on recursion.

Accept any single character starting from the specified state, returning the new state

Appends the specified character to the specified state, returning a new state.

Returns a new (deterministic) automaton that accepts all binary terms.

Returns a new (deterministic) automaton that accepts any single codepoint.

Returns a new (deterministic) automaton that accepts all strings.

Returns a new (deterministic) automaton that accepts the single given binary term.

Creates a new deterministic, minimal automaton accepting all binary terms in the specified interval. Note that unlike .makeDecimalInterval, the returned automaton is infinite, because terms behave like floating point numbers leading with a decimal point. However, in the special case where min == max, and both are inclusive, the automata will be finite and accept exactly one term.

Returns a new (deterministic and minimal) automaton that accepts the union of the given collection of BytesRefs representing UTF-8 encoded strings. The resulting automaton will be built in a binary representation.

Returns a new (deterministic and minimal) automaton that accepts the union of the given iterator of BytesRefs representing UTF-8 encoded strings. The resulting automaton will be built in a binary representation.

Returns a new (deterministic) automaton that accepts a single codepoint of the given value.

Returns a new minimal automaton that accepts any of the codepoint ranges

Returns a new (deterministic) automaton that accepts a single codepoint whose value is in the given interval (including both end points).

Returns a new minimal automaton that accepts any of the provided codepoints

Returns a new automaton that accepts strings representing decimal (base 10) non-negative integers in the given interval.

Returns a new (deterministic) automaton with the empty language.

Returns a new (deterministic) automaton that accepts only the empty string.

Returns a new (deterministic) automaton that accepts all binary terms except the empty string.

Returns a new (deterministic) automaton that accepts the single given string.

Returns a new (deterministic) automaton that accepts the single given string from the specified unicode code points.

Returns a new (deterministic and minimal) automaton that accepts the union of the given collection of BytesRefs representing UTF-8 encoded strings.

Returns a new (deterministic and minimal) automaton that accepts the union of the given iterator of BytesRefs representing UTF-8 encoded strings.