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
257
258
259
260
261
262
263
264
265
266
267
268
269
|
/****************************************************************************
*
* Copyright (C) 2013 PX4 Development Team. All rights reserved.
* Author: Will Perone <will.perone@gmail.com>
* Anton Babushkin <anton.babushkin@me.com>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
* 3. Neither the name PX4 nor the names of its contributors may be
* used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*
****************************************************************************/
/**
* @file Vector2.hpp
*
* 2D Vector
*/
#ifndef VECTOR2_HPP
#define VECTOR2_HPP
#include <math.h>
namespace math
{
template <typename T>
class Vector2 {
public:
T x, y;
/**
* trivial ctor
*/
Vector2<T>() {
}
/**
* setting ctor
*/
Vector2<T>(const T x0, const T y0): x(x0), y(y0) {
}
/**
* setter
*/
void set(const T x0, const T y0) {
x = x0;
y = y0;
}
/**
* access to elements by index
*/
T operator ()(unsigned int i) {
return *(&x + i);
}
/**
* access to elements by index
*/
const T operator ()(unsigned int i) const {
return *(&x + i);
}
/**
* test for equality
*/
bool operator ==(const Vector2<T> &v) {
return (x == v.x && y == v.y);
}
/**
* test for inequality
*/
bool operator !=(const Vector2<T> &v) {
return (x != v.x || y != v.y);
}
/**
* set to value
*/
const Vector2<T> &operator =(const Vector2<T> &v) {
x = v.x;
y = v.y;
return *this;
}
/**
* negation
*/
const Vector2<T> operator -(void) const {
return Vector2<T>(-x, -y);
}
/**
* addition
*/
const Vector2<T> operator +(const Vector2<T> &v) const {
return Vector2<T>(x + v.x, y + v.y);
}
/**
* subtraction
*/
const Vector2<T> operator -(const Vector2<T> &v) const {
return Vector2<T>(x - v.x, y - v.y);
}
/**
* uniform scaling
*/
const Vector2<T> operator *(const T num) const {
Vector2<T> temp(*this);
return temp *= num;
}
/**
* uniform scaling
*/
const Vector2<T> operator /(const T num) const {
Vector2<T> temp(*this);
return temp /= num;
}
/**
* addition
*/
const Vector2<T> &operator +=(const Vector2<T> &v) {
x += v.x;
y += v.y;
return *this;
}
/**
* subtraction
*/
const Vector2<T> &operator -=(const Vector2<T> &v) {
x -= v.x;
y -= v.y;
return *this;
}
/**
* uniform scaling
*/
const Vector2<T> &operator *=(const T num) {
x *= num;
y *= num;
return *this;
}
/**
* uniform scaling
*/
const Vector2<T> &operator /=(const T num) {
x /= num;
y /= num;
return *this;
}
/**
* dot product
*/
T operator *(const Vector2<T> &v) const {
return x * v.x + y * v.y;
}
/**
* cross product
*/
const float operator %(const Vector2<T> &v) const {
return x * v.y - y * v.x;
}
/**
* gets the length of this vector squared
*/
float length_squared() const {
return (*this * *this);
}
/**
* gets the length of this vector
*/
float length() const {
return (T)sqrt(*this * *this);
}
/**
* normalizes this vector
*/
void normalize() {
*this /= length();
}
/**
* returns the normalized version of this vector
*/
Vector2<T> normalized() const {
return *this / length();
}
/**
* reflects this vector about n
*/
void reflect(const Vector2<T> &n)
{
Vector2<T> orig(*this);
project(n);
*this = *this * 2 - orig;
}
/**
* projects this vector onto v
*/
void project(const Vector2<T> &v) {
*this = v * (*this * v) / (v * v);
}
/**
* returns this vector projected onto v
*/
Vector2<T> projected(const Vector2<T> &v) {
return v * (*this * v) / (v * v);
}
/**
* computes the angle between 2 arbitrary vectors
*/
static inline float angle(const Vector2<T> &v1, const Vector2<T> &v2) {
return acosf((v1 * v2) / (v1.length() * v2.length()));
}
/**
* computes the angle between 2 arbitrary normalized vectors
*/
static inline float angle_normalized(const Vector2<T> &v1, const Vector2<T> &v2) {
return acosf(v1 * v2);
}
};
typedef Vector2<float> Vector2f;
}
#endif // VECTOR2_HPP
|
