Lines Matching defs:that
4 * Use of this source code is governed by a BSD-style license that can be
75 // We translate the polygon so that the first point is at the origin.
227 // At this point, we've already returned true from canDraw(), which checked that the path's
287 // notice that the sample may be close to a very thin area of the path and
289 // line paths. We detect paths that are very close to a line (zero area) and
443 // with no interior, and that the resulting shared edge uses the same endpoints.
490 // We need a negative value that is very large that it won't effect results if it is
491 // interpolated with. However, the value can't be too large of a negative that it
521 // with no interior, and that the resulting shared edge uses the same endpoints.
779 // We use the fact that SkPath::transform path does subdivision based on
864 AAConvexPathOp* that = t->cast<AAConvexPathOp>();
865 if (!fHelper.isCompatible(that->fHelper, caps, this->bounds(), that->bounds())) {
869 !SkMatrixPriv::CheapEqual(fPaths[0].fViewMatrix, that->fPaths[0].fViewMatrix)) {
873 fPaths.push_back_n(that->fPaths.count(), that->fPaths.begin());
874 fWideColor |= that->fWideColor;