Lines Matching defs:Region
35 class Region : public LightFlattenable<Region>
38 Region();
39 Region(const Region& rhs);
40 explicit Region(const Rect& rhs);
41 ~Region();
43 static Region createTJunctionFreeRegion(const Region& r);
45 Region& operator = (const Region& rhs);
53 // the region becomes its bounds
54 Region& makeBoundsSelf();
60 Region& orSelf(const Rect& rhs);
61 Region& xorSelf(const Rect& rhs);
62 Region& andSelf(const Rect& rhs);
63 Region& subtractSelf(const Rect& rhs);
66 Region& orSelf(const Region& rhs);
67 Region& xorSelf(const Region& rhs);
68 Region& andSelf(const Region& rhs);
69 Region& subtractSelf(const Region& rhs);
72 const Region merge(const Rect& rhs) const;
73 const Region mergeExclusive(const Rect& rhs) const;
74 const Region intersect(const Rect& rhs) const;
75 const Region subtract(const Rect& rhs) const;
78 const Region merge(const Region& rhs) const;
79 const Region mergeExclusive(const Region& rhs) const;
80 const Region intersect(const Region& rhs) const;
81 const Region subtract(const Region& rhs) const;
84 Region& translateSelf(int dx, int dy);
85 Region& orSelf(const Region& rhs, int dx, int dy);
86 Region& xorSelf(const Region& rhs, int dx, int dy);
87 Region& andSelf(const Region& rhs, int dx, int dy);
88 Region& subtractSelf(const Region& rhs, int dx, int dy);
91 const Region translate(int dx, int dy) const;
92 const Region merge(const Region& rhs, int dx, int dy) const;
93 const Region mergeExclusive(const Region& rhs, int dx, int dy) const;
94 const Region intersect(const Region& rhs, int dx, int dy) const;
95 const Region subtract(const Region& rhs, int dx, int dy) const;
98 inline const Region operator | (const Region& rhs) const;
99 inline const Region operator ^ (const Region& rhs) const;
100 inline const Region operator & (const Region& rhs) const;
101 inline const Region operator - (const Region& rhs) const;
102 inline const Region operator + (const Point& pt) const;
104 inline Region& operator |= (const Region& rhs);
105 inline Region& operator ^= (const Region& rhs);
106 inline Region& operator &= (const Region& rhs);
107 inline Region& operator -= (const Region& rhs);
108 inline Region& operator += (const Point& pt);
112 bool isTriviallyEqual(const Region& region) const;
124 // Region object.
135 // be sorted in Y and X and must not make the region invalid.
150 Region& operationSelf(const Rect& r, int op);
151 Region& operationSelf(const Region& r, int op);
152 Region& operationSelf(const Region& r, int dx, int dy, int op);
153 const Region operation(const Rect& rhs, int op) const;
154 const Region operation(const Region& rhs, int op) const;
155 const Region operation(const Region& rhs, int dx, int dy, int op) const;
157 static void boolean_operation(int op, Region& dst,
158 const Region& lhs, const Region& rhs, int dx, int dy);
159 static void boolean_operation(int op, Region& dst,
160 const Region& lhs, const Rect& rhs, int dx, int dy);
162 static void boolean_operation(int op, Region& dst,
163 const Region& lhs, const Region& rhs);
164 static void boolean_operation(int op, Region& dst,
165 const Region& lhs, const Rect& rhs);
167 static void translate(Region& reg, int dx, int dy);
168 static void translate(Region& dst, const Region& reg, int dx, int dy);
170 static bool validate(const Region& reg,
173 // mStorage is a (manually) sorted array of Rects describing the region
175 // bounds of the region. However, if the region is
181 const Region Region::operator | (const Region& rhs) const {
184 const Region Region::operator ^ (const Region& rhs) const {
187 const Region Region::operator & (const Region& rhs) const {
190 const Region Region::operator - (const Region& rhs) const {
193 const Region Region::operator + (const Point& pt) const {
198 Region& Region::operator |= (const Region& rhs) {
201 Region& Region::operator ^= (const Region& rhs) {
204 Region& Region::operator &= (const Region& rhs) {
207 Region& Region::operator -= (const Region& rhs) {
210 Region& Region::operator += (const Point& pt) {
