// This file is part of Eigen, a lightweight C++ template library // for linear algebra. Eigen itself is part of the KDE project. // // Copyright (C) 2006-2007 Benoit Jacob // // Eigen is free software; you can redistribute it and/or modify it under the // terms of the GNU General Public License as published by the Free Software // Foundation; either version 2 or (at your option) any later version. // // Eigen 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 General Public License for more // details. // // You should have received a copy of the GNU General Public License along // with Eigen; if not, write to the Free Software Foundation, Inc., 51 // Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. // // As a special exception, if other files instantiate templates or use macros // or functions from this file, or you compile this file and link it // with other works to produce a work based on this file, this file does not // by itself cause the resulting work to be covered by the GNU General Public // License. This exception does not invalidate any other reasons why a work // based on this file might be covered by the GNU General Public License. #ifndef EI_MATRIXSTORAGE_H #define EI_MATRIXSTORAGE_H template class EiMatrixStorage { protected: Scalar m_array[RowsAtCompileTime * ColsAtCompileTime]; void resize(int rows, int cols) { assert(rows == RowsAtCompileTime && cols == ColsAtCompileTime); } int _rows() const { return RowsAtCompileTime; } int _cols() const { return ColsAtCompileTime; } public: EiMatrixStorage(int rows, int cols) { EI_UNUSED(rows); EI_UNUSED(cols); assert(RowsAtCompileTime > 0 && ColsAtCompileTime > 0); } ~EiMatrixStorage() {}; }; template class EiMatrixStorage { protected: int m_rows; Scalar* m_array; void resize(int rows, int cols) { assert(rows > 0 && cols == ColsAtCompileTime); if(rows > m_rows) { delete[] m_array; m_array = new Scalar[rows * ColsAtCompileTime]; } m_rows = rows; } int _rows() const { return m_rows; } int _cols() const { return ColsAtCompileTime; } public: EiMatrixStorage(int rows, int cols) : m_rows(rows) { assert(m_rows > 0 && cols == ColsAtCompileTime); m_array = new Scalar[m_rows * ColsAtCompileTime]; } ~EiMatrixStorage() { delete[] m_array; } }; template class EiMatrixStorage { protected: int m_cols; Scalar* m_array; void resize(int rows, int cols) { assert(rows == RowsAtCompileTime && cols > 0); if(cols > m_cols) { delete[] m_array; m_array = new Scalar[cols * RowsAtCompileTime]; } m_cols = cols; } int _rows() const { return RowsAtCompileTime; } int _cols() const { return m_cols; } public: EiMatrixStorage(int rows, int cols) : m_cols(cols) { assert(rows == RowsAtCompileTime && cols > 0); m_array = new Scalar[m_cols * RowsAtCompileTime]; } ~EiMatrixStorage() { delete[] m_array; } }; template class EiMatrixStorage { protected: int m_rows, m_cols; Scalar* m_array; void resize(int rows, int cols) { assert(rows > 0 && cols > 0); if(rows * cols > m_rows * m_cols) { delete[] m_array; m_array = new Scalar[rows * cols]; } m_rows = rows; m_cols = cols; } int _rows() const { return m_rows; } int _cols() const { return m_cols; } public: EiMatrixStorage(int rows, int cols) : m_rows(rows), m_cols(cols) { assert(m_rows > 0 && m_cols > 0); m_array = new Scalar[m_rows * m_cols]; } ~EiMatrixStorage() { delete[] m_array; } }; #endif // EI_MATRIXSTORAGE_H