50     public int top;  field in Rect
84     public Rect(int left, int top, int right, int bottom) {  in Rect()  argument
86         this.top = top;  in Rect()
100             left = top = right = bottom = 0;  in Rect()
103             top = r.top;  in Rect()
114             left = top = right = bottom = 0;  in Rect()
117             top = r.top;  in Rect()
139         return left == r.left && top == r.top && right == r.right && bottom == r.bottom;  in equals()
145         result = 31 * result + top;  in hashCode()
155         sb.append(top); sb.append(" - "); sb.append(right);  in toString()
176         sb.append(top); sb.append("]["); sb.append(right);  in toShortString()
196         sb.append(top);  in flattenToString()
231         pw.print(top); pw.print("]["); pw.print(right);  in printShortString()
246         protoOutputStream.write(RectProto.TOP, top);  in dumpDebug()
270                         top = proto.readInt(RectProto.TOP);  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
368         this.top = top;  in set()
381         this.top = src.top;  in set()
395         top += dy;  in offset()
409         bottom += newTop - top;  in offsetTo()
411         top = newTop;  in offsetTo()
425         top += dy;  in inset()
438         top += insets.top;  in inset()
450         top += insets.top;  in inset()
463     public void inset(int left, int top, int right, int bottom) {  in inset()  argument
465         this.top += top;  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()
502                 && this.left <= left && this.top <= top  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()
543             if (this.top < top) this.top = top;  in intersect()
564         return intersect(r.left, r.top, r.right, r.bottom);  in intersect()
575         top = Math.max(top, other.top);  in intersectUnchecked()
594         if (a.left < b.right && b.left < a.right && a.top < b.bottom && b.top < a.bottom) {  in setIntersect()
596             top = Math.max(a.top, b.top);  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()
650                 if (this.top > top) this.top = top;  in union()
655                 this.top = top;  in union()
670         union(r.left, r.top, r.right, r.bottom);  in union()
686         if (y < top) {  in union()
687             top = y;  in union()
706         if (top > bottom) {  in sort()
707             int temp = top;  in sort()
708             top = bottom;  in sort()
724             split.top = top;  in splitVertically()
741             split.top = top + (splitHeight * i);  in splitHorizontally()
743             split.bottom = split.top + splitHeight;  in splitHorizontally()
763         out.writeInt(top);  in writeToParcel()
796         top = in.readInt();  in readFromParcel()
809             top = (int) (top * scale + 0.5f);  in scale()