#include <system_descartes1d.hpp>
|
| void | reset (unsigned sz, const real_t &prec) |
| |
| void | split (real_t *r) |
| |
| real_t | precision (real_t *l) |
| |
| bool | precision_reached (real_t *l) |
| |
| void | rockwoodcuts (real_t *nxt, real_t *prv, real_t *mid) |
| |
| void | set_sz (unsigned sz) |
| |
| template<class Prms > |
| void | output (Prms &prms, real_t *stck, const texp::true_t &) |
| |
| template<class Prms > |
| void | output (Prms &prms, real_t *stck, const texp::false_t &) |
| |
| template<class Prms > |
| void | output (Prms &prms, real_t *stck) |
| |
| template<class Prms , class In > |
| unsigned | solve (Prms &prms, const In &in, int option=0) |
| |
| | descartes_solver (unsigned sz, const real_t &eps=1e-12) |
| |
| | ~descartes_solver () |
| |
template<class real_t , class local_method = bsearch< real_t >>
template<class real_t , class local_method = bsearch< real_t >>
template<class real_t , class local_method = bsearch< real_t >>
template<class Prms >
template<class real_t , class local_method = bsearch< real_t >>
template<class Prms >
template<class real_t , class local_method = bsearch< real_t >>
template<class Prms >
template<class real_t , class local_method = bsearch< real_t >>
template<class real_t , class local_method = bsearch< real_t >>
template<class real_t , class local_method = bsearch< real_t >>
template<class real_t , class local_method = bsearch< real_t >>
template<class real_t , class local_method = bsearch< real_t >>
template<class real_t , class local_method = bsearch< real_t >>
template<class Prms , class In >
template<class real_t , class local_method = bsearch< real_t >>
template<class real_t , class local_method = bsearch< real_t >>
template<class real_t , class local_method = bsearch< real_t >>
template<class real_t , class local_method = bsearch< real_t >>
template<class real_t , class local_method = bsearch< real_t >>
template<class real_t , class local_method = bsearch< real_t >>
The documentation for this class was generated from the following file: