44   m_pTestee->join<TreeIteratorBase::Rightward>(pos, 0);  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()
49   m_pTestee->join<TreeIteratorBase::Rightward>(pos, 2);  in TEST_F()
50   m_pTestee->join<TreeIteratorBase::Leftward>(pos, 2);  in TEST_F()
54   mergeTree->join<TreeIteratorBase::Rightward>(pos2, 1);  in TEST_F()
56   mergeTree->join<TreeIteratorBase::Rightward>(pos2, 1);  in TEST_F()
57   mergeTree->join<TreeIteratorBase::Leftward>(pos2, 1);  in TEST_F()
69   mergeTree->join<TreeIteratorBase::Rightward>(pos, 0);  in TEST_F()
71   mergeTree->join<TreeIteratorBase::Rightward>(pos, 1);  in TEST_F()
72   mergeTree->join<TreeIteratorBase::Leftward>(pos, 1);  in TEST_F()
74   mergeTree->join<TreeIteratorBase::Rightward>(pos, 2);  in TEST_F()
75   mergeTree->join<TreeIteratorBase::Leftward>(pos, 2);  in TEST_F()
85   m_pTestee->join<TreeIteratorBase::Rightward>(pos, 0);  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()
90   m_pTestee->join<TreeIteratorBase::Rightward>(pos, 2);  in TEST_F()
91   m_pTestee->join<TreeIteratorBase::Leftward>(pos, 2);  in TEST_F()
119   m_pTestee->join<InputTree::Inclusive>(pos, a);  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()
124   m_pTestee->join<InputTree::Positional>(pos, d);  in TEST_F()
125   m_pTestee->join<InputTree::Inclusive>(pos, e);  in TEST_F()
146   m_pTestee->join<InputTree::Inclusive>(pos, a);  in TEST_F()
148   m_pTestee->join<InputTree::Positional>(pos, b);  in TEST_F()
150   m_pTestee->join<InputTree::Positional>(pos, c);  in TEST_F()
152   m_pTestee->join<InputTree::Positional>(pos, d);  in TEST_F()
154   m_pTestee->join<InputTree::Positional>(pos, e);  in TEST_F()
174   m_pTestee->join<InputTree::Inclusive>(pos, 0);  in TEST_F()
189   m_pTestee->join<InputTree::Inclusive>(pos, a);  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()
194   m_pTestee->join<InputTree::Positional>(pos, d);  in TEST_F()
195   m_pTestee->join<InputTree::Inclusive>(pos, e);  in TEST_F()
218   m_pTestee->join<InputTree::Inclusive>(pos, a);  in TEST_F()
220   m_pTestee->join<InputTree::Positional>(pos, b);  in TEST_F()
222   m_pTestee->join<InputTree::Positional>(pos, c);  in TEST_F()
224   m_pTestee->join<InputTree::Positional>(pos, d);  in TEST_F()
226   m_pTestee->join<InputTree::Positional>(pos, e);  in TEST_F()
246   m_pTestee->join<InputTree::Inclusive>(pos, 0);  in TEST_F()
260   m_pTestee->join<InputTree::Inclusive>(pos, a);  in TEST_F()
262   m_pTestee->join<InputTree::Positional>(pos, b);  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()
267   m_pTestee->join<InputTree::Positional>(pos, d);  in TEST_F()
269   m_pTestee->join<InputTree::Positional>(pos, e);  in TEST_F()