Inheritance diagram for Ideal< C, R >:

Definition at line 22 of file Ideal.h.
Public Types | |
| typedef C | coeff_t |
| typedef Seq< R >::iterator | iterator |
| typedef Seq< R >::const_iterator | const_iterator |
| typedef Seq< R >::reverse_iterator | reverse_iterator |
| typedef Seq< R >::const_reverse_iterator | const_reverse_iterator |
| typedef R | poly_t |
| typedef Ideal< C, R > | self_t |
|
typedef std::vector< R >::size_type | size_type |
| typedef R | value_type |
Public Member Functions | |
| Ideal () | |
| Ideal (const poly_t &p) | |
| Ideal (const self_t &I) | |
| Ideal (int n, poly_t *t) | |
| Ideal (const Seq< R > &s) | |
| self_t & | operator= (const self_t &x) |
| std::vector< R > & | rep () |
| const std::vector< R > & | rep () const |
| iterator | begin () |
| const_iterator | begin () const |
| iterator | end () |
| const_iterator | end () const |
| reverse_iterator | rbegin () |
| const_reverse_iterator | rbegin () const |
| reverse_iterator | rend () |
| const_reverse_iterator | rend () const |
| value_type & | operator[] (size_type i) |
| value_type | operator[] (size_type i) const |
|
Seq< value_type, seq1d< value_type, iterator > > | operator[] (const Range &I) |
| self_t & | push_back (const R &x) |
| size_type | size () const |
| bool | empty () const |
| void | resize (size_type i) |
| self_t | operator, (const self_t &x) const |
| Concatenate two sequences. | |
| self_t | operator, (const R &x) const |
| Concatenate an element at the end of the sequence. | |
| self_t | operator<< (const self_t &s) |
Public Attributes | |
|
shared_object< std::vector< R > > | data |
Concatenate two sequences.
Concatenate an element at the end of the sequence.
![]() |