Sequence of terms with reference counter.
More...
#include <Seq.hpp>
|
R & | rep () |
|
const R & | rep () const |
|
| Seq () |
|
| Seq (const R &r) |
|
| Seq (size_type s) |
|
| Seq (size_type s, value_type *t) |
|
| Seq (iterator b, iterator e) |
|
| Seq (size_type m, const char *str) |
|
| Seq (char *str) |
|
| Seq (const self_t &r) |
|
template<class X , class S > |
| Seq (const Seq< X, S > &P) |
|
iterator | begin () |
|
iterator | end () |
|
const_iterator | begin () const |
|
const_iterator | end () const |
|
reverse_iterator | rbegin () |
|
reverse_iterator | rend () |
|
const_reverse_iterator | rbegin () const |
|
const_reverse_iterator | rend () const |
|
self_t & | operator= (const self_t &V) |
|
template<class X , class S > |
self_t & | operator= (const Seq< X, S > &V) |
|
value_type & | operator[] (size_type i) |
|
const value_type & | operator[] (size_type i) const |
|
const value_type & | front () const |
|
self_t & | push_back (const C &x) |
|
self_t & | erase (size_type i) |
|
self_t & | clear () |
|
size_type | search (const C &x) |
|
bool | member (const C &x) |
|
void | sort () |
|
void | insert (const size_type &i, const C &c) |
|
C | min () |
|
C | max () |
|
template<class Compare > |
void | sort (Compare comp) |
|
template<class Compare > |
C | min (Compare comp) |
|
template<class Compare > |
C | max (Compare comp) |
|
size_type | size () const |
|
bool | empty () const |
|
void | resize (size_type i) |
|
C | back () const |
|
void | pop_back () |
|
void | reverse () |
| Reverse list. More...
|
|
self_t | reversed () const |
|
self_t | operator, (const self_t &x) const |
| Concatenate two sequences. More...
|
|
self_t | operator, (const C &x) const |
| Concatenate an element at the end of the sequence. More...
|
|
self_t | operator<< (const self_t &s) |
|
| ~Seq () |
|
template<class C, class R = std::vector<C>>
struct mmx::Seq< C, R >
Sequence of terms with reference counter.
It allows to use it as output of other functions. The container R
should have the following signatures:
typename R::size_type;
typename R::iterator;
typename R::const_iterator;
typename R::reverse_iterator;
typename R::const_reverse_iterator;
- Examples:
- polynomial_mv_sparse_test.cpp, polynomial_mv_test.cpp, solver_mv_bernstein_binary_test.cpp, solver_mv_bernstein_proj_test.cpp, solver_mv_fatarcs_test.cpp, solver_mv_monomial_test.cpp, solver_uv_bernstein_binary_test.cpp, solver_uv_contfrac_extended_test.cpp, solver_uv_inewton_test.cpp, and solver_uv_test.cpp.
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C , class R>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class X , class S >
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class Compare >
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class Compare >
template<class C, class R = std::vector<C>>
Concatenate two sequences.
template<class C, class R >
Concatenate an element at the end of the sequence.
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class X , class S >
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class C, class R = std::vector<C>>
template<class Compare >
template<class C, class R = std::vector<C>>
The documentation for this struct was generated from the following file: