ordered_set.hpp
Go to the documentation of this file.
/*
CLAW - a C++ Library Absolutely Wonderful
CLAW is a free library without any particular aim but being useful to
anyone.
Copyright (C) 2005-2011 Julien Jorge
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
contact: julien.jorge@gamned.org
*/
#ifndef __CLAW_ORDERED_SET_HPP__
#define __CLAW_ORDERED_SET_HPP__
#include <claw/avl.hpp>
namespace claw
{
namespace math
{
template<class K, class Comp = std::less<K> >
class ordered_set:
public avl<K, Comp>
{
private:
typedef avl<K, Comp> super;
public:
typedef typename super::const_iterator const_iterator;
typedef typename super::value_type value_type;
typedef typename super::referent_type referent_type;
typedef typename super::const_reference const_reference;
public:
ordered_set& operator*=( const ordered_set& that );
ordered_set& operator+=( const ordered_set& that );
ordered_set& operator-=( const ordered_set& that );
ordered_set& operator/=( const ordered_set& that );
bool operator>( const ordered_set& that ) const;
bool operator>=( const ordered_set& that ) const;
bool operator<( const ordered_set& that ) const;
bool operator<=( const ordered_set& that ) const;
ordered_set& intersection( const ordered_set& that );
ordered_set& join( const ordered_set& that );
ordered_set& difference( const ordered_set& that );
ordered_set& symetric_difference( const ordered_set& that );
bool contains( const ordered_set& that ) const;
bool strictly_contains( const ordered_set& that ) const;
private:
static Comp s_key_comp;
}; // class ordered_set
} // namespace math
} // namespace claw
#include <claw/impl/ordered_set.tpp>
#endif // __CLAW_ORDERED_SET_HPP__
avl.hpp
AVL Binary search tree.
claw::avl< K, Comp >::const_reference
const K & const_reference
Definition avl.hpp:63
claw::avl< K, Comp >::value_type
K value_type
Definition avl.hpp:51
claw::avl< K, Comp >::const_iterator
impl_type::avl_const_iterator const_iterator
Definition avl.hpp:66
claw::avl< K, Comp >::referent_type
K referent_type
Definition avl.hpp:57
claw::math::ordered_set
A class to manage sets of ordered items.
Definition ordered_set.hpp:46
claw::math::ordered_set::referent_type
super::referent_type referent_type
The type passed to the template.
Definition ordered_set.hpp:60
claw::math::ordered_set::const_reference
super::const_reference const_reference
The type of a const reference on the values.
Definition ordered_set.hpp:63
claw::math::ordered_set::const_iterator
super::const_iterator const_iterator
The type of the iterator used to access non modifiable values.
Definition ordered_set.hpp:54
claw::math::ordered_set::value_type
super::value_type value_type
The type of the values in the set.
Definition ordered_set.hpp:57
claw::math
Manipulation of mathematic, geometric, etc. items.
Definition box_2d.hpp:38
claw
This is the main namespace.
Definition algorithm.hpp:34