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
|
/******************************************************************************
* 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_FULLVECTOR_H
#define SOFA_COMPONENT_LINEARSOLVER_FULLVECTOR_H
#include <sofa/defaulttype/BaseVector.h>
#include <sofa/component/component.h>
#include <sofa/helper/rmath.h>
#include <iostream>
#include <vector>
namespace sofa
{
namespace component
{
namespace linearsolver
{
template<typename T>
class FullVector : public defaulttype::BaseVector
{
public:
typedef T Real;
typedef int Index;
typedef T* Iterator;
typedef const T* ConstIterator;
typedef Real value_type;
typedef Index size_type;
typedef Iterator iterator;
typedef ConstIterator const_iterator;
protected:
T* data;
Index cursize;
Index allocsize;
public:
FullVector()
: data(NULL), cursize(0), allocsize(0)
{
}
explicit FullVector(Index n)
: data(new T[n]), cursize(n), allocsize(n)
{
}
FullVector(T* ptr, Index n)
: data(ptr), cursize(n), allocsize(-n)
{
}
FullVector(T* ptr, Index n, Index nmax)
: data(ptr), cursize(n), allocsize(-nmax)
{
}
virtual ~FullVector()
{
if (allocsize>0)
delete[] data;
}
T* ptr() { return data; }
const T* ptr() const { return data; }
void setptr(T* p) { data = p; }
Index capacity() const { if (allocsize < 0) return -allocsize; else return allocsize; }
Iterator begin() { return data; }
Iterator end() { return data+cursize; }
ConstIterator begin() const { return data; }
ConstIterator end() const { return data+cursize; }
void fastResize(int dim)
{
if (dim == cursize) return;
if (allocsize >= 0)
{
if (dim > allocsize)
{
if (allocsize > 0)
delete[] data;
allocsize = dim;
data = new T[dim];
}
}
else
{
if (dim > -allocsize)
{
std::cerr << "ERROR: cannot resize preallocated vector to size "<<dim<<std::endl;
return;
}
}
cursize = dim;
}
void resize(int dim)
{
fastResize(dim);
clear();
}
void clear()
{
if (cursize > 0)
std::fill( this->begin(), this->end(), T() );
}
T& operator[](Index i)
{
return data[i];
}
const T& operator[](Index i) const
{
return data[i];
}
SReal element(int i) const
{
return data[i];
}
void set(int i, SReal v)
{
data[i] = (Real)v;
}
void add(int i, SReal v)
{
data[i] += (Real)v;
}
unsigned int size() const
{
return cursize;
}
FullVector<T> sub(int i, int n)
{
return FullVector<T>(data+i,n);
}
template<class TV>
void getsub(int i, int n, TV& v)
{
v = FullVector<T>(data+i,n);
}
template<class TV>
void setsub(int i, int n, const TV& v)
{
FullVector<T>(data+i,n) = v;
}
/// v = a
void operator=(const FullVector<T>& a)
{
fastResize(a.size());
std::copy(a.begin(), a.end(), begin());
}
void operator=(const T& a)
{
std::fill(begin(), end(), a);
}
/// v += a
template<typename Real2>
void operator+=(const FullVector<Real2>& a)
{
for(int i=0;i<cursize;++i)
(*this)[i] += (Real)a[i];
}
/// v -= a
template<typename Real2>
void operator-=(const FullVector<Real2>& a)
{
for(int i=0;i<cursize;++i)
(*this)[i] -= (Real)a[i];
}
/// v += a*f
template<typename Real2,typename Real3>
void peq(const FullVector<Real2>& a, Real3 f)
{
for(int i=0;i<cursize;++i)
(*this)[i] += (Real)(a[i]*f);
}
/// v *= f
template<typename Real2>
void operator*=(Real2 f)
{
for(int i=0;i<cursize;++i)
(*this)[i] *= (Real)f;
}
/// \return v.a
Real dot(const FullVector<Real>& a) const
{
Real r = 0;
for(int i=0;i<cursize;++i)
r += (*this)[i]*a[i];
return r;
}
/// \return sqrt(v.v)
double norm() const
{
return helper::rsqrt(dot(*this));
}
friend std::ostream& operator << (std::ostream& out, const FullVector<Real>& v )
{
for (int i=0,s=v.size();i<s;++i)
{
if (i) out << ' ';
out << v[i];
}
return out;
}
};
#if defined(WIN32) && !defined(SOFA_COMPONENT_LINEARSOLVER_FULLVECTOR_CPP)
#pragma warning(disable : 4231)
//extern template class SOFA_COMPONENT_LINEARSOLVER_API FullVector<bool>;
#endif
template<> SOFA_COMPONENT_LINEARSOLVER_API void FullVector<bool>::set(int i, SReal v);
template<> SOFA_COMPONENT_LINEARSOLVER_API void FullVector<bool>::add(int i, SReal v);
template<> SOFA_COMPONENT_LINEARSOLVER_API bool FullVector<bool>::dot(const FullVector<Real>& a) const;
template<> SOFA_COMPONENT_LINEARSOLVER_API double FullVector<bool>::norm() const;
} // namespace linearsolver
} // namespace component
} // namespace sofa
#endif
|