49     public int left;  field in Rect
84     public Rect(int left, int top, int right, int bottom) {  in Rect()  argument
85         this.left = left;  in Rect()
100             left = top = right = bottom = 0;  in Rect()
102             left = r.left;  in Rect()
114             left = top = right = bottom = 0;  in Rect()
116             left = r.left;  in Rect()
139         return left == r.left && top == r.top && right == r.right && bottom == r.bottom;  in equals()
144         int result = left;  in hashCode()
154         sb.append("Rect("); sb.append(left); sb.append(", ");  in toString()
175         sb.append('['); sb.append(left); sb.append(',');  in toShortString()
194         sb.append(left);  in flattenToString()
230         pw.print('['); pw.print(left); pw.print(',');  in printShortString()
245         protoOutputStream.write(RectProto.LEFT, left);  in dumpDebug()
267                         left = proto.readInt(RectProto.LEFT);  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
367         this.left = left;  in set()
380         this.left = src.left;  in set()
394         left += dx;  in offset()
408         right += newLeft - left;  in offsetTo()
410         left = newLeft;  in offsetTo()
424         left += dx;  in inset()
437         left += insets.left;  in inset()
449         left += insets.left;  in inset()
463     public void inset(int left, int top, int right, int bottom) {  in inset()  argument
464         this.left += left;  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()
542             if (this.left < left) this.left = left;  in intersect()
564         return intersect(r.left, r.top, r.right, r.bottom);  in intersect()
574         left = Math.max(left, other.left);  in intersectUnchecked()
594         if (a.left < b.right && b.left < a.right && a.top < b.bottom && b.top < a.bottom) {  in setIntersect()
595             left = Math.max(a.left, b.left);  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()
649                 if (this.left > left) this.left = left;  in union()
654                 this.left = left;  in union()
670         union(r.left, r.top, r.right, r.bottom);  in union()
681         if (x < left) {  in union()
682             left = x;  in union()
701         if (left > right) {  in sort()
702             int temp = left;  in sort()
703             left = right;  in sort()
723             split.left = left + (splitWidth * i);  in splitVertically()
725             split.right = split.left + splitWidth;  in splitVertically()
740             split.left = left;  in splitHorizontally()
762         out.writeInt(left);  in writeToParcel()
795         left = in.readInt();  in readFromParcel()
808             left = (int) (left * scale + 0.5f);  in scale()