Lines Matching defs:bounds
52 * Path.bounds is defined to be the bounds of all the control points.
53 * If we called bounds.join(r) we would skip r if r was empty, which breaks
83 used when we know the bounds of the amount we are going to add to the path
87 cached bounds), and then if it can, it updates the cache bounds explicitly,
97 // Cannot use fRect for our bounds unless we know it is sorted
99 // Mark the path's bounds as dirty if (1) they are, or (2) the path
100 // is non-finite, and therefore its bounds are not meaningful
206 // note: don't need to look at isConvex or bounds, since just comparing the
458 bool SkPath::isOval(SkRect* bounds) const {
459 return SkPathPriv::IsOval(*this, bounds, nullptr, nullptr);
938 const SkRect& bounds = rrect.getBounds();
942 this->addRect(bounds, dir, (startIndex + 1) / 2);
945 this->addOval(bounds, dir, startIndex / 2);
950 SkAutoPathBoundsUpdate apbu(this, bounds);
967 SkPath_RectPointIterator rectIter(bounds, dir, rectStartIndex);
2073 SkRect bounds;
2075 bool isFinite = compute_pt_bounds(&bounds, *fPathRef.get());
2082 // necessarily compare to bounds directly
2083 // try path.addOval(2, 2, 2, 2) which is empty, but the bounds will
2085 if (!bounds.isEmpty() || !fBounds.isEmpty()) {
2089 if (bounds.isEmpty()) {
2095 if (!fBounds.contains(bounds)) {
2825 // bounds check on X (not required. is it faster?)
3371 SkRect bounds;
3372 min.store((SkPoint*)&bounds.fLeft);
3373 max.store((SkPoint*)&bounds.fRight);
3374 return bounds;
3723 Result test(const SkRect& bounds) const {
3727 diagMin.fX = bounds.fLeft;
3728 diagMax.fX = bounds.fRight;
3730 diagMin.fX = bounds.fRight;
3731 diagMax.fX = bounds.fLeft;
3734 diagMin.fY = bounds.fTop;
3735 diagMax.fY = bounds.fBottom;
3737 diagMin.fY = bounds.fBottom;
3738 diagMax.fY = bounds.fTop;