------------------ Monomial related ------------------ int divides(const Vektor& q) const { assert(size()==q.size()); int n=v.size(); for(int i=0;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();
| 225 | // Subvectors and concatenation |
| 226 | //------------------------------ |
| 227 | Vector subvector(int begin, int end)const |
| 228 | { |
| 229 | assert(begin>=0); |
| 230 | assert(end<=(int)size()); |
| 231 | assert(end>=begin); |
| 232 | Vector ret(end-begin); |
| 233 | for(int i=0;i<end-begin;i++) |
| 234 | ret[i]=v[begin+i]; |
| 235 | return ret; |
| 236 | } |
| 237 | /* Vektor subvector(list<int> const &chosenIndices)const |
| 238 | { |
| 239 | Vektor ret(chosenIndices.size()); |
no test coverage detected