Ideal Class Reference

#include <Ideal.h>

Public Member Functions
	Ideal ()
	Ideal (ideal i, ring r)
	Ideal (iterator first, iterator last, const allocator_type &__a=allocator_type())
ideal	as_ideal () const
Public Member Functions inherited from IdealBase< Poly >
	IdealBase ()
	IdealBase (iterator first, iterator last, const typename std::vector< Poly >::allocator_type &__a=allocator_type())
ring	getRing () const
Poly &	operator[] (int n)
const Poly &	operator[] (int n) const
void	push_back (const Poly &p)
void	push_front (const Poly &p)
iterator	begin ()
iterator	end ()
size_type	size () const
iterator	insert (iterator __position, const value_type &__x)
void	insert (iterator __pos, iterator __first, iterator __last)
iterator	erase (iterator __position)
iterator	erase (iterator __first, iterator __last)

Additional Inherited Members
Public Types inherited from IdealBase< Poly >
typedef Poly	value_type
typedef std::vector< Poly >::size_type	size_type
typedef std::vector< Poly >::iterator	iterator
typedef std::vector< Poly >::difference_type	difference_type
typedef std::vector< Poly >::allocator_type	allocator_type
Protected Attributes inherited from IdealBase< Poly >
std::vector< Poly >	storage

Detailed Description

Definition at line 86 of file Ideal.h.

Constructor & Destructor Documentation

Ideal() [1/3]

Ideal::Ideal ( )

inline

Definition at line 90 of file Ideal.h.

{}

Ideal() [2/3]

Ideal::Ideal ( ideal  i, ring  r  )

inline

Definition at line 91 of file Ideal.h.

  {
    for(int j=0;j<IDELEMS(i);j++)
    {
      storage.push_back(Poly(i->m[j],r));
    }
  }

Ideal() [3/3]

Ideal::Ideal ( iterator  first, iterator  last, const allocator_type &  __a = allocator_type()  )

inline

Definition at line 98 of file Ideal.h.

                                                     :
    IdealBase<Poly>(first,last,__a){}

Member Function Documentation

as_ideal()

ideal Ideal::as_ideal ( ) const

inline

Definition at line 102 of file Ideal.h.

 {
   //no checks for rings
   int s=size();
 
   if (s==0) s=1;
 
   ideal result=idInit(s,1);
   result->m[0]=NULL;
   s=size();
   for(int i=0;i<s;i++)
   {
     result->m[i]=storage[i].as_poly();
   }
   return result;
 }

---

The documentation for this class was generated from the following file:

• Singular/dyn_modules/python/Ideal.h