EvtMatrix< T > Class Template Reference

#include <EvtMatrix.hh>

List of all members.

Public Member Functions
T	det ()
std::string	dump ()
	EvtMatrix ()
EvtMatrix *	inverse ()
EvtMatrix *	min (int row, int col)
T &	operator() (int row, int col)
T *	operator[] (int row)
void	setRange (int range)
	~EvtMatrix ()
Private Attributes
T **	_mat
int	_range
Friends
template<class M>
EvtMatrix< M > *	operator * (const EvtMatrix< M > &left, const EvtMatrix< M > &right)

template<class T>
class EvtMatrix< T >

---

Constructor & Destructor Documentation

template<class T> EvtMatrix< T >::EvtMatrix (   )  [inline]

: _range( 0 ) {};

template<class T> EvtMatrix< T >::~EvtMatrix (   )

{ for( int row = 0; row < _range; row++ ) delete[] _mat[ row ]; delete[] _mat; }

---

Member Function Documentation

template<class T> T EvtMatrix< T >::det (   )

{ if ( _range == 1 ) return _mat[ 0 ][ 0 ]; // There's no need to define the range 2 determinant manually, but it may // speed up the calculation. if ( _range == 2 ) return _mat[ 0 ][ 0 ] * _mat[ 1 ][ 1 ] - _mat[ 0 ][ 1 ] * _mat[ 1 ][ 0 ]; T sum = 0.; for ( int col = 0; col < _range; col++ ) { EvtMatrix< T >* minor = min( 0, col ); sum += std::pow( -1., col ) * _mat[ 0 ][ col ] * minor->det(); delete minor; } return sum; }

template<class T> std::string EvtMatrix< T >::dump (   )

{ std::ostringstream str; for ( int row = 0; row < _range; row++ ) { str << "|"; for ( int col = 0; col < _range; col++ ) str << "\t" << _mat[ row ][ col ]; str << "\t|" << std::endl; } return str.str(); }

template<class T> EvtMatrix< T > * EvtMatrix< T >::inverse (   )

{ EvtMatrix< T >* inv = new EvtMatrix< T >(); inv->setRange( _range ); if ( det() == 0 ) { std::cerr << "This matrix has a null determinant and cannot be inverted. Returning zero matrix." << std::endl; for ( int row = 0; row < _range; row++ ) for ( int col = 0; col < _range; col++ ) (*inv)( row, col ) = 0.; return inv; } T determinant = det(); for ( int row = 0; row < _range; row++ ) for ( int col = 0; col < _range; col++ ) { EvtMatrix< T >* minor = min( row, col ); inv->_mat[col][row] = std::pow( -1., row + col ) * minor->det() / determinant; delete minor; } return inv; }

template<class T> EvtMatrix< T > * EvtMatrix< T >::min (  int  row, int  col )

{ EvtMatrix< T >* minor = new EvtMatrix< T >(); minor->setRange( _range - 1 ); int minIndex = 0; for ( int r = 0; r < _range; r++ ) for ( int c = 0; c < _range; c++ ) if ( ( r != row ) && ( c != col ) ) { (*minor)( minIndex / ( _range - 1 ), minIndex % ( _range - 1 ) ) = _mat[ r ][ c ]; minIndex++; } return minor; }

template<class T> T& EvtMatrix< T >::operator() (  int  row, int  col )  [inline]

{ return _mat[ row ][ col ]; }

template<class T> T* EvtMatrix< T >::operator[] (  int  row  )  [inline]

{ return _mat[ row ]; }

template<class T> void EvtMatrix< T >::setRange (  int  range  )  [inline]

{ // If the range is changed, delete any previous matrix stored // and allocate elements with the newly specified range. if ( _range != range ) { if ( _range ) { for ( int row = 0; row < _range; row++ ) delete[] _mat[ row ]; delete[] _mat; } _mat = new T*[ range ]; for ( int row = 0; row < range; row++ ) _mat[ row ] = new T[ range ]; // Set the new range. _range = range; } // Since user is willing to change the range, reset the matrix elements. for ( int row = 0; row < _range; row++ ) for ( int col = 0; col < _range; col++ ) _mat[ row ][ col ] = 0.; }

---

Friends And Related Function Documentation

template<class T> template<class M> EvtMatrix< M >* operator * (  const EvtMatrix< M > &  left, const EvtMatrix< M > &  right )  [friend]

---

Member Data Documentation

template<class T> T** EvtMatrix< T >::_mat [private]

template<class T> int EvtMatrix< T >::_range [private]

---

The documentation for this class was generated from the following file:

• /data0/mdestefa/bes3soft/Boss_6.5.5/dist/6.5.5/Generator/BesEvtGen/BesEvtGen-00-01-11/src/EvtGen/EvtGenBase/EvtMatrix.hh

---