rect2i.h 7.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242
  1. /**************************************************************************/
  2. /* rect2i.h */
  3. /**************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* https://godotengine.org */
  7. /**************************************************************************/
  8. /* Copyright (c) 2014-present Godot Engine contributors (see AUTHORS.md). */
  9. /* Copyright (c) 2007-2014 Juan Linietsky, Ariel Manzur. */
  10. /* */
  11. /* Permission is hereby granted, free of charge, to any person obtaining */
  12. /* a copy of this software and associated documentation files (the */
  13. /* "Software"), to deal in the Software without restriction, including */
  14. /* without limitation the rights to use, copy, modify, merge, publish, */
  15. /* distribute, sublicense, and/or sell copies of the Software, and to */
  16. /* permit persons to whom the Software is furnished to do so, subject to */
  17. /* the following conditions: */
  18. /* */
  19. /* The above copyright notice and this permission notice shall be */
  20. /* included in all copies or substantial portions of the Software. */
  21. /* */
  22. /* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
  23. /* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
  24. /* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. */
  25. /* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
  26. /* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
  27. /* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
  28. /* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
  29. /**************************************************************************/
  30. #pragma once
  31. #include "core/error/error_macros.h"
  32. #include "core/math/vector2i.h"
  33. class String;
  34. struct Rect2;
  35. struct [[nodiscard]] Rect2i {
  36. Point2i position;
  37. Size2i size;
  38. const Point2i &get_position() const { return position; }
  39. void set_position(const Point2i &p_position) { position = p_position; }
  40. const Size2i &get_size() const { return size; }
  41. void set_size(const Size2i &p_size) { size = p_size; }
  42. int get_area() const { return size.width * size.height; }
  43. _FORCE_INLINE_ Vector2i get_center() const { return position + (size / 2); }
  44. inline bool intersects(const Rect2i &p_rect) const {
  45. #ifdef MATH_CHECKS
  46. if (unlikely(size.x < 0 || size.y < 0 || p_rect.size.x < 0 || p_rect.size.y < 0)) {
  47. ERR_PRINT("Rect2i size is negative, this is not supported. Use Rect2i.abs() to get a Rect2i with a positive size.");
  48. }
  49. #endif
  50. if (position.x >= (p_rect.position.x + p_rect.size.width)) {
  51. return false;
  52. }
  53. if ((position.x + size.width) <= p_rect.position.x) {
  54. return false;
  55. }
  56. if (position.y >= (p_rect.position.y + p_rect.size.height)) {
  57. return false;
  58. }
  59. if ((position.y + size.height) <= p_rect.position.y) {
  60. return false;
  61. }
  62. return true;
  63. }
  64. inline bool encloses(const Rect2i &p_rect) const {
  65. #ifdef MATH_CHECKS
  66. if (unlikely(size.x < 0 || size.y < 0 || p_rect.size.x < 0 || p_rect.size.y < 0)) {
  67. ERR_PRINT("Rect2i size is negative, this is not supported. Use Rect2i.abs() to get a Rect2i with a positive size.");
  68. }
  69. #endif
  70. return (p_rect.position.x >= position.x) && (p_rect.position.y >= position.y) &&
  71. ((p_rect.position.x + p_rect.size.x) <= (position.x + size.x)) &&
  72. ((p_rect.position.y + p_rect.size.y) <= (position.y + size.y));
  73. }
  74. _FORCE_INLINE_ bool has_area() const {
  75. return size.x > 0 && size.y > 0;
  76. }
  77. // Returns the intersection between two Rect2is or an empty Rect2i if there is no intersection.
  78. inline Rect2i intersection(const Rect2i &p_rect) const {
  79. Rect2i new_rect = p_rect;
  80. if (!intersects(new_rect)) {
  81. return Rect2i();
  82. }
  83. new_rect.position = p_rect.position.max(position);
  84. Point2i p_rect_end = p_rect.position + p_rect.size;
  85. Point2i end = position + size;
  86. new_rect.size = p_rect_end.min(end) - new_rect.position;
  87. return new_rect;
  88. }
  89. inline Rect2i merge(const Rect2i &p_rect) const { ///< return a merged rect
  90. #ifdef MATH_CHECKS
  91. if (unlikely(size.x < 0 || size.y < 0 || p_rect.size.x < 0 || p_rect.size.y < 0)) {
  92. ERR_PRINT("Rect2i size is negative, this is not supported. Use Rect2i.abs() to get a Rect2i with a positive size.");
  93. }
  94. #endif
  95. Rect2i new_rect;
  96. new_rect.position = p_rect.position.min(position);
  97. new_rect.size = (p_rect.position + p_rect.size).max(position + size);
  98. new_rect.size = new_rect.size - new_rect.position; // Make relative again.
  99. return new_rect;
  100. }
  101. bool has_point(const Point2i &p_point) const {
  102. #ifdef MATH_CHECKS
  103. if (unlikely(size.x < 0 || size.y < 0)) {
  104. ERR_PRINT("Rect2i size is negative, this is not supported. Use Rect2i.abs() to get a Rect2i with a positive size.");
  105. }
  106. #endif
  107. if (p_point.x < position.x) {
  108. return false;
  109. }
  110. if (p_point.y < position.y) {
  111. return false;
  112. }
  113. if (p_point.x >= (position.x + size.x)) {
  114. return false;
  115. }
  116. if (p_point.y >= (position.y + size.y)) {
  117. return false;
  118. }
  119. return true;
  120. }
  121. constexpr bool operator==(const Rect2i &p_rect) const { return position == p_rect.position && size == p_rect.size; }
  122. constexpr bool operator!=(const Rect2i &p_rect) const { return position != p_rect.position || size != p_rect.size; }
  123. Rect2i grow(int p_amount) const {
  124. Rect2i g = *this;
  125. g.position.x -= p_amount;
  126. g.position.y -= p_amount;
  127. g.size.width += p_amount * 2;
  128. g.size.height += p_amount * 2;
  129. return g;
  130. }
  131. inline Rect2i grow_side(Side p_side, int p_amount) const {
  132. Rect2i g = *this;
  133. g = g.grow_individual((SIDE_LEFT == p_side) ? p_amount : 0,
  134. (SIDE_TOP == p_side) ? p_amount : 0,
  135. (SIDE_RIGHT == p_side) ? p_amount : 0,
  136. (SIDE_BOTTOM == p_side) ? p_amount : 0);
  137. return g;
  138. }
  139. inline Rect2i grow_side_bind(uint32_t p_side, int p_amount) const {
  140. return grow_side(Side(p_side), p_amount);
  141. }
  142. inline Rect2i grow_individual(int p_left, int p_top, int p_right, int p_bottom) const {
  143. Rect2i g = *this;
  144. g.position.x -= p_left;
  145. g.position.y -= p_top;
  146. g.size.width += p_left + p_right;
  147. g.size.height += p_top + p_bottom;
  148. return g;
  149. }
  150. _FORCE_INLINE_ Rect2i expand(const Vector2i &p_vector) const {
  151. Rect2i r = *this;
  152. r.expand_to(p_vector);
  153. return r;
  154. }
  155. inline void expand_to(const Point2i &p_vector) {
  156. #ifdef MATH_CHECKS
  157. if (unlikely(size.x < 0 || size.y < 0)) {
  158. ERR_PRINT("Rect2i size is negative, this is not supported. Use Rect2i.abs() to get a Rect2i with a positive size.");
  159. }
  160. #endif
  161. Point2i begin = position;
  162. Point2i end = position + size;
  163. if (p_vector.x < begin.x) {
  164. begin.x = p_vector.x;
  165. }
  166. if (p_vector.y < begin.y) {
  167. begin.y = p_vector.y;
  168. }
  169. if (p_vector.x > end.x) {
  170. end.x = p_vector.x;
  171. }
  172. if (p_vector.y > end.y) {
  173. end.y = p_vector.y;
  174. }
  175. position = begin;
  176. size = end - begin;
  177. }
  178. _FORCE_INLINE_ Rect2i abs() const {
  179. return Rect2i(position + size.mini(0), size.abs());
  180. }
  181. _FORCE_INLINE_ void set_end(const Vector2i &p_end) {
  182. size = p_end - position;
  183. }
  184. _FORCE_INLINE_ Vector2i get_end() const {
  185. return position + size;
  186. }
  187. operator String() const;
  188. operator Rect2() const;
  189. Rect2i() = default;
  190. constexpr Rect2i(int p_x, int p_y, int p_width, int p_height) :
  191. position(Point2i(p_x, p_y)),
  192. size(Size2i(p_width, p_height)) {
  193. }
  194. constexpr Rect2i(const Point2i &p_pos, const Size2i &p_size) :
  195. position(p_pos),
  196. size(p_size) {
  197. }
  198. };
  199. template <>
  200. struct is_zero_constructible<Rect2i> : std::true_type {};