Lines Matching full:bounds
212 SkRect& bounds) {
215 bounds.fLeft = bounds.fRight = dst[0].fX;
216 bounds.fTop = bounds.fBottom = dst[0].fY;
218 bounds.growToInclude(dst[index].fX, dst[index].fY);
223 SkRect& bounds) {
226 bounds.fLeft = bounds.fRight = dst[0].fX;
227 bounds.fTop = bounds.fBottom = dst[0].fY;
229 bounds.growToInclude(dst[index].fX, dst[index].fY);
274 bounds for edge
278 if a contour's bounds is outside of the active area, no need to create edges
282 find the bounds of each contour, select the active contours
294 SkRect bounds;
295 bounds.setEmpty();
300 if (!bounds.isEmpty()) {
301 *boundsArray.append() = bounds;
303 bounds.set(pts[0].fX, pts[0].fY, pts[0].fX, pts[0].fY);
323 bounds.growToInclude(pts[i].fX, pts[i].fY);
735 // Bounds, unlike Rect, does not consider a vertical line to be empty.
736 struct Bounds : public SkRect {
737 static bool Intersects(const Bounds& a, const Bounds& b) {
922 // FIXME: bounds could be better for partial Ts
1010 // recompute bounds based on subrange of T values
1172 Bounds fBounds;
1965 if (!Bounds::Intersects(test->fBounds, next->fBounds)) {
2614 // bounds that cross over, then tight bounds that cross
