Vcsn
2.3
Be Rational
|
#include <vector>
#include <boost/range/algorithm/sort.hpp>
#include <vcsn/core/permutation-automaton.hh>
#include <vcsn/ctx/traits.hh>
#include <vcsn/dyn/automaton.hh>
#include <vcsn/dyn/fwd.hh>
#include <vcsn/misc/algorithm.hh>
Go to the source code of this file.
Classes | |
struct | vcsn::detail::transition_less< Aut > |
Compare transitions of an automaton. More... | |
class | vcsn::detail::sorter< Aut > |
A function to sort an automaton. More... | |
Namespaces | |
vcsn | |
vcsn::detail | |
vcsn::dyn | |
vcsn::dyn::detail | |
Functions | |
template<Automaton Aut> | |
bool | vcsn::is_out_sorted (const Aut &a) |
Whether for each state, the outgoing transitions are sorted by increasing label. More... | |
template<Automaton Aut> | |
bool | vcsn::dyn::detail::is_out_sorted (const automaton &aut) |
Bridge. More... | |
template<Automaton Aut> | |
auto | vcsn::sort (const Aut &a) -> permutation_automaton< Aut > |
template<Automaton Aut> | |
automaton | vcsn::dyn::detail::sort (const automaton &aut) |
Bridge. More... | |