Lines Matching refs:m_pTestee
23 m_pTestee = new BinaryTree<int>();
29 delete m_pTestee;
50 BinaryTree<int>::iterator pos = m_pTestee->root();
51 m_pTestee->join<TreeIteratorBase::Rightward>(pos,0);
53 m_pTestee->join<TreeIteratorBase::Rightward>(pos,1);
54 m_pTestee->join<TreeIteratorBase::Leftward>(pos,1);
56 m_pTestee->join<TreeIteratorBase::Rightward>(pos,2);
57 m_pTestee->join<TreeIteratorBase::Leftward>(pos,2);
66 m_pTestee->merge<TreeIteratorBase::Rightward>(pos,*mergeTree);
68 EXPECT_TRUE(m_pTestee->size()==8);
74 BinaryTree<int>::iterator pos = m_pTestee->root();
85 m_pTestee->merge<TreeIteratorBase::Rightward>(pos,*mergeTree);
88 EXPECT_TRUE(m_pTestee->size()==5);
93 BinaryTree<int>::iterator pos = m_pTestee->root();
94 m_pTestee->join<TreeIteratorBase::Rightward>(pos,0);
96 m_pTestee->join<TreeIteratorBase::Rightward>(pos,1);
97 m_pTestee->join<TreeIteratorBase::Leftward>(pos,1);
99 m_pTestee->join<TreeIteratorBase::Rightward>(pos,2);
100 m_pTestee->join<TreeIteratorBase::Leftward>(pos,2);
104 mergeTree->merge<TreeIteratorBase::Rightward>(pos2,*m_pTestee);
106 //delete m_pTestee;
113 BinaryTree<int>::iterator pos = m_pTestee->root();
118 mergeTree->merge<TreeIteratorBase::Rightward>(pos2,*m_pTestee);
120 //delete m_pTestee;
128 BinaryTree<int>::iterator pos = m_pTestee->root();
130 m_pTestee->join<InputTree::Inclusive>(pos,a);
132 m_pTestee->join<InputTree::Positional>(pos,10);
133 m_pTestee->join<InputTree::Inclusive>(pos,9);
135 m_pTestee->join<InputTree::Positional>(pos,8);
136 m_pTestee->join<InputTree::Inclusive>(pos,7);
138 BinaryTree<int>::dfs_iterator dfs_it = m_pTestee->dfs_begin();
139 BinaryTree<int>::dfs_iterator dfs_end = m_pTestee->dfs_end();
152 BinaryTree<int>::bfs_iterator bfs_it = m_pTestee->bfs_begin();
153 BinaryTree<int>::bfs_iterator bfs_end = m_pTestee->bfs_end();
158 BinaryTree<int>::iterator pos = m_pTestee->root();
159 m_pTestee->join<InputTree::Inclusive>(pos,0);
161 m_pTestee->join<InputTree::Positional>(pos,1);
163 m_pTestee->join<InputTree::Positional>(pos,2);
165 m_pTestee->join<InputTree::Positional>(pos,3);
167 m_pTestee->join<InputTree::Positional>(pos,4);
169 BinaryTree<int>::dfs_iterator dfs_it = m_pTestee->dfs_begin();
170 BinaryTree<int>::dfs_iterator dfs_end = m_pTestee->dfs_end();
188 BinaryTree<int>::iterator pos = m_pTestee->root();
189 m_pTestee->join<InputTree::Inclusive>(pos,0);
190 BinaryTree<int>::dfs_iterator dfs_it = m_pTestee->dfs_begin();
191 BinaryTree<int>::dfs_iterator dfs_end = m_pTestee->dfs_end();
203 BinaryTree<int>::iterator pos = m_pTestee->root();
205 m_pTestee->join<InputTree::Inclusive>(pos,a);
207 m_pTestee->join<InputTree::Positional>(pos,10);
208 m_pTestee->join<InputTree::Inclusive>(pos,9);
210 m_pTestee->join<InputTree::Positional>(pos,8);
211 m_pTestee->join<InputTree::Inclusive>(pos,7);
213 BinaryTree<int>::bfs_iterator bfs_it = m_pTestee->bfs_begin();
214 BinaryTree<int>::bfs_iterator bfs_end = m_pTestee->bfs_end();
227 bfs_it = m_pTestee->bfs_begin();
228 bfs_end = m_pTestee->bfs_end();
233 BinaryTree<int>::iterator pos = m_pTestee->root();
234 m_pTestee->join<InputTree::Inclusive>(pos,0);
236 m_pTestee->join<InputTree::Positional>(pos,1);
238 m_pTestee->join<InputTree::Positional>(pos,2);
240 m_pTestee->join<InputTree::Positional>(pos,3);
242 m_pTestee->join<InputTree::Positional>(pos,4);
244 BinaryTree<int>::bfs_iterator bfs_it = m_pTestee->bfs_begin();
245 BinaryTree<int>::bfs_iterator bfs_end = m_pTestee->bfs_end();
263 BinaryTree<int>::iterator pos = m_pTestee->root();
264 m_pTestee->join<InputTree::Inclusive>(pos,0);
265 BinaryTree<int>::bfs_iterator bfs_it = m_pTestee->bfs_begin();
266 BinaryTree<int>::bfs_iterator bfs_end = m_pTestee->bfs_end();
277 BinaryTree<int>::iterator pos = m_pTestee->root();
278 m_pTestee->join<InputTree::Inclusive>(pos,0);
280 m_pTestee->join<InputTree::Positional>(pos,1);
282 m_pTestee->join<InputTree::Inclusive>(pos,2);
283 m_pTestee->join<InputTree::Positional>(pos,5);
285 m_pTestee->join<InputTree::Positional>(pos,3);
287 m_pTestee->join<InputTree::Positional>(pos,4);
289 BinaryTree<int>::iterator it = m_pTestee->begin();
290 BinaryTree<int>::iterator end = m_pTestee->end();
304 it = m_pTestee->begin();
