30#ifndef __CLAW_ORDERED_SET_HPP__
31#define __CLAW_ORDERED_SET_HPP__
43 template <
class K,
class Comp = std::less<K> >
81 bool strictly_contains(
const ordered_set& that)
const;
85 static Comp s_key_comp;
91#include <claw/ordered_set.tpp>
Binary search tree AVL implementation.
K referent_type
The type passed to the template.
const K & const_reference
The type of a const reference on the values.
impl_type::avl_const_iterator const_iterator
The type of the iterator on the values of the tree.
K value_type
The type of the values in the tree.
A class to manage sets of ordered items.
super::value_type value_type
The type of the values in the set.
super::const_reference const_reference
The type of a const reference on the values.
super::referent_type referent_type
The type passed to the template.
super::const_iterator const_iterator
The type of the iterator used to access non modifiable values.
This is the main namespace.