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
247
248
249
250
251
252
253
254
255
256
|
using System;
using System.Runtime.InteropServices;
#if REAL_T_IS_DOUBLE
using real_t = System.Double;
#else
using real_t = System.Single;
#endif
namespace Godot
{
[StructLayout(LayoutKind.Sequential)]
public struct Rect2 : IEquatable<Rect2>
{
private Vector2 _position;
private Vector2 _size;
public Vector2 Position
{
get { return _position; }
set { _position = value; }
}
public Vector2 Size
{
get { return _size; }
set { _size = value; }
}
public Vector2 End
{
get { return _position + _size; }
set { _size = value - _position; }
}
public real_t Area
{
get { return GetArea(); }
}
public Rect2 Abs()
{
Vector2 end = End;
Vector2 topLeft = new Vector2(Mathf.Min(_position.x, end.x), Mathf.Min(_position.y, end.y));
return new Rect2(topLeft, _size.Abs());
}
public Rect2 Clip(Rect2 b)
{
var newRect = b;
if (!Intersects(newRect))
return new Rect2();
newRect._position.x = Mathf.Max(b._position.x, _position.x);
newRect._position.y = Mathf.Max(b._position.y, _position.y);
Vector2 bEnd = b._position + b._size;
Vector2 end = _position + _size;
newRect._size.x = Mathf.Min(bEnd.x, end.x) - newRect._position.x;
newRect._size.y = Mathf.Min(bEnd.y, end.y) - newRect._position.y;
return newRect;
}
public bool Encloses(Rect2 b)
{
return b._position.x >= _position.x && b._position.y >= _position.y &&
b._position.x + b._size.x < _position.x + _size.x &&
b._position.y + b._size.y < _position.y + _size.y;
}
public Rect2 Expand(Vector2 to)
{
var expanded = this;
Vector2 begin = expanded._position;
Vector2 end = expanded._position + expanded._size;
if (to.x < begin.x)
begin.x = to.x;
if (to.y < begin.y)
begin.y = to.y;
if (to.x > end.x)
end.x = to.x;
if (to.y > end.y)
end.y = to.y;
expanded._position = begin;
expanded._size = end - begin;
return expanded;
}
public real_t GetArea()
{
return _size.x * _size.y;
}
public Rect2 Grow(real_t by)
{
var g = this;
g._position.x -= by;
g._position.y -= by;
g._size.x += by * 2;
g._size.y += by * 2;
return g;
}
public Rect2 GrowIndividual(real_t left, real_t top, real_t right, real_t bottom)
{
var g = this;
g._position.x -= left;
g._position.y -= top;
g._size.x += left + right;
g._size.y += top + bottom;
return g;
}
public Rect2 GrowMargin(Margin margin, real_t by)
{
var g = this;
g.GrowIndividual(Margin.Left == margin ? by : 0,
Margin.Top == margin ? by : 0,
Margin.Right == margin ? by : 0,
Margin.Bottom == margin ? by : 0);
return g;
}
public bool HasNoArea()
{
return _size.x <= 0 || _size.y <= 0;
}
public bool HasPoint(Vector2 point)
{
if (point.x < _position.x)
return false;
if (point.y < _position.y)
return false;
if (point.x >= _position.x + _size.x)
return false;
if (point.y >= _position.y + _size.y)
return false;
return true;
}
public bool Intersects(Rect2 b)
{
if (_position.x > b._position.x + b._size.x)
return false;
if (_position.x + _size.x < b._position.x)
return false;
if (_position.y > b._position.y + b._size.y)
return false;
if (_position.y + _size.y < b._position.y)
return false;
return true;
}
public Rect2 Merge(Rect2 b)
{
Rect2 newRect;
newRect._position.x = Mathf.Min(b._position.x, _position.x);
newRect._position.y = Mathf.Min(b._position.y, _position.y);
newRect._size.x = Mathf.Max(b._position.x + b._size.x, _position.x + _size.x);
newRect._size.y = Mathf.Max(b._position.y + b._size.y, _position.y + _size.y);
newRect._size = newRect._size - newRect._position; // Make relative again
return newRect;
}
// Constructors
public Rect2(Vector2 position, Vector2 size)
{
_position = position;
_size = size;
}
public Rect2(Vector2 position, real_t width, real_t height)
{
_position = position;
_size = new Vector2(width, height);
}
public Rect2(real_t x, real_t y, Vector2 size)
{
_position = new Vector2(x, y);
_size = size;
}
public Rect2(real_t x, real_t y, real_t width, real_t height)
{
_position = new Vector2(x, y);
_size = new Vector2(width, height);
}
public static bool operator ==(Rect2 left, Rect2 right)
{
return left.Equals(right);
}
public static bool operator !=(Rect2 left, Rect2 right)
{
return !left.Equals(right);
}
public override bool Equals(object obj)
{
if (obj is Rect2)
{
return Equals((Rect2)obj);
}
return false;
}
public bool Equals(Rect2 other)
{
return _position.Equals(other._position) && _size.Equals(other._size);
}
public override int GetHashCode()
{
return _position.GetHashCode() ^ _size.GetHashCode();
}
public override string ToString()
{
return String.Format("({0}, {1})", new object[]
{
_position.ToString(),
_size.ToString()
});
}
public string ToString(string format)
{
return String.Format("({0}, {1})", new object[]
{
_position.ToString(format),
_size.ToString(format)
});
}
}
}
|