// @(#)root/smatrix:$Name: $:$Id: MatrixRepresentationsStatic.h,v 1.1 2006/02/08 14:45:35 moneta Exp $
// Authors: L. Moneta, J. Palacios 2006
#ifndef ROOT_Math_MatrixRepresentationsStatic_h
#define ROOT_Math_MatrixRepresentationsStatic_h 1
// Include files
/** @class MatrixRepresentationsStatic MatrixRepresentationsStatic.h Math/MatrixRepresentationsStatic.h
*
*
* @author Juan Palacios
* @date 2006-01-15
*
* Classes MatRepStd and MatRepSym for gneeric and symmetric matrix
* data storage and manipulation. Define data storage and access, plus
* operators =, +=, -=, ==.
*
*/
#include <iostream>
#include "Math/StaticCheck.h"
namespace ROOT {
namespace Math {
template <class T, unsigned int D1, unsigned int D2=D1>
class MatRepStd {
public:
typedef T value_type;
inline const T& operator()(unsigned int i, unsigned int j) const {
return fArray[i*D2+j];
}
inline T& operator()(unsigned int i, unsigned int j) {
return fArray[i*D2+j];
}
inline T& operator[](unsigned int i) { return fArray[i]; }
inline const T& operator[](unsigned int i) const { return fArray[i]; }
inline T apply(unsigned int i) const { return fArray[i]; }
inline T* Array() { return fArray; }
inline const T* Array() const { return fArray; }
template <class R>
inline MatRepStd<T, D1, D2>& operator+=(const R& rhs) {
for(unsigned int i=0; i<kSize; ++i) fArray[i] += rhs[i];
return *this;
}
template <class R>
inline MatRepStd<T, D1, D2>& operator-=(const R& rhs) {
for(unsigned int i=0; i<kSize; ++i) fArray[i] -= rhs[i];
return *this;
}
template <class R>
inline MatRepStd<T, D1, D2>& operator=(const R& rhs) {
for(unsigned int i=0; i<kSize; ++i) fArray[i] = rhs[i];
return *this;
}
template <class R>
inline bool operator==(const R& rhs) const {
bool rc = true;
for(unsigned int i=0; i<D1*D1; ++i) {
rc = rc && (fArray[i] == rhs[i]);
}
return rc;
}
enum {
/// return no. of matrix rows
kRows = D1,
/// return no. of matrix columns
kCols = D2,
/// return no of elements: rows*columns
kSize = D1*D2
};
private:
T fArray[kSize];
};
template<unsigned int D>
struct RowOffsets {
RowOffsets() {
int v[D];
v[0]=0;
for (unsigned int i=1; i<D; ++i)
v[i]=v[i-1]+i;
for (unsigned int i=0; i<D; ++i) {
for (unsigned int j=0; j<=i; ++j)
off[i][j] = v[i]+j;
for (unsigned int j=i+1; j<D; ++j)
off[i][j] = v[j]+i ;
}
}
int operator()(unsigned int i, unsigned int j) const { return off[i][j]; }
int off[D][D];
};
// offset specializations for small matrix sizes
int off2[2][2] = { { 0 , 1 } , { 1 , 2 } };
template<>
struct RowOffsets<2> {
int operator()(unsigned int i, unsigned int j) const { return off2[i][j]; }
};
int off3[3][3] = { { 0 , 1 , 3 } , { 1 , 2 , 4 } , { 3 , 4 , 5 } };
template<>
struct RowOffsets<3> {
int operator()(unsigned int i, unsigned int j) const { return off3[i][j]; }
};
int off4[4][4] = { { 0 , 1 , 3 , 6 } , { 1 , 2 , 4 , 7 } , { 3 , 4 , 5 , 8 } , { 6 , 7 , 8 , 9 } };
template<>
struct RowOffsets<4> {
int operator()(unsigned int i, unsigned int j) const { return off4[i][j]; }
};
int off5[5][5] = { { 0 , 1 , 3 , 6 , 10 } , { 1 , 2 , 4 , 7 , 11 } , { 3 , 4 , 5 , 8 , 12 } , { 6 , 7 , 8 , 9 , 13 } , { 10 , 11 , 12 , 13 , 14 } };
template<>
struct RowOffsets<5> {
int operator()(unsigned int i, unsigned int j) const { return off5[i][j]; }
};
int off6[6][6] = { { 0 , 1 , 3 , 6 , 10 , 15 } , { 1 , 2 , 4 , 7 , 11 , 16 } , { 3 , 4 , 5 , 8 , 12 , 17 } , { 6 , 7 , 8 , 9 , 13 , 18 } , { 10 , 11 , 12 , 13 , 14 , 19 } , { 15 , 16 , 17 , 18 , 19 , 20 } };
template<>
struct RowOffsets<6> {
int operator()(unsigned int i, unsigned int j) const { return off6[i][j]; }
};
template <class T, unsigned int D>
class MatRepSym {
public:
typedef T value_type;
inline const T& operator()(unsigned int i, unsigned int j) const {
return fArray[fOffsets(i,j)];
}
inline T& operator()(unsigned int i, unsigned int j) {
return fArray[fOffsets(i,j)];
}
inline T& operator[](unsigned int i) { return operator()(i/D, i%D); }
inline const T& operator[](unsigned int i) const {
return operator()(i/D, i%D);
}
inline T apply(unsigned int i) const {
return operator()(i/D, i%D);
}
inline T* Array() { return fArray; }
inline const T* Array() const { return fArray; }
inline MatRepSym<T, D>& operator+=(const MatRepSym& rhs) {
for(unsigned int i=0; i<kSize; ++i) fArray[i] += rhs.Array()[i];
return *this;
}
inline MatRepSym<T, D>& operator-=(const MatRepSym& rhs) {
for(unsigned int i=0; i<kSize; ++i) fArray[i] -= rhs.Array()[i];
return *this;
}
template <class R>
inline MatRepSym<T, D>& operator=(const R& rhs) {
STATIC_CHECK(0==1,
Cannot_assign_general_to_symmetric_matrix_representation);
return *this;
}
inline MatRepSym<T, D>& operator=(const MatRepSym& rhs) {
for(unsigned int i=0; i<kSize; ++i) fArray[i] = rhs.Array()[i];
return *this;
}
template <class R>
inline bool operator==(const R& rhs) const {
bool rc = true;
for(unsigned int i=0; i<D*D; ++i) {
rc = rc && (operator[](i) == rhs[i]);
}
return rc;
}
enum {
/// return no. of matrix rows
kRows = D,
/// return no. of matrix columns
kCols = D,
/// return no of elements: rows*columns
kSize = D*(D+1)/2
};
private:
T fArray[kSize];
RowOffsets<D> fOffsets;
};
} // namespace Math
} // namespace ROOT
#endif // MATH_MATRIXREPRESENTATIONSSTATIC_H
ROOT page - Class index - Class Hierarchy - Top of the page
This page has been automatically generated. If you have any comments or suggestions about the page layout send a mail to ROOT support, or contact the developers with any questions or problems regarding ROOT.