Home
last modified time | relevance | path

Searched refs:kNumPoints (Results 1 – 7 of 7) sorted by relevance

/external/skia/example/
DSkiaSDLExample.cpp88 static const int kNumPoints = 5; in create_star() local
90 SkPoint points[kNumPoints] = {{0, SkIntToScalar(-50)} }; in create_star()
92 rot.setRotate(SkIntToScalar(360) / kNumPoints); in create_star()
93 for (int i = 1; i < kNumPoints; ++i) { in create_star()
97 for (int i = 0; i < kNumPoints; ++i) { in create_star()
98 concavePath.lineTo(points[(2 * i) % kNumPoints]); in create_star()
/external/skqp/example/
DSkiaSDLExample.cpp88 static const int kNumPoints = 5; in create_star() local
90 SkPoint points[kNumPoints] = {{0, SkIntToScalar(-50)} }; in create_star()
92 rot.setRotate(SkIntToScalar(360) / kNumPoints); in create_star()
93 for (int i = 1; i < kNumPoints; ++i) { in create_star()
97 for (int i = 0; i < kNumPoints; ++i) { in create_star()
98 concavePath.lineTo(points[(2 * i) % kNumPoints]); in create_star()
/external/skia/bench/
DPathBench.cpp326 fPoints.reset(kNumPoints); in createData()
327 for (int i = 0; i < kNumPoints; ++i) { in createData()
346 path->moveTo(fPoints[(fCurrPoint++) & (kNumPoints - 1)]); in makePath()
349 path->lineTo(fPoints[(fCurrPoint++) & (kNumPoints - 1)]); in makePath()
352 path->quadTo(fPoints[(fCurrPoint + 0) & (kNumPoints - 1)], in makePath()
353 fPoints[(fCurrPoint + 1) & (kNumPoints - 1)]); in makePath()
357 path->conicTo(fPoints[(fCurrPoint + 0) & (kNumPoints - 1)], in makePath()
358 fPoints[(fCurrPoint + 1) & (kNumPoints - 1)], in makePath()
363 path->cubicTo(fPoints[(fCurrPoint + 0) & (kNumPoints - 1)], in makePath()
364 fPoints[(fCurrPoint + 1) & (kNumPoints - 1)], in makePath()
[all …]
/external/skqp/bench/
DPathBench.cpp324 fPoints.reset(kNumPoints); in createData()
325 for (int i = 0; i < kNumPoints; ++i) { in createData()
344 path->moveTo(fPoints[(fCurrPoint++) & (kNumPoints - 1)]); in makePath()
347 path->lineTo(fPoints[(fCurrPoint++) & (kNumPoints - 1)]); in makePath()
350 path->quadTo(fPoints[(fCurrPoint + 0) & (kNumPoints - 1)], in makePath()
351 fPoints[(fCurrPoint + 1) & (kNumPoints - 1)]); in makePath()
355 path->conicTo(fPoints[(fCurrPoint + 0) & (kNumPoints - 1)], in makePath()
356 fPoints[(fCurrPoint + 1) & (kNumPoints - 1)], in makePath()
361 path->cubicTo(fPoints[(fCurrPoint + 0) & (kNumPoints - 1)], in makePath()
362 fPoints[(fCurrPoint + 1) & (kNumPoints - 1)], in makePath()
[all …]
/external/skia/tests/
DMatrixTest.cpp794 static const int kNumPoints = 5; in check_decompScale() local
795 const SkPoint testPts[kNumPoints] = { in check_decompScale()
803 SkPoint v1[kNumPoints]; in check_decompScale()
804 original.mapPoints(v1, testPts, kNumPoints); in check_decompScale()
806 SkPoint v2[kNumPoints]; in check_decompScale()
811 scaleMat.mapPoints(v2, testPts, kNumPoints); in check_decompScale()
812 remaining.mapPoints(v2, kNumPoints); in check_decompScale()
814 for (int i = 0; i < kNumPoints; ++i) { in check_decompScale()
/external/skqp/tests/
DMatrixTest.cpp830 static const int kNumPoints = 5; in check_decompScale() local
831 const SkPoint testPts[kNumPoints] = { in check_decompScale()
839 SkPoint v1[kNumPoints]; in check_decompScale()
840 original.mapPoints(v1, testPts, kNumPoints); in check_decompScale()
842 SkPoint v2[kNumPoints]; in check_decompScale()
847 remaining.mapPoints(v2, testPts, kNumPoints); in check_decompScale()
848 scaleMat.mapPoints(v2, kNumPoints); in check_decompScale()
850 for (int i = 0; i < kNumPoints; ++i) { in check_decompScale()
/external/angle/third_party/abseil-cpp/absl/container/internal/
Draw_hash_set_benchmark.cc197 const size_t kNumPoints = 10; in CacheInSteadyStateArgs() local
198 for (size_t i = 0; i != kNumPoints; ++i) in CacheInSteadyStateArgs()
200 capacity * (max_load_factor + i * max_load_factor / kNumPoints) / 2)); in CacheInSteadyStateArgs()