68   InputTree::iterator node = m_pTestee->root();  in TEST_F()  local
69   InputTree::const_iterator const_node = node;  in TEST_F()
70   --node;  in TEST_F()
73   ASSERT_TRUE(isGroup(node));  in TEST_F()
78   --node;  in TEST_F()
80   m_pTestee->enterGroup(node, InputTree::Downward);  in TEST_F()
82   InputTree::const_iterator const_node2 = node;  in TEST_F()
84   ASSERT_FALSE(node.isRoot());  in TEST_F()
86   ASSERT_FALSE(isGroup(node));  in TEST_F()
95   InputTree::iterator node = m_pTestee->root();  in TEST_F()  local
98   m_pTestee->insert<InputTree::Inclusive>(node, *input);  in TEST_F()
99   InputTree::const_iterator const_node = node;  in TEST_F()
100   --node;  in TEST_F()
104     m_pTestee->insert<InputTree::Inclusive>(node, *input);  in TEST_F()
105     ++node;  in TEST_F()
108   m_pTestee->enterGroup(node, InputTree::Downward);  in TEST_F()
109   --node;  in TEST_F()
111   ASSERT_FALSE(node.isRoot());  in TEST_F()
112   ASSERT_TRUE(isGroup(node));  in TEST_F()
120   InputTree::iterator node = m_pTestee->root();  in TEST_F()  local
123     m_pTestee->enterGroup(node, InputTree::Downward);  in TEST_F()
124     --node;  in TEST_F()
127     m_pTestee->insert(node, InputTree::Afterward, *input);  in TEST_F()
128     ++node;  in TEST_F()
131   ASSERT_FALSE(node.isRoot());  in TEST_F()
132   ASSERT_FALSE(isGroup(node));  in TEST_F()
139   InputTree::iterator node = m_pTestee->root();  in TEST_F()  local
141   m_pTestee->insert<InputTree::Inclusive>(node, *input);  in TEST_F()
142   node.move<InputTree::Inclusive>();  in TEST_F()
145   m_pTestee->insert<InputTree::Positional>(node, *input);  in TEST_F()
146   m_pTestee->enterGroup<InputTree::Inclusive>(node);  in TEST_F()
147   node.move<InputTree::Inclusive>();  in TEST_F()
150   m_pTestee->insert<InputTree::Inclusive>(node, *input);  in TEST_F()
152   m_pTestee->insert<InputTree::Positional>(node, *input);  in TEST_F()