sprint/math/dynamic_matrix.h

Go to the documentation of this file.

/******************************************************************************
*   sprint::matrix
*
*   Copyright (C) 2004-2011  Paolo Medici <www.pmx.it>
*
*  This library is free software; you can redistribute it and/or
*  modify it under the terms of the GNU Lesser General Public
*  License as published by the Free Software Foundation; either
*  version 2.1 of the License, or (at your option) any later version.
*
*  This library is distributed in the hope that it will be useful,
*  but WITHOUT ANY WARRANTY; without even the implied warranty of
*  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
*  Lesser General Public License for more details.
*
*  You should have received a copy of the GNU Lesser General Public
*  License along with this library; if not, write to the Free Software
*  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
*
*******************************************************************************/
#ifndef _DYNAMIC_MATRIX_H
#define _DYNAMIC_MATRIX_H

#include "matrix_common.h"

namespace sprint {

template<class T>
class dmatrix {
        unsigned int m_nr;
        unsigned int m_nc;
        T * m_data;
        
        private:
        void alloc()
        {
                m_data = new T[m_nr * m_nc];
        }
        void release()
                {
                        delete [] m_data;
                        m_data = NULL;
                }
        
        public:
                
                typedef T data_type;
                
    public:
        dmatrix() : m_nr(0), m_nc(), m_data(0) { }
                dmatrix(unsigned int nr, unsigned int nc) :m_nr(nr), m_nc(nc) { alloc(); }
                ~dmatrix() { release(); }
                
                void resize(unsigned int nr, unsigned int nc, const T def = T())
                        {
                T *nb = new T[nr * nc];

                for(int j=0;j<nr; ++j)                
                 for(int i=0;i<nc; ++i)
                 {
                 nb[i + j * nc] = (i<m_nc && j <m_nr) ? m_data[i + j * m_nc] : def;
                 }
                
                        delete [] m_data;
                        m_data = NULL;
                                m_nc = nc;
                                m_nr = nr;
                                m_data = nb;

                        }
                
                inline unsigned int rows() const { return m_nr; }
                inline unsigned int cols() const { return m_nc; }
                                
                inline T & operator() (unsigned int r, unsigned int c) { return m_data[r * m_nc + c]; }
                inline const T & operator()  (unsigned int r, unsigned int c) const { return m_data[r * m_nc + c]; }
                
                inline T * values() { return m_data; }
                inline const T * values() const { return m_data; }              
};

typedef dmatrix<float> dmatrixf;

typedef dmatrix<double> dmatrixd;

}
/*
namespace std {
          
template<class T>          
void swap(dmatrix<T> & a, dmatrix<T> & b)
{
std::swap(a.m_nr, b.m_nr);
std::swap(a.m_nr, b.m_nr);
}
          
};
*/

#endif