1 // Copyright (C) 2022 CEA/DEN, EDF R&D
3 // This library is free software; you can redistribute it and/or
4 // modify it under the terms of the GNU Lesser General Public
5 // License as published by the Free Software Foundation; either
6 // version 2.1 of the License, or (at your option) any later version.
8 // This library is distributed in the hope that it will be useful,
9 // but WITHOUT ANY WARRANTY; without even the implied warranty of
10 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 // Lesser General Public License for more details.
13 // You should have received a copy of the GNU Lesser General Public
14 // License along with this library; if not, write to the Free Software
15 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
22 #include "InterpKernelDenseMatrix.hxx"
24 namespace INTERP_KERNEL
27 DenseMatrixT<T>::DenseMatrixT() : nn(0), mm(0), v(nullptr) {}
30 DenseMatrixT<T>::DenseMatrixT(mcIdType n, mcIdType m) : nn(n), mm(m), v(n>0 ? new T*[n] : nullptr)
33 if (v) v[0] = nel>0 ? new T[nel] : nullptr;
34 for (i=1;i<n;i++) v[i] = v[i-1] + m;
38 DenseMatrixT<T>::DenseMatrixT(mcIdType n, mcIdType m, const T &a) : nn(n), mm(m), v(n>0 ? new T*[n] : nullptr)
41 if (v) v[0] = nel>0 ? new T[nel] : nullptr;
42 for (i=1; i< n; i++) v[i] = v[i-1] + m;
43 for (i=0; i< n; i++) for (j=0; j<m; j++) v[i][j] = a;
47 DenseMatrixT<T>::DenseMatrixT(mcIdType n, mcIdType m, const T *a) : nn(n), mm(m), v(n>0 ? new T*[n] : nullptr)
50 if (v) v[0] = nel>0 ? new T[nel] : nullptr;
51 for (i=1; i< n; i++) v[i] = v[i-1] + m;
52 for (i=0; i< n; i++) for (j=0; j<m; j++) v[i][j] = *a++;
56 DenseMatrixT<T>::DenseMatrixT(const DenseMatrixT &rhs) : nn(rhs.nn), mm(rhs.mm), v(nn>0 ? new T*[nn] : nullptr)
58 mcIdType i,j,nel=mm*nn;
59 if (v) v[0] = nel>0 ? new T[nel] : nullptr;
60 for (i=1; i< nn; i++) v[i] = v[i-1] + mm;
61 for (i=0; i< nn; i++) for (j=0; j<mm; j++) v[i][j] = rhs[i][j];
65 * postcondition: normal assignment via copying has been performed
66 * if matrix and rhs were different sizes, matrix
67 * has been resized to match the size of rhs
70 DenseMatrixT<T> & DenseMatrixT<T>::operator=(const DenseMatrixT<T> &rhs)
74 if (nn != rhs.nn || mm != rhs.mm) {
81 v = nn>0 ? new T*[nn] : nullptr;
83 if (v) v[0] = nel>0 ? new T[nel] : nullptr;
84 for (i=1; i< nn; i++) v[i] = v[i-1] + mm;
86 for (i=0; i< nn; i++) for (j=0; j<mm; j++) v[i][j] = rhs[i][j];
92 void DenseMatrixT<T>::resize(mcIdType newn, mcIdType newm)
95 if (newn != nn || newm != mm)
104 v = nn>0 ? new T*[nn] : nullptr;
106 if (v) v[0] = nel>0 ? new T[nel] : nullptr;
107 for (i=1; i< nn; i++) v[i] = v[i-1] + mm;
112 void DenseMatrixT<T>::assign(mcIdType newn, mcIdType newm, const T& a)
115 if (newn != nn || newm != mm)
124 v = nn>0 ? new T*[nn] : nullptr;
126 if (v) v[0] = nel>0 ? new T[nel] : nullptr;
127 for (i=1; i< nn; i++) v[i] = v[i-1] + mm;
129 for (i=0; i< nn; i++) for (j=0; j<mm; j++) v[i][j] = a;
133 DenseMatrixT<T>::~DenseMatrixT()