Home
last modified time | relevance | path

Searched refs:kNumSteps (Results 1 – 3 of 3) sorted by relevance

/third_party/skia/tests/
DRoundRectTest.cpp439 static const int kNumSteps = 15; in test_round_rect_contains_rect() local
440 bool answers[kNumRRects][8][kNumSteps] = { in test_round_rect_contains_rect()
505 test_direction(reporter, rrects[i], 0, 1, 0, 1, kNumSteps, answers[i][0]); // NW in test_round_rect_contains_rect()
506 test_direction(reporter, rrects[i], 19.5f, 0, 0, 1, kNumSteps, answers[i][1]); // N in test_round_rect_contains_rect()
507 test_direction(reporter, rrects[i], 40, -1, 0, 1, kNumSteps, answers[i][2]); // NE in test_round_rect_contains_rect()
508 test_direction(reporter, rrects[i], 40, -1, 19.5f, 0, kNumSteps, answers[i][3]); // E in test_round_rect_contains_rect()
509 test_direction(reporter, rrects[i], 40, -1, 40, -1, kNumSteps, answers[i][4]); // SE in test_round_rect_contains_rect()
510 test_direction(reporter, rrects[i], 19.5f, 0, 40, -1, kNumSteps, answers[i][5]); // S in test_round_rect_contains_rect()
511 test_direction(reporter, rrects[i], 0, 1, 40, -1, kNumSteps, answers[i][6]); // SW in test_round_rect_contains_rect()
512 test_direction(reporter, rrects[i], 0, 1, 19.5f, 0, kNumSteps, answers[i][7]); // W in test_round_rect_contains_rect()
/third_party/skia/third_party/externals/angle2/src/tests/gl_tests/
DClearTest.cpp602 constexpr int kNumSteps = 13; in TEST_P() local
603 for (int ndx = 1; ndx < kNumSteps; ndx++) in TEST_P()
605 float perc = static_cast<float>(ndx) / static_cast<float>(kNumSteps); in TEST_P()
629 constexpr int kNumSteps = 13; in TEST_P() local
630 for (int ndx = 1; ndx < kNumSteps; ndx++) in TEST_P()
632 float perc = static_cast<float>(ndx) / static_cast<float>(kNumSteps); in TEST_P()
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/str_format/
Dfloat_conversion.cc58 static constexpr size_t kNumSteps = 5; member in absl::str_format_internal::__anonff8546680111::StackArray
70 static constexpr size_t kMaxCapacity = kStep * kNumSteps;
75 assert(step <= kNumSteps); in RunWithCapacity()