Lines Matching full:angle
18 // OPTIMIZATION: Probably, the walked winding should be rolled into the angle structure
27 SkTDArray<Angle> angles;
30 Angle* last = angles.end() - 1;
43 SkTDArray<Angle*> sorted;
52 // find first angle, initialize winding to computed fWindSum
54 const Angle* angle;
56 angle = sorted[++firstIndex];
57 segment = angle->segment();
58 } while (segment->windSum(angle) == SK_MinS32);
62 int sumMiWinding = segment->updateWindingReverse(angle);
63 int sumSuWinding = segment->updateOppWindingReverse(angle);
75 angle = sorted[nextIndex];
76 segment = angle->segment();
77 int start = angle->start();
78 int end = angle->end();
82 if (!segment->done(angle)) {
89 oppSumWinding, true, angle);
