30 #ifndef __CLAW_ORDERED_SET_HPP__
31 #define __CLAW_ORDERED_SET_HPP__
43 template<
class K,
class Comp = std::less<K> >
86 static Comp s_key_comp;
94 #endif // __CLAW_ORDERED_SET_HPP__
ordered_set & operator*=(const ordered_set &that)
Intersection.
ordered_set & operator-=(const ordered_set &that)
Difference.
super::const_reference const_reference
The type of a const reference on the values.
Binary search tree AVL implementation.
Implementation of the claw::math::ordered_set.
ordered_set & join(const ordered_set &that)
Union.
bool strictly_contains(const ordered_set &that) const
Inclusion.
impl_type::avl_const_iterator const_iterator
The type of the iterator on the values of the tree.
super::referent_type referent_type
The type passed to the template.
ordered_set & operator/=(const ordered_set &that)
Symetric difference.
bool operator>=(const ordered_set &that) const
Inclusion or equality.
super::const_iterator const_iterator
The type of the iterator used to access non modifiable values.
argument_attributes referent_type
The type passed to the template.
bool operator<=(const ordered_set &that) const
Inclusion or equality.
const argument_attributes & const_reference
The type of a const reference on the values.
bool operator>(const ordered_set &that) const
Inclusion.
bool operator<(const ordered_set &that) const
Inclusion.
ordered_set & operator+=(const ordered_set &that)
Union.
super::value_type value_type
The type of the values in the set.
bool contains(const ordered_set &that) const
Inclusion or equality.
A class to manage sets of ordered items.
ordered_set & difference(const ordered_set &that)
Difference.
ordered_set & symetric_difference(const ordered_set &that)
Symetric difference.
argument_attributes value_type
The type of the values in the tree.
ordered_set & intersection(const ordered_set &that)
Intersection.