Vcsn  2.2
Be Rational
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
polynomialset<context<wordset<char_letters>, q>>.cc
Go to the documentation of this file.
1 #define BUILD_LIBVCSN 1
2 #define VCSN_INSTANTIATION 1
3 #define MAYBE_EXTERN
4 
5 #include <vcsn/alphabets/char.hh>
7 #include <vcsn/ctx/context.hh>
8 #include <vcsn/dyn/registries.hh>
10 #include <vcsn/misc/attributes.hh>
11 #include <vcsn/misc/name.hh>
13 #include <vcsn/weightset/q.hh>
14 
15 #include <vcsn/algos/trie.hh>
16 
17 
18 // trie.
19 using t0_t =
23  vcsn::q
24  >
25  >;
26 
27 static bool trie ATTRIBUTE_USED =
29  vcsn::ssignature<t0_t>(),
30  vcsn::dyn::detail::trie<t0_t>
31  );
mutable_automaton< detail::free_context< context_t_of< PolynomialSet > > > trie(const PolynomialSet &ps, const typename PolynomialSet::value_t &p)
Make a trie-like mutable_automaton for a finite series given as a polynomial.
Definition: trie.hh:213
static bool trie ATTRIBUTE_USED
bool trie_register(const signature &sig, trie_t fn)
Definition: algos.cc:1430
vcsn::compose_automaton< true, vcsn::focus_automaton< 1, vcsn::mutable_automaton< vcsn::context< vcsn::tupleset< vcsn::nullableset< vcsn::letterset< vcsn::set_alphabet< vcsn::char_letters >> >, vcsn::nullableset< vcsn::letterset< vcsn::set_alphabet< vcsn::char_letters >> > >, vcsn::b > > >, vcsn::insplit_automaton< vcsn::focus_automaton< 0, vcsn::mutable_automaton< vcsn::context< vcsn::tupleset< vcsn::nullableset< vcsn::letterset< vcsn::set_alphabet< vcsn::char_letters >> >, vcsn::nullableset< vcsn::letterset< vcsn::set_alphabet< vcsn::char_letters >> > >, vcsn::b > > > > > t0_t
Definition: b>>>>>.cc:61
Implementation of labels are words.
Definition: fwd.hh:36
Provide a variadic mul on top of a binary mul(), and one().
Definition: fwd.hh:46