1 // Debugging multiset implementation -*- C++ -*-
3 // Copyright (C) 2003, 2004, 2005, 2006, 2007
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 2, 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 // You should have received a copy of the GNU General Public License along
18 // with this library; see the file COPYING. If not, write to the Free
19 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
22 // As a special exception, you may use this file as part of a free software
23 // library without restriction. Specifically, if other files instantiate
24 // templates or use macros or inline functions from this file, or you compile
25 // this file and link it with other files to produce an executable, this
26 // file does not by itself cause the resulting executable to be covered by
27 // the GNU General Public License. This exception does not however
28 // invalidate any other reasons why the executable file might be covered by
29 // the GNU General Public License.
31 /** @file debug/multiset.h
32 * This file is a GNU debug extension to the Standard C++ Library.
35 #ifndef _GLIBCXX_DEBUG_MULTISET_H
36 #define _GLIBCXX_DEBUG_MULTISET_H 1
38 #include <debug/safe_sequence.h>
39 #include <debug/safe_iterator.h>
46 template<typename _Key, typename _Compare = std::less<_Key>,
47 typename _Allocator = std::allocator<_Key> >
49 : public _GLIBCXX_STD_D::multiset<_Key, _Compare, _Allocator>,
50 public __gnu_debug::_Safe_sequence<multiset<_Key, _Compare, _Allocator> >
52 typedef _GLIBCXX_STD_D::multiset<_Key, _Compare, _Allocator> _Base;
53 typedef __gnu_debug::_Safe_sequence<multiset> _Safe_base;
57 typedef _Key key_type;
58 typedef _Key value_type;
59 typedef _Compare key_compare;
60 typedef _Compare value_compare;
61 typedef _Allocator allocator_type;
62 typedef typename _Base::reference reference;
63 typedef typename _Base::const_reference const_reference;
65 typedef __gnu_debug::_Safe_iterator<typename _Base::iterator, multiset>
67 typedef __gnu_debug::_Safe_iterator<typename _Base::const_iterator,
68 multiset> const_iterator;
70 typedef typename _Base::size_type size_type;
71 typedef typename _Base::difference_type difference_type;
72 typedef typename _Base::pointer pointer;
73 typedef typename _Base::const_pointer const_pointer;
74 typedef std::reverse_iterator<iterator> reverse_iterator;
75 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
77 // 23.3.3.1 construct/copy/destroy:
78 explicit multiset(const _Compare& __comp = _Compare(),
79 const _Allocator& __a = _Allocator())
80 : _Base(__comp, __a) { }
82 template<typename _InputIterator>
83 multiset(_InputIterator __first, _InputIterator __last,
84 const _Compare& __comp = _Compare(),
85 const _Allocator& __a = _Allocator())
86 : _Base(__gnu_debug::__check_valid_range(__first, __last), __last,
89 multiset(const multiset& __x)
90 : _Base(__x), _Safe_base() { }
92 multiset(const _Base& __x)
93 : _Base(__x), _Safe_base() { }
95 #ifdef __GXX_EXPERIMENTAL_CXX0X__
96 multiset(multiset&& __x)
97 : _Base(std::forward<multiset>(__x)), _Safe_base()
98 { this->_M_swap(__x); }
104 operator=(const multiset& __x)
106 *static_cast<_Base*>(this) = __x;
107 this->_M_invalidate_all();
111 #ifdef __GXX_EXPERIMENTAL_CXX0X__
113 operator=(multiset&& __x)
122 using _Base::get_allocator;
127 { return iterator(_Base::begin(), this); }
131 { return const_iterator(_Base::begin(), this); }
135 { return iterator(_Base::end(), this); }
139 { return const_iterator(_Base::end(), this); }
143 { return reverse_iterator(end()); }
145 const_reverse_iterator
147 { return const_reverse_iterator(end()); }
151 { return reverse_iterator(begin()); }
153 const_reverse_iterator
155 { return const_reverse_iterator(begin()); }
157 #ifdef __GXX_EXPERIMENTAL_CXX0X__
160 { return const_iterator(_Base::begin(), this); }
164 { return const_iterator(_Base::end(), this); }
166 const_reverse_iterator
168 { return const_reverse_iterator(end()); }
170 const_reverse_iterator
172 { return const_reverse_iterator(begin()); }
178 using _Base::max_size;
182 insert(const value_type& __x)
183 { return iterator(_Base::insert(__x), this); }
186 insert(iterator __position, const value_type& __x)
188 __glibcxx_check_insert(__position);
189 return iterator(_Base::insert(__position.base(), __x), this);
192 template<typename _InputIterator>
194 insert(_InputIterator __first, _InputIterator __last)
196 __glibcxx_check_valid_range(__first, __last);
197 _Base::insert(__first, __last);
201 erase(iterator __position)
203 __glibcxx_check_erase(__position);
204 __position._M_invalidate();
205 _Base::erase(__position.base());
209 erase(const key_type& __x)
211 std::pair<iterator, iterator> __victims = this->equal_range(__x);
212 size_type __count = 0;
213 while (__victims.first != __victims.second)
215 iterator __victim = __victims.first++;
216 __victim._M_invalidate();
217 _Base::erase(__victim.base());
224 erase(iterator __first, iterator __last)
226 // _GLIBCXX_RESOLVE_LIB_DEFECTS
227 // 151. can't currently clear() empty container
228 __glibcxx_check_erase_range(__first, __last);
229 while (__first != __last)
230 this->erase(__first++);
234 #ifdef __GXX_EXPERIMENTAL_CXX0X__
246 { this->erase(begin(), end()); }
249 using _Base::key_comp;
250 using _Base::value_comp;
252 // multiset operations:
254 find(const key_type& __x)
255 { return iterator(_Base::find(__x), this); }
257 // _GLIBCXX_RESOLVE_LIB_DEFECTS
258 // 214. set::find() missing const overload
260 find(const key_type& __x) const
261 { return const_iterator(_Base::find(__x), this); }
266 lower_bound(const key_type& __x)
267 { return iterator(_Base::lower_bound(__x), this); }
269 // _GLIBCXX_RESOLVE_LIB_DEFECTS
270 // 214. set::find() missing const overload
272 lower_bound(const key_type& __x) const
273 { return const_iterator(_Base::lower_bound(__x), this); }
276 upper_bound(const key_type& __x)
277 { return iterator(_Base::upper_bound(__x), this); }
279 // _GLIBCXX_RESOLVE_LIB_DEFECTS
280 // 214. set::find() missing const overload
282 upper_bound(const key_type& __x) const
283 { return const_iterator(_Base::upper_bound(__x), this); }
285 std::pair<iterator,iterator>
286 equal_range(const key_type& __x)
288 typedef typename _Base::iterator _Base_iterator;
289 std::pair<_Base_iterator, _Base_iterator> __res =
290 _Base::equal_range(__x);
291 return std::make_pair(iterator(__res.first, this),
292 iterator(__res.second, this));
295 // _GLIBCXX_RESOLVE_LIB_DEFECTS
296 // 214. set::find() missing const overload
297 std::pair<const_iterator,const_iterator>
298 equal_range(const key_type& __x) const
300 typedef typename _Base::const_iterator _Base_iterator;
301 std::pair<_Base_iterator, _Base_iterator> __res =
302 _Base::equal_range(__x);
303 return std::make_pair(const_iterator(__res.first, this),
304 const_iterator(__res.second, this));
308 _M_base() { return *this; }
311 _M_base() const { return *this; }
317 typedef typename _Base::const_iterator _Base_const_iterator;
318 typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal;
319 this->_M_invalidate_if(_Not_equal(_M_base().end()));
323 template<typename _Key, typename _Compare, typename _Allocator>
325 operator==(const multiset<_Key, _Compare, _Allocator>& __lhs,
326 const multiset<_Key, _Compare, _Allocator>& __rhs)
327 { return __lhs._M_base() == __rhs._M_base(); }
329 template<typename _Key, typename _Compare, typename _Allocator>
331 operator!=(const multiset<_Key, _Compare, _Allocator>& __lhs,
332 const multiset<_Key, _Compare, _Allocator>& __rhs)
333 { return __lhs._M_base() != __rhs._M_base(); }
335 template<typename _Key, typename _Compare, typename _Allocator>
337 operator<(const multiset<_Key, _Compare, _Allocator>& __lhs,
338 const multiset<_Key, _Compare, _Allocator>& __rhs)
339 { return __lhs._M_base() < __rhs._M_base(); }
341 template<typename _Key, typename _Compare, typename _Allocator>
343 operator<=(const multiset<_Key, _Compare, _Allocator>& __lhs,
344 const multiset<_Key, _Compare, _Allocator>& __rhs)
345 { return __lhs._M_base() <= __rhs._M_base(); }
347 template<typename _Key, typename _Compare, typename _Allocator>
349 operator>=(const multiset<_Key, _Compare, _Allocator>& __lhs,
350 const multiset<_Key, _Compare, _Allocator>& __rhs)
351 { return __lhs._M_base() >= __rhs._M_base(); }
353 template<typename _Key, typename _Compare, typename _Allocator>
355 operator>(const multiset<_Key, _Compare, _Allocator>& __lhs,
356 const multiset<_Key, _Compare, _Allocator>& __rhs)
357 { return __lhs._M_base() > __rhs._M_base(); }
359 template<typename _Key, typename _Compare, typename _Allocator>
361 swap(multiset<_Key, _Compare, _Allocator>& __x,
362 multiset<_Key, _Compare, _Allocator>& __y)
363 { return __x.swap(__y); }
365 #ifdef __GXX_EXPERIMENTAL_CXX0X__
366 template<typename _Key, typename _Compare, typename _Allocator>
368 swap(multiset<_Key, _Compare, _Allocator>&& __x,
369 multiset<_Key, _Compare, _Allocator>& __y)
370 { return __x.swap(__y); }
372 template<typename _Key, typename _Compare, typename _Allocator>
374 swap(multiset<_Key, _Compare, _Allocator>& __x,
375 multiset<_Key, _Compare, _Allocator>&& __y)
376 { return __x.swap(__y); }
379 } // namespace __debug