#include <memory>
#include <set>
#include <boost/algorithm/string/predicate.hpp>
#include <vcsn/core/kind.hh>
#include <vcsn/labelset/fwd.hh>
#include <vcsn/labelset/genset-labelset.hh>
#include <vcsn/labelset/labelset.hh>
#include <vcsn/misc/attributes.hh>
#include <vcsn/misc/hash.hh>
#include <vcsn/misc/raise.hh>
Go to the source code of this file.
|
#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...
|
|
#define DEFINE |
( |
|
Lhs, |
|
|
|
Rhs |
|
) |
| |
Value:template <typename GenSet> \
struct join_impl<Lhs, Rhs> \
{ \
using type = Rhs; \
static type
join(
const Lhs& lhs,
const Rhs& rhs) \
{ \
return {
get_union(lhs.genset(), rhs.genset())}; \
} \
}
std::set< T, Compare, Alloc > get_union(const std::set< T, Compare, Alloc > &set1, const std::set< T, Compare, Alloc > &set2)
The union of two sets.
auto join(const ValueSet &vs) -> ValueSet
The join of a single valueset.
Declare that Lhs v Rhs => Rhs (on the union of alphabets).
Definition at line 286 of file wordset.hh.