Lines Matching full:bounds
25 used when we know the bounds of the amount we are going to add to the path
29 cached bounds), and the if it can, it updates the cache bounds explicitly,
69 // Cannot use fRect for our bounds unless we know it is sorted
74 static void compute_pt_bounds(SkRect* bounds, const SkTDArray<SkPoint>& pts) {
76 bounds->set(0, 0, 0, 0);
78 bounds->set(pts.begin(), pts.count());
79 // SkDebugf("------- compute bounds %p %d", &pts, pts.count());
127 // note: don't need to look at isConvex or bounds, since just comparing the
538 the provided bounds when we can (i.e. use oval.fLeft instead of cx-rx)
539 to ensure that we don't exceed the oval's bounds *ever*, since we want
540 to use oval for our fast-bounds, rather than have to recompute it.
1326 SkRect bounds;
1327 compute_pt_bounds(&bounds, fPts);
1330 // necessarily compare to bounds directly
1331 // try path.addOval(2, 2, 2, 2) which is empty, but the bounds will
1333 SkASSERT(bounds.isEmpty());
1336 fBounds.contains(bounds);
