Lines Matching refs:numPts
161 if (previousRing.numPts() < 3) {
184 bool done = currentRing->numPts() >= 3;
222 if (fStrokeWidth >= 0.0f && fInitialRing.numPts() > 2) {
287 // Outer ring: 3*numPts
288 // Middle ring: numPts
289 // Presumptive inner ring: numPts
291 // Outer ring: 12*numPts
293 // Presumptive inner ring: 6*numPts + 6
325 if (this->numPts() < 2) {
330 if (duplicate_pt(fPts[this->numPts()-1], fPts[0])) {
336 if (this->numPts() >= 3) {
349 if (this->numPts() >= 3 && abs_dist_from_line(fPts[0], fNorms.top(), fPts[1]) < kClose) {
359 if (this->numPts() >= 3) {
375 } else if (this->numPts() == 2) {
398 fCandidateVerts.setReserve(this->numPts());
399 fInitialRing.setReserve(this->numPts());
400 for (int i = 0; i < this->numPts(); ++i) {
412 ring->setReserve(fInitialRing.numPts());
418 fRings[nextRing].setReserve(fInitialRing.numPts());
427 for (int cur = ring.numPts() - 2; cur >= 0; --cur) {
434 const int numPts = previousRing.numPts();
435 if (numPts == 0) {
439 int prev = numPts - 1;
445 for (int cur = 0; cur < numPts; ++cur) {
562 int lastIdx = previousRing.index(numPts - 1);
600 for (int cur = 0; cur < lastRing.numPts(); ++cur) {
601 int next = (cur + 1) % lastRing.numPts();
631 dst.setCount(lastRing.numPts());
646 for (int cur = 1; cur < lastRing.numPts()-1; ++cur) {
664 int cur = lastRing.numPts()-1;
699 for (int i = 0; i < fCandidateVerts.numPts(); ++i) {
724 for (int i = 0; i < lastRing.numPts(); ++i) {
725 int next = (i + 1) % lastRing.numPts();
736 if (nextRing->numPts() < 3) {
827 if (this->numPts() > 0 && duplicate_pt(p, this->lastPoint())) {
832 if (this->numPts() >= 2 &&
848 if (this->numPts() > 1) {
993 SkASSERT(fIndices[i] < this->numPts()) ;
994 SkASSERT(fIndices[i+1] < this->numPts()) ;
995 SkASSERT(fIndices[i+2] < this->numPts()) ;
1013 for (int i = 0; i < this->numPts(); ++i) {
