| /third_party/python/Lib/lib2to3/ |
| D | btm_matcher.py | 21 self.transition_table = {}
69 if pattern[0] not in start.transition_table:
72 start.transition_table[pattern[0]] = next_node
75 next_node = start.transition_table[pattern[0]]
116 if node_token in current_ac_node.transition_table:
118 current_ac_node = current_ac_node.transition_table[node_token]
130 if node_token in current_ac_node.transition_table:
132 current_ac_node = current_ac_node.transition_table[node_token]
143 for subnode_key in node.transition_table.keys():
144 subnode = node.transition_table[subnode_key]
|
| /third_party/boost/libs/iostreams/test/ |
| D | finite_state_filter_test.cpp | 80 typedef boost::mpl::vector0<> transition_table; typedef
89 > transition_table; typedef
101 > transition_table; typedef
126 > transition_table; typedef
|
| /third_party/boost/libs/msm/doc/PDF/examples/ |
| D | ActivateStateBeforeTransitionEuml.cpp | 100 ),transition_table)
113 BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT
|
| D | AnonymousTutorialEuml.cpp | 139 ),transition_table)
142 BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT
|
| D | SimpleTutorialEuml2.cpp | 89 ),transition_table)
92 BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT
|
| D | SimpleTimer.cpp | 116 ),transition_table)
119 BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT
|
| D | EumlInternal.cpp | 92 ),transition_table)
96 BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT
|
| D | FsmAsPtr.cpp | 96 ),transition_table)
99 BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT
|
| D | iPodSearchEuml.cpp | 93 ),transition_table ) in BOOST_MSM_EUML_DECLARE_ATTRIBUTE()
105 BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT
|
| D | SimpleTutorialEuml.cpp | 121 ),transition_table)
124 BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT
|
| D | CompositeTutorialEuml.cpp | 116 ),transition_table)
119 BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT
|
| D | SimplePhoenix.cpp | 193 ),transition_table)
196 BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT
|
| /third_party/boost/libs/msm/doc/HTML/examples/ |
| D | ActivateStateBeforeTransitionEuml.cpp | 100 ),transition_table)
113 BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT
|
| D | SimpleTutorialEuml2.cpp | 89 ),transition_table)
92 BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT
|
| D | AnonymousTutorialEuml.cpp | 139 ),transition_table)
142 BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT
|
| D | SimpleTimer.cpp | 116 ),transition_table)
119 BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT
|
| D | EumlInternal.cpp | 92 ),transition_table)
96 BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT
|
| D | FsmAsPtr.cpp | 96 ),transition_table)
99 BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT
|
| D | iPodSearchEuml.cpp | 93 ),transition_table ) in BOOST_MSM_EUML_DECLARE_ATTRIBUTE()
105 BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT
|
| D | SimpleTutorialEuml.cpp | 121 ),transition_table)
124 BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT
|
| D | SimplePhoenix.cpp | 193 ),transition_table)
196 BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT
|
| D | CompositeTutorialEuml.cpp | 116 ),transition_table)
119 BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT
|
| D | HistoryEuml.cpp | 115 ),transition_table)
118 BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT
|
| /third_party/boost/libs/wave/samples/cpp_tokens/slex/ |
| D | lexer.hpp | 2138 s = dfa.transition_table[s][(uchar)*p]; in do_match()
2191 s = dfa.transition_table[s][get_byte(*wp,i)]; in do_match()
2275 std::vector<std::vector<node_id_t> > transition_table; member
2501 m_dfa[state].transition_table.push_back( in create_dfa_for_state()
2574 m_dfa[state].transition_table.push_back( in create_dfa_for_state()
2590 BOOST_ASSERT(T < m_dfa[state].transition_table.size()); in create_dfa_for_state()
2591 BOOST_ASSERT(j < m_dfa[state].transition_table[T].size()); in create_dfa_for_state()
2592 m_dfa[state].transition_table[T][j] = target_state; in create_dfa_for_state()
2617 out << "\nm_dfa[" << x << "] has " << m_dfa[x].transition_table.size() << " states\n"; in dump()
2618 for (node_id_t i = 0; i < m_dfa[x].transition_table.size(); ++i) in dump()
[all …]
|
| /third_party/boost/libs/msm/test/ |
| D | AnonymousEuml.cpp | 96 ),transition_table)
99 BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT
|