Lines Matching refs:InputTree
14 #include <mcld/InputTree.h>
37 m_pTestee = new mcld::InputTree();
78 InputTree::iterator node = m_pTestee->root();
79 InputTree::const_iterator const_node = node;
90 m_pTestee->enterGroup(node, InputTree::Downward);
92 InputTree::const_iterator const_node2 = node;
105 InputTree::iterator node = m_pTestee->root();
109 m_pTestee->insert<InputTree::Inclusive>(node, *input);
110 InputTree::const_iterator const_node = node;
116 m_pTestee->insert<InputTree::Inclusive>(node, *input);
120 m_pTestee->enterGroup(node, InputTree::Downward);
132 InputTree::iterator node = m_pTestee->root();
136 m_pTestee->enterGroup(node, InputTree::Downward);
140 m_pTestee->insert(node, InputTree::Afterward, *input);
154 InputTree::iterator node = m_pTestee->root();
156 m_pTestee->insert<InputTree::Inclusive>(node, *input);
157 node.move<InputTree::Inclusive>();
160 m_pTestee->insert<InputTree::Positional>(node, *input);
161 m_pTestee->enterGroup<InputTree::Inclusive>(node);
162 node.move<InputTree::Inclusive>();
165 m_pTestee->insert<InputTree::Inclusive>(node, *input);
167 m_pTestee->insert<InputTree::Positional>(node, *input);
169 InputTree::dfs_iterator dfs_it = m_pTestee->dfs_begin();
170 InputTree::dfs_iterator dfs_end = m_pTestee->dfs_end();
