78   InputTree::iterator node = m_pTestee->root();  in TEST_F()  local
79   InputTree::const_iterator const_node = node;  in TEST_F()
80   --node;  in TEST_F()
83   ASSERT_TRUE(isGroup(node));  in TEST_F()
88   --node;  in TEST_F()
90   m_pTestee->enterGroup(node, InputTree::Downward);  in TEST_F()
92   InputTree::const_iterator const_node2 = node;  in TEST_F()
94   ASSERT_FALSE(node.isRoot());  in TEST_F()
96   ASSERT_FALSE(isGroup(node));  in TEST_F()
105   InputTree::iterator node = m_pTestee->root();  in TEST_F()  local
109   m_pTestee->insert<InputTree::Inclusive>(node, *input);  in TEST_F()
110   InputTree::const_iterator const_node = node;  in TEST_F()
111   --node;  in TEST_F()
116     m_pTestee->insert<InputTree::Inclusive>(node, *input);  in TEST_F()
117     ++node;  in TEST_F()
120   m_pTestee->enterGroup(node, InputTree::Downward);  in TEST_F()
121   --node;  in TEST_F()
123   ASSERT_FALSE(node.isRoot());  in TEST_F()
124   ASSERT_TRUE(isGroup(node));  in TEST_F()
132   InputTree::iterator node = m_pTestee->root();  in TEST_F()  local
136     m_pTestee->enterGroup(node, InputTree::Downward);  in TEST_F()
137     --node;  in TEST_F()
140     m_pTestee->insert(node, InputTree::Afterward, *input);  in TEST_F()
141     ++node;  in TEST_F()
144   ASSERT_FALSE(node.isRoot());  in TEST_F()
145   ASSERT_FALSE(isGroup(node));  in TEST_F()
154   InputTree::iterator node = m_pTestee->root();  in TEST_F()  local
156   m_pTestee->insert<InputTree::Inclusive>(node, *input);  in TEST_F()
157   node.move<InputTree::Inclusive>();  in TEST_F()
160   m_pTestee->insert<InputTree::Positional>(node, *input);  in TEST_F()
161   m_pTestee->enterGroup<InputTree::Inclusive>(node);  in TEST_F()
162   node.move<InputTree::Inclusive>();  in TEST_F()
165   m_pTestee->insert<InputTree::Inclusive>(node, *input);  in TEST_F()
167   m_pTestee->insert<InputTree::Positional>(node, *input);  in TEST_F()