1 // Vector implementation -*- C++ -*-
3 // Copyright (C) 2001-2016 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 3, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // Under Section 7 of GPL version 3, you are granted additional
17 // permissions described in the GCC Runtime Library Exception, version
18 // 3.1, as published by the Free Software Foundation.
20 // You should have received a copy of the GNU General Public License and
21 // a copy of the GCC Runtime Library Exception along with this program;
22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23 // <http://www.gnu.org/licenses/>.
28 * Hewlett-Packard Company
30 * Permission to use, copy, modify, distribute and sell this software
31 * and its documentation for any purpose is hereby granted without fee,
32 * provided that the above copyright notice appear in all copies and
33 * that both that copyright notice and this permission notice appear
34 * in supporting documentation. Hewlett-Packard Company makes no
35 * representations about the suitability of this software for any
36 * purpose. It is provided "as is" without express or implied warranty.
40 * Silicon Graphics Computer Systems, Inc.
42 * Permission to use, copy, modify, distribute and sell this software
43 * and its documentation for any purpose is hereby granted without fee,
44 * provided that the above copyright notice appear in all copies and
45 * that both that copyright notice and this permission notice appear
46 * in supporting documentation. Silicon Graphics makes no
47 * representations about the suitability of this software for any
48 * purpose. It is provided "as is" without express or implied warranty.
51 /** @file bits/stl_vector.h
52 * This is an internal header file, included by other library headers.
53 * Do not attempt to use it directly. @headername{vector}
57 #define _STL_VECTOR_H 1
59 #include <bits/stl_iterator_base_funcs.h>
60 #include <bits/functexcept.h>
61 #include <bits/concept_check.h>
62 #if __cplusplus >= 201103L
63 #include <initializer_list>
66 #include <debug/assertions.h>
68 namespace std
_GLIBCXX_VISIBILITY(default)
70 _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
72 /// See bits/stl_deque.h's _Deque_base for an explanation.
73 template<typename _Tp
, typename _Alloc
>
76 typedef typename
__gnu_cxx::__alloc_traits
<_Alloc
>::template
77 rebind
<_Tp
>::other _Tp_alloc_type
;
78 typedef typename
__gnu_cxx::__alloc_traits
<_Tp_alloc_type
>::pointer
82 : public _Tp_alloc_type
86 pointer _M_end_of_storage
;
89 : _Tp_alloc_type(), _M_start(), _M_finish(), _M_end_of_storage()
92 _Vector_impl(_Tp_alloc_type
const& __a
) _GLIBCXX_NOEXCEPT
93 : _Tp_alloc_type(__a
), _M_start(), _M_finish(), _M_end_of_storage()
96 #if __cplusplus >= 201103L
97 _Vector_impl(_Tp_alloc_type
&& __a
) noexcept
98 : _Tp_alloc_type(std::move(__a
)),
99 _M_start(), _M_finish(), _M_end_of_storage()
103 void _M_swap_data(_Vector_impl
& __x
) _GLIBCXX_NOEXCEPT
105 std::swap(_M_start
, __x
._M_start
);
106 std::swap(_M_finish
, __x
._M_finish
);
107 std::swap(_M_end_of_storage
, __x
._M_end_of_storage
);
112 typedef _Alloc allocator_type
;
115 _M_get_Tp_allocator() _GLIBCXX_NOEXCEPT
116 { return *static_cast<_Tp_alloc_type
*>(&this->_M_impl
); }
118 const _Tp_alloc_type
&
119 _M_get_Tp_allocator() const _GLIBCXX_NOEXCEPT
120 { return *static_cast<const _Tp_alloc_type
*>(&this->_M_impl
); }
123 get_allocator() const _GLIBCXX_NOEXCEPT
124 { return allocator_type(_M_get_Tp_allocator()); }
129 _Vector_base(const allocator_type
& __a
) _GLIBCXX_NOEXCEPT
132 _Vector_base(size_t __n
)
134 { _M_create_storage(__n
); }
136 _Vector_base(size_t __n
, const allocator_type
& __a
)
138 { _M_create_storage(__n
); }
140 #if __cplusplus >= 201103L
141 _Vector_base(_Tp_alloc_type
&& __a
) noexcept
142 : _M_impl(std::move(__a
)) { }
144 _Vector_base(_Vector_base
&& __x
) noexcept
145 : _M_impl(std::move(__x
._M_get_Tp_allocator()))
146 { this->_M_impl
._M_swap_data(__x
._M_impl
); }
148 _Vector_base(_Vector_base
&& __x
, const allocator_type
& __a
)
151 if (__x
.get_allocator() == __a
)
152 this->_M_impl
._M_swap_data(__x
._M_impl
);
155 size_t __n
= __x
._M_impl
._M_finish
- __x
._M_impl
._M_start
;
156 _M_create_storage(__n
);
161 ~_Vector_base() _GLIBCXX_NOEXCEPT
162 { _M_deallocate(this->_M_impl
._M_start
, this->_M_impl
._M_end_of_storage
163 - this->_M_impl
._M_start
); }
166 _Vector_impl _M_impl
;
169 _M_allocate(size_t __n
)
171 typedef __gnu_cxx::__alloc_traits
<_Tp_alloc_type
> _Tr
;
172 return __n
!= 0 ? _Tr::allocate(_M_impl
, __n
) : pointer();
176 _M_deallocate(pointer __p
, size_t __n
)
178 typedef __gnu_cxx::__alloc_traits
<_Tp_alloc_type
> _Tr
;
180 _Tr::deallocate(_M_impl
, __p
, __n
);
185 _M_create_storage(size_t __n
)
187 this->_M_impl
._M_start
= this->_M_allocate(__n
);
188 this->_M_impl
._M_finish
= this->_M_impl
._M_start
;
189 this->_M_impl
._M_end_of_storage
= this->_M_impl
._M_start
+ __n
;
195 * @brief A standard container which offers fixed time access to
196 * individual elements in any order.
200 * @tparam _Tp Type of element.
201 * @tparam _Alloc Allocator type, defaults to allocator<_Tp>.
203 * Meets the requirements of a <a href="tables.html#65">container</a>, a
204 * <a href="tables.html#66">reversible container</a>, and a
205 * <a href="tables.html#67">sequence</a>, including the
206 * <a href="tables.html#68">optional sequence requirements</a> with the
207 * %exception of @c push_front and @c pop_front.
209 * In some terminology a %vector can be described as a dynamic
210 * C-style array, it offers fast and efficient access to individual
211 * elements in any order and saves the user from worrying about
212 * memory and size allocation. Subscripting ( @c [] ) access is
213 * also provided as with C-style arrays.
215 template<typename _Tp
, typename _Alloc
= std::allocator
<_Tp
> >
216 class vector
: protected _Vector_base
<_Tp
, _Alloc
>
218 // Concept requirements.
219 typedef typename
_Alloc::value_type _Alloc_value_type
;
220 #if __cplusplus < 201103L
221 __glibcxx_class_requires(_Tp
, _SGIAssignableConcept
)
223 __glibcxx_class_requires2(_Tp
, _Alloc_value_type
, _SameTypeConcept
)
225 typedef _Vector_base
<_Tp
, _Alloc
> _Base
;
226 typedef typename
_Base::_Tp_alloc_type _Tp_alloc_type
;
227 typedef __gnu_cxx::__alloc_traits
<_Tp_alloc_type
> _Alloc_traits
;
230 typedef _Tp value_type
;
231 typedef typename
_Base::pointer pointer
;
232 typedef typename
_Alloc_traits::const_pointer const_pointer
;
233 typedef typename
_Alloc_traits::reference reference
;
234 typedef typename
_Alloc_traits::const_reference const_reference
;
235 typedef __gnu_cxx::__normal_iterator
<pointer
, vector
> iterator
;
236 typedef __gnu_cxx::__normal_iterator
<const_pointer
, vector
>
238 typedef std::reverse_iterator
<const_iterator
> const_reverse_iterator
;
239 typedef std::reverse_iterator
<iterator
> reverse_iterator
;
240 typedef size_t size_type
;
241 typedef ptrdiff_t difference_type
;
242 typedef _Alloc allocator_type
;
245 using _Base::_M_allocate
;
246 using _Base::_M_deallocate
;
247 using _Base::_M_impl
;
248 using _Base::_M_get_Tp_allocator
;
251 // [23.2.4.1] construct/copy/destroy
252 // (assign() and get_allocator() are also listed in this section)
255 * @brief Creates a %vector with no elements.
258 #if __cplusplus >= 201103L
259 noexcept(is_nothrow_default_constructible
<_Alloc
>::value
)
264 * @brief Creates a %vector with no elements.
265 * @param __a An allocator object.
268 vector(const allocator_type
& __a
) _GLIBCXX_NOEXCEPT
271 #if __cplusplus >= 201103L
273 * @brief Creates a %vector with default constructed elements.
274 * @param __n The number of elements to initially create.
275 * @param __a An allocator.
277 * This constructor fills the %vector with @a __n default
278 * constructed elements.
281 vector(size_type __n
, const allocator_type
& __a
= allocator_type())
283 { _M_default_initialize(__n
); }
286 * @brief Creates a %vector with copies of an exemplar element.
287 * @param __n The number of elements to initially create.
288 * @param __value An element to copy.
289 * @param __a An allocator.
291 * This constructor fills the %vector with @a __n copies of @a __value.
293 vector(size_type __n
, const value_type
& __value
,
294 const allocator_type
& __a
= allocator_type())
296 { _M_fill_initialize(__n
, __value
); }
299 * @brief Creates a %vector with copies of an exemplar element.
300 * @param __n The number of elements to initially create.
301 * @param __value An element to copy.
302 * @param __a An allocator.
304 * This constructor fills the %vector with @a __n copies of @a __value.
307 vector(size_type __n
, const value_type
& __value
= value_type(),
308 const allocator_type
& __a
= allocator_type())
310 { _M_fill_initialize(__n
, __value
); }
314 * @brief %Vector copy constructor.
315 * @param __x A %vector of identical element and allocator types.
317 * All the elements of @a __x are copied, but any unused capacity in
318 * @a __x will not be copied
319 * (i.e. capacity() == size() in the new %vector).
321 * The newly-created %vector uses a copy of the allocator object used
322 * by @a __x (unless the allocator traits dictate a different object).
324 vector(const vector
& __x
)
326 _Alloc_traits::_S_select_on_copy(__x
._M_get_Tp_allocator()))
328 this->_M_impl
._M_finish
=
329 std::__uninitialized_copy_a(__x
.begin(), __x
.end(),
330 this->_M_impl
._M_start
,
331 _M_get_Tp_allocator());
334 #if __cplusplus >= 201103L
336 * @brief %Vector move constructor.
337 * @param __x A %vector of identical element and allocator types.
339 * The newly-created %vector contains the exact contents of @a __x.
340 * The contents of @a __x are a valid, but unspecified %vector.
342 vector(vector
&& __x
) noexcept
343 : _Base(std::move(__x
)) { }
345 /// Copy constructor with alternative allocator
346 vector(const vector
& __x
, const allocator_type
& __a
)
347 : _Base(__x
.size(), __a
)
349 this->_M_impl
._M_finish
=
350 std::__uninitialized_copy_a(__x
.begin(), __x
.end(),
351 this->_M_impl
._M_start
,
352 _M_get_Tp_allocator());
355 /// Move constructor with alternative allocator
356 vector(vector
&& __rv
, const allocator_type
& __m
)
357 noexcept(_Alloc_traits::_S_always_equal())
358 : _Base(std::move(__rv
), __m
)
360 if (__rv
.get_allocator() != __m
)
362 this->_M_impl
._M_finish
=
363 std::__uninitialized_move_a(__rv
.begin(), __rv
.end(),
364 this->_M_impl
._M_start
,
365 _M_get_Tp_allocator());
371 * @brief Builds a %vector from an initializer list.
372 * @param __l An initializer_list.
373 * @param __a An allocator.
375 * Create a %vector consisting of copies of the elements in the
376 * initializer_list @a __l.
378 * This will call the element type's copy constructor N times
379 * (where N is @a __l.size()) and do no memory reallocation.
381 vector(initializer_list
<value_type
> __l
,
382 const allocator_type
& __a
= allocator_type())
385 _M_range_initialize(__l
.begin(), __l
.end(),
386 random_access_iterator_tag());
391 * @brief Builds a %vector from a range.
392 * @param __first An input iterator.
393 * @param __last An input iterator.
394 * @param __a An allocator.
396 * Create a %vector consisting of copies of the elements from
399 * If the iterators are forward, bidirectional, or
400 * random-access, then this will call the elements' copy
401 * constructor N times (where N is distance(first,last)) and do
402 * no memory reallocation. But if only input iterators are
403 * used, then this will do at most 2N calls to the copy
404 * constructor, and logN memory reallocations.
406 #if __cplusplus >= 201103L
407 template<typename _InputIterator
,
408 typename
= std::_RequireInputIter
<_InputIterator
>>
409 vector(_InputIterator __first
, _InputIterator __last
,
410 const allocator_type
& __a
= allocator_type())
412 { _M_initialize_dispatch(__first
, __last
, __false_type()); }
414 template<typename _InputIterator
>
415 vector(_InputIterator __first
, _InputIterator __last
,
416 const allocator_type
& __a
= allocator_type())
419 // Check whether it's an integral type. If so, it's not an iterator.
420 typedef typename
std::__is_integer
<_InputIterator
>::__type _Integral
;
421 _M_initialize_dispatch(__first
, __last
, _Integral());
426 * The dtor only erases the elements, and note that if the
427 * elements themselves are pointers, the pointed-to memory is
428 * not touched in any way. Managing the pointer is the user's
431 ~vector() _GLIBCXX_NOEXCEPT
432 { std::_Destroy(this->_M_impl
._M_start
, this->_M_impl
._M_finish
,
433 _M_get_Tp_allocator()); }
436 * @brief %Vector assignment operator.
437 * @param __x A %vector of identical element and allocator types.
439 * All the elements of @a __x are copied, but any unused capacity in
440 * @a __x will not be copied.
442 * Whether the allocator is copied depends on the allocator traits.
445 operator=(const vector
& __x
);
447 #if __cplusplus >= 201103L
449 * @brief %Vector move assignment operator.
450 * @param __x A %vector of identical element and allocator types.
452 * The contents of @a __x are moved into this %vector (without copying,
453 * if the allocators permit it).
454 * Afterwards @a __x is a valid, but unspecified %vector.
456 * Whether the allocator is moved depends on the allocator traits.
459 operator=(vector
&& __x
) noexcept(_Alloc_traits::_S_nothrow_move())
461 constexpr bool __move_storage
=
462 _Alloc_traits::_S_propagate_on_move_assign()
463 || _Alloc_traits::_S_always_equal();
464 _M_move_assign(std::move(__x
), __bool_constant
<__move_storage
>());
469 * @brief %Vector list assignment operator.
470 * @param __l An initializer_list.
472 * This function fills a %vector with copies of the elements in the
473 * initializer list @a __l.
475 * Note that the assignment completely changes the %vector and
476 * that the resulting %vector's size is the same as the number
477 * of elements assigned.
480 operator=(initializer_list
<value_type
> __l
)
482 this->_M_assign_aux(__l
.begin(), __l
.end(),
483 random_access_iterator_tag());
489 * @brief Assigns a given value to a %vector.
490 * @param __n Number of elements to be assigned.
491 * @param __val Value to be assigned.
493 * This function fills a %vector with @a __n copies of the given
494 * value. Note that the assignment completely changes the
495 * %vector and that the resulting %vector's size is the same as
496 * the number of elements assigned.
499 assign(size_type __n
, const value_type
& __val
)
500 { _M_fill_assign(__n
, __val
); }
503 * @brief Assigns a range to a %vector.
504 * @param __first An input iterator.
505 * @param __last An input iterator.
507 * This function fills a %vector with copies of the elements in the
508 * range [__first,__last).
510 * Note that the assignment completely changes the %vector and
511 * that the resulting %vector's size is the same as the number
512 * of elements assigned.
514 #if __cplusplus >= 201103L
515 template<typename _InputIterator
,
516 typename
= std::_RequireInputIter
<_InputIterator
>>
518 assign(_InputIterator __first
, _InputIterator __last
)
519 { _M_assign_dispatch(__first
, __last
, __false_type()); }
521 template<typename _InputIterator
>
523 assign(_InputIterator __first
, _InputIterator __last
)
525 // Check whether it's an integral type. If so, it's not an iterator.
526 typedef typename
std::__is_integer
<_InputIterator
>::__type _Integral
;
527 _M_assign_dispatch(__first
, __last
, _Integral());
531 #if __cplusplus >= 201103L
533 * @brief Assigns an initializer list to a %vector.
534 * @param __l An initializer_list.
536 * This function fills a %vector with copies of the elements in the
537 * initializer list @a __l.
539 * Note that the assignment completely changes the %vector and
540 * that the resulting %vector's size is the same as the number
541 * of elements assigned.
544 assign(initializer_list
<value_type
> __l
)
546 this->_M_assign_aux(__l
.begin(), __l
.end(),
547 random_access_iterator_tag());
551 /// Get a copy of the memory allocation object.
552 using _Base::get_allocator
;
556 * Returns a read/write iterator that points to the first
557 * element in the %vector. Iteration is done in ordinary
561 begin() _GLIBCXX_NOEXCEPT
562 { return iterator(this->_M_impl
._M_start
); }
565 * Returns a read-only (constant) iterator that points to the
566 * first element in the %vector. Iteration is done in ordinary
570 begin() const _GLIBCXX_NOEXCEPT
571 { return const_iterator(this->_M_impl
._M_start
); }
574 * Returns a read/write iterator that points one past the last
575 * element in the %vector. Iteration is done in ordinary
579 end() _GLIBCXX_NOEXCEPT
580 { return iterator(this->_M_impl
._M_finish
); }
583 * Returns a read-only (constant) iterator that points one past
584 * the last element in the %vector. Iteration is done in
585 * ordinary element order.
588 end() const _GLIBCXX_NOEXCEPT
589 { return const_iterator(this->_M_impl
._M_finish
); }
592 * Returns a read/write reverse iterator that points to the
593 * last element in the %vector. Iteration is done in reverse
597 rbegin() _GLIBCXX_NOEXCEPT
598 { return reverse_iterator(end()); }
601 * Returns a read-only (constant) reverse iterator that points
602 * to the last element in the %vector. Iteration is done in
603 * reverse element order.
605 const_reverse_iterator
606 rbegin() const _GLIBCXX_NOEXCEPT
607 { return const_reverse_iterator(end()); }
610 * Returns a read/write reverse iterator that points to one
611 * before the first element in the %vector. Iteration is done
612 * in reverse element order.
615 rend() _GLIBCXX_NOEXCEPT
616 { return reverse_iterator(begin()); }
619 * Returns a read-only (constant) reverse iterator that points
620 * to one before the first element in the %vector. Iteration
621 * is done in reverse element order.
623 const_reverse_iterator
624 rend() const _GLIBCXX_NOEXCEPT
625 { return const_reverse_iterator(begin()); }
627 #if __cplusplus >= 201103L
629 * Returns a read-only (constant) iterator that points to the
630 * first element in the %vector. Iteration is done in ordinary
634 cbegin() const noexcept
635 { return const_iterator(this->_M_impl
._M_start
); }
638 * Returns a read-only (constant) iterator that points one past
639 * the last element in the %vector. Iteration is done in
640 * ordinary element order.
643 cend() const noexcept
644 { return const_iterator(this->_M_impl
._M_finish
); }
647 * Returns a read-only (constant) reverse iterator that points
648 * to the last element in the %vector. Iteration is done in
649 * reverse element order.
651 const_reverse_iterator
652 crbegin() const noexcept
653 { return const_reverse_iterator(end()); }
656 * Returns a read-only (constant) reverse iterator that points
657 * to one before the first element in the %vector. Iteration
658 * is done in reverse element order.
660 const_reverse_iterator
661 crend() const noexcept
662 { return const_reverse_iterator(begin()); }
665 // [23.2.4.2] capacity
666 /** Returns the number of elements in the %vector. */
668 size() const _GLIBCXX_NOEXCEPT
669 { return size_type(this->_M_impl
._M_finish
- this->_M_impl
._M_start
); }
671 /** Returns the size() of the largest possible %vector. */
673 max_size() const _GLIBCXX_NOEXCEPT
674 { return _Alloc_traits::max_size(_M_get_Tp_allocator()); }
676 #if __cplusplus >= 201103L
678 * @brief Resizes the %vector to the specified number of elements.
679 * @param __new_size Number of elements the %vector should contain.
681 * This function will %resize the %vector to the specified
682 * number of elements. If the number is smaller than the
683 * %vector's current size the %vector is truncated, otherwise
684 * default constructed elements are appended.
687 resize(size_type __new_size
)
689 if (__new_size
> size())
690 _M_default_append(__new_size
- size());
691 else if (__new_size
< size())
692 _M_erase_at_end(this->_M_impl
._M_start
+ __new_size
);
696 * @brief Resizes the %vector to the specified number of elements.
697 * @param __new_size Number of elements the %vector should contain.
698 * @param __x Data with which new elements should be populated.
700 * This function will %resize the %vector to the specified
701 * number of elements. If the number is smaller than the
702 * %vector's current size the %vector is truncated, otherwise
703 * the %vector is extended and new elements are populated with
707 resize(size_type __new_size
, const value_type
& __x
)
709 if (__new_size
> size())
710 _M_fill_insert(end(), __new_size
- size(), __x
);
711 else if (__new_size
< size())
712 _M_erase_at_end(this->_M_impl
._M_start
+ __new_size
);
716 * @brief Resizes the %vector to the specified number of elements.
717 * @param __new_size Number of elements the %vector should contain.
718 * @param __x Data with which new elements should be populated.
720 * This function will %resize the %vector to the specified
721 * number of elements. If the number is smaller than the
722 * %vector's current size the %vector is truncated, otherwise
723 * the %vector is extended and new elements are populated with
727 resize(size_type __new_size
, value_type __x
= value_type())
729 if (__new_size
> size())
730 _M_fill_insert(end(), __new_size
- size(), __x
);
731 else if (__new_size
< size())
732 _M_erase_at_end(this->_M_impl
._M_start
+ __new_size
);
736 #if __cplusplus >= 201103L
737 /** A non-binding request to reduce capacity() to size(). */
740 { _M_shrink_to_fit(); }
744 * Returns the total number of elements that the %vector can
745 * hold before needing to allocate more memory.
748 capacity() const _GLIBCXX_NOEXCEPT
749 { return size_type(this->_M_impl
._M_end_of_storage
750 - this->_M_impl
._M_start
); }
753 * Returns true if the %vector is empty. (Thus begin() would
757 empty() const _GLIBCXX_NOEXCEPT
758 { return begin() == end(); }
761 * @brief Attempt to preallocate enough memory for specified number of
763 * @param __n Number of elements required.
764 * @throw std::length_error If @a n exceeds @c max_size().
766 * This function attempts to reserve enough memory for the
767 * %vector to hold the specified number of elements. If the
768 * number requested is more than max_size(), length_error is
771 * The advantage of this function is that if optimal code is a
772 * necessity and the user can determine the number of elements
773 * that will be required, the user can reserve the memory in
774 * %advance, and thus prevent a possible reallocation of memory
775 * and copying of %vector data.
778 reserve(size_type __n
);
782 * @brief Subscript access to the data contained in the %vector.
783 * @param __n The index of the element for which data should be
785 * @return Read/write reference to data.
787 * This operator allows for easy, array-style, data access.
788 * Note that data access with this operator is unchecked and
789 * out_of_range lookups are not defined. (For checked lookups
793 operator[](size_type __n
) _GLIBCXX_NOEXCEPT
795 __glibcxx_requires_subscript(__n
);
796 return *(this->_M_impl
._M_start
+ __n
);
800 * @brief Subscript access to the data contained in the %vector.
801 * @param __n The index of the element for which data should be
803 * @return Read-only (constant) reference to data.
805 * This operator allows for easy, array-style, data access.
806 * Note that data access with this operator is unchecked and
807 * out_of_range lookups are not defined. (For checked lookups
811 operator[](size_type __n
) const _GLIBCXX_NOEXCEPT
813 __glibcxx_requires_subscript(__n
);
814 return *(this->_M_impl
._M_start
+ __n
);
818 /// Safety check used only from at().
820 _M_range_check(size_type __n
) const
822 if (__n
>= this->size())
823 __throw_out_of_range_fmt(__N("vector::_M_range_check: __n "
824 "(which is %zu) >= this->size() "
831 * @brief Provides access to the data contained in the %vector.
832 * @param __n The index of the element for which data should be
834 * @return Read/write reference to data.
835 * @throw std::out_of_range If @a __n is an invalid index.
837 * This function provides for safer data access. The parameter
838 * is first checked that it is in the range of the vector. The
839 * function throws out_of_range if the check fails.
849 * @brief Provides access to the data contained in the %vector.
850 * @param __n The index of the element for which data should be
852 * @return Read-only (constant) reference to data.
853 * @throw std::out_of_range If @a __n is an invalid index.
855 * This function provides for safer data access. The parameter
856 * is first checked that it is in the range of the vector. The
857 * function throws out_of_range if the check fails.
860 at(size_type __n
) const
867 * Returns a read/write reference to the data at the first
868 * element of the %vector.
871 front() _GLIBCXX_NOEXCEPT
873 __glibcxx_requires_nonempty();
878 * Returns a read-only (constant) reference to the data at the first
879 * element of the %vector.
882 front() const _GLIBCXX_NOEXCEPT
884 __glibcxx_requires_nonempty();
889 * Returns a read/write reference to the data at the last
890 * element of the %vector.
893 back() _GLIBCXX_NOEXCEPT
895 __glibcxx_requires_nonempty();
900 * Returns a read-only (constant) reference to the data at the
901 * last element of the %vector.
904 back() const _GLIBCXX_NOEXCEPT
906 __glibcxx_requires_nonempty();
910 // _GLIBCXX_RESOLVE_LIB_DEFECTS
911 // DR 464. Suggestion for new member functions in standard containers.
914 * Returns a pointer such that [data(), data() + size()) is a valid
915 * range. For a non-empty %vector, data() == &front().
918 data() _GLIBCXX_NOEXCEPT
919 { return _M_data_ptr(this->_M_impl
._M_start
); }
922 data() const _GLIBCXX_NOEXCEPT
923 { return _M_data_ptr(this->_M_impl
._M_start
); }
925 // [23.2.4.3] modifiers
927 * @brief Add data to the end of the %vector.
928 * @param __x Data to be added.
930 * This is a typical stack operation. The function creates an
931 * element at the end of the %vector and assigns the given data
932 * to it. Due to the nature of a %vector this operation can be
933 * done in constant time if the %vector has preallocated space
937 push_back(const value_type
& __x
)
939 if (this->_M_impl
._M_finish
!= this->_M_impl
._M_end_of_storage
)
941 _Alloc_traits::construct(this->_M_impl
, this->_M_impl
._M_finish
,
943 ++this->_M_impl
._M_finish
;
946 _M_realloc_insert(end(), __x
);
949 #if __cplusplus >= 201103L
951 push_back(value_type
&& __x
)
952 { emplace_back(std::move(__x
)); }
954 template<typename
... _Args
>
955 #if __cplusplus > 201402L
960 emplace_back(_Args
&&... __args
);
964 * @brief Removes last element.
966 * This is a typical stack operation. It shrinks the %vector by one.
968 * Note that no data is returned, and if the last element's
969 * data is needed, it should be retrieved before pop_back() is
973 pop_back() _GLIBCXX_NOEXCEPT
975 __glibcxx_requires_nonempty();
976 --this->_M_impl
._M_finish
;
977 _Alloc_traits::destroy(this->_M_impl
, this->_M_impl
._M_finish
);
980 #if __cplusplus >= 201103L
982 * @brief Inserts an object in %vector before specified iterator.
983 * @param __position A const_iterator into the %vector.
984 * @param __args Arguments.
985 * @return An iterator that points to the inserted data.
987 * This function will insert an object of type T constructed
988 * with T(std::forward<Args>(args)...) before the specified location.
989 * Note that this kind of operation could be expensive for a %vector
990 * and if it is frequently used the user should consider using
993 template<typename
... _Args
>
995 emplace(const_iterator __position
, _Args
&&... __args
)
996 { return _M_emplace_aux(__position
, std::forward
<_Args
>(__args
)...); }
999 * @brief Inserts given value into %vector before specified iterator.
1000 * @param __position A const_iterator into the %vector.
1001 * @param __x Data to be inserted.
1002 * @return An iterator that points to the inserted data.
1004 * This function will insert a copy of the given value before
1005 * the specified location. Note that this kind of operation
1006 * could be expensive for a %vector and if it is frequently
1007 * used the user should consider using std::list.
1010 insert(const_iterator __position
, const value_type
& __x
);
1013 * @brief Inserts given value into %vector before specified iterator.
1014 * @param __position An iterator into the %vector.
1015 * @param __x Data to be inserted.
1016 * @return An iterator that points to the inserted data.
1018 * This function will insert a copy of the given value before
1019 * the specified location. Note that this kind of operation
1020 * could be expensive for a %vector and if it is frequently
1021 * used the user should consider using std::list.
1024 insert(iterator __position
, const value_type
& __x
);
1027 #if __cplusplus >= 201103L
1029 * @brief Inserts given rvalue into %vector before specified iterator.
1030 * @param __position A const_iterator into the %vector.
1031 * @param __x Data to be inserted.
1032 * @return An iterator that points to the inserted data.
1034 * This function will insert a copy of the given rvalue before
1035 * the specified location. Note that this kind of operation
1036 * could be expensive for a %vector and if it is frequently
1037 * used the user should consider using std::list.
1040 insert(const_iterator __position
, value_type
&& __x
)
1041 { return _M_insert_rval(__position
, std::move(__x
)); }
1044 * @brief Inserts an initializer_list into the %vector.
1045 * @param __position An iterator into the %vector.
1046 * @param __l An initializer_list.
1048 * This function will insert copies of the data in the
1049 * initializer_list @a l into the %vector before the location
1050 * specified by @a position.
1052 * Note that this kind of operation could be expensive for a
1053 * %vector and if it is frequently used the user should
1054 * consider using std::list.
1057 insert(const_iterator __position
, initializer_list
<value_type
> __l
)
1059 auto __offset
= __position
- cbegin();
1060 _M_range_insert(begin() + __offset
, __l
.begin(), __l
.end(),
1061 std::random_access_iterator_tag());
1062 return begin() + __offset
;
1066 #if __cplusplus >= 201103L
1068 * @brief Inserts a number of copies of given data into the %vector.
1069 * @param __position A const_iterator into the %vector.
1070 * @param __n Number of elements to be inserted.
1071 * @param __x Data to be inserted.
1072 * @return An iterator that points to the inserted data.
1074 * This function will insert a specified number of copies of
1075 * the given data before the location specified by @a position.
1077 * Note that this kind of operation could be expensive for a
1078 * %vector and if it is frequently used the user should
1079 * consider using std::list.
1082 insert(const_iterator __position
, size_type __n
, const value_type
& __x
)
1084 difference_type __offset
= __position
- cbegin();
1085 _M_fill_insert(begin() + __offset
, __n
, __x
);
1086 return begin() + __offset
;
1090 * @brief Inserts a number of copies of given data into the %vector.
1091 * @param __position An iterator into the %vector.
1092 * @param __n Number of elements to be inserted.
1093 * @param __x Data to be inserted.
1095 * This function will insert a specified number of copies of
1096 * the given data before the location specified by @a position.
1098 * Note that this kind of operation could be expensive for a
1099 * %vector and if it is frequently used the user should
1100 * consider using std::list.
1103 insert(iterator __position
, size_type __n
, const value_type
& __x
)
1104 { _M_fill_insert(__position
, __n
, __x
); }
1107 #if __cplusplus >= 201103L
1109 * @brief Inserts a range into the %vector.
1110 * @param __position A const_iterator into the %vector.
1111 * @param __first An input iterator.
1112 * @param __last An input iterator.
1113 * @return An iterator that points to the inserted data.
1115 * This function will insert copies of the data in the range
1116 * [__first,__last) into the %vector before the location specified
1119 * Note that this kind of operation could be expensive for a
1120 * %vector and if it is frequently used the user should
1121 * consider using std::list.
1123 template<typename _InputIterator
,
1124 typename
= std::_RequireInputIter
<_InputIterator
>>
1126 insert(const_iterator __position
, _InputIterator __first
,
1127 _InputIterator __last
)
1129 difference_type __offset
= __position
- cbegin();
1130 _M_insert_dispatch(begin() + __offset
,
1131 __first
, __last
, __false_type());
1132 return begin() + __offset
;
1136 * @brief Inserts a range into the %vector.
1137 * @param __position An iterator into the %vector.
1138 * @param __first An input iterator.
1139 * @param __last An input iterator.
1141 * This function will insert copies of the data in the range
1142 * [__first,__last) into the %vector before the location specified
1145 * Note that this kind of operation could be expensive for a
1146 * %vector and if it is frequently used the user should
1147 * consider using std::list.
1149 template<typename _InputIterator
>
1151 insert(iterator __position
, _InputIterator __first
,
1152 _InputIterator __last
)
1154 // Check whether it's an integral type. If so, it's not an iterator.
1155 typedef typename
std::__is_integer
<_InputIterator
>::__type _Integral
;
1156 _M_insert_dispatch(__position
, __first
, __last
, _Integral());
1161 * @brief Remove element at given position.
1162 * @param __position Iterator pointing to element to be erased.
1163 * @return An iterator pointing to the next element (or end()).
1165 * This function will erase the element at the given position and thus
1166 * shorten the %vector by one.
1168 * Note This operation could be expensive and if it is
1169 * frequently used the user should consider using std::list.
1170 * The user is also cautioned that this function only erases
1171 * the element, and that if the element is itself a pointer,
1172 * the pointed-to memory is not touched in any way. Managing
1173 * the pointer is the user's responsibility.
1176 #if __cplusplus >= 201103L
1177 erase(const_iterator __position
)
1178 { return _M_erase(begin() + (__position
- cbegin())); }
1180 erase(iterator __position
)
1181 { return _M_erase(__position
); }
1185 * @brief Remove a range of elements.
1186 * @param __first Iterator pointing to the first element to be erased.
1187 * @param __last Iterator pointing to one past the last element to be
1189 * @return An iterator pointing to the element pointed to by @a __last
1190 * prior to erasing (or end()).
1192 * This function will erase the elements in the range
1193 * [__first,__last) and shorten the %vector accordingly.
1195 * Note This operation could be expensive and if it is
1196 * frequently used the user should consider using std::list.
1197 * The user is also cautioned that this function only erases
1198 * the elements, and that if the elements themselves are
1199 * pointers, the pointed-to memory is not touched in any way.
1200 * Managing the pointer is the user's responsibility.
1203 #if __cplusplus >= 201103L
1204 erase(const_iterator __first
, const_iterator __last
)
1206 const auto __beg
= begin();
1207 const auto __cbeg
= cbegin();
1208 return _M_erase(__beg
+ (__first
- __cbeg
), __beg
+ (__last
- __cbeg
));
1211 erase(iterator __first
, iterator __last
)
1212 { return _M_erase(__first
, __last
); }
1216 * @brief Swaps data with another %vector.
1217 * @param __x A %vector of the same element and allocator types.
1219 * This exchanges the elements between two vectors in constant time.
1220 * (Three pointers, so it should be quite fast.)
1221 * Note that the global std::swap() function is specialized such that
1222 * std::swap(v1,v2) will feed to this function.
1224 * Whether the allocators are swapped depends on the allocator traits.
1227 swap(vector
& __x
) _GLIBCXX_NOEXCEPT
1229 #if __cplusplus >= 201103L
1230 __glibcxx_assert(_Alloc_traits::propagate_on_container_swap::value
1231 || _M_get_Tp_allocator() == __x
._M_get_Tp_allocator());
1233 this->_M_impl
._M_swap_data(__x
._M_impl
);
1234 _Alloc_traits::_S_on_swap(_M_get_Tp_allocator(),
1235 __x
._M_get_Tp_allocator());
1239 * Erases all the elements. Note that this function only erases the
1240 * elements, and that if the elements themselves are pointers, the
1241 * pointed-to memory is not touched in any way. Managing the pointer is
1242 * the user's responsibility.
1245 clear() _GLIBCXX_NOEXCEPT
1246 { _M_erase_at_end(this->_M_impl
._M_start
); }
1250 * Memory expansion handler. Uses the member allocation function to
1251 * obtain @a n bytes of memory, and then copies [first,last) into it.
1253 template<typename _ForwardIterator
>
1255 _M_allocate_and_copy(size_type __n
,
1256 _ForwardIterator __first
, _ForwardIterator __last
)
1258 pointer __result
= this->_M_allocate(__n
);
1261 std::__uninitialized_copy_a(__first
, __last
, __result
,
1262 _M_get_Tp_allocator());
1267 _M_deallocate(__result
, __n
);
1268 __throw_exception_again
;
1273 // Internal constructor functions follow.
1275 // Called by the range constructor to implement [23.1.1]/9
1277 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1278 // 438. Ambiguity in the "do the right thing" clause
1279 template<typename _Integer
>
1281 _M_initialize_dispatch(_Integer __n
, _Integer __value
, __true_type
)
1283 this->_M_impl
._M_start
= _M_allocate(static_cast<size_type
>(__n
));
1284 this->_M_impl
._M_end_of_storage
=
1285 this->_M_impl
._M_start
+ static_cast<size_type
>(__n
);
1286 _M_fill_initialize(static_cast<size_type
>(__n
), __value
);
1289 // Called by the range constructor to implement [23.1.1]/9
1290 template<typename _InputIterator
>
1292 _M_initialize_dispatch(_InputIterator __first
, _InputIterator __last
,
1295 typedef typename
std::iterator_traits
<_InputIterator
>::
1296 iterator_category _IterCategory
;
1297 _M_range_initialize(__first
, __last
, _IterCategory());
1300 // Called by the second initialize_dispatch above
1301 template<typename _InputIterator
>
1303 _M_range_initialize(_InputIterator __first
,
1304 _InputIterator __last
, std::input_iterator_tag
)
1306 for (; __first
!= __last
; ++__first
)
1307 #if __cplusplus >= 201103L
1308 emplace_back(*__first
);
1310 push_back(*__first
);
1314 // Called by the second initialize_dispatch above
1315 template<typename _ForwardIterator
>
1317 _M_range_initialize(_ForwardIterator __first
,
1318 _ForwardIterator __last
, std::forward_iterator_tag
)
1320 const size_type __n
= std::distance(__first
, __last
);
1321 this->_M_impl
._M_start
= this->_M_allocate(__n
);
1322 this->_M_impl
._M_end_of_storage
= this->_M_impl
._M_start
+ __n
;
1323 this->_M_impl
._M_finish
=
1324 std::__uninitialized_copy_a(__first
, __last
,
1325 this->_M_impl
._M_start
,
1326 _M_get_Tp_allocator());
1329 // Called by the first initialize_dispatch above and by the
1330 // vector(n,value,a) constructor.
1332 _M_fill_initialize(size_type __n
, const value_type
& __value
)
1334 this->_M_impl
._M_finish
=
1335 std::__uninitialized_fill_n_a(this->_M_impl
._M_start
, __n
, __value
,
1336 _M_get_Tp_allocator());
1339 #if __cplusplus >= 201103L
1340 // Called by the vector(n) constructor.
1342 _M_default_initialize(size_type __n
)
1344 this->_M_impl
._M_finish
=
1345 std::__uninitialized_default_n_a(this->_M_impl
._M_start
, __n
,
1346 _M_get_Tp_allocator());
1350 // Internal assign functions follow. The *_aux functions do the actual
1351 // assignment work for the range versions.
1353 // Called by the range assign to implement [23.1.1]/9
1355 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1356 // 438. Ambiguity in the "do the right thing" clause
1357 template<typename _Integer
>
1359 _M_assign_dispatch(_Integer __n
, _Integer __val
, __true_type
)
1360 { _M_fill_assign(__n
, __val
); }
1362 // Called by the range assign to implement [23.1.1]/9
1363 template<typename _InputIterator
>
1365 _M_assign_dispatch(_InputIterator __first
, _InputIterator __last
,
1367 { _M_assign_aux(__first
, __last
, std::__iterator_category(__first
)); }
1369 // Called by the second assign_dispatch above
1370 template<typename _InputIterator
>
1372 _M_assign_aux(_InputIterator __first
, _InputIterator __last
,
1373 std::input_iterator_tag
);
1375 // Called by the second assign_dispatch above
1376 template<typename _ForwardIterator
>
1378 _M_assign_aux(_ForwardIterator __first
, _ForwardIterator __last
,
1379 std::forward_iterator_tag
);
1381 // Called by assign(n,t), and the range assign when it turns out
1382 // to be the same thing.
1384 _M_fill_assign(size_type __n
, const value_type
& __val
);
1386 // Internal insert functions follow.
1388 // Called by the range insert to implement [23.1.1]/9
1390 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1391 // 438. Ambiguity in the "do the right thing" clause
1392 template<typename _Integer
>
1394 _M_insert_dispatch(iterator __pos
, _Integer __n
, _Integer __val
,
1396 { _M_fill_insert(__pos
, __n
, __val
); }
1398 // Called by the range insert to implement [23.1.1]/9
1399 template<typename _InputIterator
>
1401 _M_insert_dispatch(iterator __pos
, _InputIterator __first
,
1402 _InputIterator __last
, __false_type
)
1404 _M_range_insert(__pos
, __first
, __last
,
1405 std::__iterator_category(__first
));
1408 // Called by the second insert_dispatch above
1409 template<typename _InputIterator
>
1411 _M_range_insert(iterator __pos
, _InputIterator __first
,
1412 _InputIterator __last
, std::input_iterator_tag
);
1414 // Called by the second insert_dispatch above
1415 template<typename _ForwardIterator
>
1417 _M_range_insert(iterator __pos
, _ForwardIterator __first
,
1418 _ForwardIterator __last
, std::forward_iterator_tag
);
1420 // Called by insert(p,n,x), and the range insert when it turns out to be
1423 _M_fill_insert(iterator __pos
, size_type __n
, const value_type
& __x
);
1425 #if __cplusplus >= 201103L
1426 // Called by resize(n).
1428 _M_default_append(size_type __n
);
1434 #if __cplusplus < 201103L
1435 // Called by insert(p,x)
1437 _M_insert_aux(iterator __position
, const value_type
& __x
);
1440 _M_realloc_insert(iterator __position
, const value_type
& __x
);
1442 // A value_type object constructed with _Alloc_traits::construct()
1443 // and destroyed with _Alloc_traits::destroy().
1444 struct _Temporary_value
1446 template<typename
... _Args
>
1448 _Temporary_value(vector
* __vec
, _Args
&&... __args
) : _M_this(__vec
)
1450 _Alloc_traits::construct(_M_this
->_M_impl
, _M_ptr(),
1451 std::forward
<_Args
>(__args
)...);
1455 { _Alloc_traits::destroy(_M_this
->_M_impl
, _M_ptr()); }
1458 _M_val() { return *reinterpret_cast<_Tp
*>(&__buf
); }
1462 _M_ptr() { return pointer_traits
<pointer
>::pointer_to(_M_val()); }
1465 typename aligned_storage
<sizeof(_Tp
), alignof(_Tp
)>::type __buf
;
1468 // Called by insert(p,x) and other functions when insertion needs to
1469 // reallocate or move existing elements. _Arg is either _Tp& or _Tp.
1470 template<typename _Arg
>
1472 _M_insert_aux(iterator __position
, _Arg
&& __arg
);
1474 template<typename
... _Args
>
1476 _M_realloc_insert(iterator __position
, _Args
&&... __args
);
1478 // Either move-construct at the end, or forward to _M_insert_aux.
1480 _M_insert_rval(const_iterator __position
, value_type
&& __v
);
1482 // Try to emplace at the end, otherwise forward to _M_insert_aux.
1483 template<typename
... _Args
>
1485 _M_emplace_aux(const_iterator __position
, _Args
&&... __args
);
1487 // Emplacing an rvalue of the correct type can use _M_insert_rval.
1489 _M_emplace_aux(const_iterator __position
, value_type
&& __v
)
1490 { return _M_insert_rval(__position
, std::move(__v
)); }
1493 // Called by _M_fill_insert, _M_insert_aux etc.
1495 _M_check_len(size_type __n
, const char* __s
) const
1497 if (max_size() - size() < __n
)
1498 __throw_length_error(__N(__s
));
1500 const size_type __len
= size() + std::max(size(), __n
);
1501 return (__len
< size() || __len
> max_size()) ? max_size() : __len
;
1504 // Internal erase functions follow.
1506 // Called by erase(q1,q2), clear(), resize(), _M_fill_assign,
1509 _M_erase_at_end(pointer __pos
) _GLIBCXX_NOEXCEPT
1511 std::_Destroy(__pos
, this->_M_impl
._M_finish
, _M_get_Tp_allocator());
1512 this->_M_impl
._M_finish
= __pos
;
1516 _M_erase(iterator __position
);
1519 _M_erase(iterator __first
, iterator __last
);
1521 #if __cplusplus >= 201103L
1523 // Constant-time move assignment when source object's memory can be
1524 // moved, either because the source's allocator will move too
1525 // or because the allocators are equal.
1527 _M_move_assign(vector
&& __x
, std::true_type
) noexcept
1529 vector
__tmp(get_allocator());
1530 this->_M_impl
._M_swap_data(__tmp
._M_impl
);
1531 this->_M_impl
._M_swap_data(__x
._M_impl
);
1532 std::__alloc_on_move(_M_get_Tp_allocator(), __x
._M_get_Tp_allocator());
1535 // Do move assignment when it might not be possible to move source
1536 // object's memory, resulting in a linear-time operation.
1538 _M_move_assign(vector
&& __x
, std::false_type
)
1540 if (__x
._M_get_Tp_allocator() == this->_M_get_Tp_allocator())
1541 _M_move_assign(std::move(__x
), std::true_type());
1544 // The rvalue's allocator cannot be moved and is not equal,
1545 // so we need to individually move each element.
1546 this->assign(std::__make_move_if_noexcept_iterator(__x
.begin()),
1547 std::__make_move_if_noexcept_iterator(__x
.end()));
1553 template<typename _Up
>
1555 _M_data_ptr(_Up
* __ptr
) const _GLIBCXX_NOEXCEPT
1558 #if __cplusplus >= 201103L
1559 template<typename _Ptr
>
1560 typename
std::pointer_traits
<_Ptr
>::element_type
*
1561 _M_data_ptr(_Ptr __ptr
) const
1562 { return empty() ? nullptr : std::__addressof(*__ptr
); }
1564 template<typename _Up
>
1566 _M_data_ptr(_Up
* __ptr
) _GLIBCXX_NOEXCEPT
1569 template<typename _Ptr
>
1571 _M_data_ptr(_Ptr __ptr
)
1572 { return __ptr
.operator->(); }
1574 template<typename _Ptr
>
1576 _M_data_ptr(_Ptr __ptr
) const
1577 { return __ptr
.operator->(); }
1583 * @brief Vector equality comparison.
1584 * @param __x A %vector.
1585 * @param __y A %vector of the same type as @a __x.
1586 * @return True iff the size and elements of the vectors are equal.
1588 * This is an equivalence relation. It is linear in the size of the
1589 * vectors. Vectors are considered equivalent if their sizes are equal,
1590 * and if corresponding elements compare equal.
1592 template<typename _Tp
, typename _Alloc
>
1594 operator==(const vector
<_Tp
, _Alloc
>& __x
, const vector
<_Tp
, _Alloc
>& __y
)
1595 { return (__x
.size() == __y
.size()
1596 && std::equal(__x
.begin(), __x
.end(), __y
.begin())); }
1599 * @brief Vector ordering relation.
1600 * @param __x A %vector.
1601 * @param __y A %vector of the same type as @a __x.
1602 * @return True iff @a __x is lexicographically less than @a __y.
1604 * This is a total ordering relation. It is linear in the size of the
1605 * vectors. The elements must be comparable with @c <.
1607 * See std::lexicographical_compare() for how the determination is made.
1609 template<typename _Tp
, typename _Alloc
>
1611 operator<(const vector
<_Tp
, _Alloc
>& __x
, const vector
<_Tp
, _Alloc
>& __y
)
1612 { return std::lexicographical_compare(__x
.begin(), __x
.end(),
1613 __y
.begin(), __y
.end()); }
1615 /// Based on operator==
1616 template<typename _Tp
, typename _Alloc
>
1618 operator!=(const vector
<_Tp
, _Alloc
>& __x
, const vector
<_Tp
, _Alloc
>& __y
)
1619 { return !(__x
== __y
); }
1621 /// Based on operator<
1622 template<typename _Tp
, typename _Alloc
>
1624 operator>(const vector
<_Tp
, _Alloc
>& __x
, const vector
<_Tp
, _Alloc
>& __y
)
1625 { return __y
< __x
; }
1627 /// Based on operator<
1628 template<typename _Tp
, typename _Alloc
>
1630 operator<=(const vector
<_Tp
, _Alloc
>& __x
, const vector
<_Tp
, _Alloc
>& __y
)
1631 { return !(__y
< __x
); }
1633 /// Based on operator<
1634 template<typename _Tp
, typename _Alloc
>
1636 operator>=(const vector
<_Tp
, _Alloc
>& __x
, const vector
<_Tp
, _Alloc
>& __y
)
1637 { return !(__x
< __y
); }
1639 /// See std::vector::swap().
1640 template<typename _Tp
, typename _Alloc
>
1642 swap(vector
<_Tp
, _Alloc
>& __x
, vector
<_Tp
, _Alloc
>& __y
)
1643 _GLIBCXX_NOEXCEPT_IF(noexcept(__x
.swap(__y
)))
1646 _GLIBCXX_END_NAMESPACE_CONTAINER
1649 #endif /* _STL_VECTOR_H */