Lines Matching refs:bottom
27 * represented by the coordinates of its 4 edges (left, top, right bottom).
30 * the coordinates are sorted correctly (i.e. left <= right and top <= bottom).
36 public float bottom;
46 * top <= bottom.
51 * @param bottom The Y coordinate of the bottom of the rectangle
53 public RectF(float left, float top, float right, float bottom) {
57 this.bottom = bottom;
69 left = top = right = bottom = 0.0f;
74 bottom = r.bottom;
80 left = top = right = bottom = 0.0f;
85 bottom = r.bottom;
95 return left == r.left && top == r.top && right == r.right && bottom == r.bottom;
103 result = 31 * result + (bottom != +0.0f ? Float.floatToIntBits(bottom) : 0);
109 + right + ", " + bottom + ")";
127 sb.append(','); sb.append(bottom); sb.append(']');
138 pw.print(','); pw.print(bottom); pw.print(']');
142 * Returns true if the rectangle is empty (left >= right or top >= bottom)
145 return left >= right || top >= bottom;
158 * (i.e. top <= bottom) so the result may be negative.
161 return bottom - top;
174 * a valid rectangle (i.e. top <= bottom)
177 return (top + bottom) * 0.5f;
184 left = right = top = bottom = 0;
190 * left <= right and top <= bottom.
195 * @param bottom The Y coordinate of the bottom of the rectangle
197 public void set(float left, float top, float right, float bottom) {
201 this.bottom = bottom;
214 this.bottom = src.bottom;
227 this.bottom = src.bottom;
232 * adding dy to its top and bottom coordinates.
235 * @param dy The amount to add to the rectangle's top and bottom coordinates
241 bottom += dy;
253 bottom += newTop - top;
262 * for dy and the top and bottom.
265 * @param dy The amount to add(subtract) from the rectangle's top(bottom)
271 bottom -= dy;
276 * considered to be inside, while the right and bottom are not. This means
277 * that for a x,y to be contained: left <= x < right and top <= y < bottom.
283 * means left <= x < right and top <= y < bottom
286 return left < right && top < bottom // check for empty first
287 && x >= left && x < right && y >= top && y < bottom;
298 * @param bottom The bottom of the rectangle being tested for containment
302 public boolean contains(float left, float top, float right, float bottom) {
304 return this.left < this.right && this.top < this.bottom
307 && this.right >= right && this.bottom >= bottom;
320 return this.left < this.right && this.top < this.bottom
323 && right >= r.right && bottom >= r.bottom;
327 * If the rectangle specified by left,top,right,bottom intersects this
338 * @param bottom The bottom of the rectangle being intersected with this
344 public boolean intersect(float left, float top, float right, float bottom) {
346 && this.top < bottom && top < this.bottom) {
356 if (this.bottom > bottom) {
357 this.bottom = bottom;
376 return intersect(r.left, r.top, r.right, r.bottom);
393 && a.top < b.bottom && b.top < a.bottom) {
397 bottom = Math.min(a.bottom, b.bottom);
413 * @param bottom The bottom of the rectangle being tested for intersection
418 float bottom) {
420 && this.top < bottom && top < this.bottom;
435 && a.top < b.bottom && b.top < a.bottom;
444 FastMath.round(right), FastMath.round(bottom));
449 * floor of top and left, and the ceiling of right and bottom.
453 (int) Math.ceil(right), (int) Math.ceil(bottom));
464 * @param bottom The bottom edge being unioned with this rectangle
466 public void union(float left, float top, float right, float bottom) {
467 if ((left < right) && (top < bottom)) {
468 if ((this.left < this.right) && (this.top < this.bottom)) {
475 if (this.bottom < bottom)
476 this.bottom = bottom;
481 this.bottom = bottom;
494 union(r.left, r.top, r.right, r.bottom);
512 } else if (y > bottom) {
513 bottom = y;
518 * Swap top/bottom or left/right if there are flipped (i.e. left > right
519 * and/or top > bottom). This can be called if
521 * If the edges are already correct (i.e. left <= right and top <= bottom)
530 if (top > bottom) {
532 top = bottom;
533 bottom = temp;
553 out.writeFloat(bottom);
584 bottom = in.readFloat();