33 #define RECT_ARGS(r) (r).left, (r).top, (r).right, (r).bottom  argument
34 #define SK_RECT_ARGS(r) (r).left(), (r).top(), (r).right(), (r).bottom()  argument
95     inline void set(const Rect& r) { set(r.left, r.top, r.right, r.bottom); }  in set()  argument
97     inline void set(const SkIRect& r) { set(r.left(), r.top(), r.right(), r.bottom()); }  in set()  argument
103     bool intersects(float l, float t, float r, float b) const {  in intersects()  argument
106         float tempRight = std::min(right, r);  in intersects()
112     bool intersects(const Rect& r) const { return intersects(r.left, r.top, r.right, r.bottom); }  in intersects()  argument
119     void doIntersect(float l, float t, float r, float b) {  in doIntersect()  argument
122         right = std::min(right, r);  in doIntersect()
126     void doIntersect(const Rect& r) { doIntersect(r.left, r.top, r.right, r.bottom); }  in doIntersect()  argument
128     inline bool contains(float l, float t, float r, float b) const {  in contains()  argument
129         return l >= left && t >= top && r <= right && b <= bottom;  in contains()
132     inline bool contains(const Rect& r) const { return contains(r.left, r.top, r.right, r.bottom); }  in contains()  argument
134     bool unionWith(const Rect& r) {  in unionWith()  argument
135         if (r.left < r.right && r.top < r.bottom) {  in unionWith()
137                 if (left > r.left) left = r.left;  in unionWith()
138                 if (top > r.top) top = r.top;  in unionWith()
139                 if (right < r.right) right = r.right;  in unionWith()
140                 if (bottom < r.bottom) bottom = r.bottom;  in unionWith()
143                 left = r.left;  in unionWith()
144                 top = r.top;  in unionWith()
145                 right = r.right;  in unionWith()
146                 bottom = r.bottom;  in unionWith()