Lines Matching refs:cur
175 for (int cur = 1; cur < fNorms.count() - 1; ++cur) {
176 fNorms[cur] = normalToVector(fPts[cur + 1] - fPts[cur]);
185 for (int cur = 0; cur < fBisectors.count(); prev = cur, ++cur) {
186 fBisectors[cur] = fNorms[cur] + fNorms[prev];
187 if (!fBisectors[cur].normalize()) {
188 fBisectors[cur] = SkPointPriv::MakeOrthog(fNorms[cur], (SkPointPriv::Side)-fSide) +
190 SkAssertResult(fBisectors[cur].normalize());
192 fBisectors[cur].negate(); // make the bisector face in
195 if (fCurveState[cur] == kSharp_CurveState) {
198 if (SkScalarAbs(fNorms[cur].dot(fNorms[prev])) > kCurveConnectionThreshold) {
200 fCurveState[cur] = kCurve_CurveState;
203 fCurveState[cur] = kSharp_CurveState;
208 SkASSERT(SkScalarNearlyEqual(1.0f, fBisectors[cur].length()));
511 for (int cur = ring.numPts() - 2; cur >= 0; --cur) {
512 this->addTri(startIdx, ring.index(cur), ring.index(cur + 1));
529 for (int cur = 0; cur < numPts; ++cur) {
530 int originalIdx = previousRing.index(cur);
543 SkPoint normal2 = previousRing.norm(cur);
572 SkPoint miter = previousRing.bisector(cur);
592 SkPoint miter = previousRing.bisector(cur);
635 if (0 == cur) {
649 prev = cur;
691 for (int cur = 0; cur < lastRing.numPts(); ++cur) {
692 int next = (cur + 1) % lastRing.numPts();
695 bool result = intersect(this->point(lastRing.index(cur)), lastRing.bisector(cur),
703 SkScalar dist = -t * lastRing.norm(cur).dot(lastRing.bisector(cur));
708 minEdgeIdx = cur;
745 for (int cur = 1; cur < lastRing.numPts()-1; ++cur) {
746 if (!this->computePtAlongBisector(lastRing.index(cur),
747 lastRing.bisector(cur),
748 lastRing.origEdgeID(cur),
754 dst[cur] = fCandidateVerts.addNewPt(newPt,
755 lastRing.index(cur), lastRing.origEdgeID(cur),
756 !this->movable(lastRing.index(cur)));
758 dst[cur] = fCandidateVerts.fuseWithPrior(lastRing.origEdgeID(cur));
763 int cur = lastRing.numPts()-1;
764 if (!this->computePtAlongBisector(lastRing.index(cur),
765 lastRing.bisector(cur),
766 lastRing.origEdgeID(cur),
775 dst[cur] = fCandidateVerts.addNewPt(newPt,
776 lastRing.index(cur), lastRing.origEdgeID(cur),
777 !this->movable(lastRing.index(cur)));
779 dst[cur] = fCandidateVerts.fuseWithPrior(lastRing.origEdgeID(cur));
781 dst[cur] = fCandidateVerts.fuseWithNext();
786 dst[cur] = fCandidateVerts.fuseWithPrior(lastRing.origEdgeID(cur));
789 dst[cur] = fused;
790 const int targetIdx = dst[cur - 1];
791 for (int i = cur - 1; i >= 0 && dst[i] == targetIdx; i--) {
865 for (int cur = 0; cur < fPts.count(); ++cur) {
866 int next = (cur + 1) % fPts.count();
868 fPts[cur].fNorm = tess.point(fPts[next].fIndex) - tess.point(fPts[cur].fIndex);
869 SkPoint::Normalize(&fPts[cur].fNorm);
870 fPts[cur].fNorm = SkPointPriv::MakeOrthog(fPts[cur].fNorm, tess.side());
876 for (int cur = 0; cur < fPts.count(); prev = cur, ++cur) {
877 fPts[cur].fBisector = fPts[cur].fNorm + fPts[prev].fNorm;
878 if (!fPts[cur].fBisector.normalize()) {
879 fPts[cur].fBisector =
880 SkPointPriv::MakeOrthog(fPts[cur].fNorm, (SkPointPriv::Side)-tess.side()) +
882 SkAssertResult(fPts[cur].fBisector.normalize());
884 fPts[cur].fBisector.negate(); // make the bisector face in
898 SkPoint cur = tess.point(fPts[1].fIndex) - tess.point(fPts[0].fIndex);
899 SkScalar minDot = prev.fX * cur.fY - prev.fY * cur.fX;
902 prev = cur;
906 cur = tess.point(fPts[next].fIndex) - tess.point(fPts[i].fIndex);
907 SkScalar dot = prev.fX * cur.fY - prev.fY * cur.fX;
912 prev = cur;
1057 for (int cur = 0; cur < fPts.count(); ++cur) {
1058 int next = (cur + 1) % fPts.count();
1061 tess.point(fPts[cur].fIndex),
1065 SkPoint mid = tess.point(fPts[cur].fIndex) + tess.point(fPts[next].fIndex);
1069 draw_arrow(canvas, mid, fPts[cur].fNorm, kArrowLength, SK_ColorRED);
1070 mid.fX += (kArrowLength/2) * fPts[cur].fNorm.fX;
1071 mid.fY += (kArrowLength/2) * fPts[cur].fNorm.fY;
1075 num.printf("%d", this->origEdgeID(cur));
1079 draw_arrow(canvas, tess.point(fPts[cur].fIndex), fPts[cur].fBisector,