Lines Matching refs:tree
18 Tree tree;
26 Tree::Iter xi = tree.insert(x);
31 tree.insert(0);
33 tree.insert(99);
35 REPORTER_ASSERT(reporter, *tree.begin() == 0);
36 REPORTER_ASSERT(reporter, *tree.last() == 99);
37 REPORTER_ASSERT(reporter, --(++tree.begin()) == tree.begin());
38 REPORTER_ASSERT(reporter, --tree.end() == tree.last());
39 REPORTER_ASSERT(reporter, tree.count() == 10002);
44 for (Tree::Iter a = tree.begin(); tree.end() != a; ++a) {
48 REPORTER_ASSERT(reporter, b == tree.end() || *a <= *b);
50 REPORTER_ASSERT(reporter, c == tree.count());
52 // check that the tree reports the correct number of each int
57 c = tree.countOf(i);
60 Tree::Iter iter = tree.findFirst(i);
61 while (iter != tree.end() && *iter == i) {
67 iter = tree.findLast(i);
68 if (iter != tree.end()) {
75 if (iter != tree.begin()) {
87 while (0 != tree.countOf(i)) {
93 iter = tree.findFirst(i);
96 iter = tree.findLast(i);
100 iter = tree.find(i);
103 tree.remove(iter);
106 REPORTER_ASSERT(reporter, tree.findFirst(i) == tree.end());
107 REPORTER_ASSERT(reporter, tree.findLast(i) == tree.end());
108 REPORTER_ASSERT(reporter, tree.find(i) == tree.end());
111 REPORTER_ASSERT(reporter, *tree.begin() == 0);
112 REPORTER_ASSERT(reporter, *(--tree.end()) == 99);
113 while (0 != tree.countOf(0)) {
115 tree.remove(tree.find(0));
118 REPORTER_ASSERT(reporter, tree.findFirst(0) == tree.end());
119 REPORTER_ASSERT(reporter, tree.findLast(0) == tree.end());
120 REPORTER_ASSERT(reporter, tree.find(0) == tree.end());
121 REPORTER_ASSERT(reporter, 0 < *tree.begin());
124 while (0 != tree.countOf(99)) {
126 tree.remove(tree.find(99));
129 REPORTER_ASSERT(reporter, tree.findFirst(99) == tree.end());
130 REPORTER_ASSERT(reporter, tree.findLast(99) == tree.end());
131 REPORTER_ASSERT(reporter, tree.find(99) == tree.end());
132 REPORTER_ASSERT(reporter, 99 > *(--tree.end()));
133 REPORTER_ASSERT(reporter, tree.last() == --tree.end());
138 for (Tree::Iter a = tree.begin(); tree.end() != a; ++a) {
142 REPORTER_ASSERT(reporter, b == tree.end() || *a <= *b);
144 REPORTER_ASSERT(reporter, c == tree.count());
146 // repeat check that correct number of each entry is in the tree
149 REPORTER_ASSERT(reporter, tree.countOf(i) == count[i]);
151 Tree::Iter iter = tree.findFirst(i);
152 while (iter != tree.end() && *iter == i) {
158 iter = tree.findLast(i);
159 if (iter != tree.end()) {
166 if (iter != tree.begin()) {
177 while (!tree.empty()) {
178 tree.remove(tree.begin());
181 // test reset on empty tree.
182 tree.reset();