X-Git-Url: http://git.tdb.fi/?a=blobdiff_plain;f=source%2Flinal%2Fvector.h;h=c9b2a179fe5fd0ce595e4dda796b3c2d7b13ab5d;hb=9ab061034720c1c0db4e8bff5dae4191ccd2a26f;hp=369e3ff2435bf44e597e9e9750b4dc1a03d1c10b;hpb=959f6f9d250985e7324d4a07623bee5a5b00faca;p=libs%2Fmath.git

diff --git a/source/linal/vector.h b/source/linal/vector.h
index 369e3ff..c9b2a17 100644
--- a/source/linal/vector.h
+++ b/source/linal/vector.h
@@ -3,6 +3,7 @@
 
 #include <algorithm>
 #include <cmath>
+#include <ostream>
 
 namespace Msp {
 namespace LinAl {
@@ -74,14 +75,26 @@ template<typename T, unsigned N>
 class Vector: public VectorComponents<T, N>
 {
 public:
+	typedef T ElementType;
+
 	Vector();
 	Vector(const T *);
+
+	/** Constructs a vector from an array of interleaved values.  Intended for
+	use by Matrix row accessor. */
+	Vector(const T *, unsigned);
+
 	Vector(T, T);
 	Vector(T, T, T);
 	Vector(T, T, T, T);
 	template<typename U>
 	Vector(const Vector<U, N> &);
 
+	unsigned size() const { return N; }
+
+	template<unsigned M>
+	Vector<T, M> slice(unsigned) const;
+
 	Vector &operator*=(T);
 	Vector &operator/=(T);
 	Vector &operator+=(const Vector &);
@@ -106,6 +119,13 @@ inline Vector<T, N>::Vector(const T *d)
 		(*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];
+}
+
 /* The compiler won't instantiate these unless they are used.  Trying to use
 them on the wrong class results in an error. */
 template<typename T, unsigned N>
@@ -140,6 +160,47 @@ inline Vector<T, N>::Vector(const Vector<U, N> &v)
 		(*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;
+	for(unsigned i=0; i<N; ++i)
+		r[i] = v[i];
+	r[N] = s;
+	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)
 {
@@ -236,6 +297,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));
 }
 
@@ -264,6 +326,20 @@ 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