/usr/include/sofa/component/linearsolver/FullMatrix.h is in libsofa1-dev 1.0~beta4-9.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 | /******************************************************************************
* SOFA, Simulation Open-Framework Architecture, version 1.0 beta 4 *
* (c) 2006-2009 MGH, INRIA, USTL, UJF, CNRS *
* *
* 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. *
*******************************************************************************
* SOFA :: Modules *
* *
* Authors: The SOFA Team and external contributors (see Authors.txt) *
* *
* Contact information: contact@sofa-framework.org *
******************************************************************************/
#ifndef SOFA_COMPONENT_LINEARSOLVER_FULLMATRIX_H
#define SOFA_COMPONENT_LINEARSOLVER_FULLMATRIX_H
#include <sofa/defaulttype/BaseMatrix.h>
#include <sofa/component/linearsolver/MatrixLinearSolver.h>
#include "FullVector.h"
#include <map>
namespace sofa
{
namespace component
{
namespace linearsolver
{
//#define FULLMATRIX_CHECK
//#define FULLMATRIX_VERBOSE
/// Simple full matrix container
template<typename T>
class FullMatrix : public defaulttype::BaseMatrix
{
public:
typedef T Real;
typedef int Index;
typedef FullVector<Real> Line;
class LineConstIterator
{
public:
Index first;
Line second;
LineConstIterator(Real* p, Index i, Index size, Index pitch) : first(i), second(p+i*pitch,size,pitch) { }
const Line& operator*() const { return second; }
const Line* operator->() const { return &second; }
void operator++() { ++first; second.setptr(second.ptr() + second.capacity()); }
void operator++(int) { ++first; second.setptr(second.ptr() + second.capacity()); }
void operator--() { --first; second.setptr(second.ptr() - second.capacity()); }
void operator--(int) { --first; second.setptr(second.ptr() - second.capacity()); }
bool operator==(const LineConstIterator& i) const { return i.second.ptr() == second.ptr(); }
bool operator!=(const LineConstIterator& i) const { return i.second.ptr() != second.ptr(); }
};
class LineIterator : public LineConstIterator
{
public:
LineIterator(Real* p, Index i, Index size, Index pitch) : LineConstIterator(p,i,size,pitch) {}
Line& operator*() { return this->second; }
Line* operator->() { return &this->second; }
};
typedef typename Line::iterator LElementIterator;
typedef typename Line::const_iterator LElementConstIterator;
protected:
Real* data;
Index nRow,nCol;
Index pitch;
Index allocsize;
public:
FullMatrix()
: data(NULL), nRow(0), nCol(0), pitch(0), allocsize(0)
{
}
FullMatrix(int nbRow, int nbCol)
: data(new T[nbRow*nbCol]), nRow(nbRow), nCol(nbCol), pitch(nbCol), allocsize(nbRow*nbCol)
{
}
FullMatrix(Real* p, int nbRow, int nbCol)
: data(p), nRow(nbRow), nCol(nbCol), pitch(nbCol), allocsize(-nbRow*nbCol)
{
}
FullMatrix(Real* p, int nbRow, int nbCol, int pitch)
: data(p), nRow(nbRow), nCol(nbCol), pitch(pitch), allocsize(-nbRow*pitch)
{
}
~FullMatrix()
{
if (allocsize>0)
delete data;
}
Real* ptr() { return data; }
const Real* ptr() const { return data; }
LineIterator begin() { return LineIterator(data, 0, nCol, pitch); }
LineIterator end() { return LineIterator(data, nRow, nCol, pitch); }
LineConstIterator begin() const { return LineConstIterator(data, 0, nCol, pitch); }
LineConstIterator end() const { return LineConstIterator(data, nRow, nCol, pitch); }
//Line operator[](Index i)
//{
// return Line(data+i*pitch, nCol, pitch);
//}
Real* operator[](Index i)
{
return data+i*pitch;
}
//const Line operator[](Index i) const
//{
// return Line(data+i*pitch, nCol, pitch);
//}
const Real* operator[](Index i) const
{
return data+i*pitch;
}
void resize(int nbRow, int nbCol)
{
#ifdef FULLMATRIX_VERBOSE
if (nbRow != rowSize() || nbCol != colSize())
std::cout << /*this->Name() << */": resize("<<nbRow<<","<<nbCol<<")"<<std::endl;
#endif
if (nbCol != nCol || nbRow != nRow)
{
if (allocsize < 0)
{
if (nbRow*nbCol > -allocsize)
{
std::cerr << "ERROR: cannot resize preallocated matrix to size ("<<nbRow<<","<<nbCol<<")"<<std::endl;
return;
}
}
else
{
if (nbRow*nbCol > allocsize)
{
if (allocsize > 0)
delete[] data;
allocsize = nbRow*nbCol;
data = new Real[allocsize];
}
}
pitch = nbCol;
nCol = nbCol;
nRow = nbRow;
}
clear();
}
unsigned int rowSize(void) const
{
return nRow;
}
unsigned int colSize(void) const
{
return nCol;
}
SReal element(int i, int j) const
{
#ifdef FULLMATRIX_CHECK
if ((unsigned)i >= (unsigned)rowSize() || (unsigned)j >= (unsigned)colSize())
{
std::cerr << "ERROR: invalid read access to element ("<<i<<","<<j<<") in "<</*this->Name()<<*/" of size ("<<rowSize()<<","<<colSize()<<")"<<std::endl;
return 0.0;
}
#endif
return data[i*pitch+j];
}
void set(int i, int j, double v)
{
#ifdef FULLMATRIX_VERBOSE
std::cout << /*this->Name() <<*/ "("<<rowSize()<<","<<colSize()<<"): element("<<i<<","<<j<<") = "<<v<<std::endl;
#endif
#ifdef FULLMATRIX_CHECK
if ((unsigned)i >= (unsigned)rowSize() || (unsigned)j >= (unsigned)colSize())
{
std::cerr << "ERROR: invalid write access to element ("<<i<<","<<j<<") in "<</*this->Name()<<*/" of size ("<<rowSize()<<","<<colSize()<<")"<<std::endl;
return;
}
#endif
data[i*pitch+j] = (Real)v;
}
void add(int i, int j, double v)
{
#ifdef FULLMATRIX_VERBOSE
std::cout << /*this->Name() << */"("<<rowSize()<<","<<colSize()<<"): element("<<i<<","<<j<<") += "<<v<<std::endl;
#endif
#ifdef FULLMATRIX_CHECK
if ((unsigned)i >= (unsigned)rowSize() || (unsigned)j >= (unsigned)colSize())
{
std::cerr << "ERROR: invalid write access to element ("<<i<<","<<j<<") in "/*<<this->Name()*/<<" of size ("<<rowSize()<<","<<colSize()<<")"<<std::endl;
return;
}
#endif
data[i*pitch+j] += (Real)v;
}
void clear(int i, int j)
{
#ifdef FULLMATRIX_VERBOSE
std::cout << /*this->Name() <<*/ "("<<rowSize()<<","<<colSize()<<"): element("<<i<<","<<j<<") = 0"<<std::endl;
#endif
#ifdef FULLMATRIX_CHECK
if ((unsigned)i >= (unsigned)rowSize() || (unsigned)j >= (unsigned)colSize())
{
std::cerr << "ERROR: invalid write access to element ("<<i<<","<<j<<") in "<</*this->Name()<<*/" of size ("<<rowSize()<<","<<colSize()<<")"<<std::endl;
return;
}
#endif
data[i*pitch+j] = Real();
}
void clearRow(int i)
{
#ifdef FULLMATRIX_VERBOSE
std::cout << /*this->Name() <<*/ "("<<rowSize()<<","<<colSize()<<"): row("<<i<<") = 0"<<std::endl;
#endif
#ifdef FULLMATRIX_CHECK
if ((unsigned)i >= (unsigned)rowSize())
{
std::cerr << "ERROR: invalid write access to row "<<i<<" in "<</*this->Name()<<*/" of size ("<<rowSize()<<","<<colSize()<<")"<<std::endl;
return;
}
#endif
for (Index j=0;j<nCol;++j)
data[i*pitch+j] = Real();
}
void clearCol(int j)
{
#ifdef FULLMATRIX_VERBOSE
std::cout <</* this->Name() << */"("<<rowSize()<<","<<colSize()<<"): col("<<j<<") = 0"<<std::endl;
#endif
#ifdef FULLMATRIX_CHECK
if ((unsigned)j >= (unsigned)colSize())
{
std::cerr << "ERROR: invalid write access to column "<<j<<" in "<</*this->Name()<<*/" of size ("<<rowSize()<<","<<colSize()<<")"<<std::endl;
return;
}
#endif
for (Index i=0;i<nRow;++i)
data[i*pitch+j] = Real();
}
void clearRowCol(int i)
{
#ifdef FULLMATRIX_VERBOSE
std::cout << /*this->Name() << */"("<<rowSize()<<","<<colSize()<<"): row("<<i<<") = 0 and col("<<i<<") = 0"<<std::endl;
#endif
#ifdef FULLMATRIX_CHECK
if ((unsigned)i >= (unsigned)rowSize() || (unsigned)i >= (unsigned)colSize())
{
std::cerr << "ERROR: invalid write access to row and column "<<i<<" in "<</*this->Name()<<*/" of size ("<<rowSize()<<","<<colSize()<<")"<<std::endl;
return;
}
#endif
clearRow(i);
clearCol(i);
}
void clear()
{
//if (pitch == nCol)
// std::fill(data, data+nRow*pitch, Real());
//else
for (Index i=0;i<nRow;++i)
for (Index j=0;j<nCol;++j)
data[i*pitch+j] = Real();
}
template<class Real2>
FullVector<Real2> operator*(const FullVector<Real2>& v) const
{
FullVector<Real2> res(rowSize());
for (Index i=0;i<nRow;++i)
{
Real r = 0;
for (Index j=0;j<nCol;++j)
r += data[i*pitch+j] * v[j];
res[i] = r;
}
return res;
}
friend std::ostream& operator << (std::ostream& out, const FullMatrix<T>& v )
{
int nx = v.colSize();
int ny = v.rowSize();
out << "[";
for (int y=0;y<ny;++y)
{
out << "\n[";
for (int x=0;x<nx;++x)
{
out << " " << v.element(y,x);
}
out << " ]";
}
out << " ]";
return out;
}
static const char* Name() { return "FullMatrix"; }
};
/// Simple full matrix container, with an additionnal pointer per line, to be able do get a T** pointer and use [i][j] directly
template<typename T>
class LPtrFullMatrix : public FullMatrix<T>
{
protected:
T** ldata;
int lallocsize;
public:
LPtrFullMatrix()
: ldata(NULL), lallocsize(0)
{
}
void resize(int nbRow, int nbCol)
{
if (nbRow == this->nRow && nbCol == this->nCol)
this->clear();
else
{
this->FullMatrix<T>::resize(nbRow, nbCol);
if (nbRow > lallocsize)
{
if (lallocsize > 0)
delete[] ldata;
ldata = new T*[nbRow];
lallocsize = nbRow;
}
for (int i=0;i<nbRow;++i)
ldata[i] = this->data + i*this->pitch;
}
}
T** lptr() { return ldata; }
const T** lptr() const { return ldata; }
//operator T**() { return ldata; }
//operator const T**() const { return ldata; }
};
} // namespace linearsolver
} // namespace component
} // namespace sofa
#endif
|