Lines Matching refs:next
808 this->lineTo(iter.next());
809 this->lineTo(iter.next());
810 this->lineTo(iter.next());
972 this->conicTo(rectIter.next(), rrectIter.next(), weight);
973 this->lineTo(rrectIter.next());
975 this->conicTo(rectIter.next(), rrectIter.next(), weight);
979 this->lineTo(rrectIter.next());
980 this->conicTo(rectIter.next(), rrectIter.next(), weight);
1073 this->conicTo(rectIter.next(), ovalIter.next(), weight);
1596 while ((verb = iter.next(pts)) != kDone_Verb) {
1683 // need to init enough to make next() harmlessly return kDone_Verb
1757 SkPath::Verb SkPath::Iter::next(SkPoint ptsParam[4]) {
1837 SkPath::Verb SkPath::RawIter::next(SkPoint pts[4]) {
1915 while ((verb = iter.next(pts)) != kDone_Verb) {
1965 while ((verb = iter.next(points)) != kDone_Verb) {
2248 SkVector fFirstVec {0, 0}; // The direction leaving fFirstPt to the next vertex
2373 void next();
2393 this->next();
2396 void ContourIter::next() {
2550 for (; !iter.done(); iter.next()) {
2579 // Find a next and prev index to use for the cross-product test,
2590 // completely degenerate, skip to next contour
2593 int next = find_diff_pt(pts, index, n, 1);
2594 SkASSERT(next != index);
2595 cross = cross_prod(pts[prev], pts[index], pts[next]);
2599 if (0 == cross && pts[prev].fY == pts[index].fY && pts[next].fY == pts[index].fY) {
2601 cross = pts[index].fX - pts[next].fX;
3038 switch (iter.next(pts)) {
3081 switch (iter.next(pts)) {
3787 while ((verb = clipper->next(pts)) != SkPath::kDone_Verb) {