2017-09-12 20:42:36 +00:00
<?xml version="1.0" encoding="UTF-8" ?>
2021-04-26 11:14:51 +00:00
<class name= "Rect2" version= "3.4" >
2017-09-12 20:42:36 +00:00
<brief_description >
2019-06-21 23:04:47 +00:00
2D axis-aligned bounding box.
2017-09-12 20:42:36 +00:00
</brief_description>
<description >
2020-09-21 12:27:50 +00:00
[Rect2] consists of a position, a size, and several utility functions. It is typically used for fast overlap tests.
It uses floating-point coordinates.
The 3D counterpart to [Rect2] is [AABB].
2017-09-12 20:42:36 +00:00
</description>
<tutorials >
2021-08-12 14:58:38 +00:00
<link title= "Math tutorial index" > https://docs.godotengine.org/en/3.4/tutorials/math/index.html</link>
<link title= "Vector math" > https://docs.godotengine.org/en/3.4/tutorials/math/vector_math.html</link>
<link title= "Advanced vector math" > https://docs.godotengine.org/en/3.4/tutorials/math/vectors_advanced.html</link>
2017-09-12 20:42:36 +00:00
</tutorials>
<methods >
<method name= "Rect2" >
2021-07-30 13:28:05 +00:00
<return type= "Rect2" />
<argument index= "0" name= "position" type= "Vector2" />
<argument index= "1" name= "size" type= "Vector2" />
2017-09-12 20:42:36 +00:00
<description >
2019-03-29 22:37:35 +00:00
Constructs a [Rect2] by position and size.
2017-09-12 20:42:36 +00:00
</description>
</method>
<method name= "Rect2" >
2021-07-30 13:28:05 +00:00
<return type= "Rect2" />
<argument index= "0" name= "x" type= "float" />
<argument index= "1" name= "y" type= "float" />
<argument index= "2" name= "width" type= "float" />
<argument index= "3" name= "height" type= "float" />
2017-09-12 20:42:36 +00:00
<description >
2019-03-29 22:37:35 +00:00
Constructs a [Rect2] by x, y, width, and height.
2017-09-12 20:42:36 +00:00
</description>
</method>
2017-12-09 23:43:30 +00:00
<method name= "abs" >
2021-07-30 13:28:05 +00:00
<return type= "Rect2" />
2017-12-09 23:43:30 +00:00
<description >
2019-03-29 22:37:35 +00:00
Returns a [Rect2] with equivalent position and area, modified so that the top-left corner is the origin and [code]width[/code] and [code]height[/code] are positive.
2017-12-09 23:43:30 +00:00
</description>
</method>
2017-09-12 20:42:36 +00:00
<method name= "clip" >
2021-07-30 13:28:05 +00:00
<return type= "Rect2" />
<argument index= "0" name= "b" type= "Rect2" />
2017-09-12 20:42:36 +00:00
<description >
2019-03-29 22:37:35 +00:00
Returns the intersection of this [Rect2] and b.
2017-09-12 20:42:36 +00:00
</description>
</method>
<method name= "encloses" >
2021-07-30 13:28:05 +00:00
<return type= "bool" />
<argument index= "0" name= "b" type= "Rect2" />
2017-09-12 20:42:36 +00:00
<description >
2019-03-29 22:37:35 +00:00
Returns [code]true[/code] if this [Rect2] completely encloses another one.
2017-09-12 20:42:36 +00:00
</description>
</method>
<method name= "expand" >
2021-07-30 13:28:05 +00:00
<return type= "Rect2" />
<argument index= "0" name= "to" type= "Vector2" />
2017-09-12 20:42:36 +00:00
<description >
2021-11-11 10:31:30 +00:00
Returns a copy of this [Rect2] expanded to include a given point.
[b]Example:[/b]
[codeblock]
# position (-3, 2), size (1, 1)
var rect = Rect2(Vector2(-3, 2), Vector2(1, 1))
# position (-3, -1), size (3, 4), so we fit both rect and Vector2(0, -1)
var rect2 = rect.expand(Vector2(0, -1))
[/codeblock]
2017-09-12 20:42:36 +00:00
</description>
</method>
<method name= "get_area" >
2021-07-30 13:28:05 +00:00
<return type= "float" />
2017-09-12 20:42:36 +00:00
<description >
2022-02-01 21:43:02 +00:00
Returns the area of the [Rect2]. See also [method has_no_area].
2017-09-12 20:42:36 +00:00
</description>
</method>
<method name= "grow" >
2021-07-30 13:28:05 +00:00
<return type= "Rect2" />
<argument index= "0" name= "by" type= "float" />
2017-09-12 20:42:36 +00:00
<description >
2019-03-29 22:37:35 +00:00
Returns a copy of the [Rect2] grown a given amount of units towards all the sides.
2017-09-12 20:42:36 +00:00
</description>
</method>
<method name= "grow_individual" >
2021-07-30 13:28:05 +00:00
<return type= "Rect2" />
<argument index= "0" name= "left" type= "float" />
<argument index= "1" name= "top" type= "float" />
<argument index= "2" name= "right" type= "float" />
<argument index= "3" name= " bottom" type= "float" />
2017-09-12 20:42:36 +00:00
<description >
2019-03-29 22:37:35 +00:00
Returns a copy of the [Rect2] grown a given amount of units towards each direction individually.
2017-09-12 20:42:36 +00:00
</description>
</method>
<method name= "grow_margin" >
2021-07-30 13:28:05 +00:00
<return type= "Rect2" />
<argument index= "0" name= "margin" type= "int" />
<argument index= "1" name= "by" type= "float" />
2017-09-12 20:42:36 +00:00
<description >
2019-03-29 22:37:35 +00:00
Returns a copy of the [Rect2] grown a given amount of units towards the [enum Margin] direction.
2017-09-12 20:42:36 +00:00
</description>
</method>
<method name= "has_no_area" >
2021-07-30 13:28:05 +00:00
<return type= "bool" />
2017-09-12 20:42:36 +00:00
<description >
2022-02-01 21:43:02 +00:00
Returns [code]true[/code] if the [Rect2] is flat or empty, [code]false[/code] otherwise. See also [method get_area].
[b]Note:[/b] If the [Rect2] has a negative size and is not flat or empty, [method has_no_area] will return [code]true[/code].
2017-09-12 20:42:36 +00:00
</description>
</method>
<method name= "has_point" >
2021-07-30 13:28:05 +00:00
<return type= "bool" />
<argument index= "0" name= "point" type= "Vector2" />
2017-09-12 20:42:36 +00:00
<description >
2021-11-11 10:31:30 +00:00
Returns [code]true[/code] if the [Rect2] contains a point. By convention, the right and bottom edges of the [Rect2] are considered exclusive, so points on these edges are [b]not[/b] included.
[b]Note:[/b] This method is not reliable for [Rect2] with a [i]negative size[/i]. Use [method abs] to get a positive sized equivalent rectangle to check for contained points.
2017-09-12 20:42:36 +00:00
</description>
</method>
<method name= "intersects" >
2021-07-30 13:28:05 +00:00
<return type= "bool" />
<argument index= "0" name= "b" type= "Rect2" />
<argument index= "1" name= "include_borders" type= "bool" default= "false" />
2017-09-12 20:42:36 +00:00
<description >
2020-02-08 17:43:08 +00:00
Returns [code]true[/code] if the [Rect2] overlaps with [code]b[/code] (i.e. they have at least one point in common).
If [code]include_borders[/code] is [code]true[/code], they will also be considered overlapping if their borders touch, even without intersection.
2017-09-12 20:42:36 +00:00
</description>
</method>
2019-11-08 07:33:48 +00:00
<method name= "is_equal_approx" >
2021-07-30 13:28:05 +00:00
<return type= "bool" />
<argument index= "0" name= "rect" type= "Rect2" />
2019-11-08 07:33:48 +00:00
<description >
2019-11-30 20:08:50 +00:00
Returns [code]true[/code] if this [Rect2] and [code]rect[/code] are approximately equal, by calling [code]is_equal_approx[/code] on each component.
2019-11-08 07:33:48 +00:00
</description>
</method>
2017-09-12 20:42:36 +00:00
<method name= "merge" >
2021-07-30 13:28:05 +00:00
<return type= "Rect2" />
<argument index= "0" name= "b" type= "Rect2" />
2017-09-12 20:42:36 +00:00
<description >
2019-11-30 20:08:50 +00:00
Returns a larger [Rect2] that contains this [Rect2] and [code]b[/code].
2017-09-12 20:42:36 +00:00
</description>
</method>
</methods>
<members >
2019-06-29 10:38:01 +00:00
<member name= "end" type= "Vector2" setter= "" getter= "" default= "Vector2( 0, 0 )" >
2020-07-22 01:21:41 +00:00
Ending corner. This is calculated as [code]position + size[/code]. Setting this value will change the size.
2017-09-12 20:42:36 +00:00
</member>
2019-06-29 10:38:01 +00:00
<member name= "position" type= "Vector2" setter= "" getter= "" default= "Vector2( 0, 0 )" >
2020-07-22 01:21:41 +00:00
Beginning corner. Typically has values lower than [member end].
2017-09-12 20:42:36 +00:00
</member>
2019-06-29 10:38:01 +00:00
<member name= "size" type= "Vector2" setter= "" getter= "" default= "Vector2( 0, 0 )" >
2021-03-18 11:04:28 +00:00
Size from [member position] to [member end]. Typically, all components are positive.
2020-07-22 01:21:41 +00:00
If the size is negative, you can use [method abs] to fix it.
2017-09-12 20:42:36 +00:00
</member>
</members>
<constants >
</constants>
</class>