X-Git-Url: http://git.tdb.fi/?a=blobdiff_plain;f=source%2Flinal%2Fvector.h;h=610ac2103a21ab83e0b58f88905e6d07c6962d2d;hb=291c11cf66e7083dc21fffea1afbdeaaad96077d;hp=392e3a12772dcdc6e3b9f12dba937c7d38779e29;hpb=b60ee0fb060790277bfc68722f85a137a58ad771;p=libs%2Fmath.git

diff --git a/source/linal/vector.h b/source/linal/vector.h
index 392e3a1..610ac21 100644
--- a/source/linal/vector.h
+++ b/source/linal/vector.h
@@ -3,27 +3,97 @@
 
 #include <algorithm>
 #include <cmath>
+#include <ostream>
 
 namespace Msp {
 namespace LinAl {
 
 /**
-A general mathematical vector.
+Base class to provide the components of a vector.  This is used so that
+specializations with individual members can be provided in some dimensions.
 */
 template<typename T, unsigned N>
-class Vector
+class VectorComponents
 {
-protected:
+private:
 	T data[N];
 
+protected:
+	VectorComponents() { }
+
+public:
+	T &operator[](unsigned i) { return data[i]; }
+	const T &operator[](unsigned i) const { return data[i]; }
+};
+
+template<typename T>
+class VectorComponents<T, 2>
+{
 public:
+	T x, y;
+
+protected:
+	VectorComponents() { }
+
+public:
+	T &operator[](unsigned i) { return *(&x+i); }
+	const T &operator[](unsigned i) const { return *(&x+i); }
+};
+
+template<typename T>
+class VectorComponents<T, 3>
+{
+public:
+	T x, y, z;
+
+protected:
+	VectorComponents() { }
+
+public:
+	T &operator[](unsigned i) { return *(&x+i); }
+	const T &operator[](unsigned i) const { return *(&x+i); }
+};
+
+template<typename T>
+class VectorComponents<T, 4>
+{
+public:
+	T x, y, z, w;
+
+protected:
+	VectorComponents() { }
+
+public:
+	T &operator[](unsigned i) { return *(&x+i); }
+	const T &operator[](unsigned i) const { return *(&x+i); }
+};
+
+/**
+A general mathematical vector.
+*/
+template<typename T, unsigned N>
+class Vector: public VectorComponents<T, N>
+{
+public:
+	typedef T ElementType;
+
 	Vector();
-	Vector(const T *d);
+	Vector(const T *);
+
+	/** Constructs a vector from an array of interleaved values.  Intended for
+	use by Matrix row accessor. */
+	Vector(const T *, unsigned);
+
+	template<typename... Args>
+	Vector(T, Args...);
+
 	template<typename U>
-	Vector(const Vector<U, N> &v);
+	Vector(const Vector<U, N> &);
 
-	T &operator[](unsigned i) { return data[i]; }
-	const T &operator[](unsigned i) const { return data[i]; }
+	unsigned size() const { return N; }
+
+	template<unsigned M>
+	Vector<T, M> slice(unsigned) const;
 
 	Vector &operator*=(T);
 	Vector &operator/=(T);
@@ -38,27 +108,89 @@ public:
 template<typename T, unsigned N>
 inline Vector<T, N>::Vector()
 {
-	std::fill(data, data+N, T());
+	for(unsigned i=0; i<N; ++i)
+		(*this)[i] = T();
 }
 
 template<typename T, unsigned N>
 inline Vector<T, N>::Vector(const T *d)
 {
-	std::copy(d, d+N, data);
+	for(unsigned i=0; i<N; ++i)
+		(*this)[i] = d[i];
+}
+
+template<typename T, unsigned N>
+inline Vector<T, N>::Vector(const T *d, unsigned stride)
+{
+	for(unsigned i=0; i<N; ++i)
+		(*this)[i] = d[i*stride];
+}
+
+template<typename T, unsigned N>
+template<typename... Args>
+inline Vector<T, N>::Vector(T x_, Args... v)
+{
+	static_assert(1+sizeof...(v)==N, "Incorrect number of arguments in Vector constructor");
+	(*this)[0] = x_;
+	unsigned i = 1;
+	for(auto c: std::initializer_list<T> { static_cast<T>(v)... })
+		(*this)[i++] = c;
 }
 
 template<typename T, unsigned N>
 template<typename U>
 inline Vector<T, N>::Vector(const Vector<U, N> &v)
 {
-	std::copy(v.data, v.data+N, data);
+	for(unsigned i=0; i<N; ++i)
+		(*this)[i] = v[i];
+}
+
+template<typename T, unsigned N>
+inline Vector<T, N+1> compose(const Vector<T, N> &v, T s)
+{
+	Vector<T, N+1> r;
+	for(unsigned i=0; i<N; ++i)
+		r[i] = v[i];
+	r[N] = s;
+	return r;
+}
+
+template<typename T, unsigned N>
+inline Vector<T, N+1> compose(T s, const Vector<T, N> &v)
+{
+	Vector<T, N+1> r;
+	r[0] = s;
+	for(unsigned i=0; i<N; ++i)
+		r[i+1] = v[i];
+	return r;
+}
+
+template<typename T, unsigned N, unsigned M>
+inline Vector<T, N+M> compose(const Vector<T, N> &v1, const Vector<T, M> &v2)
+{
+	Vector<T, N+M> r;
+	for(unsigned i=0; i<N; ++i)
+		r[i] = v1[i];
+	for(unsigned i=0; i<M; ++i)
+		r[N+i] = v2[i];
+	return r;
+}
+
+template<typename T, unsigned N>
+template<unsigned M>
+inline Vector<T, M> Vector<T, N>::slice(unsigned j) const
+{
+	Vector<T, M> r;
+	for(unsigned i=0; i<M; ++i)
+		r[i] = (*this)[j+i];
+	return r;
 }
 
 template<typename T, unsigned N>
 inline Vector<T, N> &Vector<T, N>::operator*=(T s)
 {
 	for(unsigned i=0; i<N; ++i)	
-		data[i] *= s;
+		(*this)[i] *= s;
 	return *this;
 }
 
@@ -79,7 +211,7 @@ template<typename T, unsigned N>
 inline Vector<T, N> &Vector<T, N>::operator/=(T s)
 {
 	for(unsigned i=0; i<N; ++i)	
-		data[i] /= s;
+		(*this)[i] /= s;
 	return *this;
 }
 
@@ -94,7 +226,7 @@ template<typename T, unsigned N>
 inline Vector<T, N> &Vector<T, N>::operator+=(const Vector<T, N> &v)
 {
 	for(unsigned i=0; i<N; ++i)	
-		data[i] += v[i];
+		(*this)[i] += v[i];
 	return *this;
 }
 
@@ -109,7 +241,7 @@ template<typename T, unsigned N>
 inline Vector<T, N> &Vector<T, N>::operator-=(const Vector<T, N> &v)
 {
 	for(unsigned i=0; i<N; ++i)	
-		data[i] -= v[i];
+		(*this)[i] -= v[i];
 	return *this;
 }
 
@@ -150,6 +282,7 @@ inline T inner_product(const Vector<T, N> &v1, const Vector<T, N> &v2)
 template<typename T, unsigned N>
 inline T Vector<T, N>::norm() const
 {
+	using std::sqrt;
 	return sqrt(inner_product(*this, *this));
 }
 
@@ -166,6 +299,32 @@ inline Vector<T, N> normalize(const Vector<T, N> &v)
 	return r.normalize();
 }
 
+template<typename T>
+inline T dot(const Vector<T, 3> &v1, const Vector<T, 3> &v2)
+{
+	return inner_product(v1, v2);
+}
+
+template<typename T>
+inline Vector<T, 3> cross(const Vector<T, 3> &v1, const Vector<T, 3> &v2)
+{
+	return Vector<T, 3>(v1.y*v2.z-v1.z*v2.y, v1.z*v2.x-v1.x*v2.z, v1.x*v2.y-v1.y*v2.x);
+}
+
+template<typename T, unsigned N>
+inline std::ostream &operator<<(std::ostream &s, const Vector<T, N> &v)
+{
+	s << "Vector" << N << '(';
+	for(unsigned i=0; i<N; ++i)
+	{
+		if(i)
+			s << ", ";
+		s << v[i];
+	}
+	s << ')';
+	return s;
+}
+
 } // namespace LinAl
 } // namespace Msp