1 // Debugging set implementation -*- C++ -*-
3 // Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
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/>.
27 * This file is a GNU debug extension to the Standard C++ Library.
30 #ifndef _GLIBCXX_DEBUG_SET_H
31 #define _GLIBCXX_DEBUG_SET_H 1
33 #include <debug/safe_sequence.h>
34 #include <debug/safe_iterator.h>
41 /// Class std::set with safety/checking/debug instrumentation.
42 template<typename _Key, typename _Compare = std::less<_Key>,
43 typename _Allocator = std::allocator<_Key> >
45 : public _GLIBCXX_STD_D::set<_Key,_Compare,_Allocator>,
46 public __gnu_debug::_Safe_sequence<set<_Key, _Compare, _Allocator> >
48 typedef _GLIBCXX_STD_D::set<_Key, _Compare, _Allocator> _Base;
49 typedef __gnu_debug::_Safe_sequence<set> _Safe_base;
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;
61 typedef __gnu_debug::_Safe_iterator<typename _Base::iterator, set>
63 typedef __gnu_debug::_Safe_iterator<typename _Base::const_iterator, set>
66 typedef typename _Base::size_type size_type;
67 typedef typename _Base::difference_type difference_type;
68 typedef typename _Base::pointer pointer;
69 typedef typename _Base::const_pointer const_pointer;
70 typedef std::reverse_iterator<iterator> reverse_iterator;
71 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
73 // 23.3.3.1 construct/copy/destroy:
74 explicit set(const _Compare& __comp = _Compare(),
75 const _Allocator& __a = _Allocator())
76 : _Base(__comp, __a) { }
78 template<typename _InputIterator>
79 set(_InputIterator __first, _InputIterator __last,
80 const _Compare& __comp = _Compare(),
81 const _Allocator& __a = _Allocator())
82 : _Base(__gnu_debug::__check_valid_range(__first, __last), __last,
86 : _Base(__x), _Safe_base() { }
89 : _Base(__x), _Safe_base() { }
91 #ifdef __GXX_EXPERIMENTAL_CXX0X__
93 : _Base(std::forward<set>(__x)), _Safe_base()
94 { this->_M_swap(__x); }
96 set(initializer_list<value_type> __l,
97 const _Compare& __comp = _Compare(),
98 const allocator_type& __a = allocator_type())
99 : _Base(__l, __comp, __a), _Safe_base() { }
105 operator=(const set& __x)
107 *static_cast<_Base*>(this) = __x;
108 this->_M_invalidate_all();
112 #ifdef __GXX_EXPERIMENTAL_CXX0X__
124 operator=(initializer_list<value_type> __l)
132 using _Base::get_allocator;
137 { return iterator(_Base::begin(), this); }
141 { return const_iterator(_Base::begin(), this); }
145 { return iterator(_Base::end(), this); }
149 { return const_iterator(_Base::end(), this); }
153 { return reverse_iterator(end()); }
155 const_reverse_iterator
157 { return const_reverse_iterator(end()); }
161 { return reverse_iterator(begin()); }
163 const_reverse_iterator
165 { return const_reverse_iterator(begin()); }
167 #ifdef __GXX_EXPERIMENTAL_CXX0X__
170 { return const_iterator(_Base::begin(), this); }
174 { return const_iterator(_Base::end(), this); }
176 const_reverse_iterator
178 { return const_reverse_iterator(end()); }
180 const_reverse_iterator
182 { return const_reverse_iterator(begin()); }
188 using _Base::max_size;
191 std::pair<iterator, bool>
192 insert(const value_type& __x)
194 typedef typename _Base::iterator _Base_iterator;
195 std::pair<_Base_iterator, bool> __res = _Base::insert(__x);
196 return std::pair<iterator, bool>(iterator(__res.first, this),
201 insert(iterator __position, const value_type& __x)
203 __glibcxx_check_insert(__position);
204 return iterator(_Base::insert(__position.base(), __x), this);
207 template <typename _InputIterator>
209 insert(_InputIterator __first, _InputIterator __last)
211 __glibcxx_check_valid_range(__first, __last);
212 _Base::insert(__first, __last);
215 #ifdef __GXX_EXPERIMENTAL_CXX0X__
217 insert(initializer_list<value_type> __l)
218 { _Base::insert(__l); }
221 #ifdef __GXX_EXPERIMENTAL_CXX0X__
223 erase(iterator __position)
225 __glibcxx_check_erase(__position);
226 __position._M_invalidate();
227 return iterator(_Base::erase(__position.base()), this);
231 erase(iterator __position)
233 __glibcxx_check_erase(__position);
234 __position._M_invalidate();
235 _Base::erase(__position.base());
240 erase(const key_type& __x)
242 iterator __victim = find(__x);
243 if (__victim == end())
247 __victim._M_invalidate();
248 _Base::erase(__victim.base());
253 #ifdef __GXX_EXPERIMENTAL_CXX0X__
255 erase(iterator __first, iterator __last)
257 // _GLIBCXX_RESOLVE_LIB_DEFECTS
258 // 151. can't currently clear() empty container
259 __glibcxx_check_erase_range(__first, __last);
260 while (__first != __last)
261 this->erase(__first++);
266 erase(iterator __first, iterator __last)
268 // _GLIBCXX_RESOLVE_LIB_DEFECTS
269 // 151. can't currently clear() empty container
270 __glibcxx_check_erase_range(__first, __last);
271 while (__first != __last)
272 this->erase(__first++);
285 { this->erase(begin(), end()); }
288 using _Base::key_comp;
289 using _Base::value_comp;
293 find(const key_type& __x)
294 { return iterator(_Base::find(__x), this); }
296 // _GLIBCXX_RESOLVE_LIB_DEFECTS
297 // 214. set::find() missing const overload
299 find(const key_type& __x) const
300 { return const_iterator(_Base::find(__x), this); }
305 lower_bound(const key_type& __x)
306 { return iterator(_Base::lower_bound(__x), this); }
308 // _GLIBCXX_RESOLVE_LIB_DEFECTS
309 // 214. set::find() missing const overload
311 lower_bound(const key_type& __x) const
312 { return const_iterator(_Base::lower_bound(__x), this); }
315 upper_bound(const key_type& __x)
316 { return iterator(_Base::upper_bound(__x), this); }
318 // _GLIBCXX_RESOLVE_LIB_DEFECTS
319 // 214. set::find() missing const overload
321 upper_bound(const key_type& __x) const
322 { return const_iterator(_Base::upper_bound(__x), this); }
324 std::pair<iterator,iterator>
325 equal_range(const key_type& __x)
327 typedef typename _Base::iterator _Base_iterator;
328 std::pair<_Base_iterator, _Base_iterator> __res =
329 _Base::equal_range(__x);
330 return std::make_pair(iterator(__res.first, this),
331 iterator(__res.second, this));
334 // _GLIBCXX_RESOLVE_LIB_DEFECTS
335 // 214. set::find() missing const overload
336 std::pair<const_iterator,const_iterator>
337 equal_range(const key_type& __x) const
339 typedef typename _Base::const_iterator _Base_iterator;
340 std::pair<_Base_iterator, _Base_iterator> __res =
341 _Base::equal_range(__x);
342 return std::make_pair(const_iterator(__res.first, this),
343 const_iterator(__res.second, this));
347 _M_base() { return *this; }
350 _M_base() const { return *this; }
356 typedef typename _Base::const_iterator _Base_const_iterator;
357 typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal;
358 this->_M_invalidate_if(_Not_equal(_M_base().end()));
362 template<typename _Key, typename _Compare, typename _Allocator>
364 operator==(const set<_Key, _Compare, _Allocator>& __lhs,
365 const set<_Key, _Compare, _Allocator>& __rhs)
366 { return __lhs._M_base() == __rhs._M_base(); }
368 template<typename _Key, typename _Compare, typename _Allocator>
370 operator!=(const set<_Key, _Compare, _Allocator>& __lhs,
371 const set<_Key, _Compare, _Allocator>& __rhs)
372 { return __lhs._M_base() != __rhs._M_base(); }
374 template<typename _Key, typename _Compare, typename _Allocator>
376 operator<(const set<_Key, _Compare, _Allocator>& __lhs,
377 const set<_Key, _Compare, _Allocator>& __rhs)
378 { return __lhs._M_base() < __rhs._M_base(); }
380 template<typename _Key, typename _Compare, typename _Allocator>
382 operator<=(const set<_Key, _Compare, _Allocator>& __lhs,
383 const set<_Key, _Compare, _Allocator>& __rhs)
384 { return __lhs._M_base() <= __rhs._M_base(); }
386 template<typename _Key, typename _Compare, typename _Allocator>
388 operator>=(const set<_Key, _Compare, _Allocator>& __lhs,
389 const set<_Key, _Compare, _Allocator>& __rhs)
390 { return __lhs._M_base() >= __rhs._M_base(); }
392 template<typename _Key, typename _Compare, typename _Allocator>
394 operator>(const set<_Key, _Compare, _Allocator>& __lhs,
395 const set<_Key, _Compare, _Allocator>& __rhs)
396 { return __lhs._M_base() > __rhs._M_base(); }
398 template<typename _Key, typename _Compare, typename _Allocator>
400 swap(set<_Key, _Compare, _Allocator>& __x,
401 set<_Key, _Compare, _Allocator>& __y)
402 { return __x.swap(__y); }
404 } // namespace __debug