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