Lines Matching refs:m_pTestee
37 m_pTestee = new mcld::InputTree();
38 m_pBuilder->setCurrentTree(*m_pTestee);
44 delete m_pTestee;
78 InputTree::iterator node = m_pTestee->root();
90 m_pTestee->enterGroup(node, InputTree::Downward);
101 ASSERT_TRUE(m_pTestee->size()==3);
105 InputTree::iterator node = m_pTestee->root();
109 m_pTestee->insert<InputTree::Inclusive>(node, *input);
116 m_pTestee->insert<InputTree::Inclusive>(node, *input);
120 m_pTestee->enterGroup(node, InputTree::Downward);
128 ASSERT_TRUE(m_pTestee->size()==102);
132 InputTree::iterator node = m_pTestee->root();
136 m_pTestee->enterGroup(node, InputTree::Downward);
140 m_pTestee->insert(node, InputTree::Afterward, *input);
148 ASSERT_TRUE(m_pTestee->size()==100);
154 InputTree::iterator node = m_pTestee->root();
156 m_pTestee->insert<InputTree::Inclusive>(node, *input);
160 m_pTestee->insert<InputTree::Positional>(node, *input);
161 m_pTestee->enterGroup<InputTree::Inclusive>(node);
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();
