Lines Matching refs:left
87 int left() const { return fLeft; }
281 x -= fBounds.left();
339 // we should always consider [x, x+1] as the left-most column and [x+1, x+1+width]
352 // leftAlpha is 0, ignore the left column
531 iterLeft = iter.left();
536 int leftA = iterA.left();
538 int leftB = iterB.left();
546 int left, rite;
549 left = leftA;
557 left = leftB;
565 left = leftA; // or leftB, since leftA == leftB
571 if (left >= fBounds.fRight) {
578 if (left >= fBounds.fLeft) {
579 SkASSERT(rite > left);
580 this->addRun(left, lastY, proc(alphaA, alphaB), rite - left);
803 int fLeft; // cache of builder's bounds' left edge
964 // Count the number of zeros on the left and right edges of the passed in
1003 // modify row in place, trimming off (zeros) from the left and right sides.
1004 // return the number of bytes that were completely eliminated from the left
1063 // number of zeros on the left and right of the clip. This information
1585 bool SkAAClip::quickContains(int left, int top, int right, int bottom) const {
1589 if (!fBounds.contains(SkIRect{left, top, right, bottom})) {
1600 row = this->findX(row, left, &count);
1602 int rectWidth = right - left;