28       size_(std::abs(r.right - r.left), std::abs(r.bottom - r.top)) {  in Rect()
40   r.right = right();  in ToRECT()
102 void Rect::SetByBounds(int left, int top, int right, int bottom) {  in SetByBounds()  argument
105   SaturatedClampRange(left, right, &x, &width);  in SetByBounds()
112   Inset(insets.left(), insets.top(), insets.right(), insets.bottom());  in Inset()
115 void Rect::Inset(int left, int top, int right, int bottom) {  in Inset()  argument
120                                        base::SaturatedAddition(left, right)));  in Inset()
147                 right() - inner.right());  in InsetsFrom()
163   return (point_x >= x()) && (point_x < right()) && (point_y >= y()) &&  in Contains()
168   return (rect.x() >= x() && rect.right() <= right() && rect.y() >= y() &&  in Contains()
173   return !(IsEmpty() || rect.IsEmpty() || rect.x() >= right() ||  in Intersects()
174            rect.right() <= x() || rect.y() >= bottom() || rect.bottom() <= y());  in Intersects()
185   int new_right = std::min(right(), rect.right());  in Intersect()
205               std::max(right(), rect.right()),  in Union()
219   int rr = right();  in Subtract()
225       rx = rect.right();  in Subtract()
226     } else if (rect.right() >= right()) {  in Subtract()
229   } else if (rect.x() <= x() && rect.right() >= right()) {  in Subtract()
268       left_half->right(), y(), width() - left_half->width(), height());  in SplitVertically()
273           (x() == rect.right() || right() == rect.x())) ||  in SharesEdgeWith()
280       std::max<int>(0, std::max(x() - point.x(), point.x() - right()));  in ManhattanDistanceToPoint()
305          std::abs(right() - rect.right()) <= tolerance &&  in ApproximatelyEqual()