Lines Matching full:distance
108 SkScalar distance, int mint, int maxt, int ptIndex) {
114 distance = this->compute_quad_segs(tmp, distance, mint, halft, ptIndex);
115 distance = this->compute_quad_segs(&tmp[2], distance, halft, maxt, ptIndex);
117 SkScalar d = SkPoint::Distance(pts[0], pts[2]);
120 distance += d;
122 seg->fDistance = distance;
128 return distance;
132 SkScalar distance, int mint, int maxt, int ptIndex) {
138 distance = this->compute_cubic_segs(tmp, distance, mint, halft, ptIndex);
139 distance = this->compute_cubic_segs(&tmp[3], distance, halft, maxt, ptIndex);
141 SkScalar d = SkPoint::Distance(pts[0], pts[3]);
144 distance += d;
146 seg->fDistance = distance;
152 return distance;
158 SkScalar d, distance = 0;
175 d = SkPoint::Distance(pts[0], pts[1]);
178 distance += d;
180 seg->fDistance = distance;
190 distance = this->compute_quad_segs(pts, distance, 0,
196 distance = this->compute_cubic_segs(pts, distance, 0,
210 fLength = distance;
219 SkScalar distance = 0;
222 SkASSERT(seg->fDistance > distance);
233 distance = seg->fDistance;
403 SkScalar distance, SkScalar* t) {
405 SkASSERT(distance >= 0 && distance <= length);
410 int index = SkTSearch<SkScalar>(&seg->fDistance, count, distance,
428 SkASSERT(distance >= startD);
432 distance - startD,
437 bool SkPathMeasure::getPosTan(SkScalar distance, SkPoint* pos,
452 // pin the distance to a legal range
453 if (distance < 0) {
454 distance = 0;
455 } else if (distance > length) {
456 distance = length;
460 const Segment* seg = this->distanceToSegment(distance, &t);
467 bool SkPathMeasure::getMatrix(SkScalar distance, SkMatrix* matrix,
472 if (this->getPosTan(distance, &position, &tangent)) {
555 SkDebugf("pathmeas: seg[%d] distance=%g, point=%d, t=%g, type=%d\n",