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;
28 class BinaryTree; variable180 class BinaryTree; variable363 class BinaryTree : public BinaryTreeBase<DataType>374 typedef BinaryTree<DataType> Self;388 BinaryTree() in BinaryTree() function392 ~BinaryTree() { in ~BinaryTree()445 BinaryTree& join(Pos position, const DataType& value) { in join()463 BinaryTree& merge(Pos position, BinaryTree& pTree) { in merge()
78 class InputTree : public BinaryTree<Input>81 typedef BinaryTree<Input> BinTreeTy;89 typedef BinaryTree<Input>::iterator iterator;90 typedef BinaryTree<Input>::const_iterator const_iterator;
50 BinaryTree<Input>::node_type* node = createNode(); in insert()68 BinaryTree<Input>::node_type* node = createNode(); in insert()