Lines Matching full:right
61 int right() const { return fRight; }
70 * (i.e. left <= right) so the result may be negative.
84 * method is defined to return (right + left) >> 1.
87 * (right + left) / 2 when the sum is negative.
127 void set(int32_t left, int32_t top, int32_t right, int32_t bottom) {
130 fRight = right;
134 void setLTRB(int32_t left, int32_t top, int32_t right, int32_t bottom) {
135 this->set(left, top, right, bottom);
155 * be max 32bit and right will be min 32bit).
183 /** Offset set the rectangle by adding dx to its left and right,
230 empty. The left and top are considered to be inside, while the right
242 bool contains(int32_t left, int32_t top, int32_t right, int32_t bottom) const {
243 return left < right && top < bottom && !this->isEmpty() && // check for empties
245 fRight >= right && fBottom >= bottom;
267 int32_t right, int32_t bottom) const {
269 SkASSERT(left < right && top < bottom);
272 fRight >= right && fBottom >= bottom;
325 /** If the rectangle specified by left,top,right,bottom intersects this rectangle,
331 int32_t right, int32_t bottom) {
332 if (left < right && top < bottom && !this->isEmpty() &&
333 fLeft < right && left < fRight && fTop < bottom && top < fBottom) {
336 if (fRight > right) fRight = right;
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 right() const { return fRight; }
503 /** return the 4 points that enclose the rectangle (top-left, top-right, bottom-right,
519 void set(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) {
522 fRight = right;
526 void setLTRB(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) {
527 this->set(left, top, right, bottom);
533 void iset(int left, int top, int right, int bottom) {
536 fRight = SkIntToScalar(right);
604 * be max and right will be min).
632 /** Offset set the rectangle by adding dx to its left and right,
681 /** If this rectangle intersects the rectangle specified by left, top, right, bottom,
687 SkScalar right, SkScalar bottom);
712 bool intersects(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) const {
713 return Intersects(fLeft, fTop, fRight, fBottom, left, top, right, bottom);
734 void join(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom);
761 fRight = SkMaxScalar(fRight, r.right());
770 * contains() treats the left and top different from the right and bottom.
847 * SkScalarFloor of top and left, and the SkScalarCeil of right and bottom.
857 * SkScalarFloorToScalar of top and left, and the SkScalarCeilToScalar of right and bottom.
870 * ceil of top and left, and the floor of right and bottom. This does *not*
872 * e.g. left >= right or top >= bottom. Call isEmpty() to detect that.
895 * Swap top/bottom or left/right if there are flipped (i.e. if width()
898 * other. When this returns, left <= right && top <= bottom
