| ▼Nawali | Main namespace of Awali |
| Ndeprecated | Namespace that contains deprecated functions accessible for compatibility with earlier versions |
| ►Ndocstring | |
| Centry_t | |
| ►Ndyn | Namespace for the dynamical layer of Awali |
| ►Ncontext | Namespace containing functions to build arbitrary automata context (advanced and mostly undocumented) |
| Cabstract_weightset | |
| Cbasic_weightset | |
| Cbounded_weightset | |
| Ccontext_description_impl | |
| Ccyclic_weightset | |
| Clabelset_description_impl | |
| Cweightset_description_impl | |
| CWTypes | |
| Ndeprecated | |
| Nfactory | Namespace containing what we call factories, that is, functions that generates a member in a family of automata, rational expression or transducer |
| ►Ninternal | Implementation details of dyn layer (not stable) |
| Cacceptor_t | |
| Cacceptor_t< bool > | |
| Cacceptor_t< std::string > | |
| Caut_or_exp_t | |
| Caut_or_exp_t.__unnamed1__ | |
| Cformatted_istream | |
| Cformatted_ostream | |
| Copt_any_t | |
| Copt_typed_value | |
| Copt_untyped_value | |
| Coption_t | |
| Coption_value_pair_t | |
| Cuntyped_value | |
| CValue | |
| Nlift | Namespace containing the functions allowing to execute the state elimination algorithm (aut_to_exp) step-by-step; probably will be moved elsewhere in the future |
| ►Nloading | Namespace containtaing facilities for on-the-fly compilation |
| Cfile_loc_t | |
| Cabstract_automaton_t | Abstract interface listing the services provided by automata at the dynamical layer |
| Cabstract_context_t | Abstract interface representing the weightset and labelset of an automaton, a rational expression or a transducer |
| Cabstract_ratexp_t | Abstract interface for rational expression at the dynamical layer; lists the services provided by automata |
| Cany_cast_exception | |
| Cany_t | Structure used to erase the type of labels/weights at the dyn layer |
| ►Cautomaton_t | An automaton_t is essentially a shared pointer to an abstract_automaton_t, but also contains static functions serving as constructors |
| Cwith_int_labels | Helper class that contains convenience constructor for automata with int labels |
| Ccontext_t | Dynamical wrapper for a context, that is a weightset and a labelset |
| Coptions_t | An options_t is a set of optional parameters that is passed on to called functions |
| ►Cratexp_t | Main class for representing rational expresson at the dynamical layer |
| Cwith_int_labels | Helper class that contains convenience factories to build expressions whose labels are integers |
| Cwith_tuple_labels | Helper class that contains convenience factories to build expressions whose labels are tuples |
| Cscc_return_t | |
| Ctransducer_t | |
| ►Ninternal | Namespace containing implementation details of elements common to sttc and dyn layers (not stable) |
| Cand_ | |
| Cand_< F1 > | |
| Cand_< F1, F... > | |
| Cand_<> | |
| Cconcat | |
| Cconcat< index_sequence< I1... >, index_sequence< I2... > > | |
| Cconcat_index_sequence | |
| Cconcat_index_sequence< index_sequence< I1... >, index_sequence< I2... > > | |
| Ceval_if | |
| Ceval_if_c | |
| Cif_ | |
| Cif_c | |
| Cif_c< false, T1, T2 > | |
| Cindex_sequence | |
| Cint_range | |
| Cint_range< off, index_sequence< I... > > | |
| Cmake_index_range | |
| Cmake_index_range< S, -1U > | |
| Cmake_index_range< S, 0 > | |
| Cmake_index_sequence | |
| Cmake_index_sequence< 0 > | |
| Cmake_index_sequence< 1 > | |
| Cor_ | |
| Cor_< F1 > | |
| Cor_< F1, F... > | |
| Cor_<> | |
| Creverseseq | |
| Creverseseq< index_sequence< I1 > > | |
| Creverseseq< index_sequence< I1, I2... > > | |
| Cseqconcat | |
| Cseqconcat< index_sequence< I1... >, index_sequence< I2... > > | |
| Cstd_all | |
| Cstd_all< false, Tail... > | |
| Cstd_all< true, Tail... > | |
| Cstd_all<> | |
| Ctuple_printer | |
| Ctuple_printer< Tuple, 1 > | |
| ►Njson | |
| Ninternal | |
| Carray_t | |
| Cbool_t | |
| Ccoercion_exception | Exception used when trying to coerce a node to a given type |
| Cexception | |
| Cfloat_t | |
| Cheighter_t | |
| Cinline_sizer_t | |
| Cint_t | |
| Ckind_mismatch | |
| Cnode_t | |
| Cnull_t | |
| Cobject_t | |
| Cout_of_range | |
| Cparse_exception | |
| ►Cparser_t | |
| Cposition_t | |
| Csmart_printer_t | |
| Cstring_t | |
| Cuint_or_string_t | |
| Cvisitor_t | Abstract class that helps implement a visitor of json tree or subtree |
| Njson_ast | |
| ►Npriority | Namespace that contains helper class and function to allow one algorithm to be choosen at compile time depending on context, among a sorted list of possibly available functions |
| C_p | |
| Npy | Namespace containing the C++ that simplify type for easier to Python |
| ►Nsttc | Namespace for the static layer of Awali |
| Nctx | Namespace containing all available contexts (weigh sets, label sets, etc.) |
| ►Ndeprecated | |
| ►Ndetail | |
| Cjs_exp_parser | |
| Ndetail_info | |
| ►Ninternal | Implementation details of static layer (not stable) |
| Caff | |
| Callowworder | |
| Care_isomorphicer | |
| Cas_pair | |
| Cas_tuple | |
| Cautomaton_decorator | Aggregate an automaton, and forward calls to it |
| Cbackward_initialisation | |
| Cbackward_initialisation< Aut, b > | |
| Cbitset_iterator | |
| Ccomp_tail_tuple | |
| Ccomp_tail_tuple< N, N > | |
| Ccomposer | Build the (accessible part of the) composition |
| Cconcat_tupleset | |
| Cconcat_tupleset< tupleset< T1... >, tupleset< T2... > > | |
| Ccont_filter | |
| Ccontext_of | |
| Ccontext_of< sttc::mutable_automaton< Context > > | |
| Ccontext_t_of_impl | |
| Ccontext_t_of_impl< std::shared_ptr< ValueSet > > | |
| Ccopier | Copy an automaton |
| ►Ccross_sequences | |
| Ccross_iterator | Composite iterator |
| Ccycle_identity_impl | Whether the weight of beetween two states on component, it is always unique |
| Cdautter | Format an automaton into daut vcsn format |
| Cderived_termer | |
| Cdeterminization_bitset_impl | The subset construction automaton from another |
| Cdeterminization_set_impl | The subset construction automaton from another |
| ►Cdetweighted_algo_impl | The weighted determinization of weighted automaton |
| Cstateset | An output state is a list of weighted input states |
| Cdispatch_lal_lan | |
| Cdispatch_lal_lan< Aut, letterset< T > > | |
| Cdispatch_lal_lan< Aut, nullableset< T > > | |
| Cdotter | Format an automaton into Dot |
| Cdown_caster | A functor that captures the current location (to report errors), and provides "cast" |
| Cefsmer | Format automaton to EFSM format, based on FSM format |
| Cenumerater | |
| Cevaluator | |
| Cexp_parser | |
| Cextended_label | |
| Cextended_label< Aut, b > | |
| Cfadoer | Format an automaton into Fado |
| Cgf2_impl | |
| Cgrailer | Format an automaton into Fado |
| Cif_has_one | |
| Cif_has_one< true > | |
| Cimagers | |
| Cindice_filter | |
| Cis_quotient_computer_t | |
| Cis_synchronizable_impl | |
| Cis_valider | |
| Cis_valider< Aut, false > | |
| Cit_cont | |
| Cit_filter | |
| Cit_indice_filter | |
| Cjs_exp_parser | |
| Clabel_t_of_impl | |
| Clabel_t_of_impl< std::shared_ptr< ValueSet > > | |
| Clabelset_t_of_impl | |
| Clabelset_t_of_impl< std::shared_ptr< ValueSet > > | |
| Clabelset_types | A traits so that tupleset may define types that may exist |
| Clabelset_types< decltype(pass{typename ValueSets::word_t()...}, void()), ValueSets... > | Specialization for tuples of labelsets |
| Cless | Adapter of std::less to wrap less_than method of valuesets |
| Cletterizer | |
| Cletterizer< Aut, wordset< L > > | |
| Clhm_values | |
| Clhm_values_const_iterator | |
| Clinked_hash_map | |
| Cmake_labelset_from_letters | |
| Cmake_labelset_from_letters< nullableset< LS > > | |
| Cmap_nullable | |
| Cmap_nullable< tupleset< Letterset, T... > > | |
| Cmap_nullable< tupleset<> > | |
| Cmerger | |
| Cmultituple | |
| Cmultituple< 1u > | |
| Cmultitupleset | |
| Cmultitupleset< 1u, Labelset > | |
| ►Cmutable_automaton_impl | |
| Cstored_state_t | Data stored for each state |
| Cnullable_helper | Add support for an empty word to a LabelSet that does not provide such special label to this end |
| Cnullable_helper< letterset< GenSet > > | Add support for an empty word to a letterset thanks to the one() of its genset |
| Coutputter | Factor common bits in automaton formatting |
| Coutsplitter | |
| Cpair_automaton_impl | |
| Cpartial_identiter | |
| Cpartition_automaton_impl | |
| Cpass | Ignore its arguments |
| Cpermutation_automaton_impl | |
| Cpossibly_labeled_transition_tuple | |
| Cpossibly_labeled_transition_tuple< State, empty_t > | |
| Cproduct_algo_impl | Build the (accessible part of the) product |
| Cprojector | |
| Cprojectors | |
| Cproperer | This class contains the core of the proper algorithm |
| Cproperer< Aut, false > | |
| Crandom_selector | |
| Crank | Number of tapes |
| Crank< tupleset< LabelSet... > > | |
| Cratexp_automaton_impl | An incremental automaton whose states are ratexps |
| Crealtimer | |
| Creductioner | |
| Crem_in_tuple | |
| Crem_in_tuple< 0u > | |
| Crem_in_tupleset | |
| Crem_in_tupleset< tupleset< T... >, I > | |
| Creplace_in_tuple | |
| Creplace_in_tuple< 0u, T > | |
| Creplace_in_tupleset | |
| Creplace_in_tupleset< tupleset< T... >, I, U > | |
| Creverse_postorder_impl | Get all vertexs in reverse postorder by using depth first search |
| Cscc_kosaraju | Use Kosajaju algorithm for finding all of strongly connected components |
| Cselect | |
| Cselect< q > | |
| Cselect< r > | |
| Cselect< tupleset< T... >, I > | |
| Cselect< z > | |
| Cselect_one | |
| Cselect_one< tupleset< T... >, I > | |
| Cselect_tail | |
| Cselect_tail< tupleset< T... > > | |
| Cselects | |
| Cselects< tupleset< T... >, I... > | |
| Cstandard_operations | |
| Cstar_heighter | |
| Cstate_eliminator | |
| Cstate_eliminator< Aut, labels_are_one > | |
| Cstate_eliminator< Aut, labels_are_ratexps > | |
| Csub_tuple | |
| Csub_tuple< I > | |
| Csynchronizer | |
| Ctail_tuple | |
| Ctail_tuple< std::tuple< Head, Tail... > > | |
| ►Ctarjaner_t | |
| Ctoken_t | |
| Ctdc_letterizer | |
| Ctdc_letterizer< Tdc, I, wordset< L > > | |
| Ctdc_lifter | |
| Ctikzer | Format automaton to TikZ format |
| Ctrans_tuple | |
| ►Ctransition_map | Cache the outgoing transitions of an automaton as efficient maps label -> vector<(weight, dst)> |
| Ctransition | |
| Ctranspose_view_impl | |
| Ctransposer | |
| Ctuple_automaton_impl | An automaton whose states are tuples of states of automata |
| Ctuple_to_tupleset | |
| Ctuple_to_tupleset< std::tuple< T... > > | |
| Cuniversaler | Functor for universal |
| Cweight_t_of_impl | |
| Cweight_t_of_impl< std::shared_ptr< ValueSet > > | |
| Cweightset_t_of_impl | |
| Cweightset_t_of_impl< std::shared_ptr< ValueSet > > | |
| Cz_impl | |
| ►Czip_sequences | |
| Czip_iterator | Composite iterator |
| ►Czipped_maps | |
| Citerator | Composite iterator |
| ►Nrat | Namespace about static rational expressions |
| Catom | |
| Ccompact_thompson_visitor | |
| Cconst_visitor | |
| Cconstant | |
| Cconstant_term_visitor | |
| Ccopier | |
| Cderivation_visitor | |
| Cdrawexp_visitor | |
| Cequal_visit | |
| Cexp | The abstract, non-parameterized, root for all rational expression node types |
| Cexp_stats_visitor | |
| Cexpand_visitor | |
| Cexpcopy_visitor | |
| Cexpsupport_visitor | |
| Chash | |
| Cinfo | |
| Cinner | An inner node |
| Cjson_visitor | |
| Cleaf | The root from which to derive the final node types |
| Cless_than | |
| Cnode | The abstract parameterized, root for all rational expression types |
| Cprint_visitor | |
| Cprinter | |
| Cratexpset_impl | A typed ratexp set |
| Csize | |
| Csplit_visitor | |
| Cstandard_visitor | Convert a ratexp to a standard automaton |
| Cstar_normal_form_visitor | |
| Cthompson_visitor | |
| Cunary | |
| Cvariadic | An inner node with multiple children |
| Cweight_node | An inner node implementing a weight |
| Cweighted_thompson_visitor | |
| Cb | The Boolean semring |
| Cc | The semiring of complex numbers |
| Cchar_letters | Helper for manipulations of char letters |
| Ccontext | Carries the algebraic settings of automata |
| Cempty_t | Empty labels, for LAO |
| Cexp_stats_t | Gathers informations on some rational expression |
| Cf2 | The field F2 |
| Chistory_base | Base type for history of automata |
| Cint_letters | Helper for manipulations of int letters |
| Clabels_are_letters | Marker type for labelsets where labels are letters |
| Clabels_are_nullable | Marker type for labelsets where labels are nullable |
| Clabels_are_one | Marker type for labelsets where labels are one |
| Clabels_are_ratexps | Marker type for labelsets where labels are rational expressions |
| Clabels_are_tuples | Marker type for labelsets where labels are tuples |
| Clabels_are_words | Marker type for labelsets where labels are words |
| Clabelset_trait | Trait that computes the related types of a labelset |
| Clabelset_trait< letterset< T > > | Specialisation of labelset_trait for letterset |
| Clabelset_trait< nullableset< T > > | Specialisation of labelset_trait for nullableset |
| Clabelset_trait< oneset > | Specialisation of labelset_trait for oneset |
| Clabelset_trait< tupleset< Ts... > > | Specialisation of labelset_trait for tupleset |
| Clabelset_trait< wordset< T > > | Specialisation of labelset_trait for wordset |
| Cletterset | Implementation of labels are letters |
| Cmaxmin | The max-min semiring over floating numbers |
| Cn | The semiring of Natural numbers |
| Cnn | The semiring of natural numbers bounded by K |
| Cno_history | Specialisation of history_base |
| Cnoo | The semiring of extended natural numbers |
| Cnullableset | Implementation of labels are nullables (letter or empty) |
| Coneset | Implementation of labels are ones: there is a single instance of label |
| Cpair_letters | Helper for manipulations of pair letters |
| Cpartition_history | Specialisation of history_base |
| Cpmax | The semiring of maximum probabilities |
| Cpolynomialset | Linear combination of labels: map labels to weights |
| Cq | The semiring of rational numbers |
| Cr | The semiring of floating Numbers |
| Cratexp_history | Specialisation of history_base |
| Cset_alphabet | Objets that represent the alphabets of letters as char |
| Csingle_history | Specialisation of history_base |
| Cstring_history | |
| Ctest_acyclic | |
| Ctransition_tuple | |
| Ctransition_tuple< State, Label, bool > | |
| Ctuple_history | An automaton whose states are tuples of states of automata |
| Ctupleset | A ValueSet which is a Cartesian product of ValueSets |
| Cvariadic_mul_mixin | Provide a variadic mul on top of a binary mul(), and one() |
| Cwordset | Implementation of labels are words |
| Cz | The semiring of Integers |
| Czmax | The Z-max-plus semiring |
| Czmin | The Z-min-plus semiring |
| Czz | The cyclic semiring with characteristic N |
| ►Nutils | |
| Cequal_to | This is useful to make hashes with labels or weights as keys without using non-default constructors; to be used along with utils::hash |
| Chash | This is useful to make hashes with labels or weights as keys without using non-default constructors; to be used along with utils::equal_to |
| Cmin_heap | |
| Nversion | |
| Clinked_map_t | Implemention of a linked hash-map |
| Cno_such_file_exception | |
| Cparse_exception | Exceptions thrown during parsing |
| Cpointed_equal_t | This class takes a type E that computes equality for type K and allows to compute equality for type K const* by calling deferencing both values and calling E on them |
| Cpointed_hash_t | This class takes a hasher for type K and makes a hasher for type K const* that hash the pointed value and not the pointer |
| Cq_fraction_t | |
| ▼Nstd | STL namespace |
| Cconcat_tuple | |
| Cconcat_tuple< std::tuple< T1... >, std::tuple< T2... > > | |
| Ccons_tuple | |
| Ccons_tuple< T1, std::tuple< T2... > > | |
| Ccst_tuple | |
| Ccst_tuple< T, 1u > | |
| Chash< awali::q_fraction_t > | |
| Chash< awali::sttc::empty_t > | |
| Chash< map< Key, Value, Compare, Alloc > > | |
| Chash< pair< T1, T2 > > | |
| Chash< set< T > > | |
| Chash< std::complex< T > > | |
| Chash< std::tuple< Elements... > > | |
| Chash< unordered_set< T > > | |
1.9.1