| /third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/regex/ |
| H A D | RangeTreeConverterTest.java | 45 ValueGraph<Node, SimpleEdge> nfa = RangeTreeConverter.toNfaGraph(dfa); in testSimple()
46 assertThat(nfa.nodes()).hasSize(4); in testSimple()
47 Node node = assertOutEdge(nfa, INITIAL, edge(1)); in testSimple()
48 node = assertOutEdge(nfa, node, edge(2)); in testSimple()
49 node = assertOutEdge(nfa, node, any()); in testSimple()
59 ValueGraph<Node, SimpleEdge> nfa = RangeTreeConverter.toNfaGraph(dfa); in testWithOptionalEdge()
60 assertThat(nfa.nodes()).hasSize(4); in testWithOptionalEdge()
61 Node node = assertOutEdge(nfa, INITIAL, edge(1)); in testWithOptionalEdge()
62 node = assertOutEdge(nfa, node, edge(2)); in testWithOptionalEdge()
63 node = assertOutEdge(nfa, nod in testWithOptionalEdge()
130 assertOutEdge(ValueGraph<Node, SimpleEdge> nfa, Node node, SimpleEdge edge) assertOutEdge() argument
138 assertOutEdges(ValueGraph<Node, SimpleEdge> nfa, Node node, SimpleEdge... edges) assertOutEdges() argument
148 follow(ValueGraph<Node, SimpleEdge> nfa, Node node, SimpleEdge edge) follow() argument
[all...] |
| H A D | NfaFlattenerTest.java | 42 NfaBuilder nfa = new NfaBuilder(); in testSimple()
43 nfa.addPath(INITIAL, TERMINAL, "12"); in testSimple()
44 Edge flat = NfaFlattener.flatten(nfa.graph()); in testSimple()
48 nfa.addPath(INITIAL, TERMINAL, "34"); in testSimple()
49 flat = NfaFlattener.flatten(nfa.graph()); in testSimple()
59 NfaBuilder nfa = new NfaBuilder(); in testSubgroup()
60 Node split = nfa.addPath(INITIAL, "12"); in testSubgroup()
61 Node join = nfa.addPath(split, "34"); in testSubgroup()
62 nfa.addPath(split, join, "56"); in testSubgroup()
63 nfa in testSubgroup()
[all...] |
| H A D | TrailingPathOptimizerTest.java | 33 NfaBuilder nfa = new NfaBuilder(); in testSimple()
34 nfa.addPath(INITIAL, TERMINAL, "12xx"); in testSimple()
35 nfa.addPath(INITIAL, TERMINAL, "34xxxx"); in testSimple()
36 ValueGraph<Node, SimpleEdge> actual = TrailingPathOptimizer.optimize(nfa.graph()); in testSimple()
49 NfaBuilder nfa = new NfaBuilder(); in testTrailingOptionalGroup()
50 nfa.addPath(INITIAL, TERMINAL, "12xx"); in testTrailingOptionalGroup()
52 Node optStart = nfa.addPath(INITIAL, "34xx"); in testTrailingOptionalGroup()
53 nfa.addOptionalPath(optStart, TERMINAL, "xx"); in testTrailingOptionalGroup()
55 ValueGraph<Node, SimpleEdge> actual = TrailingPathOptimizer.optimize(nfa.graph()); in testTrailingOptionalGroup()
71 NfaBuilder nfa in testDoubleRecursion()
[all...] |
| /third_party/rust/crates/aho-corasick/src/ |
| H A D | nfa.rs | 490 nfa: &'a mut NFA<S>,
496 fn new(nfa: &'a mut NFA<S>, state_id: S) -> IterTransitionsMut<'a, S> { in new()
497 IterTransitionsMut { nfa, state_id, cur: 0 } in new()
500 fn nfa(&mut self) -> &mut NFA<S> { in nfa() functions
501 self.nfa in nfa()
509 match self.nfa.states[self.state_id.to_usize()].trans { in next()
604 nfa: NFA<S>,
614 nfa: NFA { in new()
644 self.nfa.byte_classes = self.byte_classes.build(); in compile()
646 self.nfa in compile()
[all...] |
| H A D | ahocorasick.rs | 7 use crate::nfa::{self, NFA};
1014 Imp::NFA(ref nfa) => nfa.heap_bytes(), in heap_bytes()
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(ref nfa) in pattern_count()
[all...] |
| H A D | dfa.rs | 7 use crate::nfa::{PatternID, PatternLength, NFA};
623 pub fn build<S: StateID>(&self, nfa: &NFA<S>) -> Result<DFA<S>> { in build()
625 nfa.byte_classes().clone() in build()
630 let trans = vec![fail_id(); alphabet_len * nfa.state_len()]; in build()
631 let matches = vec![vec![]; nfa.state_len()]; in build()
633 match_kind: nfa.match_kind().clone(), in build()
634 anchored: nfa.anchored(), in build()
636 start_id: nfa.start_state(), in build()
637 max_pattern_len: nfa.max_pattern_len(), in build()
638 pattern_count: nfa in build()
[all...] |
| H A D | lib.rs | 210 mod nfa; modules
|
| /third_party/skia/src/sksl/lex/ |
| H A D | RegexNode.cpp | 12 std::vector<int> RegexNode::createStates(NFA* nfa, const std::vector<int>& accept) const { in createStates() argument
16 result.push_back(nfa->addState(NFAState(fPayload.fChar, accept))); in createStates()
38 result.push_back(nfa->addState(NFAState(fPayload.fBool, chars, accept))); in createStates()
42 std::vector<int> right = fChildren[1].createStates(nfa, accept); in createStates()
43 result = fChildren[0].createStates(nfa, right); in createStates()
47 result.push_back(nfa->addState(NFAState(NFAState::kDot_Kind, accept))); in createStates()
50 std::vector<int> states = fChildren[0].createStates(nfa, accept); in createStates()
52 states = fChildren[1].createStates(nfa, accept); in createStates()
59 int id = nfa->addState(NFAState(placeholder)); in createStates()
61 result = fChildren[0].createStates(nfa, nex in createStates()
[all...] |
| H A D | Main.cpp | 186 NFA nfa; in process() local
213 nfa.addRegex(node); in process()
216 nfa.addRegex(RegexParser().parse(pattern)); in process()
220 NFAtoDFA converter(&nfa); in process()
|
| H A D | NFAtoDFA.h | 37 NFAtoDFA(NFA* nfa) in NFAtoDFA() argument
38 : fNFA(*nfa) {} in NFAtoDFA()
|
| H A D | RegexNode.h | 64 std::vector<int> createStates(NFA* nfa, const std::vector<int>& accept) const;
|
| /third_party/rust/crates/regex/src/ |
| H A D | exec.rs | 75 nfa: Program,
169 /// This overrides whatever was previously set via the `nfa` or
181 pub fn nfa(mut self) -> Self { in nfa() functions
193 /// `nfa` methods.
305 nfa: Program::new(), in build()
317 let mut nfa = Compiler::new() in build() variables
336 nfa.prefixes = LiteralSearcher::prefixes(parsed.prefixes); in build()
337 dfa.prefixes = nfa.prefixes.clone(); in build()
343 nfa, in build()
428 self.ro.nfa in slots_len()
[all...] |
| /third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/ |
| H A D | RegexGenerator.java | 165 ValueGraph<Node, SimpleEdge> nfa = RangeTreeConverter.toNfaGraph(ranges); in regexOf()
167 nfa = TrailingPathOptimizer.optimize(nfa); in regexOf()
169 return EdgeWriter.toRegex(NfaFlattener.flatten(nfa), useDotMatch); in regexOf()
|
| /third_party/rust/crates/regex/tests/ |
| H A D | test_nfa_utf8bytes.rs | 6 ExecBuilder::new($re).nfa().bytes(true).build().map(|e| e.into_regex())
20 .nfa()
|
| H A D | test_nfa.rs | 6 ExecBuilder::new($re).nfa().build().map(|e| e.into_regex())
19 ExecBuilder::new_many($re).nfa().build().map(|e| e.into_regex_set())
|
| H A D | test_nfa_bytes.rs | 5 .nfa()
22 .nfa()
|
| H A D | consistent.rs | 33 .nfa() in backends_are_consistent()
60 .nfa() in backends_are_consistent()
89 .nfa() in backends_are_consistent()
|