Rect.h revision ec31f83bd3af1f900d1ee9116b15f56904c66dcd
1/* 2 * Copyright (C) 2010 The Android Open Source Project 3 * 4 * Licensed under the Apache License, Version 2.0 (the "License"); 5 * you may not use this file except in compliance with the License. 6 * You may obtain a copy of the License at 7 * 8 * http://www.apache.org/licenses/LICENSE-2.0 9 * 10 * Unless required by applicable law or agreed to in writing, software 11 * distributed under the License is distributed on an "AS IS" BASIS, 12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 13 * See the License for the specific language governing permissions and 14 * limitations under the License. 15 */ 16 17#ifndef ANDROID_HWUI_RECT_H 18#define ANDROID_HWUI_RECT_H 19 20#include <cmath> 21 22#include <utils/Log.h> 23 24namespace android { 25namespace uirenderer { 26 27/////////////////////////////////////////////////////////////////////////////// 28// Structs 29/////////////////////////////////////////////////////////////////////////////// 30 31class Rect { 32public: 33 float left; 34 float top; 35 float right; 36 float bottom; 37 38 // Used by Region 39 typedef float value_type; 40 41 // we don't provide copy-ctor and operator= on purpose 42 // because we want the compiler generated versions 43 44 inline Rect(): 45 left(0), 46 top(0), 47 right(0), 48 bottom(0) { 49 } 50 51 inline Rect(float left, float top, float right, float bottom): 52 left(left), 53 top(top), 54 right(right), 55 bottom(bottom) { 56 } 57 58 inline Rect(float width, float height): 59 left(0.0f), 60 top(0.0f), 61 right(width), 62 bottom(height) { 63 } 64 65 friend int operator==(const Rect& a, const Rect& b) { 66 return !memcmp(&a, &b, sizeof(a)); 67 } 68 69 friend int operator!=(const Rect& a, const Rect& b) { 70 return memcmp(&a, &b, sizeof(a)); 71 } 72 73 inline void clear() { 74 left = top = right = bottom = 0.0f; 75 } 76 77 inline bool isEmpty() const { 78 // this is written in such way this it'll handle NANs to return 79 // true (empty) 80 return !((left < right) && (top < bottom)); 81 } 82 83 inline void setEmpty() { 84 left = top = right = bottom = 0.0f; 85 } 86 87 inline void set(float left, float top, float right, float bottom) { 88 this->left = left; 89 this->right = right; 90 this->top = top; 91 this->bottom = bottom; 92 } 93 94 inline void set(const Rect& r) { 95 set(r.left, r.top, r.right, r.bottom); 96 } 97 98 inline float getWidth() const { 99 return right - left; 100 } 101 102 inline float getHeight() const { 103 return bottom - top; 104 } 105 106 bool intersects(float l, float t, float r, float b) const { 107 return !intersectWith(l, t, r, b).isEmpty(); 108 } 109 110 bool intersects(const Rect& r) const { 111 return intersects(r.left, r.top, r.right, r.bottom); 112 } 113 114 bool intersect(float l, float t, float r, float b) { 115 Rect tmp(intersectWith(l, t, r, b)); 116 if (!tmp.isEmpty()) { 117 set(tmp); 118 return true; 119 } 120 return false; 121 } 122 123 bool intersect(const Rect& r) { 124 return intersect(r.left, r.top, r.right, r.bottom); 125 } 126 127 bool contains(float l, float t, float r, float b) { 128 return l >= left && t >= top && r <= right && b <= bottom; 129 } 130 131 bool contains(const Rect& r) { 132 return contains(r.left, r.top, r.right, r.bottom); 133 } 134 135 bool unionWith(const Rect& r) { 136 if (r.left < r.right && r.top < r.bottom) { 137 if (left < right && top < bottom) { 138 if (left > r.left) left = r.left; 139 if (top > r.top) top = r.top; 140 if (right < r.right) right = r.right; 141 if (bottom < r.bottom) bottom = r.bottom; 142 return true; 143 } else { 144 left = r.left; 145 top = r.top; 146 right = r.right; 147 bottom = r.bottom; 148 return true; 149 } 150 } 151 return false; 152 } 153 154 void translate(float dx, float dy) { 155 left += dx; 156 right += dx; 157 top += dy; 158 bottom += dy; 159 } 160 161 void snapToPixelBoundaries() { 162 left = floorf(left + 0.5f); 163 top = floorf(top + 0.5f); 164 right = floorf(right + 0.5f); 165 bottom = floorf(bottom + 0.5f); 166 } 167 168 void dump() const { 169 LOGD("Rect[l=%f t=%f r=%f b=%f]", left, top, right, bottom); 170 } 171 172private: 173 static inline float min(float a, float b) { return (a < b) ? a : b; } 174 static inline float max(float a, float b) { return (a > b) ? a : b; } 175 176 Rect intersectWith(float l, float t, float r, float b) const { 177 Rect tmp; 178 tmp.left = max(left, l); 179 tmp.top = max(top, t); 180 tmp.right = min(right, r); 181 tmp.bottom = min(bottom, b); 182 return tmp; 183 } 184 185}; // class Rect 186 187}; // namespace uirenderer 188}; // namespace android 189 190#endif // ANDROID_HWUI_RECT_H 191