1 /* 2 * Copyright (C) 2007 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_UI_REGION_H 18 #define ANDROID_UI_REGION_H 19 20 #include <stdint.h> 21 #include <sys/types.h> 22 23 #include <utils/Vector.h> 24 25 #include <ui/Rect.h> 26 #include <utils/Flattenable.h> 27 28 namespace android { 29 // --------------------------------------------------------------------------- 30 31 class SharedBuffer; 32 class String8; 33 34 // --------------------------------------------------------------------------- 35 class Region : public LightFlattenable<Region> 36 { 37 public: 38 static const Region INVALID_REGION; 39 40 Region(); 41 Region(const Region& rhs); 42 explicit Region(const Rect& rhs); 43 ~Region(); 44 45 static Region createTJunctionFreeRegion(const Region& r); 46 47 Region& operator = (const Region& rhs); 48 49 inline bool isEmpty() const { return getBounds().isEmpty(); } 50 inline bool isRect() const { return mStorage.size() == 1; } 51 52 inline Rect getBounds() const { return mStorage[mStorage.size() - 1]; } 53 inline Rect bounds() const { return getBounds(); } 54 55 bool contains(const Point& point) const; 56 bool contains(int x, int y) const; 57 58 // the region becomes its bounds 59 Region& makeBoundsSelf(); 60 61 void clear(); 62 void set(const Rect& r); 63 void set(int32_t w, int32_t h); 64 void set(uint32_t w, uint32_t h); 65 66 Region& orSelf(const Rect& rhs); 67 Region& xorSelf(const Rect& rhs); 68 Region& andSelf(const Rect& rhs); 69 Region& subtractSelf(const Rect& rhs); 70 71 // boolean operators, applied on this 72 Region& orSelf(const Region& rhs); 73 Region& xorSelf(const Region& rhs); 74 Region& andSelf(const Region& rhs); 75 Region& subtractSelf(const Region& rhs); 76 77 // boolean operators 78 const Region merge(const Rect& rhs) const; 79 const Region mergeExclusive(const Rect& rhs) const; 80 const Region intersect(const Rect& rhs) const; 81 const Region subtract(const Rect& rhs) const; 82 83 // boolean operators 84 const Region merge(const Region& rhs) const; 85 const Region mergeExclusive(const Region& rhs) const; 86 const Region intersect(const Region& rhs) const; 87 const Region subtract(const Region& rhs) const; 88 89 // these translate rhs first 90 Region& translateSelf(int dx, int dy); 91 Region& orSelf(const Region& rhs, int dx, int dy); 92 Region& xorSelf(const Region& rhs, int dx, int dy); 93 Region& andSelf(const Region& rhs, int dx, int dy); 94 Region& subtractSelf(const Region& rhs, int dx, int dy); 95 96 // these translate rhs first 97 const Region translate(int dx, int dy) const; 98 const Region merge(const Region& rhs, int dx, int dy) const; 99 const Region mergeExclusive(const Region& rhs, int dx, int dy) const; 100 const Region intersect(const Region& rhs, int dx, int dy) const; 101 const Region subtract(const Region& rhs, int dx, int dy) const; 102 103 // convenience operators overloads 104 inline const Region operator | (const Region& rhs) const; 105 inline const Region operator ^ (const Region& rhs) const; 106 inline const Region operator & (const Region& rhs) const; 107 inline const Region operator - (const Region& rhs) const; 108 inline const Region operator + (const Point& pt) const; 109 110 inline Region& operator |= (const Region& rhs); 111 inline Region& operator ^= (const Region& rhs); 112 inline Region& operator &= (const Region& rhs); 113 inline Region& operator -= (const Region& rhs); 114 inline Region& operator += (const Point& pt); 115 116 117 // returns true if the regions share the same underlying storage 118 bool isTriviallyEqual(const Region& region) const; 119 120 121 /* various ways to access the rectangle list */ 122 123 124 // STL-like iterators 125 typedef Rect const* const_iterator; 126 const_iterator begin() const; 127 const_iterator end() const; 128 129 // returns an array of rect which has the same life-time has this 130 // Region object. 131 Rect const* getArray(size_t* count) const; 132 133 // returns a SharedBuffer as well as the number of rects. 134 // ownership is transfered to the caller. 135 // the caller must call SharedBuffer::release() to free the memory. 136 SharedBuffer const* getSharedBuffer(size_t* count) const; 137 138 /* no user serviceable parts here... */ 139 140 // add a rectangle to the internal list. This rectangle must 141 // be sorted in Y and X and must not make the region invalid. 142 void addRectUnchecked(int l, int t, int r, int b); 143 144 inline bool isFixedSize() const { return false; } 145 size_t getFlattenedSize() const; 146 status_t flatten(void* buffer, size_t size) const; 147 status_t unflatten(void const* buffer, size_t size); 148 149 void dump(String8& out, const char* what, uint32_t flags=0) const; 150 void dump(const char* what, uint32_t flags=0) const; 151 152 private: 153 class rasterizer; 154 friend class rasterizer; 155 156 Region& operationSelf(const Rect& r, int op); 157 Region& operationSelf(const Region& r, int op); 158 Region& operationSelf(const Region& r, int dx, int dy, int op); 159 const Region operation(const Rect& rhs, int op) const; 160 const Region operation(const Region& rhs, int op) const; 161 const Region operation(const Region& rhs, int dx, int dy, int op) const; 162 163 static void boolean_operation(int op, Region& dst, 164 const Region& lhs, const Region& rhs, int dx, int dy); 165 static void boolean_operation(int op, Region& dst, 166 const Region& lhs, const Rect& rhs, int dx, int dy); 167 168 static void boolean_operation(int op, Region& dst, 169 const Region& lhs, const Region& rhs); 170 static void boolean_operation(int op, Region& dst, 171 const Region& lhs, const Rect& rhs); 172 173 static void translate(Region& reg, int dx, int dy); 174 static void translate(Region& dst, const Region& reg, int dx, int dy); 175 176 static bool validate(const Region& reg, 177 const char* name, bool silent = false); 178 179 // mStorage is a (manually) sorted array of Rects describing the region 180 // with an extra Rect as the last element which is set to the 181 // bounds of the region. However, if the region is 182 // a simple Rect then mStorage contains only that rect. 183 Vector<Rect> mStorage; 184 }; 185 186 187 const Region Region::operator | (const Region& rhs) const { 188 return merge(rhs); 189 } 190 const Region Region::operator ^ (const Region& rhs) const { 191 return mergeExclusive(rhs); 192 } 193 const Region Region::operator & (const Region& rhs) const { 194 return intersect(rhs); 195 } 196 const Region Region::operator - (const Region& rhs) const { 197 return subtract(rhs); 198 } 199 const Region Region::operator + (const Point& pt) const { 200 return translate(pt.x, pt.y); 201 } 202 203 204 Region& Region::operator |= (const Region& rhs) { 205 return orSelf(rhs); 206 } 207 Region& Region::operator ^= (const Region& rhs) { 208 return xorSelf(rhs); 209 } 210 Region& Region::operator &= (const Region& rhs) { 211 return andSelf(rhs); 212 } 213 Region& Region::operator -= (const Region& rhs) { 214 return subtractSelf(rhs); 215 } 216 Region& Region::operator += (const Point& pt) { 217 return translateSelf(pt.x, pt.y); 218 } 219 // --------------------------------------------------------------------------- 220 }; // namespace android 221 222 #endif // ANDROID_UI_REGION_H 223 224
