Cross Reference: /frameworks/compile/mclinker/unittests/BinTreeTest.cpp

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