Lines Matching defs:that
4 * Use of this source code is governed by a BSD-style license that can be
54 * our promise. Hence we have a custom joiner that doesn't look at emptiness
173 SkPath::SkPath(const SkPath& that)
174 : fPathRef(SkRef(that.fPathRef.get())) {
175 this->copyFields(that);
176 SkDEBUGCODE(that.validate();)
183 SkPath& SkPath::operator=(const SkPath& that) {
184 SkDEBUGCODE(that.validate();)
186 if (this != &that) {
187 fPathRef.reset(SkRef(that.fPathRef.get()));
188 this->copyFields(that);
194 void SkPath::copyFields(const SkPath& that) {
196 fLastMoveToIndex = that.fLastMoveToIndex;
197 fFillType = that.fFillType;
198 fIsVolatile = that.fIsVolatile;
201 this->setConvexity(that.getConvexityOrUnknown());
202 this->setFirstDirection(that.getFirstDirection());
212 void SkPath::swap(SkPath& that) {
213 if (this != &that) {
214 fPathRef.swap(that.fPathRef);
215 std::swap(fLastMoveToIndex, that.fLastMoveToIndex);
218 fFillType = that.fFillType;
219 that.fFillType = ft;
222 fIsVolatile = that.fIsVolatile;
223 that.fIsVolatile = iv;
227 this->setConvexity(that.getConvexityOrUnknown());
228 that.setConvexity(c);
231 this->setFirstDirection(that.getFirstDirection());
232 that.setFirstDirection(fd);
302 // contour that matters.
405 The direction is computed such that:
425 *These last two conditions we relax if we have a 3-edge path that would
599 // that they don't complete, so we don't enable it by default
776 // signal that we need a moveTo to follow us (unless we're done)
965 // adjusted such that the start pt is "behind" the radii start pt.
1127 // At this point, we know that the arc is not a lone point, but startV == stopV
1128 // indicates that the sweepAngle is too small such that angles_to_unit_vectors
1163 // Note that arcSweep bool value is flipped from the original implementation.
1273 Computing the arc width introduces rounding errors that cause arcs to start
1289 // ensure that rounding errors in the above math don't cause any problems.
1640 // Due to finite/fragile float numerics, we can't assume that a convex path remains
1739 // false, but the iterator expects that they are treated as the same.
2184 return SkPathConvexity::kConvex; // that is, it may be convex, don't know yet
2251 SkVector fLastVec {0, 0}; // The direction that brought the path to fLastPt
2281 // Find the last real verb that affects convexity
2493 * xmax of the contiguous points that have the same Y.
2525 * contour that contained the global y-max. If we just look at the first
2526 * contour, we may find one that is wound the opposite way (correctly) since
2528 * that is outer most (or at least has the global y-max) before we can consider
2574 // we just subtract the indices, and let that auto-convert to
2580 // but we try to find pts that form non-zero vectors from pts[index]
2582 // Its possible that we can't find two non-degenerate vectors, so
2904 // sure that we're on the line (excluding the end point) here
3195 // Set sortFlags so that it has the low bit set if pt index 0 is on right edge and second bit
3858 // Multiple contours might give a false-negative, but for speed, we ignore that