Lines Matching refs:node

100     bfs_iterator it = bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);  in bfs_begin()
107 return bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); in bfs_end()
112 const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left); in bfs_begin()
119 return const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); in bfs_end()
123 dfs_iterator it = dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left); in dfs_begin()
130 return dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); in dfs_end()
135 const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left); in dfs_begin()
142 return const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); in dfs_end()
145 iterator root() { return iterator(&(BinaryTreeBase<Input>::m_Root.node)); } in root()
151 const_cast<NodeBase*>(&BinaryTreeBase<Input>::m_Root.node)); in root()
155 iterator it = iterator(BinaryTreeBase<Input>::m_Root.node.left); in begin()
159 iterator end() { return iterator(BinaryTreeBase<Input>::m_Root.node.right); } in end()
162 return const_iterator(BinaryTreeBase<Input>::m_Root.node.left); in begin()
166 return const_iterator(BinaryTreeBase<Input>::m_Root.node.right); in end()
177 node_type* node = BinaryTreeBase<Input>::createNode(); in join() local
178 node->data = const_cast<Input*>(&value); in join()
181 pPosition.hook<TreeIteratorBase::Leftward>(node); in join()
183 pPosition.hook<DIRECT>(node); in join()
199 pPosition.hook<DIRECT>(pTree.m_Root.node.left); in merge()
202 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node; in merge()
302 BinTreeTy::node_type* node = createNode(); in enterGroup() local
305 pRoot.hook<TreeIteratorBase::Leftward>(node); in enterGroup()
307 pRoot.hook<DIRECT>(node); in enterGroup()
315 BinTreeTy::node_type* node = createNode(); in insert() local
316 node->data = &pInput; in insert()
319 pRoot.hook<TreeIteratorBase::Leftward>(node); in insert()
321 pRoot.hook<DIRECT>(node); in insert()