Lines Matching refs:m_pTestee
31 m_pTestee = new mcld::InputTree(); in InputTreeTest()
32 m_pBuilder->setCurrentTree(*m_pTestee); in InputTreeTest()
37 delete m_pTestee; in ~InputTreeTest()
68 InputTree::iterator node = m_pTestee->root(); in TEST_F()
80 m_pTestee->enterGroup(node, InputTree::Downward); in TEST_F()
91 ASSERT_TRUE(m_pTestee->size() == 3); in TEST_F()
95 InputTree::iterator node = m_pTestee->root(); in TEST_F()
98 m_pTestee->insert<InputTree::Inclusive>(node, *input); in TEST_F()
104 m_pTestee->insert<InputTree::Inclusive>(node, *input); in TEST_F()
108 m_pTestee->enterGroup(node, InputTree::Downward); in TEST_F()
116 ASSERT_TRUE(m_pTestee->size() == 102); 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()
135 ASSERT_TRUE(m_pTestee->size() == 100); in TEST_F()
139 InputTree::iterator node = m_pTestee->root(); in TEST_F()
141 m_pTestee->insert<InputTree::Inclusive>(node, *input); in TEST_F()
145 m_pTestee->insert<InputTree::Positional>(node, *input); in TEST_F()
146 m_pTestee->enterGroup<InputTree::Inclusive>(node); 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()