]> git.ipfire.org Git - thirdparty/gcc.git/blame - libstdc++-v3/include/profile/multiset.h
projects / thirdparty / gcc.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
Update copyright years.
[thirdparty/gcc.git] / libstdc++-v3 / include / profile / multiset.h
CommitLineData
c55dc904 1// Profiling multiset implementation -*- C++ -*-
2
f1717362 3// Copyright (C) 2009-2016 Free Software Foundation, Inc.
c55dc904 4//
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)
9// any later version.
10
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.
15
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.
19
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/>.
24
25/** @file profile/multiset.h
26 * This file is a GNU profile extension to the Standard C++ Library.
27 */
28
29#ifndef _GLIBCXX_PROFILE_MULTISET_H
30#define _GLIBCXX_PROFILE_MULTISET_H 1
31
5f70fed5 32#include <profile/base.h>
33#include <profile/ordered_base.h>
c55dc904 34
2948dd21 35namespace std _GLIBCXX_VISIBILITY(default)
c55dc904 36{
37namespace __profile
38{
8b7c9a53 39 /// Class std::multiset wrapper with performance instrumentation.
c55dc904 40 template<typename _Key, typename _Compare = std::less<_Key>,
41 typename _Allocator = std::allocator<_Key> >
42 class multiset
5f70fed5 43 : public _GLIBCXX_STD_C::multiset<_Key, _Compare, _Allocator>,
44 public _Ordered_profile<multiset<_Key, _Compare, _Allocator> >
c55dc904 45 {
2948dd21 46 typedef _GLIBCXX_STD_C::multiset<_Key, _Compare, _Allocator> _Base;
c55dc904 47
1675d1be 48 typedef typename _Base::iterator _Base_iterator;
49 typedef typename _Base::const_iterator _Base_const_iterator;
50
c55dc904 51 public:
52 // types:
5f70fed5 53 typedef _Key key_type;
54 typedef _Key value_type;
55 typedef _Compare key_compare;
56 typedef _Compare value_compare;
57 typedef _Allocator allocator_type;
58 typedef typename _Base::reference reference;
59 typedef typename _Base::const_reference const_reference;
60
1675d1be 61 typedef __iterator_tracker<_Base_iterator,
62 multiset> iterator;
63 typedef __iterator_tracker<_Base_const_iterator,
64 multiset> const_iterator;
65 typedef std::reverse_iterator<iterator> reverse_iterator;
66 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
5f70fed5 67
68 typedef typename _Base::size_type size_type;
69 typedef typename _Base::difference_type difference_type;
c55dc904 70
71 // 23.3.3.1 construct/copy/destroy:
36f540c7 72
5f70fed5 73#if __cplusplus < 201103L
36f540c7 74 multiset()
75 : _Base() { }
5f70fed5 76 multiset(const multiset& __x)
77 : _Base(__x) { }
78 ~multiset() { }
79#else
80 multiset() = default;
81 multiset(const multiset&) = default;
82 multiset(multiset&&) = default;
83 ~multiset() = default;
84#endif
36f540c7 85
86 explicit multiset(const _Compare& __comp,
c55dc904 87 const _Allocator& __a = _Allocator())
88 : _Base(__comp, __a) { }
89
0c8766b1 90#if __cplusplus >= 201103L
3edec8c4 91 template<typename _InputIterator,
92 typename = std::_RequireInputIter<_InputIterator>>
93#else
c55dc904 94 template<typename _InputIterator>
3edec8c4 95#endif
5f70fed5 96 multiset(_InputIterator __first, _InputIterator __last,
c55dc904 97 const _Compare& __comp = _Compare(),
98 const _Allocator& __a = _Allocator())
99 : _Base(__first, __last, __comp, __a) { }
100
5f70fed5 101#if __cplusplus >= 201103L
c55dc904 102 multiset(initializer_list<value_type> __l,
103 const _Compare& __comp = _Compare(),
104 const allocator_type& __a = allocator_type())
105 : _Base(__l, __comp, __a) { }
aac14b59 106
107 explicit
108 multiset(const allocator_type& __a)
5f70fed5 109 : _Base(__a) { }
aac14b59 110
111 multiset(const multiset& __x, const allocator_type& __a)
112 : _Base(__x, __a) { }
113
114 multiset(multiset&& __x, const allocator_type& __a)
5f70fed5 115 noexcept( noexcept(_Base(std::move(__x), __a)) )
aac14b59 116 : _Base(std::move(__x), __a) { }
117
118 multiset(initializer_list<value_type> __l, const allocator_type& __a)
119 : _Base(__l, __a) { }
120
121 template<typename _InputIterator>
5f70fed5 122 multiset(_InputIterator __first, _InputIterator __last,
123 const allocator_type& __a)
124 : _Base(__first, __last, __a) { }
c55dc904 125#endif
126
aac14b59 127 multiset(const _Base& __x)
128 : _Base(__x) { }
129
aac14b59 130#if __cplusplus < 201103L
c55dc904 131 multiset&
132 operator=(const multiset& __x)
133 {
1675d1be 134 this->_M_profile_destruct();
aac14b59 135 _M_base() = __x;
1675d1be 136 this->_M_profile_construct();
c55dc904 137 return *this;
138 }
aac14b59 139#else
140 multiset&
141 operator=(const multiset&) = default;
c55dc904 142
c55dc904 143 multiset&
aac14b59 144 operator=(multiset&&) = default;
c55dc904 145
146 multiset&
147 operator=(initializer_list<value_type> __l)
148 {
1675d1be 149 this->_M_profile_destruct();
aac14b59 150 _M_base() = __l;
1675d1be 151 this->_M_profile_construct();
c55dc904 152 return *this;
153 }
154#endif
155
1675d1be 156 // iterators
157 iterator
158 begin() _GLIBCXX_NOEXCEPT
159 { return iterator(_Base::begin(), this); }
160
161 const_iterator
162 begin() const _GLIBCXX_NOEXCEPT
163 { return const_iterator(_Base::begin(), this); }
164
165 iterator
166 end() _GLIBCXX_NOEXCEPT
167 { return iterator(_Base::end(), this); }
168
169 const_iterator
170 end() const _GLIBCXX_NOEXCEPT
171 { return const_iterator(_Base::end(), this); }
172
173#if __cplusplus >= 201103L
174 const_iterator
175 cbegin() const noexcept
176 { return const_iterator(_Base::cbegin(), this); }
177
178 const_iterator
179 cend() const noexcept
180 { return const_iterator(_Base::cend(), this); }
181#endif
182
c55dc904 183 reverse_iterator
7cd718fd 184 rbegin() _GLIBCXX_NOEXCEPT
5f70fed5 185 {
1675d1be 186 __profcxx_map2umap_invalidate(this->_M_map2umap_info);
187 return reverse_iterator(end());
5f70fed5 188 }
c55dc904 189
190 const_reverse_iterator
7cd718fd 191 rbegin() const _GLIBCXX_NOEXCEPT
5f70fed5 192 {
1675d1be 193 __profcxx_map2umap_invalidate(this->_M_map2umap_info);
194 return const_reverse_iterator(end());
5f70fed5 195 }
c55dc904 196
197 reverse_iterator
7cd718fd 198 rend() _GLIBCXX_NOEXCEPT
5f70fed5 199 {
1675d1be 200 __profcxx_map2umap_invalidate(this->_M_map2umap_info);
201 return reverse_iterator(begin());
5f70fed5 202 }
c55dc904 203
204 const_reverse_iterator
7cd718fd 205 rend() const _GLIBCXX_NOEXCEPT
5f70fed5 206 {
1675d1be 207 __profcxx_map2umap_invalidate(this->_M_map2umap_info);
208 return const_reverse_iterator(begin());
5f70fed5 209 }
c55dc904 210
0c8766b1 211#if __cplusplus >= 201103L
c55dc904 212 const_reverse_iterator
7cd718fd 213 crbegin() const noexcept
5f70fed5 214 {
1675d1be 215 __profcxx_map2umap_invalidate(this->_M_map2umap_info);
216 return const_reverse_iterator(cend());
5f70fed5 217 }
c55dc904 218
219 const_reverse_iterator
7cd718fd 220 crend() const noexcept
5f70fed5 221 {
1675d1be 222 __profcxx_map2umap_invalidate(this->_M_map2umap_info);
223 return const_reverse_iterator(cbegin());
5f70fed5 224 }
c55dc904 225#endif
226
1675d1be 227 void
228 swap(multiset& __x)
02769f1f 229 _GLIBCXX_NOEXCEPT_IF( noexcept(declval<_Base&>().swap(__x)) )
1675d1be 230 {
231 _Base::swap(__x);
232 this->_M_swap(__x);
233 }
234
c55dc904 235 // modifiers:
0c8766b1 236#if __cplusplus >= 201103L
6b9314a8 237 template<typename... _Args>
238 iterator
239 emplace(_Args&&... __args)
5f70fed5 240 {
241 // The cost is the same whether or not the element is inserted so we
242 // always report insertion of 1 element.
1675d1be 243 __profcxx_map2umap_insert(this->_M_map2umap_info, this->size(), 1);
244 return iterator(_Base::emplace(std::forward<_Args>(__args)...), this);
5f70fed5 245 }
6b9314a8 246
247 template<typename... _Args>
248 iterator
249 emplace_hint(const_iterator __pos, _Args&&... __args)
250 {
5f70fed5 251 auto size_before = this->size();
1675d1be 252 auto __res
253 = _Base::emplace_hint(__pos.base(), std::forward<_Args>(__args)...);
254 __profcxx_map2umap_insert(this->_M_map2umap_info,
255 size_before, _M_hint_used(__pos.base(), __res) ? 0 : 1);
256 return iterator(__res, this);
6b9314a8 257 }
258#endif
259
c55dc904 260 iterator
261 insert(const value_type& __x)
5f70fed5 262 {
1675d1be 263 __profcxx_map2umap_insert(this->_M_map2umap_info, this->size(), 1);
264 return iterator(_Base::insert(__x), this);
5f70fed5 265 }
c55dc904 266
0c8766b1 267#if __cplusplus >= 201103L
3e469200 268 iterator
269 insert(value_type&& __x)
5f70fed5 270 {
1675d1be 271 __profcxx_map2umap_insert(this->_M_map2umap_info, this->size(), 1);
272 return iterator(_Base::insert(std::move(__x)), this);
5f70fed5 273 }
3e469200 274#endif
275
c55dc904 276 iterator
5f70fed5 277 insert(const_iterator __pos, const value_type& __x)
278 {
279 size_type size_before = this->size();
1675d1be 280 _Base_iterator __res = _Base::insert(__pos.base(), __x);
5f70fed5 281
1675d1be 282 __profcxx_map2umap_insert(this->_M_map2umap_info,
283 size_before, _M_hint_used(__pos.base(), __res) ? 0 : 1);
284 return iterator(__res, this);
5f70fed5 285 }
c55dc904 286
0c8766b1 287#if __cplusplus >= 201103L
3e469200 288 iterator
5f70fed5 289 insert(const_iterator __pos, value_type&& __x)
290 {
291 auto size_before = this->size();
1675d1be 292 auto __res = _Base::insert(__pos.base(), std::move(__x));
293 __profcxx_map2umap_insert(this->_M_map2umap_info,
294 size_before, _M_hint_used(__pos.base(), __res) ? 0 : 1);
295 return iterator(__res, this);
5f70fed5 296 }
3e469200 297#endif
298
0c8766b1 299#if __cplusplus >= 201103L
3edec8c4 300 template<typename _InputIterator,
301 typename = std::_RequireInputIter<_InputIterator>>
302#else
c55dc904 303 template<typename _InputIterator>
3edec8c4 304#endif
5f70fed5 305 void
306 insert(_InputIterator __first, _InputIterator __last)
307 {
308 for (; __first != __last; ++__first)
309 insert(*__first);
310 }
c55dc904 311
0c8766b1 312#if __cplusplus >= 201103L
c55dc904 313 void
314 insert(initializer_list<value_type> __l)
5f70fed5 315 { insert(__l.begin(), __l.end()); }
c55dc904 316#endif
317
0c8766b1 318#if __cplusplus >= 201103L
c55dc904 319 iterator
5f70fed5 320 erase(const_iterator __pos)
321 {
1675d1be 322 __profcxx_map2umap_erase(this->_M_map2umap_info, this->size(), 1);
323 return iterator(_Base::erase(__pos.base()), this);
5f70fed5 324 }
c55dc904 325#else
326 void
5f70fed5 327 erase(iterator __pos)
328 {
1675d1be 329 __profcxx_map2umap_erase(this->_M_map2umap_info, this->size(), 1);
330 _Base::erase(__pos.base());
5f70fed5 331 }
c55dc904 332#endif
333
334 size_type
335 erase(const key_type& __x)
336 {
1675d1be 337 __profcxx_map2umap_find(this->_M_map2umap_info, this->size());
338 __profcxx_map2umap_erase(this->_M_map2umap_info, this->size(), 1);
5f70fed5 339 return _Base::erase(__x);
c55dc904 340 }
341
0c8766b1 342#if __cplusplus >= 201103L
26acfa1a 343 iterator
3b607c40 344 erase(const_iterator __first, const_iterator __last)
5f70fed5 345 {
346 if (__first != __last)
347 {
348 iterator __ret;
349 for (; __first != __last;)
350 __ret = erase(__first++);
351 return __ret;
352 }
353 else
1675d1be 354 return iterator(_Base::erase(__first.base(), __last.base()), this);
5f70fed5 355 }
26acfa1a 356#else
c55dc904 357 void
358 erase(iterator __first, iterator __last)
5f70fed5 359 {
360 for (; __first != __last;)
361 erase(__first++);
362 }
26acfa1a 363#endif
c55dc904 364
365 void
1675d1be 366 clear() _GLIBCXX_NOEXCEPT
367 {
368 this->_M_profile_destruct();
369 _Base::clear();
370 this->_M_profile_construct();
371 }
372
373 size_type
374 count(const key_type& __x) const
375 {
376 __profcxx_map2umap_find(this->_M_map2umap_info, this->size());
377 return _Base::count(__x);
378 }
c55dc904 379
e20e61b2 380#if __cplusplus > 201103L
381 template<typename _Kt,
382 typename _Req =
383 typename __has_is_transparent<_Compare, _Kt>::type>
384 size_type
385 count(const _Kt& __x) const
386 {
387 __profcxx_map2umap_find(this->_M_map2umap_info, this->size());
388 return _Base::count(__x);
389 }
390#endif
391
c55dc904 392 // multiset operations:
393 iterator
394 find(const key_type& __x)
5f70fed5 395 {
1675d1be 396 __profcxx_map2umap_find(this->_M_map2umap_info, this->size());
397 return iterator(_Base::find(__x), this);
5f70fed5 398 }
c55dc904 399
400 // _GLIBCXX_RESOLVE_LIB_DEFECTS
401 // 214. set::find() missing const overload
402 const_iterator
403 find(const key_type& __x) const
5f70fed5 404 {
1675d1be 405 __profcxx_map2umap_find(this->_M_map2umap_info, this->size());
406 return const_iterator(_Base::find(__x), this);
5f70fed5 407 }
c55dc904 408
e20e61b2 409#if __cplusplus > 201103L
410 template<typename _Kt,
411 typename _Req =
412 typename __has_is_transparent<_Compare, _Kt>::type>
413 iterator
414 find(const _Kt& __x)
415 {
416 __profcxx_map2umap_find(this->_M_map2umap_info, this->size());
417 return { _Base::find(__x), this };
418 }
419
420 template<typename _Kt,
421 typename _Req =
422 typename __has_is_transparent<_Compare, _Kt>::type>
423 const_iterator
424 find(const _Kt& __x) const
425 {
426 __profcxx_map2umap_find(this->_M_map2umap_info, this->size());
427 return { _Base::find(__x), this };
428 }
429#endif
430
c55dc904 431 iterator
432 lower_bound(const key_type& __x)
5f70fed5 433 {
1675d1be 434 __profcxx_map2umap_find(this->_M_map2umap_info, this->size());
435 return iterator(_Base::lower_bound(__x), this);
5f70fed5 436 }
c55dc904 437
438 // _GLIBCXX_RESOLVE_LIB_DEFECTS
439 // 214. set::find() missing const overload
440 const_iterator
441 lower_bound(const key_type& __x) const
5f70fed5 442 {
1675d1be 443 __profcxx_map2umap_find(this->_M_map2umap_info, this->size());
444 __profcxx_map2umap_invalidate(this->_M_map2umap_info);
445 return const_iterator(_Base::lower_bound(__x), this);
5f70fed5 446 }
c55dc904 447
e20e61b2 448#if __cplusplus > 201103L
449 template<typename _Kt,
450 typename _Req =
451 typename __has_is_transparent<_Compare, _Kt>::type>
452 iterator
453 lower_bound(const _Kt& __x)
454 {
455 __profcxx_map2umap_find(this->_M_map2umap_info, this->size());
456 __profcxx_map2umap_invalidate(this->_M_map2umap_info);
457 return { _Base::lower_bound(__x), this };
458 }
459
460 template<typename _Kt,
461 typename _Req =
462 typename __has_is_transparent<_Compare, _Kt>::type>
463 const_iterator
464 lower_bound(const _Kt& __x) const
465 {
466 __profcxx_map2umap_find(this->_M_map2umap_info, this->size());
467 __profcxx_map2umap_invalidate(this->_M_map2umap_info);
468 return { _Base::lower_bound(__x), this };
469 }
470#endif
471
c55dc904 472 iterator
473 upper_bound(const key_type& __x)
5f70fed5 474 {
1675d1be 475 __profcxx_map2umap_find(this->_M_map2umap_info, this->size());
476 __profcxx_map2umap_invalidate(this->_M_map2umap_info);
477 return iterator(_Base::upper_bound(__x), this);
5f70fed5 478 }
c55dc904 479
480 // _GLIBCXX_RESOLVE_LIB_DEFECTS
481 // 214. set::find() missing const overload
482 const_iterator
483 upper_bound(const key_type& __x) const
5f70fed5 484 {
1675d1be 485 __profcxx_map2umap_find(this->_M_map2umap_info, this->size());
486 __profcxx_map2umap_invalidate(this->_M_map2umap_info);
487 return const_iterator(_Base::upper_bound(__x), this);
5f70fed5 488 }
c55dc904 489
e20e61b2 490#if __cplusplus > 201103L
491 template<typename _Kt,
492 typename _Req =
493 typename __has_is_transparent<_Compare, _Kt>::type>
494 iterator
495 upper_bound(const _Kt& __x)
496 {
497 __profcxx_map2umap_find(this->_M_map2umap_info, this->size());
498 __profcxx_map2umap_invalidate(this->_M_map2umap_info);
499 return { _Base::upper_bound(__x), this };
500 }
501
502 template<typename _Kt,
503 typename _Req =
504 typename __has_is_transparent<_Compare, _Kt>::type>
505 const_iterator
506 upper_bound(const _Kt& __x) const
507 {
508 __profcxx_map2umap_find(this->_M_map2umap_info, this->size());
509 __profcxx_map2umap_invalidate(this->_M_map2umap_info);
510 return { _Base::upper_bound(__x), this };
511 }
512#endif
513
c55dc904 514 std::pair<iterator,iterator>
515 equal_range(const key_type& __x)
516 {
1675d1be 517 __profcxx_map2umap_find(this->_M_map2umap_info, this->size());
518 std::pair<_Base_iterator, _Base_iterator> __base_ret
519 = _Base::equal_range(__x);
520 return std::make_pair(iterator(__base_ret.first, this),
521 iterator(__base_ret.second, this));
c55dc904 522 }
523
524 // _GLIBCXX_RESOLVE_LIB_DEFECTS
525 // 214. set::find() missing const overload
526 std::pair<const_iterator,const_iterator>
527 equal_range(const key_type& __x) const
528 {
1675d1be 529 __profcxx_map2umap_find(this->_M_map2umap_info, this->size());
530 std::pair<_Base_const_iterator, _Base_const_iterator> __base_ret
531 = _Base::equal_range(__x);
532 return std::make_pair(const_iterator(__base_ret.first, this),
533 const_iterator(__base_ret.second, this));
c55dc904 534 }
535
e20e61b2 536#if __cplusplus > 201103L
537 template<typename _Kt,
538 typename _Req =
539 typename __has_is_transparent<_Compare, _Kt>::type>
540 std::pair<iterator, iterator>
541 equal_range(const _Kt& __x)
542 {
543 __profcxx_map2umap_find(this->_M_map2umap_info, this->size());
544 auto __res = _Base::equal_range(__x);
545 return { { __res.first, this }, { __res.second, this } };
546 }
547
548 template<typename _Kt,
549 typename _Req =
550 typename __has_is_transparent<_Compare, _Kt>::type>
551 std::pair<const_iterator, const_iterator>
552 equal_range(const _Kt& __x) const
553 {
554 __profcxx_map2umap_find(this->_M_map2umap_info, this->size());
555 auto __res = _Base::equal_range(__x);
556 return { { __res.first, this }, { __res.second, this } };
557 }
558#endif
559
c55dc904 560 _Base&
5f70fed5 561 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
c55dc904 562
563 const _Base&
5f70fed5 564 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
565
566 private:
567 /** If hint is used we consider that the map and unordered_map
568 * operations have equivalent insertion cost so we do not update metrics
569 * about it.
570 * Note that to find out if hint has been used is libstdc++
ea160a81 571 * implementation dependent.
5f70fed5 572 */
573 bool
1675d1be 574 _M_hint_used(_Base_const_iterator __hint, _Base_iterator __res)
5f70fed5 575 {
ea160a81 576 return (__hint == __res
1675d1be 577 || (__hint == _M_base().end() && ++__res == _M_base().end())
578 || (__hint != _M_base().end() && (++__hint == __res
579 || ++__res == --__hint)));
5f70fed5 580 }
1675d1be 581
582 template<typename _K1, typename _C1, typename _A1>
583 friend bool
584 operator==(const multiset<_K1, _C1, _A1>&,
585 const multiset<_K1, _C1, _A1>&);
586
587 template<typename _K1, typename _C1, typename _A1>
588 friend bool
589 operator< (const multiset<_K1, _C1, _A1>&,
590 const multiset<_K1, _C1, _A1>&);
c55dc904 591 };
592
593 template<typename _Key, typename _Compare, typename _Allocator>
594 inline bool
595 operator==(const multiset<_Key, _Compare, _Allocator>& __lhs,
596 const multiset<_Key, _Compare, _Allocator>& __rhs)
1675d1be 597 {
598 __profcxx_map2umap_invalidate(__lhs._M_map2umap_info);
599 __profcxx_map2umap_invalidate(__rhs._M_map2umap_info);
600 return __lhs._M_base() == __rhs._M_base();
601 }
c55dc904 602
603 template<typename _Key, typename _Compare, typename _Allocator>
604 inline bool
1675d1be 605 operator<(const multiset<_Key, _Compare, _Allocator>& __lhs,
606 const multiset<_Key, _Compare, _Allocator>& __rhs)
607 {
608 __profcxx_map2umap_invalidate(__lhs._M_map2umap_info);
609 __profcxx_map2umap_invalidate(__rhs._M_map2umap_info);
610 return __lhs._M_base() < __rhs._M_base();
611 }
c55dc904 612
613 template<typename _Key, typename _Compare, typename _Allocator>
614 inline bool
1675d1be 615 operator!=(const multiset<_Key, _Compare, _Allocator>& __lhs,
616 const multiset<_Key, _Compare, _Allocator>& __rhs)
617 { return !(__lhs == __rhs); }
c55dc904 618
619 template<typename _Key, typename _Compare, typename _Allocator>
620 inline bool
621 operator<=(const multiset<_Key, _Compare, _Allocator>& __lhs,
622 const multiset<_Key, _Compare, _Allocator>& __rhs)
1675d1be 623 { return !(__rhs < __lhs); }
c55dc904 624
625 template<typename _Key, typename _Compare, typename _Allocator>
626 inline bool
627 operator>=(const multiset<_Key, _Compare, _Allocator>& __lhs,
628 const multiset<_Key, _Compare, _Allocator>& __rhs)
1675d1be 629 { return !(__lhs < __rhs); }
c55dc904 630
631 template<typename _Key, typename _Compare, typename _Allocator>
632 inline bool
633 operator>(const multiset<_Key, _Compare, _Allocator>& __lhs,
634 const multiset<_Key, _Compare, _Allocator>& __rhs)
1675d1be 635 { return __rhs < __lhs; }
c55dc904 636
637 template<typename _Key, typename _Compare, typename _Allocator>
638 void
639 swap(multiset<_Key, _Compare, _Allocator>& __x,
640 multiset<_Key, _Compare, _Allocator>& __y)
02769f1f 641 _GLIBCXX_NOEXCEPT_IF(noexcept(__x.swap(__y)))
c55dc904 642 { return __x.swap(__y); }
643
644} // namespace __profile
645} // namespace std
646
647#endif
Mirror of https://gcc.gnu.org/git/gcc.git