public class NFA
extends java.lang.Object
implements java.io.Serializable
NFA is an implementation of non-deterministic finite automata. It is used for the
non-deterministic pattern match in the MATCH_RECOGNIZE component.
The implementation is strongly based on the UMASS paper on NFA with shared buffer:
| Modifier and Type | Method and Description |
|---|---|
static NFA |
compile(java.util.List<CEPPattern> patterns,
org.apache.beam.sdk.schemas.Schema outSchema) |
java.util.Map<java.lang.String,java.util.ArrayList<org.apache.beam.sdk.values.Row>> |
processNewRow(org.apache.beam.sdk.values.Row inputRow) |
public static NFA compile(java.util.List<CEPPattern> patterns, org.apache.beam.sdk.schemas.Schema outSchema)
public java.util.Map<java.lang.String,java.util.ArrayList<org.apache.beam.sdk.values.Row>> processNewRow(org.apache.beam.sdk.values.Row inputRow)