52     public int bottom;  field in Rect
84     public Rect(int left, int top, int right, int bottom) {  in Rect()  argument
88         this.bottom = bottom;  in Rect()
100             left = top = right = bottom = 0;  in Rect()
105             bottom = r.bottom;  in Rect()
114             left = top = right = bottom = 0;  in Rect()
119             bottom = r.bottom;  in Rect()
139         return left == r.left && top == r.top && right == r.right && bottom == r.bottom;  in equals()
147         result = 31 * result + bottom;  in hashCode()
156         sb.append(", "); sb.append(bottom); sb.append(")");  in toString()
177         sb.append(','); sb.append(bottom); sb.append(']');  in toShortString()
200         sb.append(bottom);  in flattenToString()
232         pw.print(','); pw.print(bottom); pw.print(']');  in printShortString()
248         protoOutputStream.write(RectProto.BOTTOM, bottom);  in dumpDebug()
276                         bottom = proto.readInt(RectProto.BOTTOM);  in readFromProto()
290         return left >= right || top >= bottom;  in isEmpty()
298         return left <= right && top <= bottom;  in isValid()
314         return bottom - top;  in height()
332         return (top + bottom) >> 1;  in centerY()
346         return (top + bottom) * 0.5f;  in exactCenterY()
353         left = right = top = bottom = 0;  in setEmpty()
366     public void set(int left, int top, int right, int bottom) {  in set()  argument
370         this.bottom = bottom;  in set()
383         this.bottom = src.bottom;  in set()
397         bottom += dy;  in offset()
409         bottom += newTop - top;  in offsetTo()
427         bottom -= dy;  in inset()
440         bottom -= insets.bottom;  in inset()
452         bottom -= insets.bottom;  in inset()
463     public void inset(int left, int top, int right, int bottom) {  in inset()  argument
467         this.bottom -= bottom;  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()
545             if (this.bottom > bottom) this.bottom = bottom;  in intersect()
564         return intersect(r.left, r.top, r.right, r.bottom);  in intersect()
577         bottom = Math.min(bottom, other.bottom);  in intersectUnchecked()
594         if (a.left < b.right && b.left < a.right && a.top < b.bottom && b.top < a.bottom) {  in setIntersect()
598             bottom = Math.min(a.bottom, b.bottom);  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()
652                 if (this.bottom < bottom) this.bottom = bottom;  in union()
657                 this.bottom = bottom;  in union()
670         union(r.left, r.top, r.right, r.bottom);  in union()
688         } else if (y > bottom) {  in union()
689             bottom = y;  in union()
706         if (top > bottom) {  in sort()
708             top = bottom;  in sort()
709             bottom = temp;  in sort()
726             split.bottom = bottom;  in splitVertically()
743             split.bottom = split.top + splitHeight;  in splitHorizontally()
765         out.writeInt(bottom);  in writeToParcel()
798         bottom = in.readInt();  in readFromParcel()
811             bottom = (int) (bottom * scale + 0.5f);  in scale()