00001 /* 00002 CLAW - a C++ Library Absolutely Wonderful 00003 00004 CLAW is a free library without any particular aim but being useful to 00005 anyone. 00006 00007 Copyright (C) 2005-2008 Julien Jorge 00008 00009 This library is free software; you can redistribute it and/or 00010 modify it under the terms of the GNU Lesser General Public 00011 License as published by the Free Software Foundation; either 00012 version 2.1 of the License, or (at your option) any later version. 00013 00014 This library is distributed in the hope that it will be useful, 00015 but WITHOUT ANY WARRANTY; without even the implied warranty of 00016 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 00017 Lesser General Public License for more details. 00018 00019 You should have received a copy of the GNU Lesser General Public 00020 License along with this library; if not, write to the Free Software 00021 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA 00022 00023 contact: julien_jorge@yahoo.fr 00024 */ 00030 #ifndef __CLAW_ORDERED_SET_HPP__ 00031 #define __CLAW_ORDERED_SET_HPP__ 00032 00033 #include <claw/avl.hpp> 00034 00035 namespace claw 00036 { 00037 namespace math 00038 { 00043 template<class K, class Comp = std::less<K> > 00044 class ordered_set: 00045 public avl<K, Comp> 00046 { 00047 private: 00048 typedef avl<K, Comp> super; 00049 00050 public: 00051 typedef typename super::const_iterator const_iterator; 00052 typedef typename super::value_type value_type; 00053 typedef typename super::referent_type referent_type; 00054 typedef typename super::const_reference const_reference; 00055 00056 public: 00057 ordered_set& operator*=( const ordered_set& that ); 00058 ordered_set& operator+=( const ordered_set& that ); 00059 ordered_set& operator-=( const ordered_set& that ); 00060 ordered_set& operator/=( const ordered_set& that ); 00061 00062 bool operator>( const ordered_set& that ) const; 00063 bool operator>=( const ordered_set& that ) const; 00064 bool operator<( const ordered_set& that ) const; 00065 bool operator<=( const ordered_set& that ) const; 00066 00067 ordered_set& intersection( const ordered_set& that ); 00068 ordered_set& join( const ordered_set& that ); 00069 ordered_set& difference( const ordered_set& that ); 00070 ordered_set& symetric_difference( const ordered_set& that ); 00071 00072 bool contains( const ordered_set& that ) const; 00073 bool strictly_contains( const ordered_set& that ) const; 00074 00075 private: 00077 static Comp s_key_comp; 00078 00079 }; // class ordered_set 00080 } // namespace math 00081 } // namespace claw 00082 00083 #include <claw/impl/ordered_set.tpp> 00084 00085 #endif // __CLAW_ORDERED_SET_HPP__