|
AnySet Documentation
|
Free functions and operator overloads to compute fundamental set operations on AnySet instances:
Go to the source code of this file.
Classes | |
| struct | te::detail::is_any_set< T > |
| struct | te::detail::is_any_set< AnySet< H, E, A > > |
Functions | |
| template<class Op , class Pred , class T , class ... U> | |
| decltype(auto) | te::detail::select_and_invoke (Op &&op, [[maybe_unused]] Pred pred, T &&first) |
| template<class Op , class Pred , class T , class U , class ... Args> | |
| decltype(auto) | te::detail::select_and_invoke (Op &&op, Pred pred, T &&first, U &&second, Args &&... args) |
Set Operation Free-Functions | |
| template<class T , class ... U> | |
| std::decay_t< T > | te::union_of (T &&first, U &&... args) |
| Get the union of a group of AnySet instances. More... | |
| template<class T , class ... U> | |
| std::decay_t< T > | te::intersection_of (T &&first, U &&... args) |
| Get the intersection of a group of AnySet instances. More... | |
| template<class T , class ... U> | |
| std::decay_t< T > | te::symmetric_difference_of (T &&first, U &&... args) |
| Get the symmetric difference of a group of AnySet instances. More... | |
| template<class T , class ... U> | |
| std::decay_t< T > | te::difference_of (T &&left, const U &... right) |
| Get the (asymmetric) difference of a group of AnySet instances. More... | |
| template<class H , class E , class A > | |
| bool | te::is_subset_of (const AnySet< H, E, A > &sub, const AnySet< H, E, A > &super) |
Determine whether sub is a subset of super. More... | |
| template<class H , class E , class A > | |
| bool | te::is_superset_of (const AnySet< H, E, A > &super, const AnySet< H, E, A > &sub) |
Determine whether super is a superset of sub. More... | |
Set Union Operators | |
| template<class T , class U , class = std::enable_if_t< detail::is_any_set_v<std::decay_t<T>> and std::is_same_v<std::decay_t<T>, std::decay_t<U>> >> | |
| std::decay_t< T > | te::operator+ (T &&left, U &&right) |
Compute the union of left and right as if by union_of(left, right); | |
| template<class H , class E , class A > | |
| AnySet< H, E, A > & | te::operator+= (AnySet< H, E, A > &left, AnySet< H, E, A > &&right) |
Compute the union of left and right as if by left = (left + right); | |
| template<class H , class E , class A > | |
| AnySet< H, E, A > & | te::operator+= (AnySet< H, E, A > &left, const AnySet< H, E, A > &right) |
Compute the union of left and right as if by left = (left + right); | |
| template<class T , class U , class = std::enable_if_t< detail::is_any_set_v<std::decay_t<T>> and std::is_same_v<std::decay_t<T>, std::decay_t<U>> >> | |
| std::decay_t< T > | te::operator| (T &&left, U &&right) |
Compute the union of left and right as if by union_of(left, right); | |
| template<class H , class E , class A > | |
| AnySet< H, E, A > & | te::operator|= (AnySet< H, E, A > &left, AnySet< H, E, A > &&right) |
Compute the union of left and right as if by left = (left + right); | |
| template<class H , class E , class A > | |
| AnySet< H, E, A > & | te::operator|= (AnySet< H, E, A > &left, const AnySet< H, E, A > &right) |
Compute the union of left and right as if by left = (left + right); | |
Set Intersection Operators | |
| template<class T , class U , class = std::enable_if_t< detail::is_any_set_v<std::decay_t<T>> and std::is_same_v<std::decay_t<T>, std::decay_t<U>> >> | |
| std::decay_t< T > | te::operator & (T &&left, U &&right) |
Compute the intersection of left and right as if by intersection_of(left, right); | |
| template<class H , class E , class A > | |
| AnySet< H, E, A > & | te::operator &= (AnySet< H, E, A > &left, AnySet< H, E, A > &&right) |
Compute the intersection of left and right as if by left = (left & right); | |
| template<class H , class E , class A > | |
| AnySet< H, E, A > & | te::operator &= (AnySet< H, E, A > &left, const AnySet< H, E, A > &right) |
Compute the intersection of left and right as if by left = (left & right); | |
Set Difference Operators | |
| template<class T , class U , class = std::enable_if_t< detail::is_any_set_v<std::decay_t<T>> and std::is_same_v<std::decay_t<T>, std::decay_t<U>> >> | |
| std::decay_t< T > | te::operator- (T &&left, U &&right) |
Compute the (asymmetric) difference of left and right as if by difference_of(left, right); | |
| template<class H , class E , class A > | |
| AnySet< H, E, A > & | te::operator-= (AnySet< H, E, A > &left, AnySet< H, E, A > &&right) |
Compute the (asymmetric) difference of left and right as if by left = (left - right); | |
| template<class H , class E , class A > | |
| AnySet< H, E, A > & | te::operator-= (AnySet< H, E, A > &left, const AnySet< H, E, A > &right) |
Compute the (asymmetric) difference of left and right as if by left = (left - right); | |
Set Symmetric Difference Operators | |
| template<class T , class U , class = std::enable_if_t< detail::is_any_set_v<std::decay_t<T>> and std::is_same_v<std::decay_t<T>, std::decay_t<U>> >> | |
| std::decay_t< T > | te::operator^ (T &&left, U &&right) |
Compute the symmetric difference of left and right as if by symmetric_difference_of(left, right); | |
| template<class H , class E , class A , class U , class = std::enable_if_t<std::is_same_v<AnySet<H, E, A>, std::decay_t<U>>>> | |
| AnySet< H, E, A > & | te::operator^= (AnySet< H, E, A > &left, U &&right) |
Compute the symmetric difference of left and right as if by left = (left ^ right); | |
Subset/Superset Operators | |
| template<class H , class E , class A > | |
| bool | te::operator<= (const AnySet< H, E, A > &left, const AnySet< H, E, A > &right) |
Semantically equivalent to is_subset_of(left, right);. | |
| template<class H , class E , class A > | |
| bool | te::operator< (const AnySet< H, E, A > &left, const AnySet< H, E, A > &right) |
Semantically equivalent to is_subset_of(left, right) && !(left.size() == right.size());. | |
| template<class H , class E , class A > | |
| bool | te::operator>= (const AnySet< H, E, A > &left, const AnySet< H, E, A > &right) |
Semantically equivalent to is_superset_of(left, right);. | |
| template<class H , class E , class A > | |
| bool | te::operator> (const AnySet< H, E, A > &left, const AnySet< H, E, A > &right) |
Semantically equivalent to is_subset_of(left, right) && !(left.size() == right.size());. | |
Stream Insertion Operators | |
| template<class H , class E , class C > | |
| std::ostream & | te::operator<< (std::ostream &os, const AnySet< H, E, C > &set) |
Write an AnySet instance to the std::ostream os. | |
Variables | |
| template<class T > | |
| constexpr const bool | te::detail::is_any_set_v = is_any_set<T>::value |
Namespaces | |
| te | |
| Primary classes and utility functions for AnySet. | |
1.8.13