Lines Matching refs:right
61 int right() const { return fRight; }
70 * (i.e. left <= right) so the result may be negative.
82 * method is defined to return (right + left) >> 1.
85 * (right + left) / 2 when the sum is negative.
125 void set(int32_t left, int32_t top, int32_t right, int32_t bottom) {
128 fRight = right;
132 void setLTRB(int32_t left, int32_t top, int32_t right, int32_t bottom) {
133 this->set(left, top, right, bottom);
153 * be max 32bit and right will be min 32bit).
160 /** Offset set the rectangle by adding dx to its left and right,
207 empty. The left and top are considered to be inside, while the right
219 bool contains(int32_t left, int32_t top, int32_t right, int32_t bottom) const {
220 return left < right && top < bottom && !this->isEmpty() && // check for empties
222 fRight >= right && fBottom >= bottom;
240 int32_t right, int32_t bottom) const {
242 SkASSERT(left < right && top < bottom);
245 fRight >= right && fBottom >= bottom;
301 /** If the rectangle specified by left,top,right,bottom intersects this rectangle,
306 bool intersect(int32_t left, int32_t top, int32_t right, int32_t bottom) {
307 if (left < right && top < bottom && !this->isEmpty() &&
308 fLeft < right && left < fRight && fTop < bottom && top < fBottom) {
311 if (fRight > right) fRight = right;
340 void join(int32_t left, int32_t top, int32_t right, int32_t bottom);
350 /** Swap top/bottom or left/right if there are flipped.
353 When this returns, left <= right && top <= bottom
454 SkScalar right() const { return fRight; }
484 void set(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) {
487 fRight = right;
491 void setLTRB(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) {
492 this->set(left, top, right, bottom);
498 void iset(int left, int top, int right, int bottom) {
501 fRight = SkIntToScalar(right);
569 * be max and right will be min).
576 /** Offset set the rectangle by adding dx to its left and right,
625 /** If this rectangle intersects the rectangle specified by left, top, right, bottom,
630 bool intersect(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom);
636 bool intersects(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) const {
638 left < right && top < bottom &&
641 fLeft < right && left < fRight &&
665 void join(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom);
682 * contains() treats the left and top different from the right and bottom.
697 * Contains treats the left and top differently from the right and bottom.
699 * to be inside, while the right and bottom are not. Thus for the rectangle
711 * Contains treats the left and top differently from the right and bottom.
713 * to be inside, while the right and bottom are not. Thus for the rectangle
743 * SkScalarFloor of top and left, and the SkScalarCeil of right and bottom.
753 * floor of top and left, and the ceil of right and bottom. If this rect
765 * ceil of top and left, and the floor of right and bottom. This does *not*
767 * e.g. left >= right or top >= bottom. Call isEmpty() to detect that.
777 * Swap top/bottom or left/right if there are flipped (i.e. if width()
780 * other. When this returns, left <= right && top <= bottom
