AntoineH/BaxterInterface
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

V1 Readme + rangement

Browse source
This commit is contained in:
Unknown 2018-08-13 11:25:26 +02:00
parent 3300e0efd3
commit 406e6d9b5d
1339 changed files with 248781 additions and 4282 deletions
Download patch file Download diff file Expand all files Collapse all files

179
ASIFT_tests/demo_ASIFT_src/libNumerics/vector.cpp
View file

@ -1,179 +0,0 @@
// Authors: Unknown. Please, if you are the author of this file, or if you
// know who are the authors of this file, let us know, so we can give the
// adequate credits and/or get the adequate authorizations.
#ifdef MATRIX_H // Do nothing if not included from matrix.h
namespace libNumerics {
/// Constructor
template <typename T>
vector<T>::vector(int m)
: matrix<T>(m, 1)
{}
/// 1-vector constructor.
template <typename T>
vector<T>::vector(T x)
: matrix<T>(1,1)
{
this->p[0] = x;
}
/// 2-vector constructor.
template <typename T>
vector<T>::vector(T x, T y)
: matrix<T>(2,1)
{
this->p[0] = x;
this->p[1] = y;
}
/// 3-vector constructor.
template <typename T>
vector<T>::vector(T x, T y, T z)
: matrix<T>(3,1)
{
this->p[0] = x;
this->p[1] = y;
this->p[2] = z;
}
/// Copy constructor
template <typename T>
vector<T>::vector(const vector<T>& v)
: matrix<T>(v)
{}
/// Assignment operator
template <typename T>
vector<T>& vector<T>::operator=(const vector<T>& v)
{
matrix<T>::operator=(v);
return *this;
}
/// Multiply a vector by scalar.
/// \param a a scalar.
template <typename T>
vector<T> vector<T>::operator*(T a) const
{
vector<T> v(this->m_rows);
for(int i = this->m_rows-1; i >= 0; i--)
v.p[i] = a*this->p[i];
return v;
}
/// Divide a vector by scalar.
/// \param a a scalar.
template <typename T>
inline vector<T> vector<T>::operator/(T a) const
{
return operator*( (T)1/a );
}
/// Addition of vectors.
template <typename T>
vector<T> vector<T>::operator+(const vector<T>& v) const
{
assert(this->m_rows == v.m_rows);
vector<T> sum(this->m_rows);
for(int i = this->m_rows-1; i >= 0; i--)
sum.p[i] = this->p[i] + v.p[i];
return sum;
}
/// Subtraction of vectors.
template <typename T>
vector<T> vector<T>::operator-(const vector<T>& v) const
{
assert(this->m_rows == v.m_rows);
vector<T> sub(this->m_rows);
for(int i = this->m_rows-1; i >= 0; i--)
sub.p[i] = this->p[i] - v.p[i];
return sub;
}
/// Opposite of vector.
template <typename T>
vector<T> vector<T>::operator-() const
{
vector<T> v(this->m_rows);
for(int i = this->m_rows-1; i >= 0; i--)
v.p[i] = -this->p[i];
return v;
}
/// Vector times matrix.
template <typename T>
matrix<T> vector<T>::operator*(const matrix<T>& m) const
{
return matrix<T>::operator*(m);
}
/// Diagonal matrix defined by its diagonal vector.
template <typename T>
matrix<T> vector<T>::diag() const
{
matrix<T> d(this->m_rows, this->m_rows);
d = (T)0;
for(int i = this->m_rows-1; i >= 0; i--)
d(i,i) = this->p[i];
return d;
}
/// Square L^2 norm of vector.
template <typename T>
T vector<T>::qnorm() const
{
T q = (T)0;
for(int i = this->m_rows-1; i >= 0; i--)
q += this->p[i]*this->p[i];
return q;
}
/// Subvector from \a i0 to \a i1.
template <typename T>
vector<T> vector<T>::copy(int i0, int i1) const
{
assert(0 <= i0 && i0 <= i1 && i1 <= this->m_rows);
vector<T> v(i1-i0+1);
for(int i=i0; i <= i1; i++)
v.p[i-i0] = this->p[i];
return v;
}
/// Paste vector \a v from row i0.
template <typename T>
void vector<T>::paste(int i0, const vector<T>& v)
{
matrix<T>::paste(i0, 0, v);
}
} // namespace libNumerics
/// Scalar product.
template <typename T>
T dot(const libNumerics::vector<T>& u, const libNumerics::vector<T>& v)
{
assert(u.nrow() == v.nrow());
T d = (T)0;
for(int i = u.nrow()-1; i >= 0; i--)
d += u(i)*v(i);
return d;
}
/// Cross product.
template <typename T>
libNumerics::vector<T> cross(const libNumerics::vector<T>& u,
const libNumerics::vector<T>& v)
{
assert(u.nrow() == 3 && v.nrow() == 3);
libNumerics::vector<T> w(3);
w(0) = u(1)*v(2) - u(2)*v(1);
w(1) = u(2)*v(0) - u(0)*v(2);
w(2) = u(0)*v(1) - u(1)*v(0);
return w;
}
#endif // MATRIX_H