28 #ifndef _VECTORBASE_H_ 29 #define _VECTORBASE_H_ 44 template <
class R >
class SVectorBase;
45 template <
class R >
class SSVectorBase;
126 val.assign(p_val, p_val + dimen);
137 template <
typename S>
162 val.reserve(vec.dim());
164 for(
auto& v : vec.val)
178 val.reserve(vec.dim());
189 val = std::move(
vec.val);
198 assert(
dim() == vec.dim());
202 for(decltype(dimen) i = 0 ; i < dimen; i++)
203 val[i] =
spxLdexp(vec[i], scaleExp);
215 assert(
dim() == vec.dim());
221 for(decltype(dimen) i = 0; i < dimen; i++)
222 val[i] =
spxLdexp(vec[i], -scaleExp[i]);
228 for(decltype(dimen) i = 0; i < dimen; i++)
229 val[i] =
spxLdexp(vec[i], scaleExp[i]);
272 return int(val.size());
278 assert(n >= 0 && n <
dim());
285 assert(n >= 0 && n <
dim());
292 return (vec1.val == vec2.val);
296 const std::vector<R>&
vec()
318 assert(
dim() == vec.dim());
322 for(decltype(dimen) i = 0; i < dimen; i++)
340 assert(
dim() == vec.dim());
344 for(decltype(dimen) i = 0; i < dimen; i++)
365 for(decltype(dimen) i = 0; i < dimen; i++)
379 for(decltype(dimen) i = 0; i < dimen; i++)
392 for(decltype(dimen) i = 0; i < dimen; i++)
393 x += val[i] * vec.val[i];
410 auto absCmpr = [](R a, R b)
415 auto maxReference = std::max_element(val.begin(), val.end(), absCmpr);
417 R maxi =
spxAbs(*maxReference);
430 auto absCmpr = [](R a, R b)
435 auto minReference = SOPLEX_MIN_element(val.begin(), val.end(), absCmpr);
437 R mini =
spxAbs(*minReference);
453 return (*
this) * (*this);
457 template <
class S,
class T >
460 assert(vec.dim() ==
dim());
464 for(decltype(dimen) i = 0; i < dimen; i++)
465 val[i] += x * vec.val[i];
471 template <
class S,
class T >
475 template <
class S,
class T >
479 template <
class S,
class T >
509 typename std::vector<R>::const_iterator
begin()
const 514 typename std::vector<R>::iterator
begin()
520 typename std::vector<R>::const_iterator
end()
const 525 typename std::vector<R>::iterator
end()
537 return int(val.capacity());
541 void reDim(
int newdim,
const bool setZero =
true)
543 if(setZero && newdim >
dim())
567 val.reserve(newsize);
573 assert(vec.dim() ==
dim());
579 for(decltype(dimen) i = 0; i < dimen; i++)
581 res.val.push_back(val[i] - vec[i]);
590 assert(v.dim() ==
dim());
596 for(decltype(dimen) i = 0; i < dimen; i++)
598 res.val.push_back(val[i] + v[i]);
609 res.val.reserve(vec.dim());
611 for(
auto& v : vec.val)
613 res.val.push_back(-(v));
634 assert(vec.
dim() ==
dim());
636 if(
dim() <= 0 || vec.
dim() <= 0)
644 for(decltype(dimen) i = 1; i < dimen; i++)
645 x += val[i] * vec.
val[i];
651 #endif // _VECTORBASE_H_ number< gmp_rational, et_off > Rational
R minAbs() const
Minimum absolute value.
VectorBase< R > & operator=(const VectorBase< S > &vec)
Assignment operator.
R length2() const
Squared norm.
Dense vector.Class VectorBase provides dense linear algebra vectors. Internally, VectorBase wraps std...
const VectorBase< R > operator+(const VectorBase< R > &v) const
const VectorBase< R > operator-(const VectorBase< R > &vec) const
VectorBase< R > & scaleAssign(int scaleExp, const VectorBase< R > &vec)
scale and assign
R length() const
Floating point approximation of euclidian norm (without any approximation guarantee).
VectorBase(const VectorBase< R > &&vec) noexcept
std::vector< R >::iterator end()
VectorBase< R > & operator+=(const VectorBase< S > &vec)
Addition.
Semi sparse vector.This class implements semi-sparse vectors. Such are VectorBases where the indices ...
const R * get_const_ptr() const
Conversion to C-style pointer.
R * get_ptr()
Conversion to C-style pointer.
Real spxSqrt(Real a)
returns square root
VectorBase< R > & operator*=(const S &x)
Scaling.
VectorBase< R > & operator=(const VectorBase< R > &&vec)
Move assignment operator.
void reSize(int newsize)
Resets VectorBase's memory size to newsize.
friend bool operator==(const VectorBase< R > &vec1, const VectorBase< R > &vec2)
Equality operator.
bool isConsistent() const
Consistency check.
boost::multiprecision::number< T > spxLdexp(boost::multiprecision::number< T, eto > x, int exp)
VectorBase(const VectorBase< R > &vec)
Debugging, floating point type and parameter definitions.
R & operator[](int n)
Return n 'th value by reference.
VectorBase< R > & multAdd(const S &x, const VectorBase< T > &vec)
Addition of scaled vector.
int dim() const
Dimension of vector.
friend VectorBase< R > operator-(const VectorBase< R > &vec)
Everything should be within this namespace.
VectorBase< R > & operator-=(const VectorBase< S > &vec)
Subtraction.
std::vector< R >::iterator begin()
std::vector< R >::const_iterator begin() const
void reDim(int newdim, const bool setZero=true)
Resets VectorBase's dimension to newdim.
VectorBase< R > & scaleAssign(const int *scaleExp, const VectorBase< R > &vec, bool negateExp=false)
scale and assign
R operator*(const VectorBase< R > &vec) const
Inner product.
void clear()
Set vector to contain all-zeros (keeping the same length)
const R & operator[](int n) const
Return n 'th value.
std::vector< R > val
Values of vector.
VectorBase< R > & operator/=(const S &x)
Division.
Sparse vectors.Class SVectorBase provides packed sparse vectors. Such are a sparse vectors...
std::vector< R >::const_iterator end() const
VectorBase< R > & assign(const SVectorBase< S > &vec)
Assign values of vec.
R maxAbs() const
Maximum absolute value, i.e., infinity norm.
const std::vector< R > & vec()
Return underlying std::vector.
VectorBase(const VectorBase< S > &vec)
VectorBase(int dimen, R *p_val)
VectorBase< R > & multSub(const S &x, const SVectorBase< T > &vec)
Subtraction of scaled vector.
VectorBase< R > & operator=(const VectorBase< R > &vec)
Assignment operator.