Searched refs:m_Root (Results 1 – 5 of 5) sorted by relevance
299 TreeImpl m_Root;303 NodeType* result = m_Root.produce(); in createNode()304 result->left = result->right = &m_Root.node; in createNode()311 m_Root.deallocate(pNode); in destroyNode()315 BinaryTreeBase() : m_Root() {} in BinaryTreeBase()319 size_t size() const { return m_Root.size(); } in size()321 bool empty() const { return m_Root.empty(); } in empty()324 void clear() { m_Root.clear(); } in clear()371 return bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left); in bfs_begin()375 return bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right); in bfs_end()[all …]
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()[all …]
26 pMover.connect(pRoot, pTree.m_Root.node.right); in merge()27 BinaryTreeBase<Input>::m_Root.summon(pTree.BinaryTreeBase<Input>::m_Root); in merge()28 BinaryTreeBase<Input>::m_Root.delegate(pTree.m_Root); in merge()29 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node; in merge()
51 const InputTree::iterator& getCurrentNode() const { return m_Root; } in getCurrentNode()52 InputTree::iterator& getCurrentNode() { return m_Root; } in getCurrentNode()93 InputTree::iterator m_Root; variable110 m_pCurrentTree->insert(m_Root, *m_pMove, *input);111 m_pMove->move(m_Root);125 m_pCurrentTree->insert(m_Root, *m_pMove, *input);126 m_pMove->move(m_Root);
24 m_Root(), in InputBuilder()42 m_Root(), in InputBuilder()64 m_pCurrentTree->enterGroup(m_Root, *m_pMove); in enterGroup()65 m_pMove->move(m_Root); in enterGroup()66 m_ReturnStack.push(m_Root); in enterGroup()75 m_Root = m_ReturnStack.top(); in exitGroup()98 m_Root = m_pCurrentTree->root(); in setCurrentTree()