public final class SpecialOperations
extends java.lang.Object
| Modifier and Type | Method and Description |
|---|---|
static java.lang.String |
getCommonPrefix(Automaton a)
Returns the longest string that is a prefix of all accepted strings and
visits each state at most once.
|
static BytesRef |
getCommonPrefixBytesRef(Automaton a) |
static java.lang.String |
getCommonSuffix(Automaton a)
Returns the longest string that is a suffix of all accepted strings and
visits each state at most once.
|
static BytesRef |
getCommonSuffixBytesRef(Automaton a) |
static java.util.Set<IntsRef> |
getFiniteStrings(Automaton a,
int limit)
Returns the set of accepted strings, assuming that at most
limit strings are accepted. |
static boolean |
isFinite(Automaton a)
Returns true if the language of this automaton is finite.
|
static java.util.Set<State> |
reverse(Automaton a)
Reverses the language of the given (non-singleton) automaton while returning
the set of new initial states.
|
public static boolean isFinite(Automaton a)
public static java.lang.String getCommonPrefix(Automaton a)
public static java.lang.String getCommonSuffix(Automaton a)
public static java.util.Set<State> reverse(Automaton a)
public static java.util.Set<IntsRef> getFiniteStrings(Automaton a, int limit)
limit strings are accepted. If more than limit
strings are accepted, the first limit strings found are returned. If limit<0, then
the limit is infinite.Copyright © 2010 - 2024 Adobe. All Rights Reserved