Lines Matching defs:node
51 // skip the Group node
60 // skip the Group node
89 typedef Node<value_type> node_type;
103 bfs_iterator it = bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
110 { return bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
115 const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
122 { return const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
126 dfs_iterator it = dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
133 { return dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
138 const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
145 { return const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
148 { return iterator(&(BinaryTreeBase<Input>::m_Root.node)); }
155 const_cast<NodeBase*>(&BinaryTreeBase<Input>::m_Root.node));
160 iterator it = iterator(BinaryTreeBase<Input>::m_Root.node.left);
165 { return iterator(BinaryTreeBase<Input>::m_Root.node.right); }
169 const_iterator it = const_iterator(BinaryTreeBase<Input>::m_Root.node.left);
174 { return const_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
177 /// join - create a leaf node and merge it in the tree.
179 // @param DIRECT the direction of the connecting edge of the parent node.
180 // @param position the parent node
184 node_type *node = BinaryTreeBase<Input>::createNode();
185 node->data = const_cast<Input*>(&value);
188 pPosition.hook<TreeIteratorBase::Leftward>(node);
190 pPosition.hook<DIRECT>(node);
196 // @param DIRECT the direction of the connecting edge of the parent node.
197 // @param position the parent node
206 pPosition.hook<DIRECT>(pTree.m_Root.node.left);
210 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node;
323 BinTreeTy::node_type* node = createNode();
326 pRoot.hook<TreeIteratorBase::Leftward>(node);
328 pRoot.hook<DIRECT>(node);
337 BinTreeTy::node_type* node = createNode();
338 node->data = &pInput;
341 pRoot.hook<TreeIteratorBase::Leftward>(node);
343 pRoot.hook<DIRECT>(node);
