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).
174 /** Offset set the rectangle by adding dx to its left and right,
221 empty. The left and top are considered to be inside, while the right
233 bool contains(int32_t left, int32_t top, int32_t right, int32_t bottom) const {
234 return left < right && top < bottom && !this->isEmpty() && // check for empties
236 fRight >= right && fBottom >= bottom;
254 int32_t right, int32_t bottom) const {
256 SkASSERT(left < right && top < bottom);
259 fRight >= right && fBottom >= bottom;
315 /** If the rectangle specified by left,top,right,bottom intersects this rectangle,
320 bool intersect(int32_t left, int32_t top, int32_t right, int32_t bottom) {
321 if (left < right && top < bottom && !this->isEmpty() &&
322 fLeft < right && left < fRight && fTop < bottom && top < fBottom) {
325 if (fRight > right) fRight = right;
354 void join(int32_t left, int32_t top, int32_t right, int32_t bottom);
364 /** Swap top/bottom or left/right if there are flipped.
367 When this returns, left <= right && top <= bottom
471 SkScalar right() const { return fRight; }
486 /** return the 4 points that enclose the rectangle (top-left, top-right, bottom-right,
502 void set(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) {
505 fRight = right;
509 void setLTRB(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) {
510 this->set(left, top, right, bottom);
516 void iset(int left, int top, int right, int bottom) {
519 fRight = SkIntToScalar(right);
587 * be max and right will be min).
608 /** Offset set the rectangle by adding dx to its left and right,
658 /** If this rectangle intersects the rectangle specified by left, top, right, bottom,
663 bool intersect(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom);
669 bool intersects(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) const {
671 left < right && top < bottom &&
674 fLeft < right && left < fRight &&
698 void join(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom);
715 * contains() treats the left and top different from the right and bottom.
782 * SkScalarFloor of top and left, and the SkScalarCeil of right and bottom.
792 * floor of top and left, and the ceil of right and bottom. If this rect
804 * ceil of top and left, and the floor of right and bottom. This does *not*
806 * e.g. left >= right or top >= bottom. Call isEmpty() to detect that.
825 * Swap top/bottom or left/right if there are flipped (i.e. if width()
828 * other. When this returns, left <= right && top <= bottom
