Lines Matching refs:left

128         int left = current->left;
137 // iterating over previous span RTL, quit if it's too far left
138 if (prev.right <= left) break;
140 if (prev.right > left && prev.right < right) {
145 if (prev.left > left && prev.left < right) {
146 dst.add(Rect(prev.left, top, right, bottom));
147 right = prev.left;
150 // if an entry in the previous span is too far right, nothing further left in the
152 if (prev.left >= right) {
157 if (prev.left >= right) break;
159 if (prev.left > left && prev.left < right) {
160 dst.add(Rect(left, top, prev.left, bottom));
161 left = prev.left;
164 if (prev.right > left && prev.right < right) {
165 dst.add(Rect(left, top, prev.right, bottom));
166 left = prev.right;
168 // if an entry in the previous span is too far left, nothing further right in the
170 if (prev.right <= left) {
176 if (left < right) {
177 dst.add(Rect(left, top, right, bottom));
238 if (y >= cur->top && y < cur->bottom && x >= cur->left && x < cur->right) {
457 bounds.left = 0;
466 // rect.left, rect.top, rect.right, rect.bottom);
470 } else if (cur->right == rect.left) {
488 if ((p->left != q->left) || (p->right != q->right)) {
504 bounds.left = min(span.itemAt(0).left, bounds.left);
538 b.left = b.left < cur->left ? b.left : cur->left;
550 } else if (cur->left < prev->right) {
570 b.left, b.top, b.right, b.bottom,
571 reg.getBounds().left, reg.getBounds().top,
622 lhs_rects[i].left + dx,
630 rhs_rects[i].left + dx,
656 head->left != it.rect().fLeft ||
703 op, rhs.left, rhs.top, rhs.right, rhs.bottom);
853 out.appendFormat(" [%3d, %3d, %3d, %3d]\n", head->left, head->top,
866 head->left, head->top, head->right, head->bottom);