Cross Reference: /frameworks/compile/mclinker/include/mcld/ADT/BinTree.h

Lines Matching refs:node
244  *  \brief BinaryTreeBase gives root node and memory management.
248  *  inserton of a node.
258   /// TreeImpl - TreeImpl records the root node and the number of nodes
272     NodeBase node;
275     TreeImpl() : NodeFactory<DataType>() { node.left = node.right = &node; }
287         if ((*data).left == &pClient.node)
288           (*data).left = &node;
289         if ((*data).right == &pClient.node)
290           (*data).right = &node;
304     result->left = result->right = &m_Root.node;
371     return bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left);
375     return bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right);
379     return const_bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left);
383     return const_bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right);
387     return dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left);
391     return dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right);
395     return const_dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left);
399     return const_dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right);
402   iterator root() { return iterator(&(BinaryTreeBase<DataType>::m_Root.node)); }
405     return const_iterator(&(BinaryTreeBase<DataType>::m_Root.node));
409     return iterator(BinaryTreeBase<DataType>::m_Root.node.left);
413     return iterator(BinaryTreeBase<DataType>::m_Root.node.right);
417     return const_iterator(BinaryTreeBase<DataType>::m_Root.node.left);
421     return const_iterator(BinaryTreeBase<DataType>::m_Root.node.right);
425   /// join - create a leaf node and merge it in the tree.
427   //  @param DIRECT the direction of the connecting edge of the parent node.
428   //  @param position the parent node
432     node_type* node = BinaryTreeBase<DataType>::createNode();
433     node->data = const_cast<DataType*>(&pValue);
436       pPosition.hook<TreeIteratorBase::Leftward>(node);
438       pPosition.hook<DIRECT>(node);
444   //  @param DIRECT the direction of the connecting edge of the parent node.
445   //  @param position the parent node
454       pPosition.hook<DIRECT>(pTree.m_Root.node.left);
458       pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node;