1 // Profiling set implementation -*- C++ -*-
3 // Copyright (C) 2009, 2010 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 3, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // Under Section 7 of GPL version 3, you are granted additional
17 // permissions described in the GCC Runtime Library Exception, version
18 // 3.1, as published by the Free Software Foundation.
20 // You should have received a copy of the GNU General Public License and
21 // a copy of the GCC Runtime Library Exception along with this program;
22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23 // <http://www.gnu.org/licenses/>.
25 /** @file profile/set.h
26 * This file is a GNU profile extension to the Standard C++ Library.
29 #ifndef _GLIBCXX_PROFILE_SET_H
30 #define _GLIBCXX_PROFILE_SET_H 1
34 namespace std _GLIBCXX_VISIBILITY(default)
38 /// Class std::set wrapper with performance instrumentation.
39 template<typename _Key, typename _Compare = std::less<_Key>,
40 typename _Allocator = std::allocator<_Key> >
42 : public _GLIBCXX_STD_C::set<_Key,_Compare,_Allocator>
44 typedef _GLIBCXX_STD_C::set<_Key, _Compare, _Allocator> _Base;
48 typedef _Key key_type;
49 typedef _Key value_type;
50 typedef _Compare key_compare;
51 typedef _Compare value_compare;
52 typedef _Allocator allocator_type;
53 typedef typename _Base::reference reference;
54 typedef typename _Base::const_reference const_reference;
56 typedef typename _Base::iterator iterator;
57 typedef typename _Base::const_iterator const_iterator;
58 typedef typename _Base::reverse_iterator reverse_iterator;
59 typedef typename _Base::const_reverse_iterator const_reverse_iterator;
61 typedef typename _Base::size_type size_type;
62 typedef typename _Base::difference_type difference_type;
63 typedef typename _Base::pointer pointer;
64 typedef typename _Base::const_pointer const_pointer;
66 // 23.3.3.1 construct/copy/destroy:
67 explicit set(const _Compare& __comp = _Compare(),
68 const _Allocator& __a = _Allocator())
69 : _Base(__comp, __a) { }
71 template<typename _InputIterator>
72 set(_InputIterator __first, _InputIterator __last,
73 const _Compare& __comp = _Compare(),
74 const _Allocator& __a = _Allocator())
75 : _Base(__first, __last, __comp, __a) { }
83 #ifdef __GXX_EXPERIMENTAL_CXX0X__
85 : _Base(std::move(__x))
88 set(initializer_list<value_type> __l,
89 const _Compare& __comp = _Compare(),
90 const allocator_type& __a = allocator_type())
91 : _Base(__l, __comp, __a) { }
97 operator=(const set& __x)
99 *static_cast<_Base*>(this) = __x;
103 #ifdef __GXX_EXPERIMENTAL_CXX0X__
115 operator=(initializer_list<value_type> __l)
123 using _Base::get_allocator;
128 { return iterator(_Base::begin()); }
132 { return const_iterator(_Base::begin()); }
136 { return iterator(_Base::end()); }
140 { return const_iterator(_Base::end()); }
144 { return reverse_iterator(end()); }
146 const_reverse_iterator
148 { return const_reverse_iterator(end()); }
152 { return reverse_iterator(begin()); }
154 const_reverse_iterator
156 { return const_reverse_iterator(begin()); }
158 #ifdef __GXX_EXPERIMENTAL_CXX0X__
161 { return const_iterator(_Base::begin()); }
165 { return const_iterator(_Base::end()); }
167 const_reverse_iterator
169 { return const_reverse_iterator(end()); }
171 const_reverse_iterator
173 { return const_reverse_iterator(begin()); }
179 using _Base::max_size;
182 std::pair<iterator, bool>
183 insert(const value_type& __x)
185 typedef typename _Base::iterator _Base_iterator;
186 std::pair<_Base_iterator, bool> __res = _Base::insert(__x);
187 return std::pair<iterator, bool>(iterator(__res.first),
191 #ifdef __GXX_EXPERIMENTAL_CXX0X__
192 std::pair<iterator, bool>
193 insert(value_type&& __x)
195 typedef typename _Base::iterator _Base_iterator;
196 std::pair<_Base_iterator, bool> __res
197 = _Base::insert(std::move(__x));
198 return std::pair<iterator, bool>(iterator(__res.first),
204 insert(const_iterator __position, const value_type& __x)
205 { return iterator(_Base::insert(__position, __x)); }
207 #ifdef __GXX_EXPERIMENTAL_CXX0X__
209 insert(const_iterator __position, value_type&& __x)
210 { return iterator(_Base::insert(__position, std::move(__x))); }
213 template <typename _InputIterator>
215 insert(_InputIterator __first, _InputIterator __last)
216 { _Base::insert(__first, __last); }
218 #ifdef __GXX_EXPERIMENTAL_CXX0X__
220 insert(initializer_list<value_type> __l)
221 { _Base::insert(__l); }
224 #ifdef __GXX_EXPERIMENTAL_CXX0X__
226 erase(const_iterator __position)
227 { return iterator(_Base::erase(__position)); }
230 erase(iterator __position)
231 { _Base::erase(__position); }
235 erase(const key_type& __x)
237 iterator __victim = find(__x);
238 if (__victim == end())
242 _Base::erase(__victim);
247 #ifdef __GXX_EXPERIMENTAL_CXX0X__
249 erase(const_iterator __first, const_iterator __last)
250 { return iterator(_Base::erase(__first, __last)); }
253 erase(iterator __first, iterator __last)
254 { _Base::erase(__first, __last); }
259 { _Base::swap(__x); }
263 { this->erase(begin(), end()); }
266 using _Base::key_comp;
267 using _Base::value_comp;
271 find(const key_type& __x)
272 { return iterator(_Base::find(__x)); }
274 // _GLIBCXX_RESOLVE_LIB_DEFECTS
275 // 214. set::find() missing const overload
277 find(const key_type& __x) const
278 { return const_iterator(_Base::find(__x)); }
283 lower_bound(const key_type& __x)
284 { return iterator(_Base::lower_bound(__x)); }
286 // _GLIBCXX_RESOLVE_LIB_DEFECTS
287 // 214. set::find() missing const overload
289 lower_bound(const key_type& __x) const
290 { return const_iterator(_Base::lower_bound(__x)); }
293 upper_bound(const key_type& __x)
294 { return iterator(_Base::upper_bound(__x)); }
296 // _GLIBCXX_RESOLVE_LIB_DEFECTS
297 // 214. set::find() missing const overload
299 upper_bound(const key_type& __x) const
300 { return const_iterator(_Base::upper_bound(__x)); }
302 std::pair<iterator,iterator>
303 equal_range(const key_type& __x)
305 typedef typename _Base::iterator _Base_iterator;
306 std::pair<_Base_iterator, _Base_iterator> __res =
307 _Base::equal_range(__x);
308 return std::make_pair(iterator(__res.first),
309 iterator(__res.second));
312 // _GLIBCXX_RESOLVE_LIB_DEFECTS
313 // 214. set::find() missing const overload
314 std::pair<const_iterator,const_iterator>
315 equal_range(const key_type& __x) const
317 typedef typename _Base::const_iterator _Base_iterator;
318 std::pair<_Base_iterator, _Base_iterator> __res =
319 _Base::equal_range(__x);
320 return std::make_pair(const_iterator(__res.first),
321 const_iterator(__res.second));
325 _M_base() { return *this; }
328 _M_base() const { return *this; }
332 template<typename _Key, typename _Compare, typename _Allocator>
334 operator==(const set<_Key, _Compare, _Allocator>& __lhs,
335 const set<_Key, _Compare, _Allocator>& __rhs)
336 { return __lhs._M_base() == __rhs._M_base(); }
338 template<typename _Key, typename _Compare, typename _Allocator>
340 operator!=(const set<_Key, _Compare, _Allocator>& __lhs,
341 const set<_Key, _Compare, _Allocator>& __rhs)
342 { return __lhs._M_base() != __rhs._M_base(); }
344 template<typename _Key, typename _Compare, typename _Allocator>
346 operator<(const set<_Key, _Compare, _Allocator>& __lhs,
347 const set<_Key, _Compare, _Allocator>& __rhs)
348 { return __lhs._M_base() < __rhs._M_base(); }
350 template<typename _Key, typename _Compare, typename _Allocator>
352 operator<=(const set<_Key, _Compare, _Allocator>& __lhs,
353 const set<_Key, _Compare, _Allocator>& __rhs)
354 { return __lhs._M_base() <= __rhs._M_base(); }
356 template<typename _Key, typename _Compare, typename _Allocator>
358 operator>=(const set<_Key, _Compare, _Allocator>& __lhs,
359 const set<_Key, _Compare, _Allocator>& __rhs)
360 { return __lhs._M_base() >= __rhs._M_base(); }
362 template<typename _Key, typename _Compare, typename _Allocator>
364 operator>(const set<_Key, _Compare, _Allocator>& __lhs,
365 const set<_Key, _Compare, _Allocator>& __rhs)
366 { return __lhs._M_base() > __rhs._M_base(); }
368 template<typename _Key, typename _Compare, typename _Allocator>
370 swap(set<_Key, _Compare, _Allocator>& __x,
371 set<_Key, _Compare, _Allocator>& __y)
372 { return __x.swap(__y); }
374 } // namespace __profile