Searched refs:BinaryTree (Results 1 – 8 of 8) sorted by relevance
21 m_pTestee = new BinaryTree<int>(); in BinTreeTest()43 BinaryTree<int>::iterator pos = m_pTestee->root(); in TEST_F()52 BinaryTree<int>* mergeTree = new BinaryTree<int>; in TEST_F()53 BinaryTree<int>::iterator pos2 = mergeTree->root(); in TEST_F()66 BinaryTree<int>::iterator pos = m_pTestee->root(); in TEST_F()68 BinaryTree<int>* mergeTree = new BinaryTree<int>; in TEST_F()84 BinaryTree<int>::iterator pos = m_pTestee->root(); in TEST_F()93 BinaryTree<int>* mergeTree = new BinaryTree<int>; in TEST_F()94 BinaryTree<int>::iterator pos2 = mergeTree->root(); in TEST_F()103 BinaryTree<int>::iterator pos = m_pTestee->root(); in TEST_F()[all …]
44 mcld::BinaryTree<int>* m_pTestee;
34 import com.sun.source.tree.BinaryTree;69 private static final Matcher<BinaryTree> INVALID_OLD_BEHAVIOR = anyOf(73 private static final Matcher<BinaryTree> INVALID_NEW_BEHAVIOR = anyOf(78 public Description matchBinary(BinaryTree tree, VisitorState state) { in matchBinary()94 static Matcher<BinaryTree> binaryTreeExact(Matcher<ExpressionTree> left, in binaryTreeExact()96 return new Matcher<BinaryTree>() { in binaryTreeExact()98 public boolean matches(BinaryTree tree, VisitorState state) { in binaryTreeExact()
37 import com.sun.source.tree.BinaryTree;109 private static final Matcher<BinaryTree> INVALID = anyOf(116 public Description matchBinary(BinaryTree tree, VisitorState state) { in matchBinary()
43 import com.sun.source.tree.BinaryTree;98 contains(BinaryTree.class, kindIs(Kind.PLUS)));
66 class BinaryTree<Input> : public BinaryTreeBase<Input> {76 typedef BinaryTree<Input> Self;94 BinaryTree() : BinaryTreeBase<Input>() {} in BinaryTree() function96 ~BinaryTree() {} in ~BinaryTree()176 BinaryTree& join(TreeIteratorBase& pPosition, const Input& value) { in join()194 BinaryTree& merge(TreeIteratorBase& pPosition, BinaryTree& pTree) { in merge()216 class InputTree : public BinaryTree<Input> {218 typedef BinaryTree<Input> BinTreeTy;226 typedef BinaryTree<Input>::iterator iterator;227 typedef BinaryTree<Input>::const_iterator const_iterator;
25 class BinaryTree; variable168 class BinaryTree; variable336 class BinaryTree : public BinaryTreeBase<DataType> {346 typedef BinaryTree<DataType> Self;365 BinaryTree() : BinaryTreeBase<DataType>() {} in BinaryTree() function367 ~BinaryTree() {} in ~BinaryTree()431 BinaryTree& join(TreeIteratorBase& pPosition, const DataType& pValue) { in join()449 BinaryTree& merge(TreeIteratorBase& pPosition, BinaryTree& pTree) { in merge()
44 BinaryTree<Input>::node_type* node = createNode(); in insert()