Vcsn  2.4
Be Rational
wordset.hh File Reference
#include <memory>
#include <boost/range/algorithm/mismatch.hpp>
#include <boost/algorithm/string/predicate.hpp>
#include <boost/optional.hpp>
#include <vcsn/core/kind.hh>
#include <vcsn/labelset/fwd.hh>
#include <vcsn/labelset/genset-labelset.hh>
#include <vcsn/labelset/labelset.hh>
#include <vcsn/labelset/letterset.hh>
#include <vcsn/misc/attributes.hh>
#include <vcsn/misc/functional.hh>
#include <vcsn/misc/irange.hh>
#include <vcsn/misc/raise.hh>
Include dependency graph for wordset.hh:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.


class  vcsn::wordset< GenSet >
 Implementation of labels are words. More...
struct  vcsn::detail::letterized_traits< wordset< GenSet > >
 Conversion to letterized. More...
struct  vcsn::detail::nullableset_traits< wordset< GenSet > >
 wordset is already a nullableset. More...
struct  vcsn::detail::law_traits< wordset< GenSet > >
struct  vcsn::detail::join_impl< letterset< GenSet >, wordset< GenSet > >
 The join with another labelset. More...
struct  vcsn::detail::join_impl< nullableset< letterset< GenSet > >, wordset< GenSet > >
struct  vcsn::detail::join_impl< wordset< GenSet >, wordset< GenSet > >




#define DEFINE(Lhs, Rhs)
 Declare that Lhs v Rhs => Rhs (on the union of alphabets). More...


template<typename GenSet >
wordset< GenSet > vcsn::meet (const wordset< GenSet > &lhs, const wordset< GenSet > &rhs)
 Compute the meet with another alphabet. More...
template<typename GenSet , typename RandomGenerator = std::default_random_engine>
wordset< GenSet >::value_t vcsn::random_label (const wordset< GenSet > &ls, RandomGenerator &gen=RandomGenerator())
 Random label from wordset. More...

Macro Definition Documentation

#define DEFINE (   Lhs,
template <typename GenSet> \
struct join_impl<Lhs, Rhs> \
{ \
using type = Rhs; \
static type join(const Lhs& lhs, const Rhs& rhs) \
{ \
return {set_union(*lhs.genset(), *rhs.genset())}; \
} \
Container set_union(const Container &s1, const Container &s2)
The union of two sets.
Definition: algorithm.hh:217
context join(const context &c1, const context &c2)

Declare that Lhs v Rhs => Rhs (on the union of alphabets).

Definition at line 410 of file wordset.hh.