Lines Matching defs:right

127         int right = current->right;
133 if (prev->right <= left) break;
135 if (prev->right > left && prev->right < right) {
136 dst.add(Rect(prev->right, top, right, bottom));
137 right = prev->right;
140 if (prev->left > left && prev->left < right) {
141 dst.add(Rect(prev->left, top, right, bottom));
142 right = prev->left;
145 // if an entry in the previous span is too far right, nothing further left in the
147 if (prev->left >= right) {
151 // iterating over previous span LTR, quit if it's too far right
152 if (prev->left >= right) break;
154 if (prev->left > left && prev->left < right) {
159 if (prev->right > left && prev->right < right) {
160 dst.add(Rect(left, top, prev->right, bottom));
161 left = prev->right;
163 // if an entry in the previous span is too far left, nothing further right in the
165 if (prev->right <= left) {
171 if (left < right) {
172 dst.add(Rect(left, top, right, bottom));
233 if (y >= cur->top && y < cur->bottom && x >= cur->left && x < cur->right) {
433 bounds.right = 0;
440 // rect.left, rect.top, rect.right, rect.bottom);
444 } else if (cur->right == rect.left) {
445 cur->right = rect.right;
465 if ((p->left != q->left) || (p->right != q->right)) {
482 bounds.right = max(span.top().right, bounds.right);
503 if (cur->right > region_operator<Rect>::max_value) {
504 ALOGE_IF(!silent, "%s: rect->right > max_value", name);
508 ALOGE_IF(!silent, "%s: rect->right > max_value", name);
514 b.right = b.right > cur->right ? b.right : cur->right;
524 } else if (cur->left < prev->right) {
544 b.left, b.top, b.right, b.bottom,
546 reg.getBounds().right, reg.getBounds().bottom);
598 lhs_rects[i].right + dx,
606 rhs_rects[i].right + dx,
632 head->right != it.rect().fRight ||
675 op, rhs.left, rhs.top, rhs.right, rhs.bottom);
823 head->left, head->top, head->right, head->bottom);
837 head->left, head->top, head->right, head->bottom);