[go: up one dir, main page]

Menu

[r49]: / lpi_math2d.cpp  Maximize  Restore  History

Download this file

205 lines (167 with data), 4.5 kB

  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
/*
Copyright (c) 2005-2007 Lode Vandevenne
All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
* 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.
* Neither the name of Lode Vandevenne nor the names of his 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.
*/
#include "lpi_math2d.h"
#include <cmath>
namespace lpi
{
Vector2::Vector2(double x, double y)
{
this->x = x;
this->y = y;
}
Vector2::Vector2()
{
x = 0.0;
y = 0.0;
}
Vector2& Vector2::operator+=(const Vector2& v)
{
x += v.x;
y += v.y;
return *this;
}
Vector2& Vector2::operator-=(const Vector2& v)
{
x -= v.x;
y -= v.y;
return *this;
}
Vector2& Vector2::operator*=(double a)
{
x *= a;
y *= a;
return *this;
}
Vector2& Vector2::operator/=(double a)
{
x /= a;
y /= a;
return *this;
}
//Subtract two vectors: a----->b is b minus a
Vector2 operator-(const Vector2& v, const Vector2& w)
{
Vector2 u = v;
u -= w;
return u;
}
void Vector2::negate()
{
x = -x;
y = -y;
}
//Return the negative of the vector
Vector2 operator-(const Vector2& v)
{
Vector2 u = v;
u.negate();
return u;
}
//Add two vectors
Vector2 operator+(const Vector2& v, const Vector2& w)
{
Vector2 u = v;
u += w;
return u;
}
//Multiplies a vector by a scalar
Vector2 operator*(const Vector2& v, double a)
{
Vector2 w = v;
w *= a;
return w;
}
//Multiplies a vector by a scalar
Vector2 operator*(double a, const Vector2& v)
{
Vector2 w = v;
w *= a;
return w;
}
//Divides a vector through a scalar
Vector2 operator/(const Vector2& v, double a)
{
Vector2 w = v;
w /= a;
return w;
}
////////////////////////////////////////////////////////////////////////////////
double Vector2::length() const
{
return std::sqrt(x * x + y * y);
}
double Vector2::lengthsq() const
{
return x * x + y * y;
}
double Vector2::manhattan() const
{
return std::abs(x) + std::abs(y);
}
double length(const Vector2& v)
{
return std::sqrt(v.x * v.x + v.y * v.y);
}
double lengthsq(const Vector2& v)
{
return v.x * v.x + v.y * v.y;
}
double manhattan(const Vector2& v)
{
return std::abs(v.x) + std::abs(v.y);
}
void Vector2::normalize()
{
double l = length();
if(l != 0.0)
{
x /= l;
y /= l;
}
}
Vector2 normalize(const Vector2& v)
{
Vector2 result = v;
result.normalize();
return result;
}
double Vector2::distance(const Vector2& v)
{
return std::sqrt((v.x - x) * (v.x - x) + (v.y - y) * (v.y - y));
}
double Vector2::distancesq(const Vector2& v)
{
return (v.x - x) * (v.x - x) + (v.y - y) * (v.y - y);
}
double Vector2::manhattan(const Vector2& v)
{
return std::abs(v.x - x) + std::abs(v.y - y);
}
double distance(const Vector2& v, const Vector2& w)
{
return std::sqrt((v.x - w.x) * (v.x - w.x) + (v.y - w.y) * (v.y - w.y));
}
double distancesq(const Vector2& v, const Vector2& w) //square of the distance, no square root taken
{
return (v.x - w.x) * (v.x - w.x) + (v.y - w.y) * (v.y - w.y);
}
double manhattan(const Vector2& v, const Vector2& w) //square of the distance, no square root taken
{
return std::abs(v.x - w.x) + std::abs(v.y - w.y);
}
double Vector2::dot(const Vector2& v)
{
return v.x * x + v.y * y;
}
double dot(const Vector2& v, const Vector2& w)
{
return v.x * w.x + v.y * w.y;
}
}