rect2i.h 8.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246
  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. #ifndef RECT2I_H
  31. #define RECT2I_H
  32. #include "core/error/error_macros.h"
  33. #include "core/math/vector2i.h"
  34. class String;
  35. struct Rect2;
  36. struct _NO_DISCARD_ Rect2i {
  37. Point2i position;
  38. Size2i size;
  39. const Point2i &get_position() const { return position; }
  40. void set_position(const Point2i &p_position) { position = p_position; }
  41. const Size2i &get_size() const { return size; }
  42. void set_size(const Size2i &p_size) { size = p_size; }
  43. int get_area() const { return size.width * size.height; }
  44. _FORCE_INLINE_ Vector2i get_center() const { return position + (size / 2); }
  45. inline bool intersects(const Rect2i &p_rect) const {
  46. #ifdef MATH_CHECKS
  47. if (unlikely(size.x < 0 || size.y < 0 || p_rect.size.x < 0 || p_rect.size.y < 0)) {
  48. ERR_PRINT("Rect2i size is negative, this is not supported. Use Rect2i.abs() to get a Rect2i with a positive size.");
  49. }
  50. #endif
  51. if (position.x >= (p_rect.position.x + p_rect.size.width)) {
  52. return false;
  53. }
  54. if ((position.x + size.width) <= p_rect.position.x) {
  55. return false;
  56. }
  57. if (position.y >= (p_rect.position.y + p_rect.size.height)) {
  58. return false;
  59. }
  60. if ((position.y + size.height) <= p_rect.position.y) {
  61. return false;
  62. }
  63. return true;
  64. }
  65. inline bool encloses(const Rect2i &p_rect) const {
  66. #ifdef MATH_CHECKS
  67. if (unlikely(size.x < 0 || size.y < 0 || p_rect.size.x < 0 || p_rect.size.y < 0)) {
  68. ERR_PRINT("Rect2i size is negative, this is not supported. Use Rect2i.abs() to get a Rect2i with a positive size.");
  69. }
  70. #endif
  71. return (p_rect.position.x >= position.x) && (p_rect.position.y >= position.y) &&
  72. ((p_rect.position.x + p_rect.size.x) <= (position.x + size.x)) &&
  73. ((p_rect.position.y + p_rect.size.y) <= (position.y + size.y));
  74. }
  75. _FORCE_INLINE_ bool has_area() const {
  76. return size.x > 0 && size.y > 0;
  77. }
  78. // Returns the intersection between two Rect2is or an empty Rect2i if there is no intersection.
  79. inline Rect2i intersection(const Rect2i &p_rect) const {
  80. Rect2i new_rect = p_rect;
  81. if (!intersects(new_rect)) {
  82. return Rect2i();
  83. }
  84. new_rect.position.x = MAX(p_rect.position.x, position.x);
  85. new_rect.position.y = MAX(p_rect.position.y, position.y);
  86. Point2i p_rect_end = p_rect.position + p_rect.size;
  87. Point2i end = position + size;
  88. new_rect.size.x = MIN(p_rect_end.x, end.x) - new_rect.position.x;
  89. new_rect.size.y = MIN(p_rect_end.y, end.y) - new_rect.position.y;
  90. return new_rect;
  91. }
  92. inline Rect2i merge(const Rect2i &p_rect) const { ///< return a merged rect
  93. #ifdef MATH_CHECKS
  94. if (unlikely(size.x < 0 || size.y < 0 || p_rect.size.x < 0 || p_rect.size.y < 0)) {
  95. ERR_PRINT("Rect2i size is negative, this is not supported. Use Rect2i.abs() to get a Rect2i with a positive size.");
  96. }
  97. #endif
  98. Rect2i new_rect;
  99. new_rect.position.x = MIN(p_rect.position.x, position.x);
  100. new_rect.position.y = MIN(p_rect.position.y, position.y);
  101. new_rect.size.x = MAX(p_rect.position.x + p_rect.size.x, position.x + size.x);
  102. new_rect.size.y = MAX(p_rect.position.y + p_rect.size.y, position.y + size.y);
  103. new_rect.size = new_rect.size - new_rect.position; // Make relative again.
  104. return new_rect;
  105. }
  106. bool has_point(const Point2i &p_point) const {
  107. #ifdef MATH_CHECKS
  108. if (unlikely(size.x < 0 || size.y < 0)) {
  109. ERR_PRINT("Rect2i size is negative, this is not supported. Use Rect2i.abs() to get a Rect2i with a positive size.");
  110. }
  111. #endif
  112. if (p_point.x < position.x) {
  113. return false;
  114. }
  115. if (p_point.y < position.y) {
  116. return false;
  117. }
  118. if (p_point.x >= (position.x + size.x)) {
  119. return false;
  120. }
  121. if (p_point.y >= (position.y + size.y)) {
  122. return false;
  123. }
  124. return true;
  125. }
  126. bool operator==(const Rect2i &p_rect) const { return position == p_rect.position && size == p_rect.size; }
  127. bool operator!=(const Rect2i &p_rect) const { return position != p_rect.position || size != p_rect.size; }
  128. Rect2i grow(int p_amount) const {
  129. Rect2i g = *this;
  130. g.position.x -= p_amount;
  131. g.position.y -= p_amount;
  132. g.size.width += p_amount * 2;
  133. g.size.height += p_amount * 2;
  134. return g;
  135. }
  136. inline Rect2i grow_side(Side p_side, int p_amount) const {
  137. Rect2i g = *this;
  138. g = g.grow_individual((SIDE_LEFT == p_side) ? p_amount : 0,
  139. (SIDE_TOP == p_side) ? p_amount : 0,
  140. (SIDE_RIGHT == p_side) ? p_amount : 0,
  141. (SIDE_BOTTOM == p_side) ? p_amount : 0);
  142. return g;
  143. }
  144. inline Rect2i grow_side_bind(uint32_t p_side, int p_amount) const {
  145. return grow_side(Side(p_side), p_amount);
  146. }
  147. inline Rect2i grow_individual(int p_left, int p_top, int p_right, int p_bottom) const {
  148. Rect2i g = *this;
  149. g.position.x -= p_left;
  150. g.position.y -= p_top;
  151. g.size.width += p_left + p_right;
  152. g.size.height += p_top + p_bottom;
  153. return g;
  154. }
  155. _FORCE_INLINE_ Rect2i expand(const Vector2i &p_vector) const {
  156. Rect2i r = *this;
  157. r.expand_to(p_vector);
  158. return r;
  159. }
  160. inline void expand_to(const Point2i &p_vector) {
  161. #ifdef MATH_CHECKS
  162. if (unlikely(size.x < 0 || size.y < 0)) {
  163. ERR_PRINT("Rect2i size is negative, this is not supported. Use Rect2i.abs() to get a Rect2i with a positive size.");
  164. }
  165. #endif
  166. Point2i begin = position;
  167. Point2i end = position + size;
  168. if (p_vector.x < begin.x) {
  169. begin.x = p_vector.x;
  170. }
  171. if (p_vector.y < begin.y) {
  172. begin.y = p_vector.y;
  173. }
  174. if (p_vector.x > end.x) {
  175. end.x = p_vector.x;
  176. }
  177. if (p_vector.y > end.y) {
  178. end.y = p_vector.y;
  179. }
  180. position = begin;
  181. size = end - begin;
  182. }
  183. _FORCE_INLINE_ Rect2i abs() const {
  184. return Rect2i(Point2i(position.x + MIN(size.x, 0), position.y + MIN(size.y, 0)), size.abs());
  185. }
  186. _FORCE_INLINE_ void set_end(const Vector2i &p_end) {
  187. size = p_end - position;
  188. }
  189. _FORCE_INLINE_ Vector2i get_end() const {
  190. return position + size;
  191. }
  192. operator String() const;
  193. operator Rect2() const;
  194. Rect2i() {}
  195. Rect2i(int p_x, int p_y, int p_width, int p_height) :
  196. position(Point2i(p_x, p_y)),
  197. size(Size2i(p_width, p_height)) {
  198. }
  199. Rect2i(const Point2i &p_pos, const Size2i &p_size) :
  200. position(p_pos),
  201. size(p_size) {
  202. }
  203. };
  204. #endif // RECT2I_H