62     int bottom() const { return fBottom; }  in bottom()  function
76      *  (i.e. top <= bottom) so the result may be negative.
93      *  method is defined to return (bottom + top) >> 1
96      *  (bottom + top) / 2 when the sum is negative.
127     void set(int32_t left, int32_t top, int32_t right, int32_t bottom) {  in set()
131         fBottom = bottom;  in set()
134     void setLTRB(int32_t left, int32_t top, int32_t right, int32_t bottom) {  in setLTRB()
135         this->set(left, top, right, bottom);  in setLTRB()
184         and adding dy to its top and bottom.
209         making the rectangle wider. The same holds true for dy and the top and bottom.
221        true for dy and the top and bottom.
231         and bottom are not. Thus for the rectangle (0, 0, 5, 10), the
242     bool contains(int32_t left, int32_t top, int32_t right, int32_t bottom) const {  in contains()
243         return  left < right && top < bottom && !this->isEmpty() && // check for empties  in contains()
245                 fRight >= right && fBottom >= bottom;  in contains()
267                               int32_t right, int32_t bottom) const {  in containsNoEmptyCheck()
269         SkASSERT(left < right && top < bottom);  in containsNoEmptyCheck()
272                fRight >= right && fBottom >= bottom;  in containsNoEmptyCheck()
325     /** If the rectangle specified by left,top,right,bottom intersects this rectangle,
331                                          int32_t right, int32_t bottom) {  in intersect()
332         if (left < right && top < bottom && !this->isEmpty() &&  in intersect()
333                 fLeft < right && left < fRight && fTop < bottom && top < fBottom) {  in intersect()
337             if (fBottom > bottom) fBottom = bottom;  in intersect()
365     void join(int32_t left, int32_t top, int32_t right, int32_t bottom);
375     /** Swap top/bottom or left/right if there are flipped.
378         When this returns, left <= right && top <= bottom
488     SkScalar    bottom() const { return fBottom; }  in bottom()  function
502     /** return the 4 points that enclose the rectangle (top-left, top-right, bottom-right,
503         bottom-left). TODO: Consider adding param to control whether quad is CW or CCW.
518     void set(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) {  in set()
522         fBottom = bottom;  in set()
525     void setLTRB(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) {  in setLTRB()
526         this->set(left, top, right, bottom);  in setLTRB()
532     void iset(int left, int top, int right, int bottom) {  in iset()
536         fBottom = SkIntToScalar(bottom);  in iset()
632         and adding dy to its top and bottom.
658          true for dy and the top and bottom.
670        true for dy and the top and bottom.
680     /** If this rectangle intersects the rectangle specified by left, top, right, bottom,
686                                          SkScalar right, SkScalar bottom);
711     bool intersects(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) const {  in intersects()
712         return Intersects(fLeft, fTop, fRight, fBottom, left, top, right, bottom);  in intersects()
733     void join(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom);
761         fBottom = SkMaxScalar(fBottom, r.bottom());  in joinPossiblyEmptyRect()
769      *  contains() treats the left and top different from the right and bottom.
828      *  SkScalarFloor of top and left, and the SkScalarCeil of right and bottom.
838      *  SkScalarFloorToScalar of top and left, and the SkScalarCeilToScalar of right and bottom.
851      *  ceil of top and left, and the floor of right and bottom. This does *not*
853      *  e.g. left >= right or top >= bottom. Call isEmpty() to detect that.
876      *  Swap top/bottom or left/right if there are flipped (i.e. if width()
879      *  other. When this returns, left <= right && top <= bottom