Lines Matching refs:rhs

56 Region::Region(const Region& rhs)
57 : mBounds(rhs.mBounds), mStorage(rhs.mStorage)
61 Region::Region(const Rect& rhs)
62 : mBounds(rhs)
76 Region& Region::operator = (const Region& rhs)
79 validate(rhs, "operator=");
81 mBounds = rhs.mBounds;
82 mStorage = rhs.mStorage;
139 Region& Region::orSelf(const Region& rhs) {
140 return operationSelf(rhs, op_or);
142 Region& Region::andSelf(const Region& rhs) {
143 return operationSelf(rhs, op_and);
145 Region& Region::subtractSelf(const Region& rhs) {
146 return operationSelf(rhs, op_nand);
148 Region& Region::operationSelf(const Region& rhs, int op) {
150 boolean_operation(op, *this, lhs, rhs);
161 const Region Region::merge(const Rect& rhs) const {
162 return operation(rhs, op_or);
164 const Region Region::intersect(const Rect& rhs) const {
165 return operation(rhs, op_and);
167 const Region Region::subtract(const Rect& rhs) const {
168 return operation(rhs, op_nand);
170 const Region Region::operation(const Rect& rhs, int op) const {
172 boolean_operation(op, result, *this, rhs);
178 const Region Region::merge(const Region& rhs) const {
179 return operation(rhs, op_or);
181 const Region Region::intersect(const Region& rhs) const {
182 return operation(rhs, op_and);
184 const Region Region::subtract(const Region& rhs) const {
185 return operation(rhs, op_nand);
187 const Region Region::operation(const Region& rhs, int op) const {
189 boolean_operation(op, result, *this, rhs);
201 Region& Region::orSelf(const Region& rhs, int dx, int dy) {
202 return operationSelf(rhs, dx, dy, op_or);
204 Region& Region::andSelf(const Region& rhs, int dx, int dy) {
205 return operationSelf(rhs, dx, dy, op_and);
207 Region& Region::subtractSelf(const Region& rhs, int dx, int dy) {
208 return operationSelf(rhs, dx, dy, op_nand);
210 Region& Region::operationSelf(const Region& rhs, int dx, int dy, int op) {
212 boolean_operation(op, *this, lhs, rhs, dx, dy);
218 const Region Region::merge(const Region& rhs, int dx, int dy) const {
219 return operation(rhs, dx, dy, op_or);
221 const Region Region::intersect(const Region& rhs, int dx, int dy) const {
222 return operation(rhs, dx, dy, op_and);
224 const Region Region::subtract(const Region& rhs, int dx, int dy) const {
225 return operation(rhs, dx, dy, op_nand);
227 const Region Region::operation(const Region& rhs, int dx, int dy, int op) const {
229 boolean_operation(op, result, *this, rhs, dx, dy);
286 static inline T min(T rhs, T lhs) { return rhs < lhs ? rhs : lhs; }
288 static inline T max(T rhs, T lhs) { return rhs > lhs ? rhs : lhs; }
367 const Region& rhs, int dx, int dy)
373 Rect const * const rhs_rects = rhs.getArray(&rhs_count);
385 validate(rhs, "boolean_operation: rhs");
452 rhs.dump("rhs");
470 const Rect& rhs, int dx, int dy)
473 boolean_operation(op, dst, lhs, Region(rhs), dx, dy);
479 region_operator<Rect>::region rhs_region(&rhs, 1, dx, dy);
490 const Region& lhs, const Region& rhs)
492 boolean_operation(op, dst, lhs, rhs, 0, 0);
496 const Region& lhs, const Rect& rhs)
498 boolean_operation(op, dst, lhs, rhs, 0, 0);