Lines Matching refs:fNorms
148 fNorms.rewind();
169 fNorms.append(fPts.count());
170 fNorms[0] = fPts[1] - fPts[0];
171 fNorms.top() = fPts[0] - fPts.top();
172 SkScalar cross = SkPoint::CrossProduct(fNorms[0], fNorms.top());
174 fNorms[0] = normalToVector(fNorms[0]);
175 for (int cur = 1; cur < fNorms.count() - 1; ++cur) {
176 fNorms[cur] = normalToVector(fPts[cur + 1] - fPts[cur]);
178 fNorms.top() = normalToVector(fNorms.top());
182 fBisectors.setCount(fNorms.count());
186 fBisectors[cur] = fNorms[cur] + fNorms[prev];
188 fBisectors[cur] = SkPointPriv::MakeOrthog(fNorms[cur], (SkPointPriv::Side)-fSide) +
189 SkPointPriv::MakeOrthog(fNorms[prev], fSide);
198 if (SkScalarAbs(fNorms[cur].dot(fNorms[prev])) > kCurveConnectionThreshold) {
282 fNorms.setCount(fNorms.count() + outerStrokeAndAARing.numPts());
284 SkASSERT(outerStrokeAndAARing.index(i) < fNorms.count());
285 fNorms[outerStrokeAndAARing.index(i)] = outerStrokeAndAARing.norm(i);
339 SkASSERT(edgeIdx < fNorms.count());
342 SkScalar depth = -fNorms[edgeIdx].dot(v);
353 const SkPoint& norm = fNorms[edgeIdx];
457 SkASSERT(fNorms.empty());
470 fNorms.append(2);
471 fNorms[0] = SkPointPriv::MakeOrthog(fPts[1] - fPts[0], fSide);
472 fNorms[0].normalize();
473 fNorms[1] = -fNorms[0];
474 SkASSERT(SkScalarNearlyEqual(1.0f, fNorms[0].length()));
487 fInitialRing.init(fNorms, fBisectors);
846 SkASSERT(!fBisectors.count() || fBisectors.count() == fNorms.count());