Searched refs:NFA (Results 1 - 9 of 9) sorted by relevance
| /third_party/rust/crates/aho-corasick/src/ |
| H A D | ahocorasick.rs | 7 use crate::nfa::{self, NFA};
1014 Imp::NFA(ref nfa) => nfa.heap_bytes(), in heap_bytes()
1020 /// The internal implementation of Aho-Corasick, which is either an NFA or
1021 /// a DFA. The NFA is slower but uses less memory. The DFA is faster but uses
1025 NFA(NFA<S>),
1033 Imp::NFA(ref nfa) => nfa.match_kind(), in match_kind()
1041 Imp::NFA(ref nfa) => nfa.start_state(), in start_state()
1051 Imp::NFA(ref nfa) => nfa.max_pattern_len(), in max_pattern_len()
1061 Imp::NFA(re in pattern_count()
[all...] |
| H A D | nfa.rs | 22 /// An Aho-Corasick automaton, represented as an NFA.
27 /// standard formulation is, technically, an NFA because of these failure
39 /// If one wants a DFA, then it is necessary to first build an NFA and convert
43 /// equivalent to the number of NFA states. The only real difference between
47 pub struct NFA<S> { structure names
48 /// The match semantics built into this NFA.
59 /// The number of bytes of heap used by this NFA's transition table.
66 /// building the NFA, but don't use it in the NFA's states. Instead, we
67 /// use this for building the DFA. We store it on the NFA sinc
90 impl<S: StateID> NFA<S> { global() impls
[all...] |
| H A D | dfa.rs | 7 use crate::nfa::{PatternID, PatternLength, NFA};
413 /// The number of bytes of heap used by this NFA's transition table.
591 /// Computes the total amount of heap used by this NFA in bytes.
605 /// A builder for configuring the determinization of an NFA into a DFA.
618 /// Build a DFA from the given NFA.
623 pub fn build<S: StateID>(&self, nfa: &NFA<S>) -> Result<DFA<S>> { in build()
689 /// This returns the next NFA transition (including resolving failure
697 nfa: &NFA<S>, in nfa_next_state_memoized()
|
| /third_party/skia/src/sksl/lex/ |
| H A D | RegexNode.h | 14 struct NFA;
61 * Creates NFA states for this node, with a successful match against this node resulting in a
64 std::vector<int> createStates(NFA* nfa, const std::vector<int>& accept) const;
|
| H A D | NFAtoDFA.h | 12 #include "src/sksl/lex/NFA.h"
24 * DFAs differ only in that an NFA allows multiple states at the same time, we can find each
25 * possible combination of simultaneous NFA states and give this combination a label. These labelled
26 * nodes are our DFA nodes, since we can only be in one such unique set of NFA states at a time.
28 * As an NFA can end up in multiple accept states at the same time (for instance, the token "while"
30 * (in terms of the order in which they were added to the NFA).
37 NFAtoDFA(NFA* nfa) in NFAtoDFA()
41 * Returns a DFA created from the NFA.
46 // create a state representing being in all of the NFA's start states at once in convert()
162 const NFA
[all...] |
| H A D | NFA.h | 15 * A nondeterministic finite automaton for matching regular expressions. The NFA is initialized with
18 struct NFA { struct
33 * Adds a new state to the NFA, returning its index.
41 * Matches a string against all of the regexes added to this NFA. Returns the index of the first
43 * only for debugging purposes; the NFA should be converted to a DFA before actual use.
|
| H A D | NFA.cpp | 8 #include "src/sksl/lex/NFA.h"
10 int NFA::match(std::string s) const { in match()
|
| H A D | Main.cpp | 186 NFA nfa; in process()
|
| H A D | RegexNode.cpp | 10 #include "src/sksl/lex/NFA.h"
12 std::vector<int> RegexNode::createStates(NFA* nfa, const std::vector<int>& accept) const { in createStates()
|
Completed in 6 milliseconds