1 // Debugging multiset implementation -*- C++ -*-
3 // Copyright (C) 2003, 2004, 2005, 2006, 2007, 2009, 2010, 2011
4 // Free Software Foundation, Inc.
6 // This file is part of the GNU ISO C++ Library. This library is free
7 // software; you can redistribute it and/or modify it under the
8 // terms of the GNU General Public License as published by the
9 // Free Software Foundation; either version 3, or (at your option)
12 // This library is distributed in the hope that it will be useful,
13 // but WITHOUT ANY WARRANTY; without even the implied warranty of
14 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 // GNU General Public License for more details.
17 // Under Section 7 of GPL version 3, you are granted additional
18 // permissions described in the GCC Runtime Library Exception, version
19 // 3.1, as published by the Free Software Foundation.
21 // You should have received a copy of the GNU General Public License and
22 // a copy of the GCC Runtime Library Exception along with this program;
23 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
24 // <http://www.gnu.org/licenses/>.
26 /** @file debug/multiset.h
27 * This file is a GNU debug extension to the Standard C++ Library.
30 #ifndef _GLIBCXX_DEBUG_MULTISET_H
31 #define _GLIBCXX_DEBUG_MULTISET_H 1
33 #include <debug/safe_sequence.h>
34 #include <debug/safe_iterator.h>
37 namespace std _GLIBCXX_VISIBILITY(default)
41 /// Class std::multiset with safety/checking/debug instrumentation.
42 template<typename _Key, typename _Compare = std::less<_Key>,
43 typename _Allocator = std::allocator<_Key> >
45 : public _GLIBCXX_STD_C::multiset<_Key, _Compare, _Allocator>,
46 public __gnu_debug::_Safe_sequence<multiset<_Key, _Compare, _Allocator> >
48 typedef _GLIBCXX_STD_C::multiset<_Key, _Compare, _Allocator> _Base;
50 typedef typename _Base::const_iterator _Base_const_iterator;
51 typedef typename _Base::iterator _Base_iterator;
52 typedef __gnu_debug::_Equal_to<_Base_const_iterator> _Equal;
55 typedef _Key key_type;
56 typedef _Key value_type;
57 typedef _Compare key_compare;
58 typedef _Compare value_compare;
59 typedef _Allocator allocator_type;
60 typedef typename _Base::reference reference;
61 typedef typename _Base::const_reference const_reference;
63 typedef __gnu_debug::_Safe_iterator<_Base_iterator, multiset>
65 typedef __gnu_debug::_Safe_iterator<_Base_const_iterator,
66 multiset> const_iterator;
68 typedef typename _Base::size_type size_type;
69 typedef typename _Base::difference_type difference_type;
70 typedef typename _Base::pointer pointer;
71 typedef typename _Base::const_pointer const_pointer;
72 typedef std::reverse_iterator<iterator> reverse_iterator;
73 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
75 // 23.3.3.1 construct/copy/destroy:
76 explicit multiset(const _Compare& __comp = _Compare(),
77 const _Allocator& __a = _Allocator())
78 : _Base(__comp, __a) { }
80 template<typename _InputIterator>
81 multiset(_InputIterator __first, _InputIterator __last,
82 const _Compare& __comp = _Compare(),
83 const _Allocator& __a = _Allocator())
84 : _Base(__gnu_debug::__base(__gnu_debug::__check_valid_range(__first,
86 __gnu_debug::__base(__last),
89 multiset(const multiset& __x)
92 multiset(const _Base& __x)
95 #ifdef __GXX_EXPERIMENTAL_CXX0X__
96 multiset(multiset&& __x)
97 noexcept(is_nothrow_copy_constructible<_Compare>::value)
98 : _Base(std::move(__x))
99 { this->_M_swap(__x); }
101 multiset(initializer_list<value_type> __l,
102 const _Compare& __comp = _Compare(),
103 const allocator_type& __a = allocator_type())
104 : _Base(__l, __comp, __a) { }
107 ~multiset() _GLIBCXX_NOEXCEPT { }
110 operator=(const multiset& __x)
112 *static_cast<_Base*>(this) = __x;
113 this->_M_invalidate_all();
117 #ifdef __GXX_EXPERIMENTAL_CXX0X__
119 operator=(multiset&& __x)
129 operator=(initializer_list<value_type> __l)
137 using _Base::get_allocator;
141 begin() _GLIBCXX_NOEXCEPT
142 { return iterator(_Base::begin(), this); }
145 begin() const _GLIBCXX_NOEXCEPT
146 { return const_iterator(_Base::begin(), this); }
149 end() _GLIBCXX_NOEXCEPT
150 { return iterator(_Base::end(), this); }
153 end() const _GLIBCXX_NOEXCEPT
154 { return const_iterator(_Base::end(), this); }
157 rbegin() _GLIBCXX_NOEXCEPT
158 { return reverse_iterator(end()); }
160 const_reverse_iterator
161 rbegin() const _GLIBCXX_NOEXCEPT
162 { return const_reverse_iterator(end()); }
165 rend() _GLIBCXX_NOEXCEPT
166 { return reverse_iterator(begin()); }
168 const_reverse_iterator
169 rend() const _GLIBCXX_NOEXCEPT
170 { return const_reverse_iterator(begin()); }
172 #ifdef __GXX_EXPERIMENTAL_CXX0X__
174 cbegin() const noexcept
175 { return const_iterator(_Base::begin(), this); }
178 cend() const noexcept
179 { return const_iterator(_Base::end(), this); }
181 const_reverse_iterator
182 crbegin() const noexcept
183 { return const_reverse_iterator(end()); }
185 const_reverse_iterator
186 crend() const noexcept
187 { return const_reverse_iterator(begin()); }
193 using _Base::max_size;
197 insert(const value_type& __x)
198 { return iterator(_Base::insert(__x), this); }
200 #ifdef __GXX_EXPERIMENTAL_CXX0X__
202 insert(value_type&& __x)
203 { return iterator(_Base::insert(std::move(__x)), this); }
207 insert(const_iterator __position, const value_type& __x)
209 __glibcxx_check_insert(__position);
210 return iterator(_Base::insert(__position.base(), __x), this);
213 #ifdef __GXX_EXPERIMENTAL_CXX0X__
215 insert(const_iterator __position, value_type&& __x)
217 __glibcxx_check_insert(__position);
218 return iterator(_Base::insert(__position.base(), std::move(__x)),
223 template<typename _InputIterator>
225 insert(_InputIterator __first, _InputIterator __last)
227 __glibcxx_check_valid_range(__first, __last);
228 _Base::insert(__gnu_debug::__base(__first),
229 __gnu_debug::__base(__last));
232 #ifdef __GXX_EXPERIMENTAL_CXX0X__
234 insert(initializer_list<value_type> __l)
235 { _Base::insert(__l); }
238 #ifdef __GXX_EXPERIMENTAL_CXX0X__
240 erase(const_iterator __position)
242 __glibcxx_check_erase(__position);
243 this->_M_invalidate_if(_Equal(__position.base()));
244 return iterator(_Base::erase(__position.base()), this);
248 erase(iterator __position)
250 __glibcxx_check_erase(__position);
251 this->_M_invalidate_if(_Equal(__position.base()));
252 _Base::erase(__position.base());
257 erase(const key_type& __x)
259 std::pair<_Base_iterator, _Base_iterator> __victims =
260 _Base::equal_range(__x);
261 size_type __count = 0;
262 _Base_iterator __victim = __victims.first;
263 while (__victim != __victims.second)
265 this->_M_invalidate_if(_Equal(__victim));
266 _Base::erase(__victim++);
272 #ifdef __GXX_EXPERIMENTAL_CXX0X__
274 erase(const_iterator __first, const_iterator __last)
276 // _GLIBCXX_RESOLVE_LIB_DEFECTS
277 // 151. can't currently clear() empty container
278 __glibcxx_check_erase_range(__first, __last);
279 for (_Base_const_iterator __victim = __first.base();
280 __victim != __last.base(); ++__victim)
282 _GLIBCXX_DEBUG_VERIFY(__victim != _Base::end(),
283 _M_message(__gnu_debug::__msg_valid_range)
284 ._M_iterator(__first, "first")
285 ._M_iterator(__last, "last"));
286 this->_M_invalidate_if(_Equal(__victim));
288 return iterator(_Base::erase(__first.base(), __last.base()), this);
292 erase(iterator __first, iterator __last)
294 // _GLIBCXX_RESOLVE_LIB_DEFECTS
295 // 151. can't currently clear() empty container
296 __glibcxx_check_erase_range(__first, __last);
297 for (_Base_iterator __victim = __first.base();
298 __victim != __last.base(); ++__victim)
300 _GLIBCXX_DEBUG_VERIFY(__victim != _Base::end(),
301 _M_message(__gnu_debug::__msg_valid_range)
302 ._M_iterator(__first, "first")
303 ._M_iterator(__last, "last"));
304 this->_M_invalidate_if(_Equal(__victim));
306 _Base::erase(__first.base(), __last.base());
318 clear() _GLIBCXX_NOEXCEPT
320 this->_M_invalidate_all();
325 using _Base::key_comp;
326 using _Base::value_comp;
328 // multiset operations:
330 find(const key_type& __x)
331 { return iterator(_Base::find(__x), this); }
333 // _GLIBCXX_RESOLVE_LIB_DEFECTS
334 // 214. set::find() missing const overload
336 find(const key_type& __x) const
337 { return const_iterator(_Base::find(__x), this); }
342 lower_bound(const key_type& __x)
343 { return iterator(_Base::lower_bound(__x), this); }
345 // _GLIBCXX_RESOLVE_LIB_DEFECTS
346 // 214. set::find() missing const overload
348 lower_bound(const key_type& __x) const
349 { return const_iterator(_Base::lower_bound(__x), this); }
352 upper_bound(const key_type& __x)
353 { return iterator(_Base::upper_bound(__x), this); }
355 // _GLIBCXX_RESOLVE_LIB_DEFECTS
356 // 214. set::find() missing const overload
358 upper_bound(const key_type& __x) const
359 { return const_iterator(_Base::upper_bound(__x), this); }
361 std::pair<iterator,iterator>
362 equal_range(const key_type& __x)
364 std::pair<_Base_iterator, _Base_iterator> __res =
365 _Base::equal_range(__x);
366 return std::make_pair(iterator(__res.first, this),
367 iterator(__res.second, this));
370 // _GLIBCXX_RESOLVE_LIB_DEFECTS
371 // 214. set::find() missing const overload
372 std::pair<const_iterator,const_iterator>
373 equal_range(const key_type& __x) const
375 std::pair<_Base_const_iterator, _Base_const_iterator> __res =
376 _Base::equal_range(__x);
377 return std::make_pair(const_iterator(__res.first, this),
378 const_iterator(__res.second, this));
382 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
385 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
391 typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal;
392 this->_M_invalidate_if(_Not_equal(_Base::end()));
396 template<typename _Key, typename _Compare, typename _Allocator>
398 operator==(const multiset<_Key, _Compare, _Allocator>& __lhs,
399 const multiset<_Key, _Compare, _Allocator>& __rhs)
400 { return __lhs._M_base() == __rhs._M_base(); }
402 template<typename _Key, typename _Compare, typename _Allocator>
404 operator!=(const multiset<_Key, _Compare, _Allocator>& __lhs,
405 const multiset<_Key, _Compare, _Allocator>& __rhs)
406 { return __lhs._M_base() != __rhs._M_base(); }
408 template<typename _Key, typename _Compare, typename _Allocator>
410 operator<(const multiset<_Key, _Compare, _Allocator>& __lhs,
411 const multiset<_Key, _Compare, _Allocator>& __rhs)
412 { return __lhs._M_base() < __rhs._M_base(); }
414 template<typename _Key, typename _Compare, typename _Allocator>
416 operator<=(const multiset<_Key, _Compare, _Allocator>& __lhs,
417 const multiset<_Key, _Compare, _Allocator>& __rhs)
418 { return __lhs._M_base() <= __rhs._M_base(); }
420 template<typename _Key, typename _Compare, typename _Allocator>
422 operator>=(const multiset<_Key, _Compare, _Allocator>& __lhs,
423 const multiset<_Key, _Compare, _Allocator>& __rhs)
424 { return __lhs._M_base() >= __rhs._M_base(); }
426 template<typename _Key, typename _Compare, typename _Allocator>
428 operator>(const multiset<_Key, _Compare, _Allocator>& __lhs,
429 const multiset<_Key, _Compare, _Allocator>& __rhs)
430 { return __lhs._M_base() > __rhs._M_base(); }
432 template<typename _Key, typename _Compare, typename _Allocator>
434 swap(multiset<_Key, _Compare, _Allocator>& __x,
435 multiset<_Key, _Compare, _Allocator>& __y)
436 { return __x.swap(__y); }
438 } // namespace __debug