Lines Matching refs:poly
22 virtual void makePoly(SkTDArray<SkPoint>* poly) = 0;
50 SkTDArray<SkPoint> poly;
51 this->makePoly(&poly);
55 (void)SkIsConvexPolygon(poly.begin(), poly.count());
60 (void)SkIsSimplePolygon(poly.begin(), poly.count());
64 if (SkIsConvexPolygon(poly.begin(), poly.count())) {
67 (void)SkInsetConvexPolygon(poly.begin(), poly.count(), 10, &result);
68 (void)SkInsetConvexPolygon(poly.begin(), poly.count(), 40, &result);
73 if (SkIsSimplePolygon(poly.begin(), poly.count())) {
76 bounds.setBounds(poly.begin(), poly.count());
78 (void)SkOffsetSimplePolygon(poly.begin(), poly.count(), bounds, 10,
80 (void)SkOffsetSimplePolygon(poly.begin(), poly.count(), bounds, -10,
86 if (SkIsSimplePolygon(poly.begin(), poly.count())) {
87 SkAutoSTMalloc<64, uint16_t> indexMap(poly.count());
88 for (int i = 0; i < poly.count(); ++i) {
93 SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(),
115 void makePoly(SkTDArray<SkPoint>* poly) override {
124 *poly->push() = SkPoint::Make(c + SkScalarCos(rad) * r1, c + SkScalarSin(rad) * r1);
126 *poly->push() = SkPoint::Make(c + SkScalarCos(rad) * r2, c + SkScalarSin(rad) * r2);
141 void makePoly(SkTDArray<SkPoint>* poly) override {
149 *poly->push() = SkPoint::Make(c + SkScalarCos(rad) * r, c + SkScalarSin(rad) * r);
164 void makePoly(SkTDArray<SkPoint>* poly) override {
172 *poly->push() = SkPoint::Make(c, c - r);
175 *poly->push() = SkPoint::Make(c + SkScalarCos(rad) * r, c + SkScalarSin(rad) * r);
190 void makePoly(SkTDArray<SkPoint>* poly) override {
198 *poly->push() = SkPoint::Make(c + SkScalarCos(rad) * r, c + SkScalarSin(rad) * r);
202 *poly->push() = SkPoint::Make(45, 45);
215 void makePoly(SkTDArray<SkPoint>* poly) override {
223 *poly->push() = SkPoint::Make(c + SkScalarCos(rad) * r, c + SkScalarSin(rad) * r);
227 *poly->push() = SkPoint::Make(90, 0);