Duckstation/src/common/rectangle.h

199 lines
7.1 KiB
C
Raw Normal View History

2019-11-05 09:19:20 +00:00
#pragma once
2020-01-10 03:31:12 +00:00
#include <algorithm>
2019-11-05 09:19:20 +00:00
#include <limits>
#include <tuple>
#include <type_traits>
namespace Common {
/// Templated rectangle class. Assumes an upper-left origin, that is (0,0) is the top-left corner.
template<typename T>
struct Rectangle
{
enum : T
{
InvalidMinCoord = std::numeric_limits<T>::max(),
InvalidMaxCoord = std::numeric_limits<T>::min()
};
/// Default constructor - initializes to an invalid coordinate range suitable for including points.
constexpr Rectangle() : left(InvalidMinCoord), top(InvalidMinCoord), right(InvalidMaxCoord), bottom(InvalidMaxCoord)
{
}
/// Construct with values.
constexpr Rectangle(T left_, T top_, T right_, T bottom_) : left(left_), top(top_), right(right_), bottom(bottom_) {}
/// Copy constructor.
constexpr Rectangle(const Rectangle& copy) : left(copy.left), top(copy.top), right(copy.right), bottom(copy.bottom) {}
/// Sets the rectangle using the specified values.
constexpr void Set(T left_, T top_, T right_, T bottom_)
{
left = left_;
top = top_;
right = right_;
bottom = bottom_;
}
/// Sets the rectangle using the specified top-left position and extents.
constexpr void SetExtents(T x, T y, T width, T height)
{
left = x;
top = y;
right = x + width;
2019-11-05 09:19:20 +00:00
bottom = y + height;
}
/// Returns a new rectangle from the specified position and size.
static Rectangle FromExtents(T x, T y, T width, T height) { return Rectangle(x, y, x + width, y + height); }
/// Sets the rectangle to invalid coordinates (right < left, top < bottom).
constexpr void SetInvalid() { Set(InvalidMinCoord, InvalidMinCoord, InvalidMaxCoord, InvalidMaxCoord); }
/// Returns the width of the rectangle.
constexpr T GetWidth() const { return right - left; }
/// Returns the height of the rectangle.
constexpr T GetHeight() const { return bottom - top; }
/// Returns true if the rectangles's width/height can be considered valid.
constexpr bool Valid() const { return left <= right && top <= bottom; }
/// Returns false if the rectangle does not have any extents (zero size).
constexpr bool HasExtents() const { return left < right && top < bottom; }
/// Assignment operator.
constexpr Rectangle& operator=(const Rectangle& rhs)
{
left = rhs.left;
top = rhs.top;
right = rhs.right;
2019-11-05 09:19:20 +00:00
bottom = rhs.bottom;
return *this;
2019-11-05 09:19:20 +00:00
}
// Relational operators.
#define RELATIONAL_OPERATOR(op) \
constexpr bool operator op(const Rectangle& rhs) const \
{ \
return std::tie(left, top, right, bottom) op std::tie(rhs.left, rhs.top, rhs.right, rhs.bottom); \
}
RELATIONAL_OPERATOR(==);
RELATIONAL_OPERATOR(!=);
RELATIONAL_OPERATOR(<);
RELATIONAL_OPERATOR(<=);
RELATIONAL_OPERATOR(>);
RELATIONAL_OPERATOR(>=);
#undef RELATIONAL_OPERATOR
// Arithmetic operators.
#define ARITHMETIC_OPERATOR(op) \
constexpr Rectangle& operator op##=(const T amount) \
{ \
left op## = amount; \
top op## = amount; \
right op## = amount; \
bottom op## = amount; \
} \
constexpr Rectangle operator op(const T amount) const \
{ \
return Rectangle(left op amount, top op amount, right op amount, bottom op amount); \
}
ARITHMETIC_OPERATOR(+);
ARITHMETIC_OPERATOR(-);
ARITHMETIC_OPERATOR(*);
ARITHMETIC_OPERATOR(/);
ARITHMETIC_OPERATOR(%);
ARITHMETIC_OPERATOR(>>);
ARITHMETIC_OPERATOR(<<);
ARITHMETIC_OPERATOR(|);
ARITHMETIC_OPERATOR(&);
ARITHMETIC_OPERATOR(^);
#undef ARITHMETIC_OPERATOR
2019-11-05 09:19:20 +00:00
#ifdef _WINDEF_
/// Casts this rectangle to a Win32 RECT structure if compatible.
template<bool _ = true, typename = typename std::enable_if_t<std::is_same_v<T, s32> && _>>
const RECT* AsRECT() const
{
return reinterpret_cast<const RECT*>(this);
}
#endif
/// Tests for intersection between two rectangles.
constexpr bool Intersects(const Rectangle& rhs) const
{
return !(left >= rhs.right || rhs.left >= right || top >= rhs.bottom || rhs.top >= bottom);
2019-11-05 09:19:20 +00:00
}
/// Tests whether the specified point is contained in the rectangle.
constexpr bool Contains(T x, T y) const { return (x >= left && x < right && y >= top && y < bottom); }
/// Expands the bounds of the rectangle to contain the specified point.
constexpr void Include(T x, T y)
{
left = std::min(left, x);
right = std::max(right, x + static_cast<T>(1));
top = std::min(top, y);
bottom = std::max(bottom, y + static_cast<T>(1));
}
/// Expands the bounds of the rectangle to contain another rectangle.
constexpr void Include(const Rectangle& rhs)
{
left = std::min(left, rhs.left);
right = std::max(right, rhs.right);
top = std::min(top, rhs.top);
bottom = std::max(bottom, rhs.bottom);
}
/// Expands the bounds of the rectangle to contain another rectangle.
constexpr void Include(T other_left, T other_right, T other_top, T other_bottom)
{
left = std::min(left, other_left);
right = std::max(right, other_right);
top = std::min(top, other_top);
bottom = std::max(bottom, other_bottom);
2019-11-05 09:19:20 +00:00
}
2020-01-22 13:57:12 +00:00
/// Clamps the rectangle to the specified coordinates.
constexpr void Clamp(T x1, T y1, T x2, T y2)
{
left = std::clamp(left, x1, x2);
right = std::clamp(right, x1, x2);
top = std::clamp(top, y1, y2);
bottom = std::clamp(bottom, y1, y2);
}
/// Clamps the rectangle to the specified size.
constexpr void ClampSize(T width, T height)
{
right = std::min(right, left + width);
bottom = std::min(bottom, top + height);
}
/// Returns a new rectangle with clamped coordinates.
constexpr Rectangle Clamped(T x1, T y1, T x2, T y2) const
{
return Rectangle(std::clamp(left, x1, x2), std::clamp(top, y1, y2), std::clamp(right, x1, x2),
std::clamp(bottom, y1, y2));
}
/// Returns a new rectangle with clamped size.
constexpr Rectangle ClampedSize(T width, T height) const
{
return Rectangle(left, top, std::min(right, left + width), std::min(bottom, top + height));
}
2019-11-05 09:19:20 +00:00
T left;
T top;
T right;
T bottom;
};
} // namespace Common