Lines Matching refs:m_pTestee
21 m_pTestee = new BinaryTree<int>();
26 delete m_pTestee;
43 BinaryTree<int>::iterator pos = m_pTestee->root();
44 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 0);
46 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 1);
47 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 1);
49 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 2);
50 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 2);
59 m_pTestee->merge<TreeIteratorBase::Rightward>(pos, *mergeTree);
61 EXPECT_TRUE(m_pTestee->size() == 8);
66 BinaryTree<int>::iterator pos = m_pTestee->root();
77 m_pTestee->merge<TreeIteratorBase::Rightward>(pos, *mergeTree);
80 EXPECT_TRUE(m_pTestee->size() == 5);
84 BinaryTree<int>::iterator pos = m_pTestee->root();
85 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 0);
87 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 1);
88 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 1);
90 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 2);
91 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 2);
95 mergeTree->merge<TreeIteratorBase::Rightward>(pos2, *m_pTestee);
97 // delete m_pTestee;
103 BinaryTree<int>::iterator pos = m_pTestee->root();
108 mergeTree->merge<TreeIteratorBase::Rightward>(pos2, *m_pTestee);
110 // delete m_pTestee;
117 BinaryTree<int>::iterator pos = m_pTestee->root();
119 m_pTestee->join<InputTree::Inclusive>(pos, a);
121 m_pTestee->join<InputTree::Positional>(pos, b);
122 m_pTestee->join<InputTree::Inclusive>(pos, c);
124 m_pTestee->join<InputTree::Positional>(pos, d);
125 m_pTestee->join<InputTree::Inclusive>(pos, e);
127 BinaryTree<int>::dfs_iterator dfs_it = m_pTestee->dfs_begin();
128 BinaryTree<int>::dfs_iterator dfs_end = m_pTestee->dfs_end();
145 BinaryTree<int>::iterator pos = m_pTestee->root();
146 m_pTestee->join<InputTree::Inclusive>(pos, a);
148 m_pTestee->join<InputTree::Positional>(pos, b);
150 m_pTestee->join<InputTree::Positional>(pos, c);
152 m_pTestee->join<InputTree::Positional>(pos, d);
154 m_pTestee->join<InputTree::Positional>(pos, e);
156 BinaryTree<int>::dfs_iterator dfs_it = m_pTestee->dfs_begin();
157 BinaryTree<int>::dfs_iterator dfs_end = m_pTestee->dfs_end();
173 BinaryTree<int>::iterator pos = m_pTestee->root();
174 m_pTestee->join<InputTree::Inclusive>(pos, 0);
175 BinaryTree<int>::dfs_iterator dfs_it = m_pTestee->dfs_begin();
176 BinaryTree<int>::dfs_iterator dfs_end = m_pTestee->dfs_end();
187 BinaryTree<int>::iterator pos = m_pTestee->root();
189 m_pTestee->join<InputTree::Inclusive>(pos, a);
191 m_pTestee->join<InputTree::Positional>(pos, b);
192 m_pTestee->join<InputTree::Inclusive>(pos, c);
194 m_pTestee->join<InputTree::Positional>(pos, d);
195 m_pTestee->join<InputTree::Inclusive>(pos, e);
197 BinaryTree<int>::bfs_iterator bfs_it = m_pTestee->bfs_begin();
198 BinaryTree<int>::bfs_iterator bfs_end = m_pTestee->bfs_end();
211 bfs_it = m_pTestee->bfs_begin();
212 bfs_end = m_pTestee->bfs_end();
217 BinaryTree<int>::iterator pos = m_pTestee->root();
218 m_pTestee->join<InputTree::Inclusive>(pos, a);
220 m_pTestee->join<InputTree::Positional>(pos, b);
222 m_pTestee->join<InputTree::Positional>(pos, c);
224 m_pTestee->join<InputTree::Positional>(pos, d);
226 m_pTestee->join<InputTree::Positional>(pos, e);
228 BinaryTree<int>::bfs_iterator bfs_it = m_pTestee->bfs_begin();
229 BinaryTree<int>::bfs_iterator bfs_end = m_pTestee->bfs_end();
245 BinaryTree<int>::iterator pos = m_pTestee->root();
246 m_pTestee->join<InputTree::Inclusive>(pos, 0);
247 BinaryTree<int>::bfs_iterator bfs_it = m_pTestee->bfs_begin();
248 BinaryTree<int>::bfs_iterator bfs_end = m_pTestee->bfs_end();
259 BinaryTree<int>::iterator pos = m_pTestee->root();
260 m_pTestee->join<InputTree::Inclusive>(pos, a);
262 m_pTestee->join<InputTree::Positional>(pos, b);
264 m_pTestee->join<InputTree::Inclusive>(pos, c);
265 m_pTestee->join<InputTree::Positional>(pos, f);
267 m_pTestee->join<InputTree::Positional>(pos, d);
269 m_pTestee->join<InputTree::Positional>(pos, e);
271 BinaryTree<int>::iterator it = m_pTestee->begin();
272 BinaryTree<int>::iterator end = m_pTestee->end();
286 it = m_pTestee->begin();
