51     public int right;  field in Rect
84     public Rect(int left, int top, int right, int bottom) {  in Rect()  argument
87         this.right = right;  in Rect()
100             left = top = right = bottom = 0;  in Rect()
104             right = r.right;  in Rect()
114             left = top = right = bottom = 0;  in Rect()
118             right = r.right;  in Rect()
139         return left == r.left && top == r.top && right == r.right && bottom == r.bottom;  in equals()
146         result = 31 * result + right;  in hashCode()
155         sb.append(top); sb.append(" - "); sb.append(right);  in toString()
176         sb.append(top); sb.append("]["); sb.append(right);  in toShortString()
198         sb.append(right);  in flattenToString()
231         pw.print(top); pw.print("]["); pw.print(right);  in printShortString()
247         protoOutputStream.write(RectProto.RIGHT, right);  in dumpDebug()
273                         right = proto.readInt(RectProto.RIGHT);  in readFromProto()
290         return left >= right || top >= bottom;  in isEmpty()
298         return left <= right && top <= bottom;  in isValid()
306         return right - left;  in width()
323         return (left + right) >> 1;  in centerX()
339         return (left + right) * 0.5f;  in exactCenterX()
353         left = right = top = bottom = 0;  in setEmpty()
366     public void set(int left, int top, int right, int bottom) {  in set()  argument
369         this.right = right;  in set()
382         this.right = src.right;  in set()
396         right += dx;  in offset()
408         right += newLeft - left;  in offsetTo()
426         right -= dx;  in inset()
439         right -= insets.right;  in inset()
451         right -= insets.right;  in inset()
463     public void inset(int left, int top, int right, int bottom) {  in inset()  argument
466         this.right -= right;  in inset()
482         return left < right && top < bottom  // check for empty first  in contains()
483                && x >= left && x < right && y >= top && y < bottom;  in contains()
498     public boolean contains(int left, int top, int right, int bottom) {  in contains()  argument
500         return this.left < this.right && this.top < this.bottom  in contains()
503                 && this.right >= right && this.bottom >= bottom;  in contains()
516         return this.left < this.right && this.top < this.bottom  in contains()
518                && left <= r.left && top <= r.top && right >= r.right && bottom >= r.bottom;  in contains()
540     public boolean intersect(int left, int top, int right, int bottom) {  in intersect()  argument
541         if (this.left < right && left < this.right && this.top < bottom && top < this.bottom) {  in intersect()
544             if (this.right > right) this.right = right;  in intersect()
564         return intersect(r.left, r.top, r.right, r.bottom);  in intersect()
576         right = Math.min(right, other.right);  in intersectUnchecked()
594         if (a.left < b.right && b.left < a.right && a.top < b.bottom && b.top < a.bottom) {  in setIntersect()
597             right = Math.min(a.right, b.right);  in setIntersect()
618     public boolean intersects(int left, int top, int right, int bottom) {  in intersects()  argument
619         return this.left < right && left < this.right && this.top < bottom && top < this.bottom;  in intersects()
633         return a.left < b.right && b.left < a.right && a.top < b.bottom && b.top < a.bottom;  in intersects()
646     public void union(int left, int top, int right, int bottom) {  in union()  argument
647         if ((left < right) && (top < bottom)) {  in union()
648             if ((this.left < this.right) && (this.top < this.bottom)) {  in union()
651                 if (this.right < right) this.right = right;  in union()
656                 this.right = right;  in union()
670         union(r.left, r.top, r.right, r.bottom);  in union()
683         } else if (x > right) {  in union()
684             right = x;  in union()
701         if (left > right) {  in sort()
703             left = right;  in sort()
704             right = temp;  in sort()
725             split.right = split.left + splitWidth;  in splitVertically()
742             split.right = right;  in splitHorizontally()
764         out.writeInt(right);  in writeToParcel()
797         right = in.readInt();  in readFromParcel()
810             right = (int) (right * scale + 0.5f);  in scale()