My Project  debian-1:4.1.1-p2+ds-4build2
Public Member Functions
Module Class Reference

#include <Ideal.h>

Public Member Functions

 Module (ideal i, ring r)
 
ideal as_module () const
 
 Module (iterator first, iterator last, const allocator_type &__a=allocator_type())
 
 Module ()
 
- Public Member Functions inherited from IdealBase< Vector >
 IdealBase ()
 
 IdealBase (iterator first, iterator last, const typename std::vector< Vector >::allocator_type &__a=allocator_type())
 
ring getRing () const
 
Vectoroperator[] (int n)
 
const Vectoroperator[] (int n) const
 
void push_back (const Vector &p)
 
void push_front (const Vector &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< Vector >
typedef Vector value_type
 
typedef std::vector< Vector >::size_type size_type
 
typedef std::vector< Vector >::iterator iterator
 
typedef std::vector< Vector >::difference_type difference_type
 
typedef std::vector< Vector >::allocator_type allocator_type
 
- Protected Attributes inherited from IdealBase< Vector >
std::vector< Vectorstorage
 

Detailed Description

Definition at line 119 of file Ideal.h.

Constructor & Destructor Documentation

◆ Module() [1/3]

Module::Module ( ideal  i,
ring  r 
)
inline

Definition at line 123 of file Ideal.h.

124  {
125  for(int j=0;j<IDELEMS(i);j++)
126  {
127  storage.push_back(Vector(i->m[j],r));
128  }
129  }

◆ Module() [2/3]

Module::Module ( iterator  first,
iterator  last,
const allocator_type __a = allocator_type() 
)
inline

Definition at line 151 of file Ideal.h.

153  :
154  IdealBase<Vector>(first,last,__a)
155  {}

◆ Module() [3/3]

Module::Module ( )
inline

Definition at line 156 of file Ideal.h.

157  {}

Member Function Documentation

◆ as_module()

ideal Module::as_module ( ) const
inline

Definition at line 130 of file Ideal.h.

131  {
132  //no checks for rings
133  int s=size();
134 
135  if (s==0)
136  s=1;
137 
138  ideal result=idInit(s,1);
139  result->m[0]=NULL;
140  s=size();
141  for(int i=0;i<s;i++)
142  {
143  result->m[i]=storage[i].as_poly();
144  }
145  if (size()==0)
146  result->rank=0;
147  else
149  return result;
150  }

The documentation for this class was generated from the following file:
j
int j
Definition: facHensel.cc:105
result
return result
Definition: facAbsBiFact.cc:76
IdealBase< Vector >::getRing
ring getRing() const
Definition: Ideal.h:26
i
int i
Definition: cfEzgcd.cc:125
id_RankFreeModule
long id_RankFreeModule(ideal s, ring lmRing, ring tailRing)
return the maximal component number found in any polynomial in s
Definition: simpleideals.cc:782
IdealBase< Vector >::size
size_type size() const
Definition: Ideal.h:61
IdealBase< Vector >
last
static poly last
Definition: hdegree.cc:1077
idInit
ideal idInit(int idsize, int rank)
initialise an ideal / module
Definition: simpleideals.cc:37
NULL
#define NULL
Definition: omList.c:10
IdealBase< Vector >::storage
std::vector< Vector > storage
Definition: Ideal.h:11
s
const CanonicalForm int s
Definition: facAbsFact.cc:55
IDELEMS
#define IDELEMS(i)
Definition: simpleideals.h:26
Vector
Definition: Poly.h:509