1 // Debugging vector 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/>.
26 /** @file debug/vector
27 * This file is a GNU debug extension to the Standard C++ Library.
30 #ifndef _GLIBCXX_DEBUG_VECTOR
31 #define _GLIBCXX_DEBUG_VECTOR 1
35 #include <debug/safe_sequence.h>
36 #include <debug/safe_iterator.h>
42 /// Class std::vector with safety/checking/debug instrumentation.
43 template<typename _Tp,
44 typename _Allocator = std::allocator<_Tp> >
46 : public _GLIBCXX_STD_D::vector<_Tp, _Allocator>,
47 public __gnu_debug::_Safe_sequence<vector<_Tp, _Allocator> >
49 typedef _GLIBCXX_STD_D::vector<_Tp, _Allocator> _Base;
50 typedef __gnu_debug::_Safe_sequence<vector> _Safe_base;
52 typedef typename _Base::const_iterator _Base_const_iterator;
53 typedef __gnu_debug::_After_nth_from<_Base_const_iterator> _After_nth;
56 typedef typename _Base::reference reference;
57 typedef typename _Base::const_reference const_reference;
59 typedef __gnu_debug::_Safe_iterator<typename _Base::iterator,vector>
61 typedef __gnu_debug::_Safe_iterator<typename _Base::const_iterator,vector>
64 typedef typename _Base::size_type size_type;
65 typedef typename _Base::difference_type difference_type;
67 typedef _Tp value_type;
68 typedef _Allocator allocator_type;
69 typedef typename _Base::pointer pointer;
70 typedef typename _Base::const_pointer const_pointer;
71 typedef std::reverse_iterator<iterator> reverse_iterator;
72 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
74 // 23.2.4.1 construct/copy/destroy:
76 vector(const _Allocator& __a = _Allocator())
77 : _Base(__a), _M_guaranteed_capacity(0) { }
79 #ifdef __GXX_EXPERIMENTAL_CXX0X__
82 : _Base(__n), _M_guaranteed_capacity(__n) { }
84 vector(size_type __n, const _Tp& __value,
85 const _Allocator& __a = _Allocator())
86 : _Base(__n, __value, __a), _M_guaranteed_capacity(__n) { }
89 vector(size_type __n, const _Tp& __value = _Tp(),
90 const _Allocator& __a = _Allocator())
91 : _Base(__n, __value, __a), _M_guaranteed_capacity(__n) { }
94 template<class _InputIterator>
95 vector(_InputIterator __first, _InputIterator __last,
96 const _Allocator& __a = _Allocator())
97 : _Base(__gnu_debug::__base(__gnu_debug::__check_valid_range(__first,
99 __gnu_debug::__base(__last), __a),
100 _M_guaranteed_capacity(0)
101 { _M_update_guaranteed_capacity(); }
103 vector(const vector& __x)
104 : _Base(__x), _Safe_base(), _M_guaranteed_capacity(__x.size()) { }
106 /// Construction from a release-mode vector
107 vector(const _Base& __x)
108 : _Base(__x), _Safe_base(), _M_guaranteed_capacity(__x.size()) { }
110 #ifdef __GXX_EXPERIMENTAL_CXX0X__
112 : _Base(std::move(__x)), _Safe_base(),
113 _M_guaranteed_capacity(this->size())
116 __x._M_guaranteed_capacity = 0;
119 vector(initializer_list<value_type> __l,
120 const allocator_type& __a = allocator_type())
121 : _Base(__l, __a), _Safe_base(),
122 _M_guaranteed_capacity(__l.size()) { }
128 operator=(const vector& __x)
130 static_cast<_Base&>(*this) = __x;
131 this->_M_invalidate_all();
132 _M_update_guaranteed_capacity();
136 #ifdef __GXX_EXPERIMENTAL_CXX0X__
138 operator=(vector&& __x)
148 operator=(initializer_list<value_type> __l)
150 static_cast<_Base&>(*this) = __l;
151 this->_M_invalidate_all();
152 _M_update_guaranteed_capacity();
157 template<typename _InputIterator>
159 assign(_InputIterator __first, _InputIterator __last)
161 __glibcxx_check_valid_range(__first, __last);
162 _Base::assign(__gnu_debug::__base(__first),
163 __gnu_debug::__base(__last));
164 this->_M_invalidate_all();
165 _M_update_guaranteed_capacity();
169 assign(size_type __n, const _Tp& __u)
171 _Base::assign(__n, __u);
172 this->_M_invalidate_all();
173 _M_update_guaranteed_capacity();
176 #ifdef __GXX_EXPERIMENTAL_CXX0X__
178 assign(initializer_list<value_type> __l)
181 this->_M_invalidate_all();
182 _M_update_guaranteed_capacity();
186 using _Base::get_allocator;
191 { return iterator(_Base::begin(), this); }
195 { return const_iterator(_Base::begin(), this); }
199 { return iterator(_Base::end(), this); }
203 { return const_iterator(_Base::end(), this); }
207 { return reverse_iterator(end()); }
209 const_reverse_iterator
211 { return const_reverse_iterator(end()); }
215 { return reverse_iterator(begin()); }
217 const_reverse_iterator
219 { return const_reverse_iterator(begin()); }
221 #ifdef __GXX_EXPERIMENTAL_CXX0X__
224 { return const_iterator(_Base::begin(), this); }
228 { return const_iterator(_Base::end(), this); }
230 const_reverse_iterator
232 { return const_reverse_iterator(end()); }
234 const_reverse_iterator
236 { return const_reverse_iterator(begin()); }
239 // 23.2.4.2 capacity:
241 using _Base::max_size;
243 #ifdef __GXX_EXPERIMENTAL_CXX0X__
245 resize(size_type __sz)
247 bool __realloc = _M_requires_reallocation(__sz);
248 if (__sz < this->size())
249 this->_M_invalidate_if(_After_nth(__sz, _M_base().begin()));
252 this->_M_invalidate_all();
253 _M_update_guaranteed_capacity();
257 resize(size_type __sz, const _Tp& __c)
259 bool __realloc = _M_requires_reallocation(__sz);
260 if (__sz < this->size())
261 this->_M_invalidate_if(_After_nth(__sz, _M_base().begin()));
262 _Base::resize(__sz, __c);
264 this->_M_invalidate_all();
265 _M_update_guaranteed_capacity();
269 resize(size_type __sz, _Tp __c = _Tp())
271 bool __realloc = _M_requires_reallocation(__sz);
272 if (__sz < this->size())
273 this->_M_invalidate_if(_After_nth(__sz, _M_base().begin()));
274 _Base::resize(__sz, __c);
276 this->_M_invalidate_all();
277 _M_update_guaranteed_capacity();
281 #ifdef __GXX_EXPERIMENTAL_CXX0X__
282 using _Base::shrink_to_fit;
288 #ifdef _GLIBCXX_DEBUG_PEDANTIC
289 return _M_guaranteed_capacity;
291 return _Base::capacity();
298 reserve(size_type __n)
300 bool __realloc = _M_requires_reallocation(__n);
302 if (__n > _M_guaranteed_capacity)
303 _M_guaranteed_capacity = __n;
305 this->_M_invalidate_all();
310 operator[](size_type __n)
312 __glibcxx_check_subscript(__n);
313 return _M_base()[__n];
317 operator[](size_type __n) const
319 __glibcxx_check_subscript(__n);
320 return _M_base()[__n];
328 __glibcxx_check_nonempty();
329 return _Base::front();
335 __glibcxx_check_nonempty();
336 return _Base::front();
342 __glibcxx_check_nonempty();
343 return _Base::back();
349 __glibcxx_check_nonempty();
350 return _Base::back();
353 // _GLIBCXX_RESOLVE_LIB_DEFECTS
354 // DR 464. Suggestion for new member functions in standard containers.
357 // 23.2.4.3 modifiers:
359 push_back(const _Tp& __x)
361 bool __realloc = _M_requires_reallocation(this->size() + 1);
362 _Base::push_back(__x);
364 this->_M_invalidate_all();
365 _M_update_guaranteed_capacity();
368 #ifdef __GXX_EXPERIMENTAL_CXX0X__
369 template<typename _Up = _Tp>
370 typename __gnu_cxx::__enable_if<!std::__are_same<_Up, bool>::__value,
373 { emplace_back(std::move(__x)); }
375 template<typename... _Args>
377 emplace_back(_Args&&... __args)
379 bool __realloc = _M_requires_reallocation(this->size() + 1);
380 _Base::emplace_back(std::forward<_Args>(__args)...);
382 this->_M_invalidate_all();
383 _M_update_guaranteed_capacity();
390 __glibcxx_check_nonempty();
391 iterator __victim = end() - 1;
392 __victim._M_invalidate();
396 #ifdef __GXX_EXPERIMENTAL_CXX0X__
397 template<typename... _Args>
399 emplace(iterator __position, _Args&&... __args)
401 __glibcxx_check_insert(__position);
402 bool __realloc = _M_requires_reallocation(this->size() + 1);
403 difference_type __offset = __position - begin();
404 typename _Base::iterator __res = _Base::emplace(__position.base(),
405 std::forward<_Args>(__args)...);
407 this->_M_invalidate_all();
409 this->_M_invalidate_if(_After_nth(__offset, _M_base().begin()));
410 _M_update_guaranteed_capacity();
411 return iterator(__res, this);
416 insert(iterator __position, const _Tp& __x)
418 __glibcxx_check_insert(__position);
419 bool __realloc = _M_requires_reallocation(this->size() + 1);
420 difference_type __offset = __position - begin();
421 typename _Base::iterator __res = _Base::insert(__position.base(),__x);
423 this->_M_invalidate_all();
425 this->_M_invalidate_if(_After_nth(__offset, _M_base().begin()));
426 _M_update_guaranteed_capacity();
427 return iterator(__res, this);
430 #ifdef __GXX_EXPERIMENTAL_CXX0X__
431 template<typename _Up = _Tp>
432 typename __gnu_cxx::__enable_if<!std::__are_same<_Up, bool>::__value,
434 insert(iterator __position, _Tp&& __x)
435 { return emplace(__position, std::move(__x)); }
438 insert(iterator __position, initializer_list<value_type> __l)
439 { this->insert(__position, __l.begin(), __l.end()); }
443 insert(iterator __position, size_type __n, const _Tp& __x)
445 __glibcxx_check_insert(__position);
446 bool __realloc = _M_requires_reallocation(this->size() + __n);
447 difference_type __offset = __position - begin();
448 _Base::insert(__position.base(), __n, __x);
450 this->_M_invalidate_all();
452 this->_M_invalidate_if(_After_nth(__offset, _M_base().begin()));
453 _M_update_guaranteed_capacity();
456 template<class _InputIterator>
458 insert(iterator __position,
459 _InputIterator __first, _InputIterator __last)
461 __glibcxx_check_insert_range(__position, __first, __last);
463 /* Hard to guess if invalidation will occur, because __last
464 - __first can't be calculated in all cases, so we just
465 punt here by checking if it did occur. */
466 typename _Base::iterator __old_begin = _M_base().begin();
467 difference_type __offset = __position - begin();
468 _Base::insert(__position.base(), __gnu_debug::__base(__first),
469 __gnu_debug::__base(__last));
471 if (_M_base().begin() != __old_begin)
472 this->_M_invalidate_all();
474 this->_M_invalidate_if(_After_nth(__offset, _M_base().begin()));
475 _M_update_guaranteed_capacity();
479 erase(iterator __position)
481 __glibcxx_check_erase(__position);
482 difference_type __offset = __position - begin();
483 typename _Base::iterator __res = _Base::erase(__position.base());
484 this->_M_invalidate_if(_After_nth(__offset, _M_base().begin()));
485 return iterator(__res, this);
489 erase(iterator __first, iterator __last)
491 // _GLIBCXX_RESOLVE_LIB_DEFECTS
492 // 151. can't currently clear() empty container
493 __glibcxx_check_erase_range(__first, __last);
495 difference_type __offset = __first - begin();
496 typename _Base::iterator __res = _Base::erase(__first.base(),
498 this->_M_invalidate_if(_After_nth(__offset, _M_base().begin()));
499 return iterator(__res, this);
507 std::swap(_M_guaranteed_capacity, __x._M_guaranteed_capacity);
514 this->_M_invalidate_all();
515 _M_guaranteed_capacity = 0;
519 _M_base() { return *this; }
522 _M_base() const { return *this; }
525 size_type _M_guaranteed_capacity;
528 _M_requires_reallocation(size_type __elements)
529 { return __elements > this->capacity(); }
532 _M_update_guaranteed_capacity()
534 if (this->size() > _M_guaranteed_capacity)
535 _M_guaranteed_capacity = this->size();
539 template<typename _Tp, typename _Alloc>
541 operator==(const vector<_Tp, _Alloc>& __lhs,
542 const vector<_Tp, _Alloc>& __rhs)
543 { return __lhs._M_base() == __rhs._M_base(); }
545 template<typename _Tp, typename _Alloc>
547 operator!=(const vector<_Tp, _Alloc>& __lhs,
548 const vector<_Tp, _Alloc>& __rhs)
549 { return __lhs._M_base() != __rhs._M_base(); }
551 template<typename _Tp, typename _Alloc>
553 operator<(const vector<_Tp, _Alloc>& __lhs,
554 const vector<_Tp, _Alloc>& __rhs)
555 { return __lhs._M_base() < __rhs._M_base(); }
557 template<typename _Tp, typename _Alloc>
559 operator<=(const vector<_Tp, _Alloc>& __lhs,
560 const vector<_Tp, _Alloc>& __rhs)
561 { return __lhs._M_base() <= __rhs._M_base(); }
563 template<typename _Tp, typename _Alloc>
565 operator>=(const vector<_Tp, _Alloc>& __lhs,
566 const vector<_Tp, _Alloc>& __rhs)
567 { return __lhs._M_base() >= __rhs._M_base(); }
569 template<typename _Tp, typename _Alloc>
571 operator>(const vector<_Tp, _Alloc>& __lhs,
572 const vector<_Tp, _Alloc>& __rhs)
573 { return __lhs._M_base() > __rhs._M_base(); }
575 template<typename _Tp, typename _Alloc>
577 swap(vector<_Tp, _Alloc>& __lhs, vector<_Tp, _Alloc>& __rhs)
578 { __lhs.swap(__rhs); }
580 } // namespace __debug
582 #ifdef __GXX_EXPERIMENTAL_CXX0X__
584 /// std::hash specialization for vector<bool>.
585 template<typename _Alloc>
586 struct hash<__debug::vector<bool, _Alloc>>
587 : public __hash_base<size_t, __debug::vector<bool, _Alloc>>
590 operator()(const __debug::vector<bool, _Alloc>& __b) const
591 { return std::hash<_GLIBCXX_STD_D::vector<bool, _Alloc>>()