1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246
|
// Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ui/gfx/geometry/rect_f.h"
#include <algorithm>
#include "base/logging.h"
#include "base/strings/stringprintf.h"
#include "ui/gfx/geometry/insets_f.h"
#include "ui/gfx/geometry/safe_integer_conversions.h"
namespace gfx {
static void AdjustAlongAxis(float dst_origin,
float dst_size,
float* origin,
float* size) {
*size = std::min(dst_size, *size);
if (*origin < dst_origin)
*origin = dst_origin;
else
*origin = std::min(dst_origin + dst_size, *origin + *size) - *size;
}
void RectF::Inset(const InsetsF& insets) {
Inset(insets.left(), insets.top(), insets.right(), insets.bottom());
}
void RectF::Inset(float left, float top, float right, float bottom) {
origin_ += Vector2dF(left, top);
set_width(std::max(width() - left - right, static_cast<float>(0)));
set_height(std::max(height() - top - bottom, static_cast<float>(0)));
}
void RectF::Offset(float horizontal, float vertical) {
origin_ += Vector2dF(horizontal, vertical);
}
void RectF::operator+=(const Vector2dF& offset) {
origin_ += offset;
}
void RectF::operator-=(const Vector2dF& offset) {
origin_ -= offset;
}
InsetsF RectF::InsetsFrom(const RectF& inner) const {
return InsetsF(inner.y() - y(),
inner.x() - x(),
bottom() - inner.bottom(),
right() - inner.right());
}
bool RectF::operator<(const RectF& other) const {
if (origin_ == other.origin_) {
if (width() == other.width()) {
return height() < other.height();
} else {
return width() < other.width();
}
} else {
return origin_ < other.origin_;
}
}
bool RectF::Contains(float point_x, float point_y) const {
return (point_x >= x()) && (point_x < right()) && (point_y >= y()) &&
(point_y < bottom());
}
bool RectF::Contains(const RectF& rect) const {
return (rect.x() >= x() && rect.right() <= right() && rect.y() >= y() &&
rect.bottom() <= bottom());
}
bool RectF::Intersects(const RectF& rect) const {
return !(IsEmpty() || rect.IsEmpty() || rect.x() >= right() ||
rect.right() <= x() || rect.y() >= bottom() || rect.bottom() <= y());
}
void RectF::Intersect(const RectF& rect) {
if (IsEmpty() || rect.IsEmpty()) {
SetRect(0, 0, 0, 0);
return;
}
float rx = std::max(x(), rect.x());
float ry = std::max(y(), rect.y());
float rr = std::min(right(), rect.right());
float rb = std::min(bottom(), rect.bottom());
if (rx >= rr || ry >= rb)
rx = ry = rr = rb = 0; // non-intersecting
SetRect(rx, ry, rr - rx, rb - ry);
}
void RectF::Union(const RectF& rect) {
if (IsEmpty()) {
*this = rect;
return;
}
if (rect.IsEmpty())
return;
float rx = std::min(x(), rect.x());
float ry = std::min(y(), rect.y());
float rr = std::max(right(), rect.right());
float rb = std::max(bottom(), rect.bottom());
SetRect(rx, ry, rr - rx, rb - ry);
}
void RectF::Subtract(const RectF& rect) {
if (!Intersects(rect))
return;
if (rect.Contains(*static_cast<const RectF*>(this))) {
SetRect(0, 0, 0, 0);
return;
}
float rx = x();
float ry = y();
float rr = right();
float rb = bottom();
if (rect.y() <= y() && rect.bottom() >= bottom()) {
// complete intersection in the y-direction
if (rect.x() <= x()) {
rx = rect.right();
} else if (rect.right() >= right()) {
rr = rect.x();
}
} else if (rect.x() <= x() && rect.right() >= right()) {
// complete intersection in the x-direction
if (rect.y() <= y()) {
ry = rect.bottom();
} else if (rect.bottom() >= bottom()) {
rb = rect.y();
}
}
SetRect(rx, ry, rr - rx, rb - ry);
}
void RectF::AdjustToFit(const RectF& rect) {
float new_x = x();
float new_y = y();
float new_width = width();
float new_height = height();
AdjustAlongAxis(rect.x(), rect.width(), &new_x, &new_width);
AdjustAlongAxis(rect.y(), rect.height(), &new_y, &new_height);
SetRect(new_x, new_y, new_width, new_height);
}
PointF RectF::CenterPoint() const {
return PointF(x() + width() / 2, y() + height() / 2);
}
void RectF::ClampToCenteredSize(const SizeF& size) {
float new_width = std::min(width(), size.width());
float new_height = std::min(height(), size.height());
float new_x = x() + (width() - new_width) / 2;
float new_y = y() + (height() - new_height) / 2;
SetRect(new_x, new_y, new_width, new_height);
}
void RectF::SplitVertically(RectF* left_half, RectF* right_half) const {
DCHECK(left_half);
DCHECK(right_half);
left_half->SetRect(x(), y(), width() / 2, height());
right_half->SetRect(
left_half->right(), y(), width() - left_half->width(), height());
}
bool RectF::SharesEdgeWith(const RectF& rect) const {
return (y() == rect.y() && height() == rect.height() &&
(x() == rect.right() || right() == rect.x())) ||
(x() == rect.x() && width() == rect.width() &&
(y() == rect.bottom() || bottom() == rect.y()));
}
float RectF::ManhattanDistanceToPoint(const PointF& point) const {
float x_distance =
std::max<float>(0, std::max(x() - point.x(), point.x() - right()));
float y_distance =
std::max<float>(0, std::max(y() - point.y(), point.y() - bottom()));
return x_distance + y_distance;
}
float RectF::ManhattanInternalDistance(const RectF& rect) const {
RectF c(*this);
c.Union(rect);
static const float kEpsilon = std::numeric_limits<float>::is_integer
? 1
: std::numeric_limits<float>::epsilon();
float x = std::max<float>(0, c.width() - width() - rect.width() + kEpsilon);
float y =
std::max<float>(0, c.height() - height() - rect.height() + kEpsilon);
return x + y;
}
bool RectF::IsExpressibleAsRect() const {
return IsExpressibleAsInt(x()) && IsExpressibleAsInt(y()) &&
IsExpressibleAsInt(width()) && IsExpressibleAsInt(height()) &&
IsExpressibleAsInt(right()) && IsExpressibleAsInt(bottom());
}
std::string RectF::ToString() const {
return base::StringPrintf("%s %s",
origin().ToString().c_str(),
size().ToString().c_str());
}
RectF IntersectRects(const RectF& a, const RectF& b) {
RectF result = a;
result.Intersect(b);
return result;
}
RectF UnionRects(const RectF& a, const RectF& b) {
RectF result = a;
result.Union(b);
return result;
}
RectF SubtractRects(const RectF& a, const RectF& b) {
RectF result = a;
result.Subtract(b);
return result;
}
RectF BoundingRect(const PointF& p1, const PointF& p2) {
float rx = std::min(p1.x(), p2.x());
float ry = std::min(p1.y(), p2.y());
float rr = std::max(p1.x(), p2.x());
float rb = std::max(p1.y(), p2.y());
return RectF(rx, ry, rr - rx, rb - ry);
}
} // namespace gfx
|