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

Lines Matching refs:pos
50   BinaryTree<int>::iterator pos = m_pTestee->root();
51   m_pTestee->join<TreeIteratorBase::Rightward>(pos,0);
52   --pos;
53   m_pTestee->join<TreeIteratorBase::Rightward>(pos,1);
54   m_pTestee->join<TreeIteratorBase::Leftward>(pos,1);
55   --pos;
56   m_pTestee->join<TreeIteratorBase::Rightward>(pos,2);
57   m_pTestee->join<TreeIteratorBase::Leftward>(pos,2);
66   m_pTestee->merge<TreeIteratorBase::Rightward>(pos,*mergeTree); 
74   BinaryTree<int>::iterator pos = m_pTestee->root();
77   mergeTree->join<TreeIteratorBase::Rightward>(pos,0);
78   --pos;
79   mergeTree->join<TreeIteratorBase::Rightward>(pos,1);
80   mergeTree->join<TreeIteratorBase::Leftward>(pos,1);
81   --pos;
82   mergeTree->join<TreeIteratorBase::Rightward>(pos,2);
83   mergeTree->join<TreeIteratorBase::Leftward>(pos,2);
85   m_pTestee->merge<TreeIteratorBase::Rightward>(pos,*mergeTree); 
93   BinaryTree<int>::iterator pos = m_pTestee->root();
94   m_pTestee->join<TreeIteratorBase::Rightward>(pos,0);
95   --pos;
96   m_pTestee->join<TreeIteratorBase::Rightward>(pos,1);
97   m_pTestee->join<TreeIteratorBase::Leftward>(pos,1);
98   --pos;
99   m_pTestee->join<TreeIteratorBase::Rightward>(pos,2);
100   m_pTestee->join<TreeIteratorBase::Leftward>(pos,2);
113   BinaryTree<int>::iterator pos = m_pTestee->root();
128   BinaryTree<int>::iterator pos = m_pTestee->root();
130   m_pTestee->join<InputTree::Inclusive>(pos,a);
131   pos.move<InputTree::Inclusive>();
132   m_pTestee->join<InputTree::Positional>(pos,10);
133   m_pTestee->join<InputTree::Inclusive>(pos,9);
134   pos.move<InputTree::Inclusive>();
135   m_pTestee->join<InputTree::Positional>(pos,8);
136   m_pTestee->join<InputTree::Inclusive>(pos,7);
158   BinaryTree<int>::iterator pos = m_pTestee->root();
159   m_pTestee->join<InputTree::Inclusive>(pos,0);
160   pos.move<InputTree::Inclusive>();
161   m_pTestee->join<InputTree::Positional>(pos,1);
162   pos.move<InputTree::Positional>();
163   m_pTestee->join<InputTree::Positional>(pos,2);
164   pos.move<InputTree::Positional>();
165   m_pTestee->join<InputTree::Positional>(pos,3);
166   pos.move<InputTree::Positional>();
167   m_pTestee->join<InputTree::Positional>(pos,4);
188   BinaryTree<int>::iterator pos = m_pTestee->root();
189   m_pTestee->join<InputTree::Inclusive>(pos,0);
203   BinaryTree<int>::iterator pos = m_pTestee->root();
205   m_pTestee->join<InputTree::Inclusive>(pos,a);
206   pos.move<InputTree::Inclusive>();
207   m_pTestee->join<InputTree::Positional>(pos,10);
208   m_pTestee->join<InputTree::Inclusive>(pos,9);
209   pos.move<InputTree::Inclusive>();
210   m_pTestee->join<InputTree::Positional>(pos,8);
211   m_pTestee->join<InputTree::Inclusive>(pos,7);
233   BinaryTree<int>::iterator pos = m_pTestee->root();
234   m_pTestee->join<InputTree::Inclusive>(pos,0);
235   pos.move<InputTree::Inclusive>();
236   m_pTestee->join<InputTree::Positional>(pos,1);
237   pos.move<InputTree::Positional>();
238   m_pTestee->join<InputTree::Positional>(pos,2);
239   pos.move<InputTree::Positional>();
240   m_pTestee->join<InputTree::Positional>(pos,3);
241   pos.move<InputTree::Positional>();
242   m_pTestee->join<InputTree::Positional>(pos,4);
263   BinaryTree<int>::iterator pos = m_pTestee->root();
264   m_pTestee->join<InputTree::Inclusive>(pos,0);