test-framework/org.gnit.lucenekmp.tests.util.automaton/AutomatonTestUtil

AutomatonTestUtil

object AutomatonTestUtil

Types

RandomAcceptedStrings

class RandomAcceptedStrings(a: Automaton)

Lets you retrieve random strings accepted by an Automaton.

Properties

DEFAULT_MAX_DETERMINIZED_STATES

const val DEFAULT_MAX_DETERMINIZED_STATES: Int = 1000000

Default maximum number of states that {@link Operations#determinize} should create.

Functions

fun assertCleanDFA(a: Automaton)

fun assertCleanNFA(a: Automaton)

fun assertMatches(a: Automaton, vararg strings: String)

assertMinimalDFA

fun assertMinimalDFA(a: Automaton)

assertNoDetachedStates

fun assertNoDetachedStates(a: Automaton)

Checks that an automaton has no detached states that are unreachable from the initial state.

determinizeSimple

fun determinizeSimple(a: Automaton): Automaton

Simple, original brics implementation of determinize()

fun determinizeSimple(a: Automaton, initialset: Set<Int>): Automaton

Simple, original brics implementation of determinize() Determinizes the given automaton using the given set of initial states.

getFiniteStrings

fun getFiniteStrings(a: Automaton, s: Int, pathstates: MutableSet<Int>, strings: MutableSet<IntsRef>, path: IntsRefBuilder, limit: Int): Boolean

Returns the strings that can be produced from the given state, or false if more than limit strings are found. limit<0 means "infinite".

getFiniteStringsRecursive

fun getFiniteStringsRecursive(a: Automaton, limit: Int): Set<IntsRef>

Simple, original implementation of getFiniteStrings.

isDeterministicSlow

fun isDeterministicSlow(a: Automaton): Boolean

Returns true if the automaton is deterministic.

fun isFinite(a: Automaton): Boolean

fun minimizeSimple(a: Automaton): Automaton

Simple, original brics implementation of Brzozowski minimize()

randomAutomaton

fun randomAutomaton(random: Random): Automaton

return a random NFA/DFA for testing

fun randomRegexp(r: Random): String

Returns random string, including full unicode range.

reverseOriginal

fun reverseOriginal(a: Automaton, initialStates: MutableSet<Int>?): Automaton

Original brics implementation of reverse(). It tries to satisfy multiple use-cases by populating a set of initial states too.

fun sameLanguage(a1: Automaton, a2: Automaton): Boolean

Returns true if these two automata accept exactly the same language. This is a costly computation! Both automata must be determinized and have no dead states!

fun subsetOf(a1: Automaton, a2: Automaton): Boolean

Returns true if the language of a1 is a subset of the language of a2. Both automata must be determinized and must have no dead states.