Seq< C, R > Struct Template Reference
Sequence of terms with reference counter.
More...
#include <Seq.hpp>
List of all members.
Public Types
Public Member Functions
Public Attributes
Detailed Description
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:
Definition at line 59 of file Seq.hpp.
Member Typedef Documentation
Constructor & Destructor Documentation
Seq |
( |
const R & |
r |
) |
[inline] |
Seq |
( |
char * |
str |
) |
[inline] |
Definition at line 348 of file Seq.hpp.
References mmx::assign(), BLIST, C, ELIST, Seq< C, R >::push_back(), Seq< C, R >::rep(), mmx::shift(), synaps_input, synaps_inputlim, mmx::synaps_inputptr, yylex(), and yylval.
Seq |
( |
const Seq< X, S > & |
P |
) |
[inline] |
Definition at line 85 of file Seq.hpp.
00085 {using namespace let; assign(*this,P);}
Member Function Documentation
Definition at line 89 of file Seq.hpp.
00089 {return rep().begin();}
Definition at line 87 of file Seq.hpp.
Referenced by mmx::adds(), Seq< Interval< C > >::erase(), mmx::iterate(), Seq< Interval< C > >::max(), Seq< Interval< C > >::min(), mmx::mul(), mmx::operator+(), Seq< C, R >::operator,(), mmx::operator/(), Seq< Interval< C > >::operator<<(), Seq< Interval< C > >::reverse(), mmx::run_solver(), and Seq< Interval< C > >::sort().
00087 {return rep().begin();}
bool empty |
( |
|
) |
const [inline] |
Definition at line 90 of file Seq.hpp.
00090 {return rep().end();}
Definition at line 88 of file Seq.hpp.
Referenced by mmx::adds(), Seq< Interval< C > >::max(), Seq< Interval< C > >::min(), mmx::mul(), mmx::operator+(), Seq< C, R >::operator,(), mmx::operator/(), Seq< Interval< C > >::operator<<(), Seq< Interval< C > >::reverse(), mmx::run_solver(), and Seq< Interval< C > >::sort().
00088 {return rep().end();}
C max |
( |
Compare |
comp |
) |
[inline] |
Definition at line 159 of file Seq.hpp.
00159 {
00160 return *std::max_element( this->rep().begin(), this->rep().end(),comp);
00161 }
Definition at line 144 of file Seq.hpp.
00144 {
00145 return *std::max_element( this->rep().begin(), this->rep().end());
00146 }
bool member |
( |
const C & |
x |
) |
[inline] |
Definition at line 129 of file Seq.hpp.
00129 {
00130 for (size_type i=0;i< this->size();++i)
00131 if ( this->rep()[i]== x)
00132 return true;
00133 return false;
00134 }
C min |
( |
Compare |
comp |
) |
[inline] |
Definition at line 154 of file Seq.hpp.
00154 {
00155 return *std::min_element( this->rep().begin(), this->rep().end(),comp);
00156 }
Definition at line 140 of file Seq.hpp.
00140 {
00141 return *std::min_element( this->rep().begin(), this->rep().end());
00142 }
Seq< C, R > operator, |
( |
const C & |
x |
) |
const [inline] |
Seq< C, R > operator, |
( |
const self_t & |
x |
) |
const [inline] |
self_t& operator= |
( |
const Seq< X, S > & |
V |
) |
[inline] |
Definition at line 100 of file Seq.hpp.
00100 {
00101 using namespace let;
00102 assign(*this,V);
00103 return *this;}
Definition at line 98 of file Seq.hpp.
00098 {data=V.data; return *this;}
self_t& push_back |
( |
const C & |
x |
) |
[inline] |
Definition at line 93 of file Seq.hpp.
00093 {return rep().rbegin();}
Definition at line 91 of file Seq.hpp.
00091 {return rep().rbegin();}
Definition at line 94 of file Seq.hpp.
00094 {return rep().rbegin();}
Definition at line 92 of file Seq.hpp.
00092 {return rep().rend();}
const R& rep |
( |
|
) |
const [inline] |
Definition at line 62 of file Seq.hpp.
Referenced by solver_mv_monomial< FT, POL >::approximate(), Seq< Interval< C > >::begin(), Seq< Interval< C > >::clear(), mmx::coefficients(), Seq< Interval< C > >::empty(), Seq< Interval< C > >::end(), Seq< Interval< C > >::erase(), Seq< Interval< C > >::front(), solver_mv_monomial< FT, POL >::isolate(), Seq< Interval< C > >::max(), Seq< Interval< C > >::member(), Seq< Interval< C > >::min(), Seq< C, R >::operator,(), mmx::operator==(), mmx::operator>>(), Seq< Interval< C > >::operator[](), Seq< Interval< C > >::push_back(), Seq< Interval< C > >::rbegin(), Seq< Interval< C > >::rend(), Seq< Interval< C > >::resize(), Seq< Interval< C > >::reverse(), Seq< Interval< C > >::search(), Seq< C, R >::Seq(), Seq< Interval< C > >::Seq(), Seq< Interval< C > >::size(), mmx::solve(), and Seq< Interval< C > >::sort().
void reverse |
( |
|
) |
[inline] |
self_t reversed |
( |
|
) |
const [inline] |
Definition at line 170 of file Seq.hpp.
00170 { self_t s(*this); s.reverse(); return s; }
Definition at line 120 of file Seq.hpp.
00120 {
00121 for (size_type i=0;i< this->size();++i) {
00122 if ( this->rep()[i]== x)
00123 return i;
00124 }
00125
00126 return (size_type(-1) );
00127 }
Definition at line 163 of file Seq.hpp.
Referenced by solver_cffirst< Real, POL >::all_roots_isolate(), solver_cffirst< Real, POL >::all_roots_separate(), solver_mv_monomial< FT, POL >::approximate(), solver_mv_fatarcs< C >::box_gen(), cell_mv_bernstein< C >::cell_mv_bernstein(), domain< coeff_t >::center(), mmx::CF_solve(), solver_mv_monomial< FT, POL >::check_root(), mmx::sparse::coefficients(), homography_mv< C >::colapse(), box_rep< POL >::contract_box(), domain< coeff_t >::delta(), domain< coeff_t >::diam(), domain< coeff_t >::dim(), Seq< Interval< C > >::empty(), box_rep< POL >::eval(), mmx::realroot::eval_poly_matrix(), extpts(), Seq< Interval< C > >::front(), mmx::hash(), box_rep< POL >::is_root(), sub_resultant< PREM >::is_zero_seq(), solver_mv_monomial< FT, POL >::isolate(), mmx::realroot::jacobian(), box_rep< POL >::l_bound(), domain< coeff_t >::llc(), Seq< Interval< C > >::member(), cell_mv_bernstein< C >::nbeq(), box_rep< POL >::nbpol(), cell_mv_bernstein< C >::nbvar(), arc_rep< C >::offset(), box_rep< POL >::point(), mmx::polynomial_bernstein_tensor_coefficients(), mmx::polynomial_dual_coefficients(), mmx::polynomial_sparse_coefficients(), mmx::polynomial_sturm_sequence(), mmx::polynomial_tensor_coefficients(), mmx::realroot::precondition(), box_rep< POL >::restrict(), sub_resultant< PREM >::resultant(), box_rep< POL >::reverse_and_shift_box(), box_rep< POL >::reverse_box(), Seq< Interval< C > >::search(), seq2b(), sub_resultant< PREM >::sequence(), box_rep< POL >::shift_box(), mmx::realroot::signof(), homography_mv< C >::size(), cell_mv_bernstein< C >::size(), continued_fraction_subdivision< K >::solve_polynomial(), solver_mv_monomial< FT, POL >::solve_system(), sub_resultant< PREM >::subres_gcd(), mmx::realroot::topological_degree_2d(), box_rep< POL >::update_data(), domain< coeff_t >::urc(), box_rep< POL >::volume(), and box_rep< POL >::width().
00163 {return rep().size();}
void sort |
( |
Compare |
comp |
) |
[inline] |
Member Data Documentation
The documentation for this struct was generated from the following file: