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 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316
|
#ifndef __BTANKS_V3_H__
#define __BTANKS_V3_H__
/* Battle Tanks Game
* Copyright (C) 2006-2009 Battle Tanks team
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
/*
* Additional rights can be granted beyond the GNU General Public License
* on the terms provided in the Exception. If you modify this file,
* you may extend this exception to your version of the file,
* but you are not obligated to do so. If you do not wish to provide this
* exception without modification, you must delete this exception statement
* from your version and license this file solely under the GPL without exception.
*/
#include <stdio.h>
#include <math.h>
#include <assert.h>
#include "mrt/serializator.h"
#include "mrt/serializable.h"
#include <string>
#include <stdexcept>
#include "mrt/exception.h"
#include <typeinfo>
template <typename T> class v3 : public mrt::Serializable {
public:
T x, y, z;
inline v3<T>() : x(0), y(0), z(0) {}
inline v3<T>(const T x, const T y, const T z) : x(x), y(y), z(z) {}
inline void clear() { x = y = z = 0; }
inline const bool is0() const {
#ifndef V3_DISABLE_Z
return x== 0 && y == 0 && z == 0;
#else
return x== 0 && y == 0;
#endif
}
inline const T normalize() {
const T len = length();
if (len == (T)0 || len ==(T)1)
return len;
x /= len;
y /= len;
z /= len;
return len;
}
inline const T normalize(const T nlen) {
const T len = length();
if (len == (T)0 || len == nlen)
return len;
x *= nlen / len;
y *= nlen / len;
z *= nlen / len;
return len;
}
inline const T length() const {
#ifndef V3_DISABLE_Z
const T ql = x * x + y * y + z * z;
if (ql == (T)0 || ql == (T)1)
return ql;
return (T)sqrt(ql);
#else
const T ql = x * x + y * y;
if (ql == (T)0 || ql == (T)1)
return ql;
return (T)sqrt(ql);
#endif
}
inline const T quick_length() const {
#ifndef V3_DISABLE_Z
return (T)(x * x + y * y + z * z);
#else
return (T)(x * x + y * y);
#endif
}
template <typename T2>
inline v3<T2> convert() const { return v3<T2>((T2)x, (T2)y, (T2)z); }
inline const T distance(const v3<T>& other) const {
v3<T>d(*this);
d-= other;
return d.length();
}
inline const T quick_distance(const v3<T>& other) const {
const T dx = x - other.x;
const T dy = y - other.y;
#ifndef V3_DISABLE_Z
const T dz = z - other.z;
return (dx * dx + dy * dy + dz * dz);
#else
return (dx * dx + dy * dy);
#endif
}
inline const T scalar(const v3<T> &other) const {
#ifndef V3_DISABLE_Z
return (x * other.x + y * other.y + z * other.z);
#else
return (x * other.x + y * other.y);
#endif
}
inline const bool same_sign(const v3<T> &other) const {
if (x == 0) {
if (other.x != 0)
return false;
} else { //x != 0
if (other.x * x < 0)
return false;
}
if (y == 0) {
if (other.y != 0)
return false;
} else { //y != 0
if (other.y * y < 0)
return false;
}
#ifndef V3_DISABLE_Z
if (z == 0) {
if (other.z != 0)
return false;
} else { //z != 0
if (other.z * z < 0)
return false;
}
#endif
return true;
}
//operators
inline const bool operator<(const v3<T> &other) const {
if (x != other.x) {
return x < other.x;
}
if (y != other.y) {
return y < other.y;
}
return z < other.z;
}
inline const v3<T> operator-() const {
return v3<T>(-x, -y, -z);
}
inline const bool operator==(const v3<T> &other) const {
return x == other.x && y == other.y && z == other.z;
}
inline const bool operator!=(const v3<T> &other) const {
return x != other.x || y != other.y || z != other.z;
}
inline const v3<T>& operator+=(const v3<T>& other) {
x += other.x; y += other.y; z += other.z;
return *this;
}
inline const v3<T>& operator-=(const v3<T>& other) {
x -= other.x; y -= other.y; z -= other.z;
return *this;
}
inline const v3<T>& operator*=(const v3<T>& other) {
x *= other.x; y *= other.y; z *= other.z;
return *this;
}
inline const v3<T>& operator/=(const v3<T>& other) {
x /= other.x; y /= other.y; z /= other.z;
return *this;
}
inline const v3<T> operator*(const v3<T>& other) const {
return v3<T>(x * other.x, y * other.y, z * other.z);
}
inline const v3<T> operator+(const v3<T>& other) const {
return v3<T>(x + other.x, y + other.y, z + other.z);
}
inline const v3<T> operator-(const v3<T>& other) const {
return v3<T>(x - other.x, y - other.y, z - other.z);
}
inline const v3<T> operator/(const v3<T>& other) const {
return v3<T>(x / other.x, y / other.y, z / other.z);
}
inline const v3<T> operator*(const T& other) const {
return v3<T>(x * other, y * other, z * other);
}
inline const v3<T> operator+(const T& other) const {
return v3<T>(x + other, y + other, z + other);
}
inline const v3<T> operator-(const T& other) const {
return v3<T>(x - other, y - other, z - other);
}
inline const v3<T> operator/(const T& other) const {
return v3<T>(x / other, y / other, z / other);
}
inline const v3<T>& operator/=(const T& other) {
x /= other;
y /= other;
z /= other;
return *this;
}
inline const v3<T>& operator*=(const T& other) {
x *= other;
y *= other;
z *= other;
return *this;
}
inline const v3<T>& operator+=(const T& other) {
x += other;
y += other;
z += other;
return *this;
}
inline const v3<T>& operator-=(const T& other) {
x -= other;
y -= other;
z -= other;
return *this;
}
public:
virtual void serialize(mrt::Serializator &s) const {
s.add(x);
s.add(y);
s.add(z);
}
virtual void deserialize(const mrt::Serializator &s) {
s.get(x);
s.get(y);
s.get(z);
}
void fromString(const std::string &str) {
clear();
if (typeid(T) == typeid(int)) {
if (sscanf(str.c_str(), "%d,%d,%d", &x, &y, &z) < 2)
throw std::invalid_argument("cannot parse %d,%d,%d from " + str);
} else throw std::invalid_argument("invalid type T. only int allowed for fromString()");
}
};
template <typename T>
const v3<T> operator+(const T a, const v3<T> &v) {
return v3<T>(v.x + a, v.y + a, v.z + a);
}
template <typename T>
const v3<T> operator+(const v3<T> &v, const T a) {
return v3<T>(v.x + a, v.y + a, v.z + a);
}
template <typename T>
const v3<T> operator*(const T a, const v3<T> &v) {
return v3<T>(v.x *a, v.y * a, v.z * a);
}
template <typename T>
const v3<T> operator*(const v3<T> &v, const T a) {
return v3<T>(v.x *a, v.y * a, v.z * a);
}
template <typename T>
const v3<T> operator/(const T a, const v3<T> &v) {
return v3<T>(a / v.x, a / v.y, a / v.z);
}
template <typename T>
const v3<T> operator/(const v3<T> &v, const T a) {
return v3<T>(v.x / a, v.y / a, v.z / a);
}
#endif
|