Lines Matching refs:cur
149 for (int cur = 0; cur < fBisectors.count(); prev = cur, ++cur) {
150 fBisectors[cur] = fNorms[cur] + fNorms[prev];
151 if (!fBisectors[cur].normalize()) {
153 SkPointPriv::SetOrthog(&fBisectors[cur], fNorms[cur], (SkPointPriv::Side)-fSide);
156 fBisectors[cur] += other;
157 SkAssertResult(fBisectors[cur].normalize());
159 fBisectors[cur].negate(); // make the bisector face in
162 if (fCurveState[cur] == kSharp_CurveState) {
165 if (SkScalarAbs(fNorms[cur].dot(fNorms[prev])) > kCurveConnectionThreshold) {
167 fCurveState[cur] = kCurve_CurveState;
170 fCurveState[cur] = kSharp_CurveState;
175 SkASSERT(SkScalarNearlyEqual(1.0f, fBisectors[cur].length()));
433 for (int cur = 0; cur < fNorms.count(); ++cur) {
434 SkPointPriv::SetOrthog(&fNorms[cur], fNorms[cur], fSide);
435 SkASSERT(SkScalarNearlyEqual(1.0f, fNorms[cur].length()));
449 for (int cur = 0; cur < fNorms.count(); ++cur) {
450 SkPointPriv::SetOrthog(&fNorms[cur], fNorms[cur], fSide);
451 SkASSERT(SkScalarNearlyEqual(1.0f, fNorms[cur].length()));
491 for (int cur = ring.numPts() - 2; cur >= 0; --cur) {
492 this->addTri(startIdx, ring.index(cur), ring.index(cur + 1));
509 for (int cur = 0; cur < numPts; ++cur) {
510 int originalIdx = previousRing.index(cur);
523 SkPoint normal2 = previousRing.norm(cur);
552 SkPoint miter = previousRing.bisector(cur);
572 SkPoint miter = previousRing.bisector(cur);
609 if (0 == cur) {
623 prev = cur;
665 for (int cur = 0; cur < lastRing.numPts(); ++cur) {
666 int next = (cur + 1) % lastRing.numPts();
669 bool result = intersect(this->point(lastRing.index(cur)), lastRing.bisector(cur),
675 SkScalar dist = -t * lastRing.norm(cur).dot(lastRing.bisector(cur));
680 minEdgeIdx = cur;
717 for (int cur = 1; cur < lastRing.numPts()-1; ++cur) {
718 if (!this->computePtAlongBisector(lastRing.index(cur),
719 lastRing.bisector(cur),
720 lastRing.origEdgeID(cur),
726 dst[cur] = fCandidateVerts.addNewPt(newPt,
727 lastRing.index(cur), lastRing.origEdgeID(cur),
728 !this->movable(lastRing.index(cur)));
730 dst[cur] = fCandidateVerts.fuseWithPrior(lastRing.origEdgeID(cur));
735 int cur = lastRing.numPts()-1;
736 if (!this->computePtAlongBisector(lastRing.index(cur),
737 lastRing.bisector(cur),
738 lastRing.origEdgeID(cur),
747 dst[cur] = fCandidateVerts.addNewPt(newPt,
748 lastRing.index(cur), lastRing.origEdgeID(cur),
749 !this->movable(lastRing.index(cur)));
751 dst[cur] = fCandidateVerts.fuseWithPrior(lastRing.origEdgeID(cur));
753 dst[cur] = fCandidateVerts.fuseWithNext();
758 dst[cur] = fCandidateVerts.fuseWithPrior(lastRing.origEdgeID(cur));
761 dst[cur] = fused;
762 const int targetIdx = dst[cur - 1];
763 for (int i = cur - 1; i >= 0 && dst[i] == targetIdx; i--) {
837 for (int cur = 0; cur < fPts.count(); ++cur) {
838 int next = (cur + 1) % fPts.count();
840 fPts[cur].fNorm = tess.point(fPts[next].fIndex) - tess.point(fPts[cur].fIndex);
841 SkPoint::Normalize(&fPts[cur].fNorm);
842 SkPointPriv::SetOrthog(&fPts[cur].fNorm, fPts[cur].fNorm, tess.side());
848 for (int cur = 0; cur < fPts.count(); prev = cur, ++cur) {
849 fPts[cur].fBisector = fPts[cur].fNorm + fPts[prev].fNorm;
850 if (!fPts[cur].fBisector.normalize()) {
853 SkPointPriv::SetOrthog(&fPts[cur].fBisector, fPts[cur].fNorm,
857 fPts[cur].fBisector += other;
858 SkAssertResult(fPts[cur].fBisector.normalize());
860 fPts[cur].fBisector.negate(); // make the bisector face in
874 SkPoint cur = tess.point(fPts[1].fIndex) - tess.point(fPts[0].fIndex);
875 SkScalar minDot = prev.fX * cur.fY - prev.fY * cur.fX;
878 prev = cur;
882 cur = tess.point(fPts[next].fIndex) - tess.point(fPts[i].fIndex);
883 SkScalar dot = prev.fX * cur.fY - prev.fY * cur.fX;
888 prev = cur;
1035 for (int cur = 0; cur < fPts.count(); ++cur) {
1036 int next = (cur + 1) % fPts.count();
1039 tess.point(fPts[cur].fIndex),
1043 SkPoint mid = tess.point(fPts[cur].fIndex) + tess.point(fPts[next].fIndex);
1047 draw_arrow(canvas, mid, fPts[cur].fNorm, kArrowLength, SK_ColorRED);
1048 mid.fX += (kArrowLength/2) * fPts[cur].fNorm.fX;
1049 mid.fY += (kArrowLength/2) * fPts[cur].fNorm.fY;
1053 num.printf("%d", this->origEdgeID(cur));
1057 draw_arrow(canvas, tess.point(fPts[cur].fIndex), fPts[cur].fBisector,
