2010-09-04 18:18:14 +08:00
|
|
|
/* Copyright (c) 2007 Scott Lembcke
|
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
|
|
* in the Software without restriction, including without limitation the rights
|
|
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
|
|
* copies of the Software, and to permit persons to whom the Software is
|
|
|
|
* furnished to do so, subject to the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice shall be included in
|
|
|
|
* all copies or substantial portions of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
|
|
* SOFTWARE.
|
|
|
|
*/
|
|
|
|
|
2011-05-21 14:58:22 +08:00
|
|
|
/// Constant for the zero vector.
|
|
|
|
static const cpVect cpvzero = {0.0f,0.0f};
|
2010-09-04 18:18:14 +08:00
|
|
|
|
2011-05-21 14:58:22 +08:00
|
|
|
/// Convenience constructor for cpVect structs.
|
2010-09-04 18:18:14 +08:00
|
|
|
static inline cpVect
|
|
|
|
cpv(const cpFloat x, const cpFloat y)
|
|
|
|
{
|
|
|
|
cpVect v = {x, y};
|
|
|
|
return v;
|
|
|
|
}
|
|
|
|
|
|
|
|
// non-inlined functions
|
2011-05-21 14:58:22 +08:00
|
|
|
|
|
|
|
/// Returns the length of v.
|
2010-09-04 18:18:14 +08:00
|
|
|
cpFloat cpvlength(const cpVect v);
|
2011-05-21 14:58:22 +08:00
|
|
|
|
|
|
|
/// Spherical linearly interpolate between v1 and v2.
|
2010-09-04 18:18:14 +08:00
|
|
|
cpVect cpvslerp(const cpVect v1, const cpVect v2, const cpFloat t);
|
2011-05-21 14:58:22 +08:00
|
|
|
|
|
|
|
/// Spherical linearly interpolate between v1 towards v2 by no more than angle a radians
|
2010-09-04 18:18:14 +08:00
|
|
|
cpVect cpvslerpconst(const cpVect v1, const cpVect v2, const cpFloat a);
|
|
|
|
|
2011-05-21 14:58:22 +08:00
|
|
|
/// Returns the unit length vector for the given angle (in radians).
|
|
|
|
cpVect cpvforangle(const cpFloat a);
|
|
|
|
|
|
|
|
/// Returns the angular direction v is pointing in (in radians).
|
|
|
|
cpFloat cpvtoangle(const cpVect v);
|
|
|
|
|
|
|
|
/**
|
|
|
|
Returns a string representation of v. Intended mostly for debugging purposes and not production use.
|
|
|
|
|
|
|
|
@attention The string points to a static local and is reset every time the function is called.
|
|
|
|
If you want to print more than one vector you will have to split up your printing onto separate lines.
|
|
|
|
*/
|
|
|
|
char *cpvstr(const cpVect v);
|
|
|
|
|
|
|
|
/// Check if two vectors are equal. (Be careful when comparing floating point numbers!)
|
|
|
|
static inline cpBool
|
|
|
|
cpveql(const cpVect v1, const cpVect v2)
|
|
|
|
{
|
|
|
|
return (v1.x == v2.x && v1.y == v2.y);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Add two vectors
|
2010-09-04 18:18:14 +08:00
|
|
|
static inline cpVect
|
|
|
|
cpvadd(const cpVect v1, const cpVect v2)
|
|
|
|
{
|
|
|
|
return cpv(v1.x + v2.x, v1.y + v2.y);
|
|
|
|
}
|
|
|
|
|
2011-05-21 14:58:22 +08:00
|
|
|
/// Negate a vector.
|
2010-09-04 18:18:14 +08:00
|
|
|
static inline cpVect
|
|
|
|
cpvneg(const cpVect v)
|
|
|
|
{
|
|
|
|
return cpv(-v.x, -v.y);
|
|
|
|
}
|
|
|
|
|
2011-05-21 14:58:22 +08:00
|
|
|
/// Subtract two vectors.
|
2010-09-04 18:18:14 +08:00
|
|
|
static inline cpVect
|
|
|
|
cpvsub(const cpVect v1, const cpVect v2)
|
|
|
|
{
|
|
|
|
return cpv(v1.x - v2.x, v1.y - v2.y);
|
|
|
|
}
|
|
|
|
|
2011-05-21 14:58:22 +08:00
|
|
|
/// Scalar multiplication.
|
2010-09-04 18:18:14 +08:00
|
|
|
static inline cpVect
|
|
|
|
cpvmult(const cpVect v, const cpFloat s)
|
|
|
|
{
|
|
|
|
return cpv(v.x*s, v.y*s);
|
|
|
|
}
|
|
|
|
|
2011-05-21 14:58:22 +08:00
|
|
|
/// Vector dot product.
|
2010-09-04 18:18:14 +08:00
|
|
|
static inline cpFloat
|
|
|
|
cpvdot(const cpVect v1, const cpVect v2)
|
|
|
|
{
|
|
|
|
return v1.x*v2.x + v1.y*v2.y;
|
|
|
|
}
|
|
|
|
|
2011-05-21 14:58:22 +08:00
|
|
|
/**
|
|
|
|
2D vector cross product analog.
|
|
|
|
The cross product of 2D vectors results in a 3D vector with only a z component.
|
|
|
|
This function returns the magnitude of the z value.
|
|
|
|
*/
|
2010-09-04 18:18:14 +08:00
|
|
|
static inline cpFloat
|
|
|
|
cpvcross(const cpVect v1, const cpVect v2)
|
|
|
|
{
|
|
|
|
return v1.x*v2.y - v1.y*v2.x;
|
|
|
|
}
|
|
|
|
|
2011-05-21 14:58:22 +08:00
|
|
|
/// Returns a perpendicular vector. (90 degree rotation)
|
2010-09-04 18:18:14 +08:00
|
|
|
static inline cpVect
|
|
|
|
cpvperp(const cpVect v)
|
|
|
|
{
|
|
|
|
return cpv(-v.y, v.x);
|
|
|
|
}
|
|
|
|
|
2011-05-21 14:58:22 +08:00
|
|
|
/// Returns a perpendicular vector. (-90 degree rotation)
|
2010-09-04 18:18:14 +08:00
|
|
|
static inline cpVect
|
|
|
|
cpvrperp(const cpVect v)
|
|
|
|
{
|
|
|
|
return cpv(v.y, -v.x);
|
|
|
|
}
|
|
|
|
|
2011-05-21 14:58:22 +08:00
|
|
|
/// Returns the vector projection of v1 onto v2.
|
2010-09-04 18:18:14 +08:00
|
|
|
static inline cpVect
|
|
|
|
cpvproject(const cpVect v1, const cpVect v2)
|
|
|
|
{
|
|
|
|
return cpvmult(v2, cpvdot(v1, v2)/cpvdot(v2, v2));
|
|
|
|
}
|
|
|
|
|
2011-05-21 14:58:22 +08:00
|
|
|
/// Uses complex number multiplication to rotate v1 by v2. Scaling will occur if v1 is not a unit vector.
|
2010-09-04 18:18:14 +08:00
|
|
|
static inline cpVect
|
|
|
|
cpvrotate(const cpVect v1, const cpVect v2)
|
|
|
|
{
|
|
|
|
return cpv(v1.x*v2.x - v1.y*v2.y, v1.x*v2.y + v1.y*v2.x);
|
|
|
|
}
|
|
|
|
|
2011-05-21 14:58:22 +08:00
|
|
|
/// Inverse of cpvrotate().
|
2010-09-04 18:18:14 +08:00
|
|
|
static inline cpVect
|
|
|
|
cpvunrotate(const cpVect v1, const cpVect v2)
|
|
|
|
{
|
|
|
|
return cpv(v1.x*v2.x + v1.y*v2.y, v1.y*v2.x - v1.x*v2.y);
|
|
|
|
}
|
|
|
|
|
2011-05-21 14:58:22 +08:00
|
|
|
/// Returns the squared length of v. Faster than cpvlength() when you only need to compare lengths.
|
2010-09-04 18:18:14 +08:00
|
|
|
static inline cpFloat
|
|
|
|
cpvlengthsq(const cpVect v)
|
|
|
|
{
|
|
|
|
return cpvdot(v, v);
|
|
|
|
}
|
|
|
|
|
2011-05-21 14:58:22 +08:00
|
|
|
/// Linearly interpolate between v1 and v2.
|
2010-09-04 18:18:14 +08:00
|
|
|
static inline cpVect
|
|
|
|
cpvlerp(const cpVect v1, const cpVect v2, const cpFloat t)
|
|
|
|
{
|
|
|
|
return cpvadd(cpvmult(v1, 1.0f - t), cpvmult(v2, t));
|
|
|
|
}
|
|
|
|
|
2011-05-21 14:58:22 +08:00
|
|
|
/// Returns a normalized copy of v.
|
2010-09-04 18:18:14 +08:00
|
|
|
static inline cpVect
|
|
|
|
cpvnormalize(const cpVect v)
|
|
|
|
{
|
|
|
|
return cpvmult(v, 1.0f/cpvlength(v));
|
|
|
|
}
|
|
|
|
|
2011-05-21 14:58:22 +08:00
|
|
|
/// Returns a normalized copy of v or cpvzero if v was already cpvzero. Protects against divide by zero errors.
|
2010-09-04 18:18:14 +08:00
|
|
|
static inline cpVect
|
|
|
|
cpvnormalize_safe(const cpVect v)
|
|
|
|
{
|
|
|
|
return (v.x == 0.0f && v.y == 0.0f ? cpvzero : cpvnormalize(v));
|
|
|
|
}
|
|
|
|
|
2011-05-21 14:58:22 +08:00
|
|
|
/// Clamp v to length len.
|
2010-09-04 18:18:14 +08:00
|
|
|
static inline cpVect
|
|
|
|
cpvclamp(const cpVect v, const cpFloat len)
|
|
|
|
{
|
|
|
|
return (cpvdot(v,v) > len*len) ? cpvmult(cpvnormalize(v), len) : v;
|
|
|
|
}
|
|
|
|
|
2011-05-21 14:58:22 +08:00
|
|
|
/// Linearly interpolate between v1 towards v2 by distance d.
|
2010-09-04 18:18:14 +08:00
|
|
|
static inline cpVect
|
|
|
|
cpvlerpconst(cpVect v1, cpVect v2, cpFloat d)
|
|
|
|
{
|
|
|
|
return cpvadd(v1, cpvclamp(cpvsub(v2, v1), d));
|
|
|
|
}
|
|
|
|
|
2011-05-21 14:58:22 +08:00
|
|
|
/// Returns the distance between v1 and v2.
|
2010-09-04 18:18:14 +08:00
|
|
|
static inline cpFloat
|
|
|
|
cpvdist(const cpVect v1, const cpVect v2)
|
|
|
|
{
|
|
|
|
return cpvlength(cpvsub(v1, v2));
|
|
|
|
}
|
|
|
|
|
2011-05-21 14:58:22 +08:00
|
|
|
/// Returns the squared distance between v1 and v2. Faster than cpvdist() when you only need to compare distances.
|
2010-09-04 18:18:14 +08:00
|
|
|
static inline cpFloat
|
|
|
|
cpvdistsq(const cpVect v1, const cpVect v2)
|
|
|
|
{
|
|
|
|
return cpvlengthsq(cpvsub(v1, v2));
|
|
|
|
}
|
|
|
|
|
2011-05-21 14:58:22 +08:00
|
|
|
/// Returns true if the distance between v1 and v2 is less than dist.
|
|
|
|
static inline cpBool
|
2010-09-04 18:18:14 +08:00
|
|
|
cpvnear(const cpVect v1, const cpVect v2, const cpFloat dist)
|
|
|
|
{
|
|
|
|
return cpvdistsq(v1, v2) < dist*dist;
|
|
|
|
}
|