2009-03-04 03:31:44 +00:00
|
|
|
/*
|
2009-05-27 00:44:57 +00:00
|
|
|
* Copyright (C) 2009 The Android Open Source Project
|
2009-03-04 03:31:44 +00:00
|
|
|
*
|
2009-05-27 00:44:57 +00:00
|
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
* you may not use this file except in compliance with the License.
|
|
|
|
* You may obtain a copy of the License at
|
2009-03-04 03:31:44 +00:00
|
|
|
*
|
2009-05-27 00:44:57 +00:00
|
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
*
|
|
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
* See the License for the specific language governing permissions and
|
|
|
|
* limitations under the License.
|
2009-03-04 03:31:44 +00:00
|
|
|
*/
|
|
|
|
|
2012-05-07 20:49:17 +00:00
|
|
|
#include <system/graphics.h>
|
2009-03-04 03:31:44 +00:00
|
|
|
#include <ui/Rect.h>
|
|
|
|
|
|
|
|
namespace android {
|
|
|
|
|
2015-03-17 23:23:42 +00:00
|
|
|
const Rect Rect::INVALID_RECT{0, 0, -1, -1};
|
|
|
|
|
2010-07-09 18:44:11 +00:00
|
|
|
static inline int32_t min(int32_t a, int32_t b) {
|
2013-05-10 03:37:10 +00:00
|
|
|
return (a < b) ? a : b;
|
2009-03-04 03:31:44 +00:00
|
|
|
}
|
|
|
|
|
2010-07-09 18:44:11 +00:00
|
|
|
static inline int32_t max(int32_t a, int32_t b) {
|
2013-05-10 03:37:10 +00:00
|
|
|
return (a > b) ? a : b;
|
2009-03-04 03:31:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void Rect::makeInvalid() {
|
|
|
|
left = 0;
|
|
|
|
top = 0;
|
|
|
|
right = -1;
|
|
|
|
bottom = -1;
|
|
|
|
}
|
|
|
|
|
2013-05-10 03:37:10 +00:00
|
|
|
bool Rect::operator <(const Rect& rhs) const {
|
|
|
|
if (top < rhs.top) {
|
2009-03-04 03:31:44 +00:00
|
|
|
return true;
|
|
|
|
} else if (top == rhs.top) {
|
|
|
|
if (left < rhs.left) {
|
|
|
|
return true;
|
|
|
|
} else if (left == rhs.left) {
|
2013-05-10 03:37:10 +00:00
|
|
|
if (bottom < rhs.bottom) {
|
2009-03-04 03:31:44 +00:00
|
|
|
return true;
|
|
|
|
} else if (bottom == rhs.bottom) {
|
2013-05-10 03:37:10 +00:00
|
|
|
if (right < rhs.right) {
|
2009-03-04 03:31:44 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2013-05-10 03:37:10 +00:00
|
|
|
Rect& Rect::offsetTo(int32_t x, int32_t y) {
|
2009-03-04 03:31:44 +00:00
|
|
|
right -= left - x;
|
|
|
|
bottom -= top - y;
|
|
|
|
left = x;
|
|
|
|
top = y;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2013-05-10 03:37:10 +00:00
|
|
|
Rect& Rect::offsetBy(int32_t x, int32_t y) {
|
2009-03-04 03:31:44 +00:00
|
|
|
left += x;
|
2013-05-10 03:37:10 +00:00
|
|
|
top += y;
|
|
|
|
right += x;
|
|
|
|
bottom += y;
|
2009-03-04 03:31:44 +00:00
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2013-05-10 03:37:10 +00:00
|
|
|
const Rect Rect::operator +(const Point& rhs) const {
|
|
|
|
const Rect result(left + rhs.x, top + rhs.y, right + rhs.x, bottom + rhs.y);
|
2009-05-27 00:44:57 +00:00
|
|
|
return result;
|
2009-03-04 03:31:44 +00:00
|
|
|
}
|
|
|
|
|
2013-05-10 03:37:10 +00:00
|
|
|
const Rect Rect::operator -(const Point& rhs) const {
|
|
|
|
const Rect result(left - rhs.x, top - rhs.y, right - rhs.x, bottom - rhs.y);
|
2009-05-27 00:44:57 +00:00
|
|
|
return result;
|
2009-03-04 03:31:44 +00:00
|
|
|
}
|
|
|
|
|
2013-05-10 03:37:10 +00:00
|
|
|
bool Rect::intersect(const Rect& with, Rect* result) const {
|
|
|
|
result->left = max(left, with.left);
|
|
|
|
result->top = max(top, with.top);
|
|
|
|
result->right = min(right, with.right);
|
|
|
|
result->bottom = min(bottom, with.bottom);
|
2009-03-04 03:31:44 +00:00
|
|
|
return !(result->isEmpty());
|
|
|
|
}
|
|
|
|
|
2012-05-11 03:43:55 +00:00
|
|
|
Rect Rect::transform(uint32_t xform, int32_t width, int32_t height) const {
|
2012-05-07 20:49:17 +00:00
|
|
|
Rect result(*this);
|
|
|
|
if (xform & HAL_TRANSFORM_FLIP_H) {
|
2013-05-10 03:37:10 +00:00
|
|
|
result = Rect(width - result.right, result.top, width - result.left,
|
|
|
|
result.bottom);
|
2012-05-07 20:49:17 +00:00
|
|
|
}
|
|
|
|
if (xform & HAL_TRANSFORM_FLIP_V) {
|
2013-05-10 03:37:10 +00:00
|
|
|
result = Rect(result.left, height - result.bottom, result.right,
|
|
|
|
height - result.top);
|
2012-05-07 20:49:17 +00:00
|
|
|
}
|
|
|
|
if (xform & HAL_TRANSFORM_ROT_90) {
|
|
|
|
int left = height - result.bottom;
|
|
|
|
int top = result.left;
|
|
|
|
int right = height - result.top;
|
|
|
|
int bottom = result.right;
|
|
|
|
result = Rect(left, top, right, bottom);
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2013-05-11 01:01:12 +00:00
|
|
|
Rect Rect::reduce(const Rect& exclude) const {
|
|
|
|
Rect result;
|
|
|
|
|
|
|
|
uint32_t mask = 0;
|
|
|
|
mask |= (exclude.left > left) ? 1 : 0;
|
|
|
|
mask |= (exclude.top > top) ? 2 : 0;
|
|
|
|
mask |= (exclude.right < right) ? 4 : 0;
|
|
|
|
mask |= (exclude.bottom < bottom) ? 8 : 0;
|
|
|
|
|
|
|
|
if (mask == 0) {
|
|
|
|
// crop entirely covers us
|
|
|
|
result.clear();
|
|
|
|
} else {
|
|
|
|
result = *this;
|
|
|
|
if (!(mask & (mask - 1))) {
|
|
|
|
// power-of-2, i.e.: just one bit is set
|
|
|
|
if (mask & 1) {
|
|
|
|
result.right = exclude.left;
|
|
|
|
} else if (mask & 2) {
|
|
|
|
result.bottom = exclude.top;
|
|
|
|
} else if (mask & 4) {
|
|
|
|
result.left = exclude.right;
|
|
|
|
} else if (mask & 8) {
|
|
|
|
result.top = exclude.bottom;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2009-03-04 03:31:44 +00:00
|
|
|
}; // namespace android
|