Lines Matching full:inclusive
119 m_pTestee->join<InputTree::Inclusive>(pos, a); in TEST_F()
120 pos.move<InputTree::Inclusive>(); in TEST_F()
122 m_pTestee->join<InputTree::Inclusive>(pos, c); in TEST_F()
123 pos.move<InputTree::Inclusive>(); 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()
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()
192 m_pTestee->join<InputTree::Inclusive>(pos, c); in TEST_F()
193 pos.move<InputTree::Inclusive>(); 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()
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()
264 m_pTestee->join<InputTree::Inclusive>(pos, c); in TEST_F()
266 pos.move<InputTree::Inclusive>(); in TEST_F()