Searched refs:BinaryTree (Results 1 - 5 of 5) sorted by relevance

/frameworks/compile/mclinker/unittests/
H A DBinTreeTest.cpp23 m_pTestee = new BinaryTree<int>();
50 BinaryTree<int>::iterator pos = m_pTestee->root();
59 BinaryTree<int> *mergeTree = new BinaryTree<int>;
60 BinaryTree<int>::iterator pos2 = mergeTree->root();
74 BinaryTree<int>::iterator pos = m_pTestee->root();
76 BinaryTree<int> *mergeTree = new BinaryTree<int>;
93 BinaryTree<int>::iterator pos = m_pTestee->root();
102 BinaryTree<in
[all...]
H A DBinTreeTest.h46 mcld::BinaryTree<int>* m_pTestee;
/frameworks/compile/mclinker/include/mcld/ADT/
H A DBinTree.h28 class BinaryTree;
177 class BinaryTree;
263 * @see BinaryTree
354 /** \class BinaryTree
360 class BinaryTree : public BinaryTreeBase<DataType> class in namespace:mcld
371 typedef BinaryTree<DataType> Self;
385 BinaryTree() function in class:mcld::BinaryTree
389 ~BinaryTree() {
442 BinaryTree& join(Pos position, const DataType& value) {
460 BinaryTree
[all...]
/frameworks/compile/mclinker/lib/MC/
H A DInputTree.cpp50 BinaryTree<Input>::node_type* node = createNode();
68 BinaryTree<Input>::node_type* node = createNode();
/frameworks/compile/mclinker/include/mcld/MC/
H A DInputTree.h78 class InputTree : public BinaryTree<Input>
81 typedef BinaryTree<Input> BinTreeTy;
89 typedef BinaryTree<Input>::iterator iterator;
90 typedef BinaryTree<Input>::const_iterator const_iterator;

Completed in 74 milliseconds