Lines Matching defs:reporter
40 void validate(skiatest::Reporter* reporter) const {
42 REPORTER_ASSERT(reporter, dependedOn->indexInSort() < this->indexInSort());
45 REPORTER_ASSERT(reporter, this->indexInSort() < dependent->indexInSort());
47 REPORTER_ASSERT(reporter, !fVisited); // this flag should only be true w/in depEdges()
87 Graph(int numNodesToReserve, skiatest::Reporter* reporter)
89 , fReporter(reporter) {
319 static void test_1(skiatest::Reporter* reporter) {
320 Graph g(10, reporter);
344 REPORTER_ASSERT(reporter, kExpectedInitialState == actualInitialState);
354 REPORTER_ASSERT(reporter, kExpectedFinalState == actualFinalState);
359 static void test_2(skiatest::Reporter* reporter) {
360 Graph g(10, reporter);
383 REPORTER_ASSERT(reporter, kExpectedInitialState == actualInitialState);
393 REPORTER_ASSERT(reporter, kExpectedFirstState == actualFirstState);
403 REPORTER_ASSERT(reporter, kExpectedSecondState == actualSecondState);
407 static void test_diamond(skiatest::Reporter* reporter) {
408 Graph g(4, reporter);
442 REPORTER_ASSERT(reporter, kExpected0 == actual || kExpected1 == actual);
445 static void test_lopsided_binary_tree(skiatest::Reporter* reporter) {
446 Graph g(7, reporter);
482 REPORTER_ASSERT(reporter, kExpected == actual);
485 DEF_TEST(IncrTopoSort, reporter) {
486 test_1(reporter);
487 test_2(reporter);
488 test_diamond(reporter);
489 test_lopsided_binary_tree(reporter);