public final class DaciukMihovAutomatonBuilder
extends java.lang.Object
Automaton
that accepts a set of
strings. The algorithm requires sorted input data, but is very fast
(nearly linear with the input size).Modifier and Type | Method and Description |
---|---|
void |
add(CharsRef current)
Add another character sequence to this automaton.
|
static Automaton |
build(java.util.Collection<BytesRef> input)
Build a minimal, deterministic automaton from a sorted list of
BytesRef representing
strings in UTF-8. |
org.apache.lucene.util.automaton.DaciukMihovAutomatonBuilder.State |
complete()
Finalize the automaton and return the root state.
|
public void add(CharsRef current)
public org.apache.lucene.util.automaton.DaciukMihovAutomatonBuilder.State complete()
Copyright © 2000–2019 The Apache Software Foundation. All rights reserved.