1 // Profiling multimap implementation -*- C++ -*-
3 // Copyright (C) 2009, 2010, 2011 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/multimap.h
26 * This file is a GNU profile extension to the Standard C++ Library.
29 #ifndef _GLIBCXX_PROFILE_MULTIMAP_H
30 #define _GLIBCXX_PROFILE_MULTIMAP_H 1
34 namespace std _GLIBCXX_VISIBILITY(default)
38 /// Class std::multimap wrapper with performance instrumentation.
39 template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>,
40 typename _Allocator = std::allocator<std::pair<const _Key, _Tp> > >
42 : public _GLIBCXX_STD_C::multimap<_Key, _Tp, _Compare, _Allocator>
44 typedef _GLIBCXX_STD_C::multimap<_Key, _Tp, _Compare, _Allocator> _Base;
48 typedef _Key key_type;
49 typedef _Tp mapped_type;
50 typedef std::pair<const _Key, _Tp> value_type;
51 typedef _Compare key_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.1.1 construct/copy/destroy:
67 explicit multimap(const _Compare& __comp = _Compare(),
68 const _Allocator& __a = _Allocator())
69 : _Base(__comp, __a) { }
71 template<typename _InputIterator>
72 multimap(_InputIterator __first, _InputIterator __last,
73 const _Compare& __comp = _Compare(),
74 const _Allocator& __a = _Allocator())
75 : _Base(__first, __last, __comp, __a) { }
77 multimap(const multimap& __x)
80 multimap(const _Base& __x)
83 #ifdef __GXX_EXPERIMENTAL_CXX0X__
84 multimap(multimap&& __x)
85 : _Base(std::move(__x))
88 multimap(initializer_list<value_type> __l,
89 const _Compare& __c = _Compare(),
90 const allocator_type& __a = allocator_type())
91 : _Base(__l, __c, __a) { }
97 operator=(const multimap& __x)
99 *static_cast<_Base*>(this) = __x;
103 #ifdef __GXX_EXPERIMENTAL_CXX0X__
105 operator=(multimap&& __x)
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;
183 insert(const value_type& __x)
184 { return iterator(_Base::insert(__x)); }
186 #ifdef __GXX_EXPERIMENTAL_CXX0X__
187 template<typename _Pair, typename = typename
188 std::enable_if<std::is_convertible<_Pair,
189 value_type>::value>::type>
192 { return iterator(_Base::insert(std::forward<_Pair>(__x))); }
195 #ifdef __GXX_EXPERIMENTAL_CXX0X__
197 insert(std::initializer_list<value_type> __list)
198 { _Base::insert(__list); }
202 #ifdef __GXX_EXPERIMENTAL_CXX0X__
203 insert(const_iterator __position, const value_type& __x)
205 insert(iterator __position, const value_type& __x)
207 { return iterator(_Base::insert(__position, __x)); }
209 #ifdef __GXX_EXPERIMENTAL_CXX0X__
210 template<typename _Pair, typename = typename
211 std::enable_if<std::is_convertible<_Pair,
212 value_type>::value>::type>
214 insert(const_iterator __position, _Pair&& __x)
215 { return iterator(_Base::insert(__position,
216 std::forward<_Pair>(__x))); }
219 template<typename _InputIterator>
221 insert(_InputIterator __first, _InputIterator __last)
222 { _Base::insert(__first, __last); }
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 std::pair<iterator, iterator> __victims = this->equal_range(__x);
238 size_type __count = 0;
239 while (__victims.first != __victims.second)
241 iterator __victim = __victims.first++;
242 _Base::erase(__victim);
248 #ifdef __GXX_EXPERIMENTAL_CXX0X__
250 erase(const_iterator __first, const_iterator __last)
251 { return iterator(_Base::erase(__first, __last)); }
254 erase(iterator __first, iterator __last)
255 { _Base::erase(__first, __last); }
260 { _Base::swap(__x); }
264 { this->erase(begin(), end()); }
267 using _Base::key_comp;
268 using _Base::value_comp;
270 // 23.3.1.3 multimap operations:
272 find(const key_type& __x)
273 { return iterator(_Base::find(__x)); }
276 find(const key_type& __x) const
277 { return const_iterator(_Base::find(__x)); }
282 lower_bound(const key_type& __x)
283 { return iterator(_Base::lower_bound(__x)); }
286 lower_bound(const key_type& __x) const
287 { return const_iterator(_Base::lower_bound(__x)); }
290 upper_bound(const key_type& __x)
291 { return iterator(_Base::upper_bound(__x)); }
294 upper_bound(const key_type& __x) const
295 { return const_iterator(_Base::upper_bound(__x)); }
297 std::pair<iterator,iterator>
298 equal_range(const key_type& __x)
300 typedef typename _Base::iterator _Base_iterator;
301 std::pair<_Base_iterator, _Base_iterator> __res =
302 _Base::equal_range(__x);
303 return std::make_pair(iterator(__res.first),
304 iterator(__res.second));
307 std::pair<const_iterator,const_iterator>
308 equal_range(const key_type& __x) const
310 typedef typename _Base::const_iterator _Base_const_iterator;
311 std::pair<_Base_const_iterator, _Base_const_iterator> __res =
312 _Base::equal_range(__x);
313 return std::make_pair(const_iterator(__res.first),
314 const_iterator(__res.second));
318 _M_base() { return *this; }
321 _M_base() const { return *this; }
324 template<typename _Key, typename _Tp,
325 typename _Compare, typename _Allocator>
327 operator==(const multimap<_Key, _Tp, _Compare, _Allocator>& __lhs,
328 const multimap<_Key, _Tp, _Compare, _Allocator>& __rhs)
329 { return __lhs._M_base() == __rhs._M_base(); }
331 template<typename _Key, typename _Tp,
332 typename _Compare, typename _Allocator>
334 operator!=(const multimap<_Key, _Tp, _Compare, _Allocator>& __lhs,
335 const multimap<_Key, _Tp, _Compare, _Allocator>& __rhs)
336 { return __lhs._M_base() != __rhs._M_base(); }
338 template<typename _Key, typename _Tp,
339 typename _Compare, typename _Allocator>
341 operator<(const multimap<_Key, _Tp, _Compare, _Allocator>& __lhs,
342 const multimap<_Key, _Tp, _Compare, _Allocator>& __rhs)
343 { return __lhs._M_base() < __rhs._M_base(); }
345 template<typename _Key, typename _Tp,
346 typename _Compare, typename _Allocator>
348 operator<=(const multimap<_Key, _Tp, _Compare, _Allocator>& __lhs,
349 const multimap<_Key, _Tp, _Compare, _Allocator>& __rhs)
350 { return __lhs._M_base() <= __rhs._M_base(); }
352 template<typename _Key, typename _Tp,
353 typename _Compare, typename _Allocator>
355 operator>=(const multimap<_Key, _Tp, _Compare, _Allocator>& __lhs,
356 const multimap<_Key, _Tp, _Compare, _Allocator>& __rhs)
357 { return __lhs._M_base() >= __rhs._M_base(); }
359 template<typename _Key, typename _Tp,
360 typename _Compare, typename _Allocator>
362 operator>(const multimap<_Key, _Tp, _Compare, _Allocator>& __lhs,
363 const multimap<_Key, _Tp, _Compare, _Allocator>& __rhs)
364 { return __lhs._M_base() > __rhs._M_base(); }
366 template<typename _Key, typename _Tp,
367 typename _Compare, typename _Allocator>
369 swap(multimap<_Key, _Tp, _Compare, _Allocator>& __lhs,
370 multimap<_Key, _Tp, _Compare, _Allocator>& __rhs)
371 { __lhs.swap(__rhs); }
373 } // namespace __profile