#include <realroot/Interval.hpp>
#include <realroot/upoldse.hpp>
#include <realroot/upoldse_bound.hpp>
#include <realroot/sign.hpp>
#include <realroot/Seq.hpp>
#include <realroot/contfrac_intervaldata.hpp>
#include <realroot/contfrac_lowerbound.hpp>
Go to the source code of this file.
Classes
Namespaces
Defines
- #define __GMP_EXPR ::__gmp_expr<T, U>
- #define TMPL template <class T, class U> inline
Functions
- template<typename T > void times_2_to_k (T &r, const T &a, long k=1)
- template<typename T > unsigned long int bitsize (const T &a)
- template<class T , class U > mpz_class times_2_to_k (const ::__gmp_expr< T, U > &a, long k=1)
- template<class T , class U > void times_2_to_k (::__gmp_expr< T, U > &r, const ::__gmp_expr< T, U > &a, long k=1)
- template<class T , class U > unsigned long int bitsize (const ::__gmp_expr< T, U > &a)
- template<typename RT , typename Poly > void do_scale (IntervalData< RT, Poly > &ID, long k)
- template<class C > meta::rationalof< C >::T to_rational (const C &a, const C &b)
- template<class NT , class LB > Seq< typename ContFrac< NT, LB >
::root_t > solve (const typename ContFrac< NT >::Poly &f, ContFrac< NT, LB >)
- template<typename K > void CF_positive (const typename K::Poly &f, Seq< typename K::FIT > &RL, bool posneg, K)
- template<typename K > void MCF_positive (const typename K::Poly &f, Seq< typename K::root_t > &RL, bool posneg, K)
- template<typename OutputIterator , typename K > OutputIterator CF_solve (const typename K::Poly &f, OutputIterator sol, int mult, K)
- template<typename K , typename OutputIterator > OutputIterator solve_contfrac (const typename K::Poly &h, OutputIterator sol, K)
Define Documentation
#define __GMP_EXPR ::__gmp_expr<T, U> |
#define TMPL template <class T, class U> inline |