libstdc++
|
00001 // Profiling multiset implementation -*- C++ -*- 00002 00003 // Copyright (C) 2009, 2010 Free Software Foundation, Inc. 00004 // 00005 // This file is part of the GNU ISO C++ Library. This library is free 00006 // software; you can redistribute it and/or modify it under the 00007 // terms of the GNU General Public License as published by the 00008 // Free Software Foundation; either version 3, or (at your option) 00009 // any later version. 00010 00011 // This library is distributed in the hope that it will be useful, 00012 // but WITHOUT ANY WARRANTY; without even the implied warranty of 00013 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00014 // GNU General Public License for more details. 00015 00016 // Under Section 7 of GPL version 3, you are granted additional 00017 // permissions described in the GCC Runtime Library Exception, version 00018 // 3.1, as published by the Free Software Foundation. 00019 00020 // You should have received a copy of the GNU General Public License and 00021 // a copy of the GCC Runtime Library Exception along with this program; 00022 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see 00023 // <http://www.gnu.org/licenses/>. 00024 00025 /** @file profile/multiset.h 00026 * This file is a GNU profile extension to the Standard C++ Library. 00027 */ 00028 00029 #ifndef _GLIBCXX_PROFILE_MULTISET_H 00030 #define _GLIBCXX_PROFILE_MULTISET_H 1 00031 00032 #include <utility> 00033 00034 namespace std _GLIBCXX_VISIBILITY(default) 00035 { 00036 namespace __profile 00037 { 00038 /// Class std::multiset wrapper with performance instrumentation. 00039 template<typename _Key, typename _Compare = std::less<_Key>, 00040 typename _Allocator = std::allocator<_Key> > 00041 class multiset 00042 : public _GLIBCXX_STD_C::multiset<_Key, _Compare, _Allocator> 00043 { 00044 typedef _GLIBCXX_STD_C::multiset<_Key, _Compare, _Allocator> _Base; 00045 00046 public: 00047 // types: 00048 typedef _Key key_type; 00049 typedef _Key value_type; 00050 typedef _Compare key_compare; 00051 typedef _Compare value_compare; 00052 typedef _Allocator allocator_type; 00053 typedef typename _Base::reference reference; 00054 typedef typename _Base::const_reference const_reference; 00055 00056 typedef typename _Base::iterator iterator; 00057 typedef typename _Base::const_iterator const_iterator; 00058 typedef typename _Base::reverse_iterator reverse_iterator; 00059 typedef typename _Base::const_reverse_iterator const_reverse_iterator; 00060 00061 typedef typename _Base::size_type size_type; 00062 typedef typename _Base::difference_type difference_type; 00063 typedef typename _Base::pointer pointer; 00064 typedef typename _Base::const_pointer const_pointer; 00065 00066 // 23.3.3.1 construct/copy/destroy: 00067 explicit multiset(const _Compare& __comp = _Compare(), 00068 const _Allocator& __a = _Allocator()) 00069 : _Base(__comp, __a) { } 00070 00071 template<typename _InputIterator> 00072 multiset(_InputIterator __first, _InputIterator __last, 00073 const _Compare& __comp = _Compare(), 00074 const _Allocator& __a = _Allocator()) 00075 : _Base(__first, __last, __comp, __a) { } 00076 00077 multiset(const multiset& __x) 00078 : _Base(__x) { } 00079 00080 multiset(const _Base& __x) 00081 : _Base(__x) { } 00082 00083 #ifdef __GXX_EXPERIMENTAL_CXX0X__ 00084 multiset(multiset&& __x) 00085 : _Base(std::move(__x)) 00086 { } 00087 00088 multiset(initializer_list<value_type> __l, 00089 const _Compare& __comp = _Compare(), 00090 const allocator_type& __a = allocator_type()) 00091 : _Base(__l, __comp, __a) { } 00092 #endif 00093 00094 ~multiset() { } 00095 00096 multiset& 00097 operator=(const multiset& __x) 00098 { 00099 *static_cast<_Base*>(this) = __x; 00100 return *this; 00101 } 00102 00103 #ifdef __GXX_EXPERIMENTAL_CXX0X__ 00104 multiset& 00105 operator=(multiset&& __x) 00106 { 00107 // NB: DR 1204. 00108 // NB: DR 675. 00109 this->clear(); 00110 this->swap(__x); 00111 return *this; 00112 } 00113 00114 multiset& 00115 operator=(initializer_list<value_type> __l) 00116 { 00117 this->clear(); 00118 this->insert(__l); 00119 return *this; 00120 } 00121 #endif 00122 00123 using _Base::get_allocator; 00124 00125 // iterators: 00126 iterator 00127 begin() 00128 { return iterator(_Base::begin()); } 00129 00130 const_iterator 00131 begin() const 00132 { return const_iterator(_Base::begin()); } 00133 00134 iterator 00135 end() 00136 { return iterator(_Base::end()); } 00137 00138 const_iterator 00139 end() const 00140 { return const_iterator(_Base::end()); } 00141 00142 reverse_iterator 00143 rbegin() 00144 { return reverse_iterator(end()); } 00145 00146 const_reverse_iterator 00147 rbegin() const 00148 { return const_reverse_iterator(end()); } 00149 00150 reverse_iterator 00151 rend() 00152 { return reverse_iterator(begin()); } 00153 00154 const_reverse_iterator 00155 rend() const 00156 { return const_reverse_iterator(begin()); } 00157 00158 #ifdef __GXX_EXPERIMENTAL_CXX0X__ 00159 const_iterator 00160 cbegin() const 00161 { return const_iterator(_Base::begin()); } 00162 00163 const_iterator 00164 cend() const 00165 { return const_iterator(_Base::end()); } 00166 00167 const_reverse_iterator 00168 crbegin() const 00169 { return const_reverse_iterator(end()); } 00170 00171 const_reverse_iterator 00172 crend() const 00173 { return const_reverse_iterator(begin()); } 00174 #endif 00175 00176 // capacity: 00177 using _Base::empty; 00178 using _Base::size; 00179 using _Base::max_size; 00180 00181 // modifiers: 00182 iterator 00183 insert(const value_type& __x) 00184 { return iterator(_Base::insert(__x)); } 00185 00186 #ifdef __GXX_EXPERIMENTAL_CXX0X__ 00187 iterator 00188 insert(value_type&& __x) 00189 { return iterator(_Base::insert(std::move(__x))); } 00190 #endif 00191 00192 iterator 00193 insert(const_iterator __position, const value_type& __x) 00194 { return iterator(_Base::insert(__position, __x)); } 00195 00196 #ifdef __GXX_EXPERIMENTAL_CXX0X__ 00197 iterator 00198 insert(const_iterator __position, value_type&& __x) 00199 { return iterator(_Base::insert(__position, std::move(__x))); } 00200 #endif 00201 00202 template<typename _InputIterator> 00203 void 00204 insert(_InputIterator __first, _InputIterator __last) 00205 { _Base::insert(__first, __last); } 00206 00207 #ifdef __GXX_EXPERIMENTAL_CXX0X__ 00208 void 00209 insert(initializer_list<value_type> __l) 00210 { _Base::insert(__l); } 00211 #endif 00212 00213 #ifdef __GXX_EXPERIMENTAL_CXX0X__ 00214 iterator 00215 erase(const_iterator __position) 00216 { return iterator(_Base::erase(__position)); } 00217 #else 00218 void 00219 erase(iterator __position) 00220 { _Base::erase(__position); } 00221 #endif 00222 00223 size_type 00224 erase(const key_type& __x) 00225 { 00226 std::pair<iterator, iterator> __victims = this->equal_range(__x); 00227 size_type __count = 0; 00228 while (__victims.first != __victims.second) 00229 { 00230 iterator __victim = __victims.first++; 00231 _Base::erase(__victim); 00232 ++__count; 00233 } 00234 return __count; 00235 } 00236 00237 #ifdef __GXX_EXPERIMENTAL_CXX0X__ 00238 iterator 00239 erase(const_iterator __first, const_iterator __last) 00240 { return iterator(_Base::erase(__first, __last)); } 00241 #else 00242 void 00243 erase(iterator __first, iterator __last) 00244 { _Base::erase(__first, __last); } 00245 #endif 00246 00247 void 00248 swap(multiset& __x) 00249 { _Base::swap(__x); } 00250 00251 void 00252 clear() 00253 { this->erase(begin(), end()); } 00254 00255 // observers: 00256 using _Base::key_comp; 00257 using _Base::value_comp; 00258 00259 // multiset operations: 00260 iterator 00261 find(const key_type& __x) 00262 { return iterator(_Base::find(__x)); } 00263 00264 // _GLIBCXX_RESOLVE_LIB_DEFECTS 00265 // 214. set::find() missing const overload 00266 const_iterator 00267 find(const key_type& __x) const 00268 { return const_iterator(_Base::find(__x)); } 00269 00270 using _Base::count; 00271 00272 iterator 00273 lower_bound(const key_type& __x) 00274 { return iterator(_Base::lower_bound(__x)); } 00275 00276 // _GLIBCXX_RESOLVE_LIB_DEFECTS 00277 // 214. set::find() missing const overload 00278 const_iterator 00279 lower_bound(const key_type& __x) const 00280 { return const_iterator(_Base::lower_bound(__x)); } 00281 00282 iterator 00283 upper_bound(const key_type& __x) 00284 { return iterator(_Base::upper_bound(__x)); } 00285 00286 // _GLIBCXX_RESOLVE_LIB_DEFECTS 00287 // 214. set::find() missing const overload 00288 const_iterator 00289 upper_bound(const key_type& __x) const 00290 { return const_iterator(_Base::upper_bound(__x)); } 00291 00292 std::pair<iterator,iterator> 00293 equal_range(const key_type& __x) 00294 { 00295 typedef typename _Base::iterator _Base_iterator; 00296 std::pair<_Base_iterator, _Base_iterator> __res = 00297 _Base::equal_range(__x); 00298 return std::make_pair(iterator(__res.first), 00299 iterator(__res.second)); 00300 } 00301 00302 // _GLIBCXX_RESOLVE_LIB_DEFECTS 00303 // 214. set::find() missing const overload 00304 std::pair<const_iterator,const_iterator> 00305 equal_range(const key_type& __x) const 00306 { 00307 typedef typename _Base::const_iterator _Base_iterator; 00308 std::pair<_Base_iterator, _Base_iterator> __res = 00309 _Base::equal_range(__x); 00310 return std::make_pair(const_iterator(__res.first), 00311 const_iterator(__res.second)); 00312 } 00313 00314 _Base& 00315 _M_base() { return *this; } 00316 00317 const _Base& 00318 _M_base() const { return *this; } 00319 00320 }; 00321 00322 template<typename _Key, typename _Compare, typename _Allocator> 00323 inline bool 00324 operator==(const multiset<_Key, _Compare, _Allocator>& __lhs, 00325 const multiset<_Key, _Compare, _Allocator>& __rhs) 00326 { return __lhs._M_base() == __rhs._M_base(); } 00327 00328 template<typename _Key, typename _Compare, typename _Allocator> 00329 inline bool 00330 operator!=(const multiset<_Key, _Compare, _Allocator>& __lhs, 00331 const multiset<_Key, _Compare, _Allocator>& __rhs) 00332 { return __lhs._M_base() != __rhs._M_base(); } 00333 00334 template<typename _Key, typename _Compare, typename _Allocator> 00335 inline bool 00336 operator<(const multiset<_Key, _Compare, _Allocator>& __lhs, 00337 const multiset<_Key, _Compare, _Allocator>& __rhs) 00338 { return __lhs._M_base() < __rhs._M_base(); } 00339 00340 template<typename _Key, typename _Compare, typename _Allocator> 00341 inline bool 00342 operator<=(const multiset<_Key, _Compare, _Allocator>& __lhs, 00343 const multiset<_Key, _Compare, _Allocator>& __rhs) 00344 { return __lhs._M_base() <= __rhs._M_base(); } 00345 00346 template<typename _Key, typename _Compare, typename _Allocator> 00347 inline bool 00348 operator>=(const multiset<_Key, _Compare, _Allocator>& __lhs, 00349 const multiset<_Key, _Compare, _Allocator>& __rhs) 00350 { return __lhs._M_base() >= __rhs._M_base(); } 00351 00352 template<typename _Key, typename _Compare, typename _Allocator> 00353 inline bool 00354 operator>(const multiset<_Key, _Compare, _Allocator>& __lhs, 00355 const multiset<_Key, _Compare, _Allocator>& __rhs) 00356 { return __lhs._M_base() > __rhs._M_base(); } 00357 00358 template<typename _Key, typename _Compare, typename _Allocator> 00359 void 00360 swap(multiset<_Key, _Compare, _Allocator>& __x, 00361 multiset<_Key, _Compare, _Allocator>& __y) 00362 { return __x.swap(__y); } 00363 00364 } // namespace __profile 00365 } // namespace std 00366 00367 #endif