Lines Matching defs:Rect
42 class Rect {
55 inline Rect():
62 inline Rect(float left, float top, float right, float bottom):
69 inline Rect(float width, float height):
76 inline Rect(const SkIRect& rect): // NOLINT, implicit
77 left(rect.fLeft),
78 top(rect.fTop),
79 right(rect.fRight),
80 bottom(rect.fBottom) {
83 inline Rect(const SkRect& rect): // NOLINT, implicit
84 left(rect.fLeft),
85 top(rect.fTop),
86 right(rect.fRight),
87 bottom(rect.fBottom) {
90 friend int operator==(const Rect& a, const Rect& b) {
94 friend int operator!=(const Rect& a, const Rect& b) {
119 inline void set(const Rect& r) {
144 bool intersects(const Rect& r) const {
150 * SkRect::intersect / android.graphics.Rect#intersect behavior, which do not modify the object
160 void doIntersect(const Rect& r) {
168 inline bool contains(const Rect& r) const {
172 bool unionWith(const Rect& r) {
220 * This function should be used whenever estimating the damage rect of geometry already mapped
240 * bounds by a fudge factor. This ensures that ambiguous geometry (e.g. a non-AA Rect
241 * with top left at (0.5, 0.5)) will err on the side of a larger damage rect.
268 void expandToCover(const Rect& other) {
291 ALOGD("%s[l=%.2f t=%.2f r=%.2f b=%.2f]", label ? label : "Rect", left, top, right, bottom);
294 friend std::ostream& operator<<(std::ostream& os, const Rect& rect) {
295 if (rect.isEmpty()) {
300 if (rect.left == 0 && rect.top == 0) {
301 return os << "[" << rect.right << " x " << rect.bottom << "]";
304 return os << "[" << rect.left
305 << " " << rect.top
306 << " " << rect.right
307 << " " << rect.bottom << "]";
309 }; // class Rect
