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);
332 fLeft < right && left < fRight && fTop < bottom && top < fBottom) {
333 if (fLeft < left) fLeft = left;
346 a.fLeft < b.fRight && b.fLeft < a.fRight &&
356 return a.fLeft < b.fRight && b.fLeft < a.fRight &&
371 this->join(r.fLeft, r.fTop, r.fRight, r.fBottom);
380 if (fLeft > fRight) {
381 SkTSwap<int32_t>(fLeft, fRight);
392 return MakeLTRB(SkMin32(fLeft, fRight), SkMin32(fTop, fBottom),
393 SkMax32(fLeft, fRight), SkMax32(fTop, fBottom));
405 SkScalar fLeft, fTop, fRight, fBottom;
449 r.set(SkIntToScalar(irect.fLeft),
462 r.set(SkIntToScalar(irect.fLeft),
472 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; }
477 bool isSorted() const { return fLeft <= fRight && fTop <= fBottom; }
479 bool isLargest() const { return SK_ScalarMin == fLeft &&
490 accum *= fLeft;
503 SkScalar x() const { return fLeft; }
505 SkScalar left() const { return fLeft; }
509 SkScalar width() const { return fRight - fLeft; }
511 SkScalar centerX() const { return SkScalarHalf(fLeft + fRight); }
532 fLeft = SkIntToScalar(src.fLeft);
539 fLeft = left;
553 fLeft = SkIntToScalar(left);
564 fLeft = fTop = 0;
593 fLeft = SkMinScalar(p0.fX, p1.fX);
600 fLeft = x;
607 fLeft = 0;
617 fLeft = fTop = SK_ScalarMin;
622 * Make the largest representable rectangle, but inverted (e.g. fLeft will
626 fLeft = fTop = SK_ScalarMax;
634 return MakeLTRB(fLeft + dx, fTop + dy, fRight + dx, fBottom + dy);
641 return MakeLTRB(fLeft + dx, fTop + dy, fRight - dx, fBottom - dy);
648 return MakeLTRB(fLeft - dx, fTop - dy, fRight + dx, fBottom + dy);
655 fLeft += dx;
669 fRight += newX - fLeft;
671 fLeft = newX;
681 fLeft += dx;
731 return Intersects(fLeft, fTop, fRight, fBottom, left, top, right, bottom);
735 return Intersects(fLeft, fTop, fRight, fBottom,
736 r.fLeft, r.fTop, r.fRight, r.fBottom);
743 return Intersects(a.fLeft, a.fTop, a.fRight, a.fBottom,
744 b.fLeft, b.fTop, b.fRight, b.fBottom);
759 this->join(r.fLeft, r.fTop, r.fRight, r.fBottom);
765 if (fLeft >= fRight || fTop >= fBottom) {
777 fLeft = SkMinScalar(fLeft, r.left());
785 * following will be true: fLeft <= x <= fRight && fTop <= y <= fBottom.
789 * contains(x,y) -> fLeft <= x < fRight && fTop <= y < fBottom. Also note
793 fLeft = SkMinScalar(x, fLeft);
821 fLeft <= r.fLeft && fTop <= r.fTop &&
831 fLeft <= SkIntToScalar(r.fLeft) && fTop <= SkIntToScalar(r.fTop) &&
841 dst->set(SkScalarRoundToInt(fLeft), SkScalarRoundToInt(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);
914 return MakeLTRB(SkMinScalar(fLeft, fRight), SkMinScalar(fTop, fBottom),
915 SkMaxScalar(fLeft, fRight), SkMaxScalar(fTop, fBottom));
921 const SkScalar* asScalars() const { return &fLeft; }
930 (SkScalar)fLeft <= r.fLeft && (SkScalar)fTop <= r.fTop &&
