Lines Matching refs:fLeft
21 int32_t fLeft, fTop, fRight, fBottom;
59 int left() const { return fLeft; }
65 int x() const { return fLeft; }
72 int width() const { return fRight - fLeft; }
89 int centerX() const { return (fRight + fLeft) >> 1; }
103 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; }
105 bool isLargest() const { return SK_MinS32 == fLeft &&
119 return SkIsS16(fLeft) && SkIsS16(fTop) &&
128 fLeft = left;
139 fLeft = x;
149 fLeft = fTop = SK_MinS32;
154 * Make the largest representable rectangle, but inverted (e.g. fLeft will
158 fLeft = fTop = SK_MaxS32;
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);
187 fLeft += dx;
201 fRight += newX - fLeft;
203 fLeft = newX;
212 fLeft += dx;
226 return l >= fRight || fLeft >= r || t >= fBottom || fTop >= b;
235 return (unsigned)(x - fLeft) < (unsigned)(fRight - fLeft) &&
244 fLeft <= left && fTop <= top &&
252 fLeft <= r.fLeft && fTop <= r.fTop &&
268 SkASSERT(fLeft < fRight && fTop < fBottom);
271 return fLeft <= left && fTop <= top &&
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 &&
296 fLeft = SkMax32(a.fLeft, b.fLeft);
314 if (a.fLeft < b.fRight && b.fLeft < a.fRight &&
316 fLeft = SkMax32(a.fLeft, b.fLeft);
333 fLeft < right && left < fRight && fTop < bottom && top < fBottom) {
334 if (fLeft < left) fLeft = left;
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;
438 r.set(SkIntToScalar(irect.fLeft),
447 r.set(SkIntToScalar(irect.fLeft),
457 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; }
459 bool isLargest() const { return SK_ScalarMin == fLeft &&
471 accum *= fLeft;
484 SkScalar x() const { return fLeft; }
486 SkScalar left() const { return fLeft; }
490 SkScalar width() const { return fRight - fLeft; }
492 SkScalar centerX() const { return SkScalarHalf(fLeft + fRight); }
513 fLeft = SkIntToScalar(src.fLeft);
520 fLeft = left;
534 fLeft = SkIntToScalar(left);
545 fLeft = fTop = 0;
574 fLeft = SkMinScalar(p0.fX, p1.fX);
581 fLeft = x;
588 fLeft = 0;
598 fLeft = fTop = SK_ScalarMin;
603 * Make the largest representable rectangle, but inverted (e.g. fLeft will
607 fLeft = fTop = SK_ScalarMax;
615 return MakeLTRB(fLeft + dx, fTop + dy, fRight + dx, fBottom + dy);
622 return MakeLTRB(fLeft + dx, fTop + dy, fRight - dx, fBottom - dy);
629 return MakeLTRB(fLeft - dx, fTop - dy, fRight + dx, fBottom + dy);
636 fLeft += dx;
650 fRight += newX - fLeft;
652 fLeft = newX;
662 fLeft += dx;
713 return Intersects(fLeft, fTop, fRight, fBottom, left, top, right, bottom);
717 return Intersects(fLeft, fTop, fRight, fBottom,
718 r.fLeft, r.fTop, r.fRight, r.fBottom);
725 return Intersects(a.fLeft, a.fTop, a.fRight, a.fBottom,
726 b.fLeft, b.fTop, b.fRight, b.fBottom);
741 this->join(r.fLeft, r.fTop, r.fRight, r.fBottom);
747 if (fLeft >= fRight || fTop >= fBottom) {
759 fLeft = SkMinScalar(fLeft, r.left());
767 * following will be true: fLeft <= x <= fRight && fTop <= y <= fBottom.
771 * contains(x,y) -> fLeft <= x < fRight && fTop <= y < fBottom. Also note
775 fLeft = SkMinScalar(x, fLeft);
803 fLeft <= r.fLeft && fTop <= r.fTop &&
813 fLeft <= SkIntToScalar(r.fLeft) && fTop <= SkIntToScalar(r.fTop) &&
823 dst->set(SkScalarRoundToInt(fLeft), SkScalarRoundToInt(fTop),
841 dst->set(SkDScalarRoundToInt(fLeft), SkDScalarRoundToInt(fTop),
851 dst->set(SkScalarFloorToInt(fLeft), SkScalarFloorToInt(fTop),
862 dst->set(SkScalarFloorToScalar(fLeft),
876 dst->set(SkScalarCeilToInt(fLeft), SkScalarCeilToInt(fTop),
901 if (fLeft > fRight) {
902 SkTSwap<SkScalar>(fLeft, fRight);
913 const SkScalar* asScalars() const { return &fLeft; }
922 (SkScalar)fLeft <= r.fLeft && (SkScalar)fTop <= r.fTop &&
