Lines Matching refs:node

54     // skip the Group node
63 // skip the Group node
106 bfs_iterator it = bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
113 { return bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
118 const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
125 { return const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
129 dfs_iterator it = dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
136 { return dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
141 const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
148 { return const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
151 { return iterator(&(BinaryTreeBase<Input>::m_Root.node)); }
158 const_cast<NodeBase*>(&BinaryTreeBase<Input>::m_Root.node));
163 iterator it = iterator(BinaryTreeBase<Input>::m_Root.node.left);
168 { return iterator(BinaryTreeBase<Input>::m_Root.node.right); }
172 const_iterator it = const_iterator(BinaryTreeBase<Input>::m_Root.node.left);
177 { return const_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
180 /// join - create a leaf node and merge it in the tree.
182 // @param DIRECT the direction of the connecting edge of the parent node.
183 // @param position the parent node
187 node_type *node = BinaryTreeBase<Input>::createNode();
188 node->data = const_cast<Input*>(&value);
191 const_cast<const node_type*>(node));
194 const_cast<const node_type*>(node));
199 // @param DIRECT the direction of the connecting edge of the parent node.
200 // @param position the parent node
210 const_cast<const NodeBase*>(pTree.m_Root.node.left));
214 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node;
327 BinTreeTy::node_type* node = createNode();
330 const_cast<const node_type*>(node));
333 const_cast<const node_type*>(node));
341 BinTreeTy::node_type* node = createNode();
342 node->data = &pInput;
345 const_cast<const node_type*>(node));
348 const_cast<const node_type*>(node));