Lines Matching full:reporter
17 DEF_TEST(GrRedBlackTreeTest, reporter) {
27 REPORTER_ASSERT(reporter, *xi == x);
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);
48 REPORTER_ASSERT(reporter, b == tree.end() || *a <= *b);
50 REPORTER_ASSERT(reporter, c == tree.count());
58 REPORTER_ASSERT(reporter, c == count[i]);
65 REPORTER_ASSERT(reporter, count[i] == c);
82 REPORTER_ASSERT(reporter, c == count[i]);
105 REPORTER_ASSERT(reporter, 0 == count[i]);
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);
117 REPORTER_ASSERT(reporter, 0 == count[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());
128 REPORTER_ASSERT(reporter, 0 == count[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());
142 REPORTER_ASSERT(reporter, b == tree.end() || *a <= *b);
144 REPORTER_ASSERT(reporter, c == tree.count());
149 REPORTER_ASSERT(reporter, tree.countOf(i) == count[i]);
156 REPORTER_ASSERT(reporter, count[i] == c);
173 REPORTER_ASSERT(reporter, count[i] == c);
