My Project
Public Types | Public Member Functions | Protected Attributes
IdealBase< poly_type > Class Template Reference

#include <Ideal.h>

Public Types

typedef poly_type value_type
 
typedef std::vector< poly_type >::size_type size_type
 
typedef std::vector< poly_type >::iterator iterator
 
typedef std::vector< poly_type >::difference_type difference_type
 
typedef std::vector< poly_type >::allocator_type allocator_type
 

Public Member Functions

 IdealBase ()
 
 IdealBase (iterator first, iterator last, const typename std::vector< poly_type >::allocator_type &__a=allocator_type())
 
ring getRing () const
 
poly_type & operator[] (int n)
 
const poly_type & operator[] (int n) const
 
void push_back (const poly_type &p)
 
void push_front (const poly_type &p)
 
iterator begin ()
 
iterator end ()
 
size_type size () const
 
iterator insert (iterator __position, const value_type &__x)
 
iterator erase (iterator __position)
 
iterator erase (iterator __first, iterator __last)
 
void insert (iterator __pos, iterator __first, iterator __last)
 

Protected Attributes

std::vector< poly_type > storage
 

Detailed Description

template<class poly_type>
class IdealBase< poly_type >

Definition at line 8 of file Ideal.h.

Member Typedef Documentation

◆ allocator_type

template<class poly_type >
typedef std::vector<poly_type>::allocator_type IdealBase< poly_type >::allocator_type

Definition at line 17 of file Ideal.h.

◆ difference_type

template<class poly_type >
typedef std::vector<poly_type>::difference_type IdealBase< poly_type >::difference_type

Definition at line 16 of file Ideal.h.

◆ iterator

template<class poly_type >
typedef std::vector<poly_type>::iterator IdealBase< poly_type >::iterator

Definition at line 15 of file Ideal.h.

◆ size_type

template<class poly_type >
typedef std::vector<poly_type>::size_type IdealBase< poly_type >::size_type

Definition at line 14 of file Ideal.h.

◆ value_type

template<class poly_type >
typedef poly_type IdealBase< poly_type >::value_type

Definition at line 13 of file Ideal.h.

Constructor & Destructor Documentation

◆ IdealBase() [1/2]

template<class poly_type >
IdealBase< poly_type >::IdealBase ( )
inline

Definition at line 18 of file Ideal.h.

18 {}

◆ IdealBase() [2/2]

template<class poly_type >
IdealBase< poly_type >::IdealBase ( iterator  first,
iterator  last,
const typename std::vector< poly_type >::allocator_type __a = allocator_type() 
)
inline

Definition at line 20 of file Ideal.h.

23  :
24  storage(first,last,__a)
25  {}
std::vector< poly_type > storage
Definition: Ideal.h:11
STATIC_VAR poly last
Definition: hdegree.cc:1150

Member Function Documentation

◆ begin()

template<class poly_type >
iterator IdealBase< poly_type >::begin ( )
inline

Definition at line 53 of file Ideal.h.

54  {
55  return storage.begin();
56  }

◆ end()

template<class poly_type >
iterator IdealBase< poly_type >::end ( )
inline

Definition at line 57 of file Ideal.h.

58  {
59  return storage.end();
60  }

◆ erase() [1/2]

template<class poly_type >
iterator IdealBase< poly_type >::erase ( iterator  __first,
iterator  __last 
)
inline

Definition at line 76 of file Ideal.h.

77  {
78  return storage.erase(__first,__last);
79  }

◆ erase() [2/2]

template<class poly_type >
iterator IdealBase< poly_type >::erase ( iterator  __position)
inline

Definition at line 71 of file Ideal.h.

72  {
73  return storage.erase(__position);
74  }

◆ getRing()

template<class poly_type >
ring IdealBase< poly_type >::getRing ( ) const
inline

Definition at line 26 of file Ideal.h.

27  {
28  //FIXME: is a hack
29  if (size()>0)
30  {
31  return storage[0].getRing();
32  }
33  else
34  return (ring) NULL;
35  }
size_type size() const
Definition: Ideal.h:61
#define NULL
Definition: omList.c:12

◆ insert() [1/2]

template<class poly_type >
void IdealBase< poly_type >::insert ( iterator  __pos,
iterator  __first,
iterator  __last 
)
inline

Definition at line 80 of file Ideal.h.

81  {
82  return insert(__pos,__first,__last);
83  }
iterator insert(iterator __position, const value_type &__x)
Definition: Ideal.h:66

◆ insert() [2/2]

template<class poly_type >
iterator IdealBase< poly_type >::insert ( iterator  __position,
const value_type __x 
)
inline

Definition at line 66 of file Ideal.h.

67  {
68  return storage.insert(__position,__x);
69  }

◆ operator[]() [1/2]

template<class poly_type >
poly_type& IdealBase< poly_type >::operator[] ( int  n)
inline

Definition at line 36 of file Ideal.h.

37  {
38  return storage[n];
39  }

◆ operator[]() [2/2]

template<class poly_type >
const poly_type& IdealBase< poly_type >::operator[] ( int  n) const
inline

Definition at line 40 of file Ideal.h.

41  {
42  return storage[n];
43  }

◆ push_back()

template<class poly_type >
void IdealBase< poly_type >::push_back ( const poly_type &  p)
inline

Definition at line 44 of file Ideal.h.

45  {
46  storage.push_back(p);
47  }
int p
Definition: cfModGcd.cc:4080

◆ push_front()

template<class poly_type >
void IdealBase< poly_type >::push_front ( const poly_type &  p)
inline

Definition at line 48 of file Ideal.h.

49  {
50  storage.push_front(p);
51  }

◆ size()

template<class poly_type >
size_type IdealBase< poly_type >::size ( ) const
inline

Definition at line 61 of file Ideal.h.

62  {
63  return storage.size();
64  }

Field Documentation

◆ storage

template<class poly_type >
std::vector<poly_type> IdealBase< poly_type >::storage
protected

Definition at line 11 of file Ideal.h.


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