Vcsn
2.0
Be Rational
|
#include <map>
#include <queue>
#include <vector>
#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>
#include <vcsn/misc/attributes.hh>
#include <vcsn/misc/unordered_map.hh>
#include <vcsn/algos/copy.hh>
Go to the source code of this file.
Classes | |
class | vcsn::detail::sorter< Aut > |
A function to sort an automaton. More... | |
Namespaces | |
vcsn | |
vcsn::dyn | |
FIXME: duplicate code with determinize. | |
vcsn::dyn::detail | |
vcsn::detail | |
Functions | |
template<typename Aut > | |
bool | vcsn::is_out_sorted (const Aut &a) |
Whether for each state, the outgoing transitions are sorted by increasing label. More... | |
template<typename Aut > | |
bool | vcsn::dyn::detail::is_out_sorted (const automaton &aut) |
Bridge. More... | |
vcsn::dyn::detail::REGISTER_DECLARE (is_out_sorted,(const automaton &) -> bool) | |
template<typename Aut > | |
auto | vcsn::sort (const Aut &a) -> permutation_automaton< Aut > |
template<typename Aut > | |
automaton | vcsn::dyn::detail::sort (const automaton &aut) |
Bridge. More... | |
vcsn::dyn::detail::REGISTER_DECLARE (sort,(const automaton &) -> automaton) | |