Lines Matching defs: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; }
87 int centerX() const { return (fRight + fLeft) >> 1; }
101 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; }
103 bool isLargest() const { return SK_MinS32 == fLeft &&
117 return SkIsS16(fLeft) && SkIsS16(fTop) &&
126 fLeft = left;
137 fLeft = x;
147 fLeft = fTop = SK_MinS32;
152 * Make the largest representable rectangle, but inverted (e.g. fLeft will
156 fLeft = fTop = SK_MaxS32;
164 return MakeLTRB(fLeft + dx, fTop + dy, fRight + dx, fBottom + dy);
171 return MakeLTRB(fLeft + dx, fTop + dy, fRight - dx, fBottom - dy);
178 fLeft += dx;
192 fRight += newX - fLeft;
194 fLeft = newX;
203 fLeft += dx;
217 return l >= fRight || fLeft >= r || t >= fBottom || fTop >= b;
226 return (unsigned)(x - fLeft) < (unsigned)(fRight - fLeft) &&
235 fLeft <= left && fTop <= top &&
243 fLeft <= r.fLeft && fTop <= r.fTop &&
255 SkASSERT(fLeft < fRight && fTop < fBottom);
258 return fLeft <= left && fTop <= top &&
263 return containsNoEmptyCheck(r.fLeft, r.fTop, r.fRight, r.fBottom);
272 return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom);
283 a.fLeft < b.fRight && b.fLeft < a.fRight &&
285 fLeft = SkMax32(a.fLeft, b.fLeft);
304 if (a.fLeft < b.fRight && b.fLeft < a.fRight &&
306 fLeft = SkMax32(a.fLeft, b.fLeft);
322 fLeft < right && left < fRight && fTop < bottom && top < fBottom) {
323 if (fLeft < left) fLeft = left;
336 a.fLeft < b.fRight && b.fLeft < a.fRight &&
346 return a.fLeft < b.fRight && b.fLeft < a.fRight &&
361 this->join(r.fLeft, r.fTop, r.fRight, r.fBottom);
380 SkScalar fLeft, fTop, fRight, fBottom;
421 r.set(SkIntToScalar(irect.fLeft),
430 r.set(SkIntToScalar(irect.fLeft),
440 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; }
442 bool isLargest() const { return SK_ScalarMin == fLeft &&
454 accum *= fLeft;
467 SkScalar x() const { return fLeft; }
469 SkScalar left() const { return fLeft; }
473 SkScalar width() const { return fRight - fLeft; }
475 SkScalar centerX() const { return SkScalarHalf(fLeft + fRight); }
496 fLeft = SkIntToScalar(src.fLeft);
503 fLeft = left;
517 fLeft = SkIntToScalar(left);
528 fLeft = fTop = 0;
557 fLeft = SkMinScalar(p0.fX, p1.fX);
564 fLeft = x;
571 fLeft = 0;
581 fLeft = fTop = SK_ScalarMin;
586 * Make the largest representable rectangle, but inverted (e.g. fLeft will
590 fLeft = fTop = SK_ScalarMax;
598 return MakeLTRB(fLeft + dx, fTop + dy, fRight + dx, fBottom + dy);
605 return MakeLTRB(fLeft + dx, fTop + dy, fRight - dx, fBottom - dy);
612 fLeft += dx;
626 fRight += newX - fLeft;
628 fLeft = newX;
638 fLeft += dx;
672 fLeft < fRight && fTop < fBottom &&
674 fLeft < right && left < fRight &&
689 a.fLeft < b.fRight && b.fLeft < a.fRight &&
705 this->join(r.fLeft, r.fTop, r.fRight, r.fBottom);
712 * following will be true: fLeft <= x <= fRight && fTop <= y <= fBottom.
716 * contains(x,y) -> fLeft <= x < fRight && fTop <= y < fBottom. Also note
720 fLeft = SkMinScalar(x, fLeft);
748 fLeft <= r.fLeft && fTop <= r.fTop &&
758 dst->set(SkScalarRoundToInt(fLeft), SkScalarRoundToInt(fTop),
776 dst->set(SkDScalarRoundToInt(fLeft), SkDScalarRoundToInt(fTop),
786 dst->set(SkScalarFloorToInt(fLeft), SkScalarFloorToInt(fTop),
796 this->set(SkScalarFloorToScalar(fLeft),
810 dst->set(SkScalarCeilToInt(fLeft), SkScalarCeilToInt(fTop),
835 const SkScalar* asScalars() const { return &fLeft; }
843 SkDebugf("{ l: %f, t: %f, r: %f, b: %f }", fLeft, fTop, fRight, fBottom);