![]() |
Vcsn
2.3a
Be Rational
|
An automaton isomorphic to another one. More...
#include <fwd.hh>
Public Types | |
using | automaton_t = Aut |
Input automaton type. More... | |
using | context_t = context_t_of< automaton_t > |
template<typename Ctx = context_t> | |
using | fresh_automaton_t = fresh_automaton_t_of< automaton_t, Ctx > |
Generated automaton type. More... | |
using | super_t = automaton_decorator< fresh_automaton_t<>> |
using | state_name_t = state_t_of< automaton_t > |
Symbolic state name: input automaton state type. More... | |
using | state_t = state_t_of< fresh_automaton_t<>> |
Sorted automaton state type. More... | |
using | origins_t = std::map< state_t, state_name_t > |
A map from each state to the origin state set it stands for. More... | |
using | pair_t = std::pair< state_name_t, state_t > |
![]() | |
using | automaton_t = Aut |
The type of automaton to wrap. More... | |
using | context_t = context_t_of< Aut > |
using | element_type = typename automaton_t::element_type |
The automaton type, without shared_ptr. More... | |
using | fresh_automaton_t = typename element_type::template fresh_automaton_t< Ctx > |
The (shared pointer) type to use it we have to create an automaton of the same (underlying) type. More... | |
using | kind_t = typename context_t::kind_t |
using | labelset_t = typename context_t::labelset_t |
using | labelset_ptr = typename context_t::labelset_ptr |
using | label_t = typename labelset_t::value_t |
using | weightset_t = typename context_t::weightset_t |
using | weightset_ptr = typename context_t::weightset_ptr |
using | weight_t = typename weightset_t::value_t |
using | state_t = state_t_of< automaton_t > |
using | transition_t = transition_t_of< automaton_t > |
Public Member Functions | |
permutation_automaton_impl (const automaton_t &input) | |
std::ostream & | print_set (std::ostream &o, format fmt={}) const |
bool | state_has_name (state_t) const |
std::ostream & | print_state_name (state_t s, std::ostream &o, format fmt={}, bool delimit=false) const |
state_t | state (state_name_t s) |
const origins_t & | origins () const |
Ordered map: state -> its derived term. More... | |
![]() | |
automaton_decorator (automaton_t aut) | |
automaton_decorator (const automaton_decorator &aut) | |
automaton_decorator (const context_t &ctx) | |
automaton_decorator (automaton_decorator &&aut) | |
automaton_decorator & | operator= (automaton_decorator &&that) |
automaton_t | strip () |
The automaton we decorate. More... | |
auto | all_in (Args &&...args) const -> decltype(aut_-> all_in(std::forward< Args >(args)...)) |
auto | all_out (Args &&...args) const -> decltype(aut_-> all_out(std::forward< Args >(args)...)) |
auto | all_states (Args &&...args) const -> decltype(aut_-> all_states(std::forward< Args >(args)...)) |
auto | all_transitions (Args &&...args) const -> decltype(aut_-> all_transitions(std::forward< Args >(args)...)) |
auto | context (Args &&...args) const -> decltype(aut_-> context(std::forward< Args >(args)...)) |
auto | dst_of (Args &&...args) const -> decltype(aut_-> dst_of(std::forward< Args >(args)...)) |
auto | get_final_weight (Args &&...args) const -> decltype(aut_-> get_ final _weight(std |
auto | get_initial_weight (Args &&...args) const -> decltype(aut_-> get_initial_weight(std::forward< Args >(args)...)) |
auto | get_transition (Args &&...args) const -> decltype(aut_-> get_transition(std::forward< Args >(args)...)) |
auto | has_state (Args &&...args) const -> decltype(aut_-> has_state(std::forward< Args >(args)...)) |
auto | has_transition (Args &&...args) const -> decltype(aut_-> has_transition(std::forward< Args >(args)...)) |
auto | is_final (Args &&...args) const -> decltype(aut_-> is_ final(std |
auto | is_initial (Args &&...args) const -> decltype(aut_-> is_initial(std::forward< Args >(args)...)) |
auto | label_of (Args &&...args) const -> decltype(aut_-> label_of(std::forward< Args >(args)...)) |
auto | labelset (Args &&...args) const -> decltype(aut_-> labelset(std::forward< Args >(args)...)) |
auto | num_all_states (Args &&...args) const -> decltype(aut_-> num_all_states(std::forward< Args >(args)...)) |
auto | num_finals (Args &&...args) const -> decltype(aut_-> num_ final s(std |
auto | num_initials (Args &&...args) const -> decltype(aut_-> num_initials(std::forward< Args >(args)...)) |
auto | num_states (Args &&...args) const -> decltype(aut_-> num_states(std::forward< Args >(args)...)) |
auto | num_transitions (Args &&...args) const -> decltype(aut_-> num_transitions(std::forward< Args >(args)...)) |
auto | prepost_label (Args &&...args) const -> decltype(aut_-> prepost_label(std::forward< Args >(args)...)) |
auto | print (Args &&...args) const -> decltype(aut_-> print(std::forward< Args >(args)...)) |
auto | print_set (Args &&...args) const -> decltype(aut_-> print_set(std::forward< Args >(args)...)) |
auto | print_state (Args &&...args) const -> decltype(aut_-> print_state(std::forward< Args >(args)...)) |
auto | print_state_name (Args &&...args) const -> decltype(aut_-> print_state_name(std::forward< Args >(args)...)) |
auto | src_of (Args &&...args) const -> decltype(aut_-> src_of(std::forward< Args >(args)...)) |
auto | state_has_name (Args &&...args) const -> decltype(aut_-> state_has_name(std::forward< Args >(args)...)) |
auto | is_lazy (Args &&...args) const -> decltype(aut_-> is_lazy(std::forward< Args >(args)...)) |
auto | is_lazy_in (Args &&...args) const -> decltype(aut_-> is_lazy_in(std::forward< Args >(args)...)) |
auto | states (Args &&...args) const -> decltype(aut_-> states(std::forward< Args >(args)...)) |
auto | weight_of (Args &&...args) const -> decltype(aut_-> weight_of(std::forward< Args >(args)...)) |
auto | weightset (Args &&...args) const -> decltype(aut_-> weightset(std::forward< Args >(args)...)) |
auto | add_final (Args &&...args) -> decltype(aut_-> add_ final(std |
auto | add_initial (Args &&...args) -> decltype(aut_-> add_initial(std::forward< Args >(args)...)) |
auto | add_transition (Args &&...args) -> decltype(aut_-> add_transition(std::forward< Args >(args)...)) |
auto | add_transition_copy (Args &&...args) -> decltype(aut_-> add_transition_copy(std::forward< Args >(args)...)) |
auto | add_weight (Args &&...args) -> decltype(aut_-> add_weight(std::forward< Args >(args)...)) |
auto | del_state (Args &&...args) -> decltype(aut_-> del_state(std::forward< Args >(args)...)) |
auto | del_transition (Args &&...args) -> decltype(aut_-> del_transition(std::forward< Args >(args)...)) |
auto | lweight (Args &&...args) -> decltype(aut_-> lweight(std::forward< Args >(args)...)) |
auto | new_state (Args &&...args) -> decltype(aut_-> new_state(std::forward< Args >(args)...)) |
auto | new_transition (Args &&...args) -> decltype(aut_-> new_transition(std::forward< Args >(args)...)) |
auto | new_transition_copy (Args &&...args) -> decltype(aut_-> new_transition_copy(std::forward< Args >(args)...)) |
auto | rweight (Args &&...args) -> decltype(aut_-> rweight(std::forward< Args >(args)...)) |
auto | set_final (Args &&...args) -> decltype(aut_-> set_ final(std |
auto | set_lazy (Args &&...args) -> decltype(aut_-> set_lazy(std::forward< Args >(args)...)) |
auto | set_lazy_in (Args &&...args) -> decltype(aut_-> set_lazy_in(std::forward< Args >(args)...)) |
auto | set_initial (Args &&...args) -> decltype(aut_-> set_initial(std::forward< Args >(args)...)) |
auto | set_transition (Args &&...args) -> decltype(aut_-> set_transition(std::forward< Args >(args)...)) |
auto | set_weight (Args &&...args) -> decltype(aut_-> set_weight(std::forward< Args >(args)...)) |
auto | unset_final (Args &&...args) -> decltype(aut_-> unset_ final(std |
auto | unset_initial (Args &&...args) -> decltype(aut_-> unset_initial(std::forward< Args >(args)...)) |
Static Public Member Functions | |
static symbol | sname () |
Static name. More... | |
![]() | |
static constexpr auto | lazy_transition (Args &&...args) -> decltype(element_type::lazy_transition(std::forward< Args >(args)...)) |
static constexpr auto | null_state (Args &&...args) -> decltype(element_type::null_state(std::forward< Args >(args)...)) |
static constexpr auto | null_transition (Args &&...args) -> decltype(element_type::null_transition(std::forward< Args >(args)...)) |
static constexpr auto | post (Args &&...args) -> decltype(element_type::post(std::forward< Args >(args)...)) |
static constexpr auto | pre (Args &&...args) -> decltype(element_type::pre(std::forward< Args >(args)...)) |
static constexpr auto | sname (Args &&...args) -> decltype(element_type::sname(std::forward< Args >(args)...)) |
Public Attributes | |
std::queue< pair_t > | todo_ |
std::unordered_map< state_name_t, state_t > | map_ |
Input-state -> sorted-state. More... | |
origins_t | origins_ |
const automaton_t | input_ |
Input automaton. More... | |
Additional Inherited Members | |
![]() | |
automaton_t | aut_ |
The wrapped automaton, possibly const. More... | |
An automaton isomorphic to another one.
Aut | the type of the wrapped input automaton. |
using vcsn::detail::permutation_automaton_impl< Aut >::automaton_t = Aut |
Input automaton type.
Definition at line 24 of file permutation-automaton.hh.
using vcsn::detail::permutation_automaton_impl< Aut >::context_t = context_t_of<automaton_t> |
Definition at line 25 of file permutation-automaton.hh.
using vcsn::detail::permutation_automaton_impl< Aut >::fresh_automaton_t = fresh_automaton_t_of<automaton_t, Ctx> |
Generated automaton type.
Definition at line 28 of file permutation-automaton.hh.
using vcsn::detail::permutation_automaton_impl< Aut >::origins_t = std::map<state_t, state_name_t> |
A map from each state to the origin state set it stands for.
Definition at line 93 of file permutation-automaton.hh.
using vcsn::detail::permutation_automaton_impl< Aut >::pair_t = std::pair<state_name_t, state_t> |
Definition at line 105 of file permutation-automaton.hh.
using vcsn::detail::permutation_automaton_impl< Aut >::state_name_t = state_t_of<automaton_t> |
Symbolic state name: input automaton state type.
Definition at line 32 of file permutation-automaton.hh.
using vcsn::detail::permutation_automaton_impl< Aut >::state_t = state_t_of<fresh_automaton_t<>> |
Sorted automaton state type.
Definition at line 34 of file permutation-automaton.hh.
using vcsn::detail::permutation_automaton_impl< Aut >::super_t = automaton_decorator<fresh_automaton_t<>> |
Definition at line 29 of file permutation-automaton.hh.
|
inline |
Definition at line 37 of file permutation-automaton.hh.
References vcsn::detail::permutation_automaton_impl< Aut >::input_, vcsn::detail::permutation_automaton_impl< Aut >::map_, vcsn::detail::automaton_decorator< Aut, Context >::post(), vcsn::detail::automaton_decorator< Aut, Context >::pre(), and vcsn::detail::permutation_automaton_impl< Aut >::todo_.
|
inline |
Ordered map: state -> its derived term.
Definition at line 97 of file permutation-automaton.hh.
|
inline |
Definition at line 54 of file permutation-automaton.hh.
|
inline |
Definition at line 67 of file permutation-automaton.hh.
|
inlinestatic |
Static name.
Definition at line 47 of file permutation-automaton.hh.
References vcsn::res, and vcsn::sname().
|
inline |
Definition at line 75 of file permutation-automaton.hh.
|
inline |
Definition at line 61 of file permutation-automaton.hh.
const automaton_t vcsn::detail::permutation_automaton_impl< Aut >::input_ |
Input automaton.
Definition at line 114 of file permutation-automaton.hh.
Referenced by vcsn::detail::permutation_automaton_impl< Aut >::permutation_automaton_impl().
std::unordered_map<state_name_t, state_t> vcsn::detail::permutation_automaton_impl< Aut >::map_ |
Input-state -> sorted-state.
Definition at line 109 of file permutation-automaton.hh.
Referenced by vcsn::detail::permutation_automaton_impl< Aut >::permutation_automaton_impl().
|
mutable |
Definition at line 111 of file permutation-automaton.hh.
std::queue<pair_t> vcsn::detail::permutation_automaton_impl< Aut >::todo_ |
Definition at line 106 of file permutation-automaton.hh.
Referenced by vcsn::detail::permutation_automaton_impl< Aut >::permutation_automaton_impl().