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; }
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 fLeft += dx;
178 fRight += newX - fLeft;
180 fLeft = newX;
189 fLeft += dx;
203 return l >= fRight || fLeft >= r || t >= fBottom || fTop >= b;
212 return (unsigned)(x - fLeft) < (unsigned)(fRight - fLeft) &&
221 fLeft <= left && fTop <= top &&
229 fLeft <= r.fLeft && fTop <= r.fTop &&
241 SkASSERT(fLeft < fRight && fTop < fBottom);
244 return fLeft <= left && fTop <= top &&
249 return containsNoEmptyCheck(r.fLeft, r.fTop, r.fRight, r.fBottom);
258 return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom);
269 a.fLeft < b.fRight && b.fLeft < a.fRight &&
271 fLeft = SkMax32(a.fLeft, b.fLeft);
290 if (a.fLeft < b.fRight && b.fLeft < a.fRight &&
292 fLeft = SkMax32(a.fLeft, b.fLeft);
308 fLeft < right && left < fRight && fTop < bottom && top < fBottom) {
309 if (fLeft < left) fLeft = left;
322 a.fLeft < b.fRight && b.fLeft < a.fRight &&
332 return a.fLeft < b.fRight && b.fLeft < a.fRight &&
347 this->join(r.fLeft, r.fTop, r.fRight, r.fBottom);
366 SkScalar fLeft, fTop, fRight, fBottom;
401 r.set(SkIntToScalar(irect.fLeft),
410 r.set(SkIntToScalar(irect.fLeft),
420 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; }
430 accum *= fLeft;
444 int isNaN = (SK_FixedNaN == fLeft) | (SK_FixedNaN == fTop) |
450 SkScalar x() const { return fLeft; }
452 SkScalar left() const { return fLeft; }
456 SkScalar width() const { return fRight - fLeft; }
458 SkScalar centerX() const { return SkScalarHalf(fLeft + fRight); }
478 fLeft = SkIntToScalar(src.fLeft);
485 fLeft = left;
499 fLeft = SkIntToScalar(left);
510 fLeft = fTop = 0;
539 fLeft = SkMinScalar(p0.fX, p1.fX);
546 fLeft = x;
553 fLeft = 0;
563 fLeft = fTop = SK_ScalarMin;
568 * Make the largest representable rectangle, but inverted (e.g. fLeft will
572 fLeft = fTop = SK_ScalarMax;
580 fLeft += dx;
594 fRight += newX - fLeft;
596 fLeft = newX;
606 fLeft += dx;
639 fLeft < fRight && fTop < fBottom &&
641 fLeft < right && left < fRight &&
656 a.fLeft < b.fRight && b.fLeft < a.fRight &&
672 this->join(r.fLeft, r.fTop, r.fRight, r.fBottom);
679 * following will be true: fLeft <= x <= fRight && fTop <= y <= fBottom.
683 * contains(x,y) -> fLeft <= x < fRight && fTop <= y < fBottom. Also note
687 fLeft = SkMinScalar(x, fLeft);
704 fLeft <= p.fX && p.fX < fRight && fTop <= p.fY && p.fY < fBottom;
718 fLeft <= x && x < fRight && fTop <= y && y < fBottom;
727 fLeft <= r.fLeft && fTop <= r.fTop &&
737 dst->set(SkScalarRoundToInt(fLeft), SkScalarRoundToInt(fTop),
747 dst->set(SkScalarFloorToInt(fLeft), SkScalarFloorToInt(fTop),
757 this->set(SkScalarFloorToScalar(fLeft),
771 dst->set(SkScalarCeilToInt(fLeft), SkScalarCeilToInt(fTop),
787 const SkScalar* asScalars() const { return &fLeft; }