Lines Matching refs:mergeTree
52 BinaryTree<int>* mergeTree = new BinaryTree<int>;
53 BinaryTree<int>::iterator pos2 = mergeTree->root();
54 mergeTree->join<TreeIteratorBase::Rightward>(pos2, 1);
56 mergeTree->join<TreeIteratorBase::Rightward>(pos2, 1);
57 mergeTree->join<TreeIteratorBase::Leftward>(pos2, 1);
59 m_pTestee->merge<TreeIteratorBase::Rightward>(pos, *mergeTree);
60 delete mergeTree;
68 BinaryTree<int>* mergeTree = new BinaryTree<int>;
69 mergeTree->join<TreeIteratorBase::Rightward>(pos, 0);
71 mergeTree->join<TreeIteratorBase::Rightward>(pos, 1);
72 mergeTree->join<TreeIteratorBase::Leftward>(pos, 1);
74 mergeTree->join<TreeIteratorBase::Rightward>(pos, 2);
75 mergeTree->join<TreeIteratorBase::Leftward>(pos, 2);
77 m_pTestee->merge<TreeIteratorBase::Rightward>(pos, *mergeTree);
79 delete mergeTree;
93 BinaryTree<int>* mergeTree = new BinaryTree<int>;
94 BinaryTree<int>::iterator pos2 = mergeTree->root();
95 mergeTree->merge<TreeIteratorBase::Rightward>(pos2, *m_pTestee);
98 EXPECT_TRUE(mergeTree->size() == 5);
99 delete mergeTree;
105 BinaryTree<int>* mergeTree = new BinaryTree<int>;
106 BinaryTree<int>::iterator pos2 = mergeTree->root();
108 mergeTree->merge<TreeIteratorBase::Rightward>(pos2, *m_pTestee);
111 EXPECT_TRUE(mergeTree->size() == 0);
112 delete mergeTree;
