Cross Reference: /frameworks/compile/mclinker/include/mcld/InputTree.h

Lines Matching refs:node
49     // skip the Group node
58     // skip the Group node
100     bfs_iterator it = bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
107     return bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right);
112         const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
119     return const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right);
123     dfs_iterator it = dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
130     return dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right);
135         const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
142     return const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right);
145   iterator root() { return iterator(&(BinaryTreeBase<Input>::m_Root.node)); }
151         const_cast<NodeBase*>(&BinaryTreeBase<Input>::m_Root.node));
155     iterator it = iterator(BinaryTreeBase<Input>::m_Root.node.left);
159   iterator end() { return iterator(BinaryTreeBase<Input>::m_Root.node.right); }
162     return const_iterator(BinaryTreeBase<Input>::m_Root.node.left);
166     return const_iterator(BinaryTreeBase<Input>::m_Root.node.right);
170   /// join - create a leaf node and merge it in the tree.
172   //  @param DIRECT the direction of the connecting edge of the parent node.
173   //  @param position the parent node
177     node_type* node = BinaryTreeBase<Input>::createNode();
178     node->data = const_cast<Input*>(&value);
181       pPosition.hook<TreeIteratorBase::Leftward>(node);
183       pPosition.hook<DIRECT>(node);
189   //  @param DIRECT the direction of the connecting edge of the parent node.
190   //  @param position the parent node
199       pPosition.hook<DIRECT>(pTree.m_Root.node.left);
202       pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node;
302   BinTreeTy::node_type* node = createNode();
305     pRoot.hook<TreeIteratorBase::Leftward>(node);
307     pRoot.hook<DIRECT>(node);
315   BinTreeTy::node_type* node = createNode();
316   node->data = &pInput;
319     pRoot.hook<TreeIteratorBase::Leftward>(node);
321     pRoot.hook<DIRECT>(node);