Lines Matching defs:fRight
21 int32_t fLeft, fTop, fRight, fBottom;
61 int right() const { return fRight; }
72 int width() const { return fRight - fLeft; }
89 int centerX() const { return (fRight + fLeft) >> 1; }
103 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; }
107 SK_MaxS32 == fRight &&
120 SkIsS16(fRight) && SkIsS16(fBottom);
130 fRight = right;
141 fRight = x + width;
150 fRight = fBottom = SK_MaxS32;
159 fRight = fBottom = SK_MinS32;
166 return MakeLTRB(fLeft + dx, fTop + dy, fRight + dx, fBottom + dy);
173 return MakeLTRB(fLeft + dx, fTop + dy, fRight - dx, fBottom - dy);
180 return MakeLTRB(fLeft - dx, fTop - dy, fRight + dx, fBottom + dy);
189 fRight += dx;
201 fRight += newX - fLeft;
214 fRight -= dx;
226 return l >= fRight || fLeft >= r || t >= fBottom || fTop >= b;
235 return (unsigned)(x - fLeft) < (unsigned)(fRight - fLeft) &&
245 fRight >= right && fBottom >= bottom;
253 fRight >= r.fRight && fBottom >= r.fBottom;
268 SkASSERT(fLeft < fRight && fTop < fBottom);
272 fRight >= right && fBottom >= bottom;
276 return containsNoEmptyCheck(r.fLeft, r.fTop, r.fRight, r.fBottom);
284 return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom);
294 a.fLeft < b.fRight && b.fLeft < a.fRight &&
298 fRight = SkMin32(a.fRight, b.fRight);
314 if (a.fLeft < b.fRight && b.fLeft < a.fRight &&
318 fRight = SkMin32(a.fRight, b.fRight);
333 fLeft < right && left < fRight && fTop < bottom && top < fBottom) {
336 if (fRight > right) fRight = right;
347 a.fLeft < b.fRight && b.fLeft < a.fRight &&
357 return a.fLeft < b.fRight && b.fLeft < a.fRight &&
372 this->join(r.fLeft, r.fTop, r.fRight, r.fBottom);
391 SkScalar fLeft, fTop, fRight, fBottom;
440 SkIntToScalar(irect.fRight),
449 SkIntToScalar(irect.fRight),
457 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; }
461 SK_ScalarMax == fRight &&
472 accum *= fRight;
487 SkScalar right() const { return fRight; }
489 SkScalar width() const { return fRight - fLeft; }
491 SkScalar centerX() const { return SkScalarHalf(fLeft + fRight); }
514 fRight = SkIntToScalar(src.fRight);
521 fRight = right;
535 fRight = SkIntToScalar(right);
545 fRight = SkIntToScalar(width);
574 fRight = SkMaxScalar(p0.fX, p1.fX);
582 fRight = x + width;
589 fRight = width;
598 fRight = fBottom = SK_ScalarMax;
607 fRight = fBottom = SK_ScalarMin;
614 return MakeLTRB(fLeft + dx, fTop + dy, fRight + dx, fBottom + dy);
621 return MakeLTRB(fLeft + dx, fTop + dy, fRight - dx, fBottom - dy);
628 return MakeLTRB(fLeft - dx, fTop - dy, fRight + dx, fBottom + dy);
637 fRight += dx;
649 fRight += newX - fLeft;
663 fRight -= dx;
712 return Intersects(fLeft, fTop, fRight, fBottom, left, top, right, bottom);
716 return Intersects(fLeft, fTop, fRight, fBottom,
717 r.fLeft, r.fTop, r.fRight, r.fBottom);
724 return Intersects(a.fLeft, a.fTop, a.fRight, a.fBottom,
725 b.fLeft, b.fTop, b.fRight, b.fBottom);
740 this->join(r.fLeft, r.fTop, r.fRight, r.fBottom);
746 if (fLeft >= fRight || fTop >= fBottom) {
760 fRight = SkMaxScalar(fRight, r.right());
766 * following will be true: fLeft <= x <= fRight && fTop <= y <= fBottom.
770 * contains(x,y) -> fLeft <= x < fRight && fTop <= y < fBottom. Also note
775 fRight = SkMaxScalar(x, fRight);
803 fRight >= r.fRight && fBottom >= r.fBottom;
813 fRight >= SkIntToScalar(r.fRight) && fBottom >= SkIntToScalar(r.fBottom);
823 SkScalarRoundToInt(fRight), SkScalarRoundToInt(fBottom));
833 SkScalarCeilToInt(fRight), SkScalarCeilToInt(fBottom));
845 SkScalarCeilToScalar(fRight),
858 SkScalarFloorToInt(fRight), SkScalarFloorToInt(fBottom));
882 if (fLeft > fRight) {
883 SkTSwap<SkScalar>(fLeft, fRight);
904 (SkScalar)fRight >= r.fRight && (SkScalar)fBottom >= r.fBottom;
