Searched refs:BinaryTree (Results 1 – 5 of 5) sorted by relevance
23 m_pTestee = new BinaryTree<int>(); in BinTreeTest()50 BinaryTree<int>::iterator pos = m_pTestee->root(); in TEST_F()59 BinaryTree<int> *mergeTree = new BinaryTree<int>; in TEST_F()60 BinaryTree<int>::iterator pos2 = mergeTree->root(); in TEST_F()74 BinaryTree<int>::iterator pos = m_pTestee->root(); in TEST_F()76 BinaryTree<int> *mergeTree = new BinaryTree<int>; in TEST_F()93 BinaryTree<int>::iterator pos = m_pTestee->root(); in TEST_F()102 BinaryTree<int> *mergeTree = new BinaryTree<int>; in TEST_F()103 BinaryTree<int>::iterator pos2 = mergeTree->root(); in TEST_F()113 BinaryTree<int>::iterator pos = m_pTestee->root(); in TEST_F()[all …]
46 mcld::BinaryTree<int>* m_pTestee;
68 class BinaryTree<Input> : public BinaryTreeBase<Input>79 typedef BinaryTree<Input> Self;93 BinaryTree() in BinaryTree() function97 ~BinaryTree() { in ~BinaryTree()183 BinaryTree& join(TreeIteratorBase& pPosition, const Input& value) { in join()201 BinaryTree& merge(TreeIteratorBase& pPosition, BinaryTree& pTree) { in merge()224 class InputTree : public BinaryTree<Input>227 typedef BinaryTree<Input> BinTreeTy;235 typedef BinaryTree<Input>::iterator iterator;236 typedef BinaryTree<Input>::const_iterator const_iterator;
25 class BinaryTree; variable174 class BinaryTree; variable357 class BinaryTree : public BinaryTreeBase<DataType>368 typedef BinaryTree<DataType> Self;382 BinaryTree() in BinaryTree() function386 ~BinaryTree() { in ~BinaryTree()439 BinaryTree& join(TreeIteratorBase& pPosition, const DataType& pValue) { in join()457 BinaryTree& merge(TreeIteratorBase& pPosition, BinaryTree& pTree) { in merge()
48 BinaryTree<Input>::node_type* node = createNode(); in insert()