Lines Matching refs:left
125 int left = current->left;
131 // iterating over previous span RTL, quit if it's too far left
132 if (prev->right <= left) break;
134 if (prev->right > left && prev->right < right) {
139 if (prev->left > left && prev->left < right) {
140 dst.add(Rect(prev->left, top, right, bottom));
141 right = prev->left;
144 // if an entry in the previous span is too far right, nothing further left in the
146 if (prev->left >= right) {
151 if (prev->left >= right) break;
153 if (prev->left > left && prev->left < right) {
154 dst.add(Rect(left, top, prev->left, bottom));
155 left = prev->left;
158 if (prev->right > left && prev->right < right) {
159 dst.add(Rect(left, top, prev->right, bottom));
160 left = prev->right;
162 // if an entry in the previous span is too far left, nothing further right in the
164 if (prev->right <= left) {
170 if (left < right) {
171 dst.add(Rect(left, top, right, bottom));
415 bounds.left = 0;
423 // rect.left, rect.top, rect.right, rect.bottom);
427 } else if (cur->right == rect.left) {
448 if ((p->left != q->left) || (p->right != q->right)) {
464 bounds.left = min(span.itemAt(0).left, bounds.left);
495 b.left = b.left < cur->left ? b.left : cur->left;
507 } else if (cur->left < prev->right) {
527 b.left, b.top, b.right, b.bottom,
528 reg.getBounds().left, reg.getBounds().top,
579 lhs_rects[i].left + dx,
587 rhs_rects[i].left + dx,
613 head->left != it.rect().fLeft ||
658 op, rhs.left, rhs.top, rhs.right, rhs.bottom);
806 head->left, head->top, head->right, head->bottom);
820 head->left, head->top, head->right, head->bottom);