Lines Matching defs:count
237 // need the same structure (verbs, conicweights) and same point-count
238 return fPathRef->fPoints.count() == compare.fPathRef->fPoints.count() &&
325 int count = orig.chopIntoQuadsPOW2(quadPts, 1);
326 SkASSERT_RELEASE(2 == count);
475 int count = std::min(max, fPathRef->countPoints());
476 sk_careful_memcpy(dst, fPathRef->points(), count * sizeof(SkPoint));
496 int count = std::min(max, fPathRef->countVerbs());
497 if (count) {
498 memcpy(dst, fPathRef->verbsBegin(), count);
514 int count = fPathRef->countPoints();
515 if (count > 0) {
517 *lastPt = fPathRef->atPoint(count - 1);
530 int count = fPathRef->countPoints();
531 if (count <= index) {
542 int count = fPathRef->countPoints();
543 if (count == 0) {
547 ed.atPoint(count-1)->set(x, y);
632 int count = fPathRef->countPoints();
633 if (count > 0) {
635 pt = fPathRef->atPoint(count - 1);
755 int count = fPathRef->countVerbs();
756 if (count > 0) {
757 switch (fPathRef->atVerb(count - 1)) {
817 SkPath& SkPath::addPoly(const SkPoint pts[], int count, bool close) {
819 if (count <= 0) {
826 SkPathRef::Editor ed(&fPathRef, count+close, count);
829 if (count > 1) {
830 SkPoint* p = ed.growForRepeatedVerb(kLine_Verb, count - 1);
831 memcpy(p, &pts[1], (count-1) * sizeof(SkPoint));
915 int count = SkConic::BuildUnitArc(start, stop, dir, &matrix, conics);
916 if (0 == count) {
919 return count;
996 int count = fPathRef->countVerbs();
998 for (int i = 0; i < count; ++i) {
1011 int count = fPathRef->countPoints() - startPtIndex;
1012 if (count < 2) {
1017 for (int index = 1; index < count; ++index) {
1144 int count = build_arc_conics(oval, startV, stopV, dir, conics, &singlePt);
1145 if (count) {
1146 this->incReserve(count * 2 + 1);
1149 for (int i = 0; i < count; ++i) {
1450 if (path.fPathRef->fVerbs.count() == 0) {
1866 int count, SkScalarAsStringType strType, SkScalar conicWeight = -12345) {
1871 count *= 2;
1873 for (int i = 0; i < count; ++i) {
1875 if (i < count - 1) {
1886 for (int i = 0; i < count; ++i) {
1888 if (i < count - 1) {
2146 static SkPathConvexity BySign(const SkPoint points[], int count) {
2147 if (count <= 3) {
2152 const SkPoint* last = points + count;
2330 int count = SkPathPriv::PtsInVerb((unsigned) verb);
2331 SkASSERT(count > 0);
2332 for (int i = 1; i <= count; ++i) {
2371 int count() const { return fCurrPtCount; }
2463 static int find_max_y(const SkPoint pts[], int count) {
2464 SkASSERT(count > 0);
2467 for (int i = 1; i < count; ++i) {
2551 int n = iter.count();
3080 int oldCount = tangents.count();
3101 if (tangents.count() > oldCount) {
3102 int last = tangents.count() - 1;
3120 return SkToBool(tangents.count()) ^ isInverse;
3343 int count = 0;
3347 count = 1;
3351 count = 1;
3354 count = compute_quad_extremas(pts, extremas);
3357 count = compute_conic_extremas(pts, *w, extremas);
3360 count = compute_cubic_extremas(pts, extremas);
3365 for (int i = 0; i < count; ++i) {
3491 SkPath SkPath::Polygon(const SkPoint pts[], int count, bool isClosed,
3493 return SkPathBuilder().addPolygon(pts, count, isClosed)
3862 const int count = path.fPathRef->countPoints();
3864 for (int i = 1; i < count; ++i) {