84     const Rect result(left + rhs.x, top + rhs.y, right + rhs.x, bottom + rhs.y);  in operator +()  local
85     return result;  in operator +()
89     const Rect result(left - rhs.x, top - rhs.y, right - rhs.x, bottom - rhs.y);  in operator -()  local
90     return result;  in operator -()
93 bool Rect::intersect(const Rect& with, Rect* result) const {  in intersect()
94     result->left = max(left, with.left);  in intersect()
95     result->top = max(top, with.top);  in intersect()
96     result->right = min(right, with.right);  in intersect()
97     result->bottom = min(bottom, with.bottom);  in intersect()
98     return !(result->isEmpty());  in intersect()
102     Rect result(*this);  in transform()  local
104         result = Rect(width - result.right, result.top, width - result.left,  in transform()
105                 result.bottom);  in transform()
108         result = Rect(result.left, height - result.bottom, result.right,  in transform()
109                 height - result.top);  in transform()
112         int left = height - result.bottom;  in transform()
113         int top = result.left;  in transform()
114         int right = height - result.top;  in transform()
115         int bottom = result.right;  in transform()
116         result = Rect(left, top, right, bottom);  in transform()
118     return result;  in transform()
122     Rect result(Rect::EMPTY_RECT);  in reduce()  local
132         result.clear();  in reduce()
134         result = *this;  in reduce()
138                 result.right = min(result.right, exclude.left);  in reduce()
140                 result.bottom = min(result.bottom, exclude.top);  in reduce()
142                 result.left = max(result.left, exclude.right);  in reduce()
144                 result.top = max(result.top, exclude.bottom);  in reduce()
149     return result;  in reduce()