1 #ifndef IDEAL_CPP_HEADER 2 #define IDEAL_CPP_HEADER 14 typedef typename std::vector<poly_type>::size_type
size_type;
15 typedef typename std::vector<poly_type>::iterator
iterator;
68 return storage.insert(__position,__x);
73 return storage.erase(__position);
78 return storage.erase(__first,__last);
82 return insert(__pos,__first,__last);
const CanonicalForm int s
iterator erase(iterator __position)
std::vector< poly_type >::allocator_type allocator_type
iterator insert(iterator __position, const value_type &__x)
Ideal(iterator first, iterator last, const allocator_type &__a=allocator_type())
const poly_type & operator[](int n) const
void push_back(const poly_type &p)
Module(iterator first, iterator last, const allocator_type &__a=allocator_type())
std::vector< poly_type >::size_type size_type
iterator erase(iterator __first, iterator __last)
long id_RankFreeModule(ideal s, ring lmRing, ring tailRing)
return the maximal component number found in any polynomial in s
poly_type & operator[](int n)
std::vector< poly_type >::difference_type difference_type
void push_front(const poly_type &p)
ideal idInit(int idsize, int rank)
initialise an ideal / module
std::vector< poly_type > storage
std::vector< poly_type >::iterator iterator
IdealBase(iterator first, iterator last, const typename std::vector< poly_type >::allocator_type &__a=allocator_type())
void insert(iterator __pos, iterator __first, iterator __last)