1 // Debugging multiset implementation -*- C++ -*-
3 // Copyright (C) 2003, 2004, 2005
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 #ifndef _GLIBCXX_DEBUG_MULTISET_H
32 #define _GLIBCXX_DEBUG_MULTISET_H 1
34 #include <debug/safe_sequence.h>
35 #include <debug/safe_iterator.h>
38 namespace __gnu_debug_def
40 template<typename _Key, typename _Compare = std::less<_Key>,
41 typename _Allocator = std::allocator<_Key> >
43 : public _GLIBCXX_STD::multiset<_Key, _Compare, _Allocator>,
44 public __gnu_debug::_Safe_sequence<multiset<_Key, _Compare, _Allocator> >
46 typedef _GLIBCXX_STD::multiset<_Key, _Compare, _Allocator> _Base;
47 typedef __gnu_debug::_Safe_sequence<multiset> _Safe_base;
51 typedef _Key key_type;
52 typedef _Key value_type;
53 typedef _Compare key_compare;
54 typedef _Compare value_compare;
55 typedef _Allocator allocator_type;
56 typedef typename _Base::reference reference;
57 typedef typename _Base::const_reference const_reference;
59 typedef __gnu_debug::_Safe_iterator<typename _Base::iterator, multiset>
61 typedef __gnu_debug::_Safe_iterator<typename _Base::const_iterator,
62 multiset> const_iterator;
64 typedef typename _Base::size_type size_type;
65 typedef typename _Base::difference_type difference_type;
66 typedef typename _Base::pointer pointer;
67 typedef typename _Base::const_pointer const_pointer;
68 typedef std::reverse_iterator<iterator> reverse_iterator;
69 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
71 // 23.3.3.1 construct/copy/destroy:
72 explicit multiset(const _Compare& __comp = _Compare(),
73 const _Allocator& __a = _Allocator())
74 : _Base(__comp, __a) { }
76 template<typename _InputIterator>
77 multiset(_InputIterator __first, _InputIterator __last,
78 const _Compare& __comp = _Compare(),
79 const _Allocator& __a = _Allocator())
80 : _Base(__gnu_debug::__check_valid_range(__first, __last), __last,
83 multiset(const multiset<_Key,_Compare,_Allocator>& __x)
84 : _Base(__x), _Safe_base() { }
86 multiset(const _Base& __x) : _Base(__x), _Safe_base() { }
90 multiset<_Key,_Compare,_Allocator>&
91 operator=(const multiset<_Key,_Compare,_Allocator>& __x)
93 *static_cast<_Base*>(this) = __x;
94 this->_M_invalidate_all();
98 using _Base::get_allocator;
103 { return iterator(_Base::begin(), this); }
107 { return const_iterator(_Base::begin(), this); }
111 { return iterator(_Base::end(), this); }
115 { return const_iterator(_Base::end(), this); }
119 { return reverse_iterator(end()); }
121 const_reverse_iterator
123 { return const_reverse_iterator(end()); }
127 { return reverse_iterator(begin()); }
129 const_reverse_iterator
131 { return const_reverse_iterator(begin()); }
136 using _Base::max_size;
140 insert(const value_type& __x)
141 { return iterator(_Base::insert(__x), this); }
144 insert(iterator __position, const value_type& __x)
146 __glibcxx_check_insert(__position);
147 return iterator(_Base::insert(__position.base(), __x), this);
150 template<typename _InputIterator>
152 insert(_InputIterator __first, _InputIterator __last)
154 __glibcxx_check_valid_range(__first, __last);
155 _Base::insert(__first, __last);
159 erase(iterator __position)
161 __glibcxx_check_erase(__position);
162 __position._M_invalidate();
163 _Base::erase(__position.base());
167 erase(const key_type& __x)
169 std::pair<iterator, iterator> __victims = this->equal_range(__x);
170 size_type __count = 0;
171 while (__victims.first != __victims.second)
173 iterator __victim = __victims.first++;
174 __victim._M_invalidate();
175 _Base::erase(__victim.base());
182 erase(iterator __first, iterator __last)
184 // _GLIBCXX_RESOLVE_LIB_DEFECTS
185 // 151. can't currently clear() empty container
186 __glibcxx_check_erase_range(__first, __last);
187 while (__first != __last)
188 this->erase(__first++);
192 swap(multiset<_Key,_Compare,_Allocator>& __x)
200 { this->erase(begin(), end()); }
203 using _Base::key_comp;
204 using _Base::value_comp;
206 // multiset operations:
208 find(const key_type& __x)
209 { return iterator(_Base::find(__x), this); }
211 // _GLIBCXX_RESOLVE_LIB_DEFECTS
212 // 214. set::find() missing const overload
214 find(const key_type& __x) const
215 { return const_iterator(_Base::find(__x), this); }
220 lower_bound(const key_type& __x)
221 { return iterator(_Base::lower_bound(__x), this); }
223 // _GLIBCXX_RESOLVE_LIB_DEFECTS
224 // 214. set::find() missing const overload
226 lower_bound(const key_type& __x) const
227 { return const_iterator(_Base::lower_bound(__x), this); }
230 upper_bound(const key_type& __x)
231 { return iterator(_Base::upper_bound(__x), this); }
233 // _GLIBCXX_RESOLVE_LIB_DEFECTS
234 // 214. set::find() missing const overload
236 upper_bound(const key_type& __x) const
237 { return const_iterator(_Base::upper_bound(__x), this); }
239 std::pair<iterator,iterator>
240 equal_range(const key_type& __x)
242 typedef typename _Base::iterator _Base_iterator;
243 std::pair<_Base_iterator, _Base_iterator> __res =
244 _Base::equal_range(__x);
245 return std::make_pair(iterator(__res.first, this),
246 iterator(__res.second, this));
249 // _GLIBCXX_RESOLVE_LIB_DEFECTS
250 // 214. set::find() missing const overload
251 std::pair<const_iterator,const_iterator>
252 equal_range(const key_type& __x) const
254 typedef typename _Base::const_iterator _Base_iterator;
255 std::pair<_Base_iterator, _Base_iterator> __res =
256 _Base::equal_range(__x);
257 return std::make_pair(const_iterator(__res.first, this),
258 const_iterator(__res.second, this));
262 _M_base() { return *this; }
265 _M_base() const { return *this; }
271 typedef typename _Base::const_iterator _Base_const_iterator;
272 typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal;
273 this->_M_invalidate_if(_Not_equal(_M_base().end()));
277 template<typename _Key, typename _Compare, typename _Allocator>
279 operator==(const multiset<_Key,_Compare,_Allocator>& __lhs,
280 const multiset<_Key,_Compare,_Allocator>& __rhs)
281 { return __lhs._M_base() == __rhs._M_base(); }
283 template<typename _Key, typename _Compare, typename _Allocator>
285 operator!=(const multiset<_Key,_Compare,_Allocator>& __lhs,
286 const multiset<_Key,_Compare,_Allocator>& __rhs)
287 { return __lhs._M_base() != __rhs._M_base(); }
289 template<typename _Key, typename _Compare, typename _Allocator>
291 operator<(const multiset<_Key,_Compare,_Allocator>& __lhs,
292 const multiset<_Key,_Compare,_Allocator>& __rhs)
293 { return __lhs._M_base() < __rhs._M_base(); }
295 template<typename _Key, typename _Compare, typename _Allocator>
297 operator<=(const multiset<_Key,_Compare,_Allocator>& __lhs,
298 const multiset<_Key,_Compare,_Allocator>& __rhs)
299 { return __lhs._M_base() <= __rhs._M_base(); }
301 template<typename _Key, typename _Compare, typename _Allocator>
303 operator>=(const multiset<_Key,_Compare,_Allocator>& __lhs,
304 const multiset<_Key,_Compare,_Allocator>& __rhs)
305 { return __lhs._M_base() >= __rhs._M_base(); }
307 template<typename _Key, typename _Compare, typename _Allocator>
309 operator>(const multiset<_Key,_Compare,_Allocator>& __lhs,
310 const multiset<_Key,_Compare,_Allocator>& __rhs)
311 { return __lhs._M_base() > __rhs._M_base(); }
313 template<typename _Key, typename _Compare, typename _Allocator>
315 swap(multiset<_Key,_Compare,_Allocator>& __x,
316 multiset<_Key,_Compare,_Allocator>& __y)
317 { return __x.swap(__y); }
318 } // namespace __gnu_debug_def