/usr/include/singular/gfanlib/gfanlib_vector.h is in libsingular4-dev-common 4.0.3+ds-1.
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 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 | /*
* lib_zvector.h
*
* Created on: Sep 6, 2010
* Author: anders
*/
#ifndef GFANLIB_ZVECTOR_H_INCLUDED
#define GFANLIB_ZVECTOR_H_INCLUDED
#include <vector>
#include <list>
#include <assert.h>
#include <algorithm>
#include <iostream>
#include <sstream>
#include "gfanlib_z.h"
#include "gfanlib_q.h"
namespace gfan{
inline void outOfRange(int i, int n)
{
std::cerr<<"Index out of range. i="<<i<<" n="<<n<<std::endl;
assert(0);
}
template <class typ> class Vector{
private:
std::vector<typ> v;
public:
//--------------
// Constructors
//--------------
Vector(const Vector &a):v(a.v){
}
Vector(int n):v(n){
assert(n>=0);
};
/* Vektor(const typ *p, int n):v(n){
assert(n>=0);
support=0;for(int i=0;i<n;i++)v[i]=p[i];
};*/
~Vector(){
};
Vector(){
};
static Vector standardVector(int n, int i)
{
Vector v(n);
v[i]=typ(1);
return v;
}
static Vector allOnes(int n)
{
Vector v(n);
for(int i=0;i<n;i++)
v[i]=typ(1);
return v;
}
//-------------
// Conversions
//-------------
/* template<class T> Vektor(const Vektor<T>& c)
:v(c.size())
{
for(int i=0;i<size();i++)v[i]=typ(c[i]);
}
*/
//--------
// Access
//--------
typ& operator[](int n)
{
if(!(n>=0 && n<(int)v.size()))outOfRange(n,v.size());
return (v[n]);
}
const typ& operator[](int n)const{assert(n>=0 && n<(int)v.size());return (v[n]);}
const typ& UNCHECKEDACCESS(int n)const{return (v[n]);}
//-------------
// STL related
//-------------
unsigned int size()const{return v.size();};
void resize(int n){v.resize(n,typ());};
void grow(int i){if((int)size()<i)resize(i);}
void push_back(typ a)
{
v.push_back(a);
}
void sort()
{
std::sort(v.begin(),v.end());
}
bool nextPermutation()
{
return std::next_permutation(v.begin(),v.end());
}
bool operator<(const Vector & b)const
{
if(size()<b.size())return true;
if(size()>b.size())return false;
for(unsigned i=0;i<size();i++)
{
if(v[i]<b[i])return true;
if(b[i]<v[i])return false;
}
return false;
}
//-----------------
// Arithmetic fast
//-----------------
typ sum()const{typ f;for(typename std::vector<typ>::const_iterator i=v.begin();i!=v.end();i++)f+=*i;return f;};
Vector& operator+=(const Vector& q){assert(size()==q.size());typename std::vector<typ>::const_iterator j=q.v.begin();for(typename std::vector<typ>::iterator i=v.begin();i!=v.end();++i,++j)(*i)+=(*j);return *this;}
Vector& operator-=(const Vector& q){assert(size()==q.size());typename std::vector<typ>::const_iterator j=q.v.begin();for(typename std::vector<typ>::iterator i=v.begin();i!=v.end();++i,++j)(*i)-=(*j);return *this;}
Vector& operator/=(const Vector& q){assert(size()==q.size());typename std::vector<typ>::const_iterator j=q.v.begin();for(typename std::vector<typ>::iterator i=v.begin();i!=v.end();++i,++j)(*i)/=(*j);return *this;}
inline friend typ dot(const Vector& p, const Vector& q){assert(p.size()==q.size());typ s;typename std::vector<typ>::const_iterator j=q.v.begin();for(typename std::vector<typ>::const_iterator i=p.v.begin();i!=p.v.end();++i,++j)s+=(*i)*(*j);return s;}
// inline friend int64 dotLong(const Vektor& p, const Vektor& q){assert(p.size()==q.size());int64 s=0;for(int i=0;i<p.size();i++)s+=(int64)p[i]*(int64)q[i];return s;}
bool operator==(const Vector & q)const{if(size()!=q.size())return false;typename std::vector<typ>::const_iterator j=q.v.begin();for(typename std::vector<typ>::const_iterator i=v.begin();i!=v.end();++i,++j)if((*i)!=(*j))return false;return true;}
bool operator!=(const Vector & q)const {return !(operator==(q));}
bool isZero() const
{
for(typename std::vector<typ>::const_iterator i=v.begin();i!=v.end();++i)if(!(*i).isZero())return false;
return true;
}
bool isPositive() const
{
for(typename std::vector<typ>::const_iterator i=v.begin();i!=v.end();++i)if((*i).sign()<=0)return false;
return true;
}
bool isNonNegative() const
{
for(typename std::vector<typ>::const_iterator i=v.begin();i!=v.end();++i)if(i->sign()<0)return false;
return true;
}
/* int max()const
{
int ret=-0x7fffffff; //not completely correct, but kind of works for 64bit
for(int i=0;i<v.size();i++)if(ret<v[i])ret=v[i];
return ret;
}
int min()const
{
int ret=0x7fffffff;
for(int i=0;i<v.size();i++)if(ret>v[i])ret=v[i];
return ret;
}
*/
friend bool dependent(const Vector& p, const Vector& q)
{
/*
typ pp=dot(p,p);
typ qq=dot(q,q);
typ pq=dot(p,q);
return pq*pq==pp*qq;
*/
unsigned n=p.size();
assert(n==q.size());
unsigned i;
for(i=0;i<n;i++)
{
if(!p.v[i].isZero())break;
}
if(i==n)return true;
if(q.v[i].isZero())return q.isZero();
typ a=p.v[i];
typ b=q.v[i];
for(unsigned j=0;j<n;j++)
if(a*q.v[j]!=b*p.v[j])return false;
return true;
}
//-----------------
// Arithmetic slow
//-----------------
inline friend Vector operator*(typ s, const Vector& q){Vector p=q;for(unsigned i=0;i<q.size();i++)p[i]*=s;return p;}
// inline friend Vektor operator/(const Vektor& q, typ s){Vektor p=q;for(int i=0;i<q.size();i++)p[i]/=s;return p;}
/* inline friend Vector operator*(const Vektor& p, const Vektor& q){assert(p.size()==q.size());Vektor p1=p;for(int i=0;i<p.size();i++)p1.v[i]*=q.v[i];return p1;}
inline friend Vektor operator+(const Vektor& p, const Vektor& q){assert(p.size()==q.size());Vektor p1=p;for(int i=0;i<p.size();i++)p1[i]+=q[i];return p1;}
*/
inline friend Vector operator/(const Vector& p, typ const &s){Vector ret(p.size());for(unsigned i=0;i<p.size();i++)ret[i]=p[i]/s;return ret;}
inline friend Vector operator+(const Vector& p, const Vector& q){assert(p.size()==q.size());Vector p1=p;for(unsigned i=0;i<p.size();i++)p1[i]+=q[i];return p1;}
inline friend Vector operator-(const Vector& p, const Vector& q){assert(p.size()==q.size());Vector p1=p;for(unsigned i=0;i<p.size();i++)p1[i]-=q[i];return p1;}
inline friend Vector max(const Vector& p, const Vector& q){assert(p.size()==q.size());Vector p1=p;for(unsigned i=0;i<p.size();i++)if(p1[i]<q[i])p1[i]=q[i];return p1;}
inline friend Vector min(const Vector& p, const Vector& q){assert(p.size()==q.size());Vector p1=p;for(unsigned i=0;i<p.size();i++)if(p1[i]>q[i])p1[i]=q[i];return p1;}
friend Vector operator-(const Vector &b)
{
Vector ret(b.size());
for(unsigned i=0;i<b.size();i++)ret[i]=-b[i];
return ret;
}
//------------------
// Monomial related
//------------------
/* int divides(const Vektor& q) const
{
assert(size()==q.size());
int n=v.size();
for(int i=0;i<n;i++)
{
if(v[i]>0)if(q.v[i]<v[i])return 0;
}
return 1;
}
inline friend bool relativelyPrime(const Vektor& p, const Vektor& q)
{
assert(p.size()==q.size());
int n=p.size();
for(int t=0;t<n;t++)if((p[t]>0)&&(q[t]>0)) return false;
return true;
}
Vektor supportVector()const
{
Vektor r(v.size());
for(int i=0;i<size();i++)
r[i]=(v[i]!=0);
return r;
}
*/
//------------------------------
// Subvectors and concatenation
//------------------------------
Vector subvector(int begin, int end)const
{
assert(begin>=0);
assert(end<=(int)size());
assert(end>=begin);
Vector ret(end-begin);
for(int i=0;i<end-begin;i++)
ret[i]=v[begin+i];
return ret;
}
/* Vektor subvector(list<int> const &chosenIndices)const
{
Vektor ret(chosenIndices.size());
int I=0;
for(list<int>::const_iterator i=chosenIndices.begin();i!=chosenIndices.end();i++,I++)ret[I]=v[*i];
return ret;
}
*/
friend Vector concatenation(Vector const &a, Vector const &b)
{
Vector ret(a.size()+b.size());
for(int i=0;i<a.size();i++)ret[i]=a[i];
for(int i=0;i<b.size();i++)ret[i+a.size()]=b[i];
return ret;
}
//----------------------
// Zero/nonZero entries
//----------------------
/* int indexOfLargestNonzeroEntry()const
{
int ret=-1;
for(int i=0;i<v.size();i++)
{
if(v[i])ret=i;
}
return ret;
}
Vektor supportIndices()const
{
Vektor ret(0);
for(int i=0;i<v.size();i++)
if(v[i]!=0)ret.push_back(i);
return ret;
}
Vektor supportAsZeroOneVector()const
{
Vektor ret(v.size());
for(int i=0;i<v.size();i++)ret[i]=bool(v[i]);
return ret;
}
void calcsupport(void)
{
support=0;
for(int i=0;i<v.size();i++)support=(support<<1)|(((v[i]>0)==true)&1);
}
*/
friend std::ostream &operator<<(std::ostream &f, Vector const &a)
{
f<<"(";
for(typename std::vector<typ>::const_iterator i=a.v.begin();i!=a.v.end();i++)
{
if(i!=a.v.begin()) f<<",";
f<<*i;
}
return f<<")";
}
std::string toString()const
{
std::stringstream f;
f<<*this;
return f.str();
}
typ gcd()const
{
typ ret(1);
for(unsigned i=0;i<size();i++)
ret=typ::gcd(ret,v[i]);
return ret;
}
Vector normalized()const
{
assert(!typ::isField());
return (*this)/gcd();
}
void debugPrint()const
{
std::stringstream s;
s<<"(";
for(typename std::vector<typ>::const_iterator i=this->v.begin();i!=this->v.end();i++)
{
if(i!=this->v.begin()) s<<",";
s<<*i;
}
s<<")"<<std::endl;
std::cout << s.str();
return;
}
};
typedef Vector<Integer> ZVector;
typedef Vector<Rational> QVector;
typedef Vector<int> IntVector;
inline QVector ZToQVector(ZVector const &v)
{
QVector ret(v.size());
for(unsigned i=0;i<v.size();i++)ret[i]=Rational(v[i]);
return ret;
}
inline IntVector ZToIntVector(ZVector const &v)
{
IntVector ret(v.size());
for(unsigned i=0;i<v.size();i++)ret[i]=v[i].toInt();
return ret;
}
inline ZVector IntToZVector(IntVector const &v)
{
ZVector ret(v.size());
for(unsigned i=0;i<v.size();i++)ret[i]=Integer(v[i]);
return ret;
}
inline ZVector QToZVectorPrimitive(QVector const &v)
{
int n=v.size();
ZVector ret(n);
mpz_t lcm;
mpz_t gcd;
mpz_init_set_ui(lcm, 1);
mpz_init_set_ui(gcd, 0);
mpq_t a;
mpq_init(a);
for(int j=0;j<n;j++)
{
v[j].setGmp(a);
if(mpz_cmp_si(mpq_denref(a),1)!=0)
mpz_lcm(lcm,lcm,mpq_denref(a));
if(mpz_sgn(mpq_numref(a))!=0)
mpz_gcd(gcd,gcd,mpq_numref(a));
}
mpq_clear(a);
if(mpz_sgn(gcd)!=0)//v is non-zero
{
if((mpz_cmp_si(lcm,1)==0)&&(mpz_cmp_si(gcd,1)==0)) //gcd=lcm=1
{
mpq_t a;
mpq_init(a);
for(int i=0;i<n;i++)
{
v[i].setGmp(a);
ret[i]=Integer(mpq_numref(a));
}
mpq_clear(a);
}
else
{
mpq_t a;
mpq_init(a);
mpz_t tempA;
mpz_t tempB;
mpz_init(tempA);
mpz_init(tempB);
for(int i=0;i<n;i++)
{
v[i].setGmp(a);
mpz_set(tempA,mpq_denref(a));
mpz_set(tempB,mpq_numref(a));
mpz_mul(tempA,gcd,tempA);
mpz_mul(tempB,lcm,tempB);
mpz_divexact(tempA,tempB,tempA);
ret[i]=Integer(tempA);
}
mpz_clear(tempB);
mpz_clear(tempA);
mpq_clear(a);
}
}
mpz_clear(gcd);
mpz_clear(lcm);
return ret;
};
};
#endif /* LIB_ZVECTOR_H_ */
|