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()
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()
174   m_pTestee->join<InputTree::Inclusive>(pos, 0);  in TEST_F()
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()
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()
246   m_pTestee->join<InputTree::Inclusive>(pos, 0);  in TEST_F()
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()