31   m_pTestee = new mcld::InputTree();  in InputTreeTest()
68   InputTree::iterator node = m_pTestee->root();  in TEST_F()
69   InputTree::const_iterator const_node = node;  in TEST_F()
80   m_pTestee->enterGroup(node, InputTree::Downward);  in TEST_F()
82   InputTree::const_iterator const_node2 = node;  in TEST_F()
95   InputTree::iterator node = m_pTestee->root();  in TEST_F()
98   m_pTestee->insert<InputTree::Inclusive>(node, *input);  in TEST_F()
99   InputTree::const_iterator const_node = node;  in TEST_F()
104     m_pTestee->insert<InputTree::Inclusive>(node, *input);  in TEST_F()
108   m_pTestee->enterGroup(node, InputTree::Downward);  in TEST_F()
120   InputTree::iterator node = m_pTestee->root();  in TEST_F()
123     m_pTestee->enterGroup(node, InputTree::Downward);  in TEST_F()
127     m_pTestee->insert(node, InputTree::Afterward, *input);  in TEST_F()
139   InputTree::iterator node = m_pTestee->root();  in TEST_F()
141   m_pTestee->insert<InputTree::Inclusive>(node, *input);  in TEST_F()
142   node.move<InputTree::Inclusive>();  in TEST_F()
145   m_pTestee->insert<InputTree::Positional>(node, *input);  in TEST_F()
146   m_pTestee->enterGroup<InputTree::Inclusive>(node);  in TEST_F()
147   node.move<InputTree::Inclusive>();  in TEST_F()
150   m_pTestee->insert<InputTree::Inclusive>(node, *input);  in TEST_F()
152   m_pTestee->insert<InputTree::Positional>(node, *input);  in TEST_F()
154   InputTree::dfs_iterator dfs_it = m_pTestee->dfs_begin();  in TEST_F()
155   InputTree::dfs_iterator dfs_end = m_pTestee->dfs_end();  in TEST_F()