multiset.h

00001 // Debugging multiset implementation -*- C++ -*- 00002 00003 // Copyright (C) 2003, 2004 00004 // Free Software Foundation, Inc. 00005 // 00006 // This file is part of the GNU ISO C++ Library. This library is free 00007 // software; you can redistribute it and/or modify it under the 00008 // terms of the GNU General Public License as published by the 00009 // Free Software Foundation; either version 2, or (at your option) 00010 // any later version. 00011 00012 // This library is distributed in the hope that it will be useful, 00013 // but WITHOUT ANY WARRANTY; without even the implied warranty of 00014 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00015 // GNU General Public License for more details. 00016 00017 // You should have received a copy of the GNU General Public License along 00018 // with this library; see the file COPYING. If not, write to the Free 00019 // Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, 00020 // USA. 00021 00022 // As a special exception, you may use this file as part of a free software 00023 // library without restriction. Specifically, if other files instantiate 00024 // templates or use macros or inline functions from this file, or you compile 00025 // this file and link it with other files to produce an executable, this 00026 // file does not by itself cause the resulting executable to be covered by 00027 // the GNU General Public License. This exception does not however 00028 // invalidate any other reasons why the executable file might be covered by 00029 // the GNU General Public License. 00030 00031 #ifndef _GLIBCXX_DEBUG_MULTISET_H 00032 #define _GLIBCXX_DEBUG_MULTISET_H 1 00033 00034 #include <debug/safe_sequence.h> 00035 #include <debug/safe_iterator.h> 00036 #include <utility> 00037 00038 namespace __gnu_debug_def 00039 { 00040 template<typename _Key, typename _Compare = std::less<_Key>, 00041 typename _Allocator = std::allocator<_Key> > 00042 class multiset 00043 : public _GLIBCXX_STD::multiset<_Key, _Compare, _Allocator>, 00044 public __gnu_debug::_Safe_sequence<multiset<_Key, _Compare, _Allocator> > 00045 { 00046 typedef _GLIBCXX_STD::multiset<_Key, _Compare, _Allocator> _Base; 00047 typedef __gnu_debug::_Safe_sequence<multiset> _Safe_base; 00048 00049 public: 00050 // types: 00051 typedef _Key key_type; 00052 typedef _Key value_type; 00053 typedef _Compare key_compare; 00054 typedef _Compare value_compare; 00055 typedef _Allocator allocator_type; 00056 typedef typename _Allocator::reference reference; 00057 typedef typename _Allocator::const_reference const_reference; 00058 00059 typedef __gnu_debug::_Safe_iterator<typename _Base::iterator, multiset> 00060 iterator; 00061 typedef __gnu_debug::_Safe_iterator<typename _Base::const_iterator, 00062 multiset> const_iterator; 00063 00064 typedef typename _Base::size_type size_type; 00065 typedef typename _Base::difference_type difference_type; 00066 typedef typename _Allocator::pointer pointer; 00067 typedef typename _Allocator::const_pointer const_pointer; 00068 typedef std::reverse_iterator<iterator> reverse_iterator; 00069 typedef std::reverse_iterator<const_iterator> const_reverse_iterator; 00070 00071 // 23.3.3.1 construct/copy/destroy: 00072 explicit multiset(const _Compare& __comp = _Compare(), 00073 const _Allocator& __a = _Allocator()) 00074 : _Base(__comp, __a) { } 00075 00076 template<typename _InputIterator> 00077 multiset(_InputIterator __first, _InputIterator __last, 00078 const _Compare& __comp = _Compare(), 00079 const _Allocator& __a = _Allocator()) 00080 : _Base(__gnu_debug::__check_valid_range(__first, __last), __last, 00081 __comp, __a) { } 00082 00083 multiset(const multiset<_Key,_Compare,_Allocator>& __x) 00084 : _Base(__x), _Safe_base() { } 00085 00086 multiset(const _Base& __x) : _Base(__x), _Safe_base() { } 00087 00088 ~multiset() { } 00089 00090 multiset<_Key,_Compare,_Allocator>& 00091 operator=(const multiset<_Key,_Compare,_Allocator>& __x) 00092 { 00093 *static_cast<_Base*>(this) = __x; 00094 this->_M_invalidate_all(); 00095 return *this; 00096 } 00097 00098 using _Base::get_allocator; 00099 00100 // iterators: 00101 iterator 00102 begin() 00103 { return iterator(_Base::begin(), this); } 00104 00105 const_iterator 00106 begin() const 00107 { return const_iterator(_Base::begin(), this); } 00108 00109 iterator 00110 end() 00111 { return iterator(_Base::end(), this); } 00112 00113 const_iterator 00114 end() const 00115 { return const_iterator(_Base::end(), this); } 00116 00117 reverse_iterator 00118 rbegin() 00119 { return reverse_iterator(end()); } 00120 00121 const_reverse_iterator 00122 rbegin() const 00123 { return const_reverse_iterator(end()); } 00124 00125 reverse_iterator 00126 rend() 00127 { return reverse_iterator(begin()); } 00128 00129 const_reverse_iterator 00130 rend() const 00131 { return const_reverse_iterator(begin()); } 00132 00133 // capacity: 00134 using _Base::empty; 00135 using _Base::size; 00136 using _Base::max_size; 00137 00138 // modifiers: 00139 iterator 00140 insert(const value_type& __x) 00141 { return iterator(_Base::insert(__x), this); } 00142 00143 iterator 00144 insert(iterator __position, const value_type& __x) 00145 { 00146 __glibcxx_check_insert(__position); 00147 return iterator(_Base::insert(__position.base(), __x), this); 00148 } 00149 00150 template<typename _InputIterator> 00151 void 00152 insert(_InputIterator __first, _InputIterator __last) 00153 { 00154 __glibcxx_check_valid_range(__first, __last); 00155 _Base::insert(__first, __last); 00156 } 00157 00158 void 00159 erase(iterator __position) 00160 { 00161 __glibcxx_check_erase(__position); 00162 __position._M_invalidate(); 00163 _Base::erase(__position.base()); 00164 } 00165 00166 size_type 00167 erase(const key_type& __x) 00168 { 00169 std::pair<iterator, iterator> __victims = this->equal_range(__x); 00170 size_type __count = 0; 00171 while (__victims.first != __victims.second) 00172 { 00173 iterator __victim = __victims.first++; 00174 __victim._M_invalidate(); 00175 _Base::erase(__victim.base()); 00176 ++__count; 00177 } 00178 return __count; 00179 } 00180 00181 void 00182 erase(iterator __first, iterator __last) 00183 { 00184 // _GLIBCXX_RESOLVE_LIB_DEFECTS 00185 // 151. can't currently clear() empty container 00186 __glibcxx_check_erase_range(__first, __last); 00187 while (__first != __last) 00188 this->erase(__first++); 00189 } 00190 00191 void 00192 swap(multiset<_Key,_Compare,_Allocator>& __x) 00193 { 00194 _Base::swap(__x); 00195 this->_M_swap(__x); 00196 } 00197 00198 void 00199 clear() 00200 { this->erase(begin(), end()); } 00201 00202 // observers: 00203 using _Base::key_comp; 00204 using _Base::value_comp; 00205 00206 // multiset operations: 00207 iterator 00208 find(const key_type& __x) 00209 { return iterator(_Base::find(__x), this); } 00210 00211 // _GLIBCXX_RESOLVE_LIB_DEFECTS 00212 // 214. set::find() missing const overload 00213 const_iterator 00214 find(const key_type& __x) const 00215 { return const_iterator(_Base::find(__x), this); } 00216 00217 using _Base::count; 00218 00219 iterator 00220 lower_bound(const key_type& __x) 00221 { return iterator(_Base::lower_bound(__x), this); } 00222 00223 // _GLIBCXX_RESOLVE_LIB_DEFECTS 00224 // 214. set::find() missing const overload 00225 const_iterator 00226 lower_bound(const key_type& __x) const 00227 { return const_iterator(_Base::lower_bound(__x), this); } 00228 00229 iterator 00230 upper_bound(const key_type& __x) 00231 { return iterator(_Base::upper_bound(__x), this); } 00232 00233 // _GLIBCXX_RESOLVE_LIB_DEFECTS 00234 // 214. set::find() missing const overload 00235 const_iterator 00236 upper_bound(const key_type& __x) const 00237 { return const_iterator(_Base::upper_bound(__x), this); } 00238 00239 std::pair<iterator,iterator> 00240 equal_range(const key_type& __x) 00241 { 00242 typedef typename _Base::iterator _Base_iterator; 00243 std::pair<_Base_iterator, _Base_iterator> __res = 00244 _Base::equal_range(__x); 00245 return std::make_pair(iterator(__res.first, this), 00246 iterator(__res.second, this)); 00247 } 00248 00249 // _GLIBCXX_RESOLVE_LIB_DEFECTS 00250 // 214. set::find() missing const overload 00251 std::pair<const_iterator,const_iterator> 00252 equal_range(const key_type& __x) const 00253 { 00254 typedef typename _Base::const_iterator _Base_iterator; 00255 std::pair<_Base_iterator, _Base_iterator> __res = 00256 _Base::equal_range(__x); 00257 return std::make_pair(const_iterator(__res.first, this), 00258 const_iterator(__res.second, this)); 00259 } 00260 00261 _Base& 00262 _M_base() { return *this; } 00263 00264 const _Base& 00265 _M_base() const { return *this; } 00266 00267 private: 00268 void 00269 _M_invalidate_all() 00270 { 00271 typedef typename _Base::const_iterator _Base_const_iterator; 00272 typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal; 00273 this->_M_invalidate_if(_Not_equal(_M_base().end())); 00274 } 00275 }; 00276 00277 template<typename _Key, typename _Compare, typename _Allocator> 00278 inline bool 00279 operator==(const multiset<_Key,_Compare,_Allocator>& __lhs, 00280 const multiset<_Key,_Compare,_Allocator>& __rhs) 00281 { return __lhs._M_base() == __rhs._M_base(); } 00282 00283 template<typename _Key, typename _Compare, typename _Allocator> 00284 inline bool 00285 operator!=(const multiset<_Key,_Compare,_Allocator>& __lhs, 00286 const multiset<_Key,_Compare,_Allocator>& __rhs) 00287 { return __lhs._M_base() != __rhs._M_base(); } 00288 00289 template<typename _Key, typename _Compare, typename _Allocator> 00290 inline bool 00291 operator<(const multiset<_Key,_Compare,_Allocator>& __lhs, 00292 const multiset<_Key,_Compare,_Allocator>& __rhs) 00293 { return __lhs._M_base() < __rhs._M_base(); } 00294 00295 template<typename _Key, typename _Compare, typename _Allocator> 00296 inline bool 00297 operator<=(const multiset<_Key,_Compare,_Allocator>& __lhs, 00298 const multiset<_Key,_Compare,_Allocator>& __rhs) 00299 { return __lhs._M_base() <= __rhs._M_base(); } 00300 00301 template<typename _Key, typename _Compare, typename _Allocator> 00302 inline bool 00303 operator>=(const multiset<_Key,_Compare,_Allocator>& __lhs, 00304 const multiset<_Key,_Compare,_Allocator>& __rhs) 00305 { return __lhs._M_base() >= __rhs._M_base(); } 00306 00307 template<typename _Key, typename _Compare, typename _Allocator> 00308 inline bool 00309 operator>(const multiset<_Key,_Compare,_Allocator>& __lhs, 00310 const multiset<_Key,_Compare,_Allocator>& __rhs) 00311 { return __lhs._M_base() > __rhs._M_base(); } 00312 00313 template<typename _Key, typename _Compare, typename _Allocator> 00314 void 00315 swap(multiset<_Key,_Compare,_Allocator>& __x, 00316 multiset<_Key,_Compare,_Allocator>& __y) 00317 { return __x.swap(__y); } 00318 } // namespace __gnu_debug_def 00319 00320 #endif

Generated on Sun Jul 25 00:12:33 2004 for libstdc++ source by doxygen 1.3.7