|
|
1.1 ! root 1: /* File - TrieFA.h ! 2: * ! 3: * The data types for the generated trie-baseed finite automata. ! 4: */ ! 5: ! 6: struct TrieState { // An entry in the FA state table ! 7: short def; // If this state is an accepting state then ! 8: // this is the definition, otherwise it is -1. ! 9: short trans_base; // The base index into the transition table. ! 10: long mask; // The transition mask. ! 11: }; ! 12: ! 13: struct TrieTrans { // An entry in the FA transition table. ! 14: short c; // The transition character (lowercase). ! 15: short next_state; // The next state. ! 16: }; ! 17: ! 18: extern TrieState TrieStateTbl[]; ! 19: extern TrieTrans TrieTransTbl[];
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.