Lines Matching refs:m_pTestee
31 m_pTestee = new mcld::InputTree();
32 m_pBuilder->setCurrentTree(*m_pTestee);
37 delete m_pTestee;
68 InputTree::iterator node = m_pTestee->root();
80 m_pTestee->enterGroup(node, InputTree::Downward);
91 ASSERT_TRUE(m_pTestee->size() == 3);
95 InputTree::iterator node = m_pTestee->root();
98 m_pTestee->insert<InputTree::Inclusive>(node, *input);
104 m_pTestee->insert<InputTree::Inclusive>(node, *input);
108 m_pTestee->enterGroup(node, InputTree::Downward);
116 ASSERT_TRUE(m_pTestee->size() == 102);
120 InputTree::iterator node = m_pTestee->root();
123 m_pTestee->enterGroup(node, InputTree::Downward);
127 m_pTestee->insert(node, InputTree::Afterward, *input);
135 ASSERT_TRUE(m_pTestee->size() == 100);
139 InputTree::iterator node = m_pTestee->root();
141 m_pTestee->insert<InputTree::Inclusive>(node, *input);
145 m_pTestee->insert<InputTree::Positional>(node, *input);
146 m_pTestee->enterGroup<InputTree::Inclusive>(node);
150 m_pTestee->insert<InputTree::Inclusive>(node, *input);
152 m_pTestee->insert<InputTree::Positional>(node, *input);
154 InputTree::dfs_iterator dfs_it = m_pTestee->dfs_begin();
155 InputTree::dfs_iterator dfs_end = m_pTestee->dfs_end();
