#include "config.hpp"#include <vector>#include "motzkin_burger.cpp"Go to the source code of this file.
Namespaces | |
| namespace | Arageli | 
| namespace | Arageli::ctrl | 
Classes | |
| struct | Arageli::ctrl::skeleton_motzkin_burger_idler | 
| class | Arageli::ctrl::skeleton_motzkin_burger_idler::abort | 
Defines | |
| #define | ARAGELI_INCLUDE_CPP_WITH_EXPORT_TEMPLATE_MOTZKIN_BURGER | 
Functions | |
| template<typename A, typename F, typename Q, typename E, typename Ctrler> | |
| void | Arageli::skeleton_motzkin_burger (A &a, F &f, Q &q, E &e, Ctrler ctrler) | 
| The Motzkin-Burger algorithm without modifications.   | |
| template<typename A, typename F, typename Q, typename E> | |
| void | Arageli::skeleton_motzkin_burger (A &a, F &f, Q &q, E &e) | 
| The Motzkin-Burger algorithm without modifications.   | |
| template<typename A, typename F, typename Q, typename E, typename Ctrler> | |
| void | Arageli::skeleton_motzkin_burger_min (A &a, F &f, Q &q, E &e, Ctrler ctrler) | 
| The Motzkin-Burger algorithm with selecting minimum elements.   | |
| template<typename A, typename F, typename Q, typename E> | |
| void | Arageli::skeleton_motzkin_burger_min (A &a, F &f, Q &q, E &e) | 
| The Motzkin-Burger algorithm with selecting minimum elements.   | |
| template<typename A, typename F, typename Q, typename E, typename Ctrler> | |
| void | Arageli::skeleton_motzkin_burger_max (A &a, F &f, Q &q, E &e, Ctrler ctrler) | 
| The Motzkin-Burger algorithm with selecting maximum elements.   | |
| template<typename A, typename F, typename Q, typename E> | |
| void | Arageli::skeleton_motzkin_burger_max (A &a, F &f, Q &q, E &e) | 
| The Motzkin-Burger algorithm with selecting maximum elements.   | |
| template<typename A, typename F, typename Q, typename E> | |
| void | Arageli::integer_conv_motzkin_burger (A &a, F &f, Q &q, E &e) | 
Definition in file motzkin_burger.hpp.
| #define ARAGELI_INCLUDE_CPP_WITH_EXPORT_TEMPLATE_MOTZKIN_BURGER | 
Definition at line 179 of file motzkin_burger.hpp.
 1.4.7