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
|
#ifndef VISUAL_VECTOR_ARRAY_H
#define VISUAL_VECTOR_ARRAY_H
// Copyright (c) 2000, 2001, 2002, 2003 by David Scherer and others.
// See the file license.txt for complete license terms.
// See the file authors.txt for a complete list of contributors.
#include "cvisual.h"
#include <deque>
#include "vector.h"
#include <boost/python/handle.hpp>
#include <boost/python/numeric.hpp>
namespace visual {
class scalar_array;
class vector_array
{
private:
std::deque<vector> data;
friend class scalar_array;
public:
typedef std::deque<visual::vector>::iterator iterator;
typedef std::deque<visual::vector>::const_iterator const_iterator;
vector_array( int size = 0, vector fill = vector())
: data( size, fill){}
// Construct from a list of three-element tuples.
explicit vector_array( const boost::python::list&);
vector_array( const vector_array& v)
: data( v.data) {}
explicit vector_array( boost::python::numeric::array);
inline iterator
begin()
{ return data.begin(); }
inline const_iterator
begin() const
{ return data.begin(); }
inline iterator
end()
{ return data.end(); }
inline const_iterator
end() const
{ return data.end(); }
// Append a single vector (or vector represented as a tuple) to the array.
void append( const vector& v);
void append( boost::python::tuple v);
void append( const vector_array& va);
// Prepend a single vector (or vector represented as a tuple) the the array.
void prepend( const vector& v);
void prepend( boost::python::tuple v);
// Remove a single element from the beginning of the array
void head_clip();
// Remove i elemnts from the beginning of the array.
void head_crop( int i);
// Remove a single element from the end of the array.
void tail_clip();
// Remove i elements from the end of the array.
void tail_crop( int i);
// Scalar operations
vector_array
operator*( const double& s) const;
vector_array
operator*( int s) const;
vector_array
operator*( const scalar_array& s) const;
vector_array
operator*( vector s) const;
vector_array
operator/( const double& s) const;
vector_array
operator/( int s) const;
vector_array
operator/( const scalar_array& s) const;
vector_array
operator-() const;
const vector_array&
operator*=( const double& s);
const vector_array&
operator*=( int s);
const vector_array&
operator*=( const scalar_array& s);
const vector_array&
operator/=( const double& s);
const vector_array&
operator/=( int s);
const vector_array&
operator/=( const scalar_array& s);
// Vector operations
vector_array
operator+( const vector& v) const;
vector_array
operator-( const vector& v) const;
vector_array
operator+( const vector_array& v) const;
vector_array
operator-( const vector_array& v) const;
const vector_array&
operator+=( const vector& v);
const vector_array&
operator-=( const vector& v);
const vector_array&
operator+=( const vector_array& v);
const vector_array&
operator-=( const vector_array& v);
// Compounded operations
vector_array
cross( const vector& v);
vector_array
cross( const vector_array& v);
vector_array
norm() const;
scalar_array
dot( const vector& v);
scalar_array
dot( const vector_array& v);
vector_array
proj( const vector_array& v);
vector_array
proj( const vector& v);
void
rotate( const double& angle, vector axis = vector(0,0,0));
scalar_array
mag() const;
scalar_array
mag2() const;
scalar_array
comp( const vector& v);
scalar_array
comp( const vector_array& v);
// Returns the vector at the specified position.
// Use the non-checked version for C++, and the checked version for python.
inline vector&
operator[]( int i) { return data[i]; }
inline const vector&
operator[]( int i) const { return data[i]; }
// Returns the number of elemnts in the array.
inline int
size() const { return data.size(); }
inline bool
empty() const { return data.empty(); }
vector&
py_getitem( int index);
void
py_setitem( int index, vector value);
scalar_array get_x() const;
scalar_array get_y() const;
scalar_array get_z() const;
void set_x( const scalar_array&);
void set_y( const scalar_array&);
void set_z( const scalar_array&);
void set_x( boost::python::numeric::array);
void set_y( boost::python::numeric::array);
void set_z( boost::python::numeric::array);
// Force every element to be this single value.
void set_x( double x);
void set_y( double y);
void set_z( double z);
void set_x( const boost::python::list&);
void set_y( const boost::python::list&);
void set_z( const boost::python::list&);
vector
sum() const;
// Support expressions matching vector_array = vector - vector_array.
vector_array
lhs_sub( const vector& v) const;
// Array relational comparisons. These operators return a vector_array whose x,y,and z members
// are all either 0.0 or 1.1.
vector_array
operator>=( const double&) const;
vector_array
operator>=( const scalar_array&) const;
vector_array
operator>=( const vector_array&) const;
vector_array
operator<=( const double&) const;
vector_array
operator<=( const scalar_array&) const;
vector_array
operator<=( const vector_array&) const;
vector_array
fabs() const;
// Element-wise multiplication...
vector_array
operator*( const vector_array& v) const;
boost::python::numeric::array
as_array() const;
};
void vector_array_init_type();
// Return an ordered list of collisions detected between a set of spheres
// whose centers are encoded in pos, and radii are encoded in radius.
// This algorithm runs in O(n*n) time.
// The returned list is an ordered list of tuple indexes into the array pos.
// e.g., [(2,4)] indicates a collision between the second and fourth spheres.
boost::python::list
sphere_collisions( const visual::vector_array& pos, const visual::scalar_array& radius);
boost::python::list
sphere_to_plane_collisions( const vector_array& pos, const scalar_array& radius
, vector normal, vector origin);
} // !namespace visual
// Support several expressions with a vector_array on the rhs
// Note that all of the scalar_array op vector_array expressions are covered
// in class scalar_array.
inline visual::vector_array
operator*( const double& s, const visual::vector_array& v)
{
return v * s;
}
inline visual::vector_array
operator*( int s, const visual::vector_array& v)
{
return v * s;
}
inline visual::vector_array
operator-( const visual::vector& v, const visual::vector_array& v_a)
{
return v_a.lhs_sub( v);
}
inline visual::vector_array
operator+( const visual::vector& v, const visual::vector_array& v_a)
{
return v_a + v;
}
#endif // !VISUAL_VECTOR_ARRAY_H
|