Lines Matching refs:pos
43 BinaryTree<int>::iterator pos = m_pTestee->root(); in TEST_F() local
44 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 0); in TEST_F()
45 --pos; in TEST_F()
46 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 1); in TEST_F()
47 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 1); in TEST_F()
48 --pos; in TEST_F()
49 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 2); in TEST_F()
50 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 2); in TEST_F()
59 m_pTestee->merge<TreeIteratorBase::Rightward>(pos, *mergeTree); in TEST_F()
66 BinaryTree<int>::iterator pos = m_pTestee->root(); in TEST_F() local
69 mergeTree->join<TreeIteratorBase::Rightward>(pos, 0); in TEST_F()
70 --pos; in TEST_F()
71 mergeTree->join<TreeIteratorBase::Rightward>(pos, 1); in TEST_F()
72 mergeTree->join<TreeIteratorBase::Leftward>(pos, 1); in TEST_F()
73 --pos; in TEST_F()
74 mergeTree->join<TreeIteratorBase::Rightward>(pos, 2); in TEST_F()
75 mergeTree->join<TreeIteratorBase::Leftward>(pos, 2); in TEST_F()
77 m_pTestee->merge<TreeIteratorBase::Rightward>(pos, *mergeTree); in TEST_F()
84 BinaryTree<int>::iterator pos = m_pTestee->root(); in TEST_F() local
85 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 0); in TEST_F()
86 --pos; in TEST_F()
87 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 1); in TEST_F()
88 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 1); in TEST_F()
89 --pos; in TEST_F()
90 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 2); in TEST_F()
91 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 2); in TEST_F()
103 BinaryTree<int>::iterator pos = m_pTestee->root(); in TEST_F() local
117 BinaryTree<int>::iterator pos = m_pTestee->root(); in TEST_F() local
119 m_pTestee->join<InputTree::Inclusive>(pos, a); in TEST_F()
120 pos.move<InputTree::Inclusive>(); in TEST_F()
121 m_pTestee->join<InputTree::Positional>(pos, b); in TEST_F()
122 m_pTestee->join<InputTree::Inclusive>(pos, c); in TEST_F()
123 pos.move<InputTree::Inclusive>(); in TEST_F()
124 m_pTestee->join<InputTree::Positional>(pos, d); in TEST_F()
125 m_pTestee->join<InputTree::Inclusive>(pos, e); in TEST_F()
145 BinaryTree<int>::iterator pos = m_pTestee->root(); in TEST_F() local
146 m_pTestee->join<InputTree::Inclusive>(pos, a); in TEST_F()
147 pos.move<InputTree::Inclusive>(); in TEST_F()
148 m_pTestee->join<InputTree::Positional>(pos, b); in TEST_F()
149 pos.move<InputTree::Positional>(); in TEST_F()
150 m_pTestee->join<InputTree::Positional>(pos, c); in TEST_F()
151 pos.move<InputTree::Positional>(); in TEST_F()
152 m_pTestee->join<InputTree::Positional>(pos, d); in TEST_F()
153 pos.move<InputTree::Positional>(); in TEST_F()
154 m_pTestee->join<InputTree::Positional>(pos, e); in TEST_F()
173 BinaryTree<int>::iterator pos = m_pTestee->root(); in TEST_F() local
174 m_pTestee->join<InputTree::Inclusive>(pos, 0); in TEST_F()
187 BinaryTree<int>::iterator pos = m_pTestee->root(); in TEST_F() local
189 m_pTestee->join<InputTree::Inclusive>(pos, a); in TEST_F()
190 pos.move<InputTree::Inclusive>(); in TEST_F()
191 m_pTestee->join<InputTree::Positional>(pos, b); in TEST_F()
192 m_pTestee->join<InputTree::Inclusive>(pos, c); in TEST_F()
193 pos.move<InputTree::Inclusive>(); in TEST_F()
194 m_pTestee->join<InputTree::Positional>(pos, d); in TEST_F()
195 m_pTestee->join<InputTree::Inclusive>(pos, e); in TEST_F()
217 BinaryTree<int>::iterator pos = m_pTestee->root(); in TEST_F() local
218 m_pTestee->join<InputTree::Inclusive>(pos, a); in TEST_F()
219 pos.move<InputTree::Inclusive>(); in TEST_F()
220 m_pTestee->join<InputTree::Positional>(pos, b); in TEST_F()
221 pos.move<InputTree::Positional>(); in TEST_F()
222 m_pTestee->join<InputTree::Positional>(pos, c); in TEST_F()
223 pos.move<InputTree::Positional>(); in TEST_F()
224 m_pTestee->join<InputTree::Positional>(pos, d); in TEST_F()
225 pos.move<InputTree::Positional>(); in TEST_F()
226 m_pTestee->join<InputTree::Positional>(pos, e); in TEST_F()
245 BinaryTree<int>::iterator pos = m_pTestee->root(); in TEST_F() local
246 m_pTestee->join<InputTree::Inclusive>(pos, 0); in TEST_F()
259 BinaryTree<int>::iterator pos = m_pTestee->root(); in TEST_F() local
260 m_pTestee->join<InputTree::Inclusive>(pos, a); in TEST_F()
261 pos.move<InputTree::Inclusive>(); in TEST_F()
262 m_pTestee->join<InputTree::Positional>(pos, b); in TEST_F()
263 pos.move<InputTree::Positional>(); in TEST_F()
264 m_pTestee->join<InputTree::Inclusive>(pos, c); in TEST_F()
265 m_pTestee->join<InputTree::Positional>(pos, f); in TEST_F()
266 pos.move<InputTree::Inclusive>(); in TEST_F()
267 m_pTestee->join<InputTree::Positional>(pos, d); in TEST_F()
268 pos.move<InputTree::Positional>(); in TEST_F()
269 m_pTestee->join<InputTree::Positional>(pos, e); in TEST_F()