31     template <
typename Decorated,
 
   47       template <
size_t... I>
 
   48       using seq = 
typename tuple_automaton_impl::template 
seq<I...>;
 
   68       template <
typename... T>
 
   80         return aut_->origins();
 
   91         self.add_transitions(s, sn);
 
  107       template <Automaton A>
 
  113       template <
typename... Args>
 
  116         return aut_->template state<Lazy>(std::forward<Args>(args)...);
 
  120       std::tuple<typename transition_map_t<Auts>::map_t&...>
 
  126       template <
size_t... I>
 
  127       std::tuple<typename transition_map_t<Auts>::map_t&...>
 
auto origins() const  -> decltype(aut_->origins())                
A map from result state to tuple of original states. 
 
typename tuple_automaton_impl::state_name_t state_name_t
 
Decorator implementing the laziness for an algorithm. 
 
auto make_tuple_automaton(const Auts &...auts) -> tuple_automaton< Auts... >
 
static constexpr auto pre(Args &&...args) -> decltype(element_type::pre(std::forward< Args >(args)...))
 
static symbol sname_(const T &...t)
 
std::shared_ptr< detail::tuple_automaton_impl< Auts... >> tuple_automaton
A tuple automaton as a shared pointer. 
 
state_t_of< automaton_t > state_t
 
std::tuple< typename transition_map_t< Auts >::map_t &... > out_(const state_name_t &ss)
The outgoing tuple of transitions from state tuple ss. 
 
Aggregate an automaton, and forward calls to it. 
 
typename tuple_automaton_impl::template seq< I... > seq
 
static std::string sname_(const T &...t)
The sname of the sub automata. 
 
std::tuple< typename transition_map_t< Auts >::map_t &... > out_(const state_name_t &ss, seq< I... >)
 
weightset_t_of< Aut > weightset_t
 
boost::flyweight< std::string, boost::flyweights::no_tracking, boost::flyweights::intermodule_holder > symbol
An internalized string. 
 
const weightset_t & ws_
The resulting weightset. 
 
auto is_lazy(Args &&...args) const  -> decltype(aut_-> is_lazy(std::forward< Args >(args)...))
 
void complete_(state_t s) const 
Complete a state: find its outgoing transitions. 
 
state_t state(Args &&...args)
Conversion from state name to state number. 
 
auto all_out(const Aut &aut, state_t_of< Aut > s)
Indexes of transitions leaving state s. 
 
Cache the outgoing transitions of an automaton as efficient maps label -> vector<(weight, dst)>. 
 
std::tuple< transition_map_t< Auts >... > transition_maps_
Transition caches. 
 
transition_map< A, weightset_t, false, true, KeepTransitions > transition_map_t
The type of our transition maps: convert the weight to weightset_t, non deterministic, and including transitions to post(). 
 
typename super_t::state_t state_t
Result state type. 
 
lazy_tuple_automaton(Aut aut, const Auts &...auts)
 
std::tuple< state_t_of< Auts >... > state_name_t
State names: Tuple of states of input automata. 
 
typename detail::weightset_t_of_impl< base_t< ValueSet >>::type weightset_t_of
 
tuple_automaton< Aut, Auts... > tuple_automaton_t
The underlying automaton, output and inputs. 
 
automaton_t aut_
The wrapped automaton, possibly const. 
 
typename tuple_automaton_t::element_type tuple_automaton_impl
 
auto set_lazy(Args &&...args) -> decltype(aut_-> set_lazy(std::forward< Args >(args)...))
 
typename context_t::weightset_t weightset_t
 
Build the (accessible part of the) product. 
 
auto all_out(state_t s) const  -> decltype(all_out(aut_, s))                
All the outgoing transitions.