1 // Vector implementation -*- C++ -*-
3 // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
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/>.
29 * Hewlett-Packard Company
31 * Permission to use, copy, modify, distribute and sell this software
32 * and its documentation for any purpose is hereby granted without fee,
33 * provided that the above copyright notice appear in all copies and
34 * that both that copyright notice and this permission notice appear
35 * in supporting documentation. Hewlett-Packard Company makes no
36 * representations about the suitability of this software for any
37 * purpose. It is provided "as is" without express or implied warranty.
41 * Silicon Graphics Computer Systems, Inc.
43 * Permission to use, copy, modify, distribute and sell this software
44 * and its documentation for any purpose is hereby granted without fee,
45 * provided that the above copyright notice appear in all copies and
46 * that both that copyright notice and this permission notice appear
47 * in supporting documentation. Silicon Graphics makes no
48 * representations about the suitability of this software for any
49 * purpose. It is provided "as is" without express or implied warranty.
52 /** @file stl_vector.h
53 * This is an internal header file, included by other library headers.
54 * You should not attempt to use it directly.
58 #define _STL_VECTOR_H 1
60 #include <bits/stl_iterator_base_funcs.h>
61 #include <bits/functexcept.h>
62 #include <bits/concept_check.h>
63 #include <initializer_list>
65 _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D)
67 /// See bits/stl_deque.h's _Deque_base for an explanation.
68 template<typename _Tp, typename _Alloc>
71 typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type;
74 : public _Tp_alloc_type
76 typename _Tp_alloc_type::pointer _M_start;
77 typename _Tp_alloc_type::pointer _M_finish;
78 typename _Tp_alloc_type::pointer _M_end_of_storage;
81 : _Tp_alloc_type(), _M_start(0), _M_finish(0), _M_end_of_storage(0)
84 _Vector_impl(_Tp_alloc_type const& __a)
85 : _Tp_alloc_type(__a), _M_start(0), _M_finish(0), _M_end_of_storage(0)
90 typedef _Alloc allocator_type;
94 { return *static_cast<_Tp_alloc_type*>(&this->_M_impl); }
97 _M_get_Tp_allocator() const
98 { return *static_cast<const _Tp_alloc_type*>(&this->_M_impl); }
101 get_allocator() const
102 { return allocator_type(_M_get_Tp_allocator()); }
107 _Vector_base(const allocator_type& __a)
110 _Vector_base(size_t __n, const allocator_type& __a)
113 this->_M_impl._M_start = this->_M_allocate(__n);
114 this->_M_impl._M_finish = this->_M_impl._M_start;
115 this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;
118 #ifdef __GXX_EXPERIMENTAL_CXX0X__
119 _Vector_base(_Vector_base&& __x)
120 : _M_impl(__x._M_get_Tp_allocator())
122 this->_M_impl._M_start = __x._M_impl._M_start;
123 this->_M_impl._M_finish = __x._M_impl._M_finish;
124 this->_M_impl._M_end_of_storage = __x._M_impl._M_end_of_storage;
125 __x._M_impl._M_start = 0;
126 __x._M_impl._M_finish = 0;
127 __x._M_impl._M_end_of_storage = 0;
132 { _M_deallocate(this->_M_impl._M_start, this->_M_impl._M_end_of_storage
133 - this->_M_impl._M_start); }
136 _Vector_impl _M_impl;
138 typename _Tp_alloc_type::pointer
139 _M_allocate(size_t __n)
140 { return __n != 0 ? _M_impl.allocate(__n) : 0; }
143 _M_deallocate(typename _Tp_alloc_type::pointer __p, size_t __n)
146 _M_impl.deallocate(__p, __n);
152 * @brief A standard container which offers fixed time access to
153 * individual elements in any order.
157 * Meets the requirements of a <a href="tables.html#65">container</a>, a
158 * <a href="tables.html#66">reversible container</a>, and a
159 * <a href="tables.html#67">sequence</a>, including the
160 * <a href="tables.html#68">optional sequence requirements</a> with the
161 * %exception of @c push_front and @c pop_front.
163 * In some terminology a %vector can be described as a dynamic
164 * C-style array, it offers fast and efficient access to individual
165 * elements in any order and saves the user from worrying about
166 * memory and size allocation. Subscripting ( @c [] ) access is
167 * also provided as with C-style arrays.
169 template<typename _Tp, typename _Alloc = std::allocator<_Tp> >
170 class vector : protected _Vector_base<_Tp, _Alloc>
172 // Concept requirements.
173 typedef typename _Alloc::value_type _Alloc_value_type;
174 __glibcxx_class_requires(_Tp, _SGIAssignableConcept)
175 __glibcxx_class_requires2(_Tp, _Alloc_value_type, _SameTypeConcept)
177 typedef _Vector_base<_Tp, _Alloc> _Base;
178 typedef typename _Base::_Tp_alloc_type _Tp_alloc_type;
181 typedef _Tp value_type;
182 typedef typename _Tp_alloc_type::pointer pointer;
183 typedef typename _Tp_alloc_type::const_pointer const_pointer;
184 typedef typename _Tp_alloc_type::reference reference;
185 typedef typename _Tp_alloc_type::const_reference const_reference;
186 typedef __gnu_cxx::__normal_iterator<pointer, vector> iterator;
187 typedef __gnu_cxx::__normal_iterator<const_pointer, vector>
189 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
190 typedef std::reverse_iterator<iterator> reverse_iterator;
191 typedef size_t size_type;
192 typedef ptrdiff_t difference_type;
193 typedef _Alloc allocator_type;
196 using _Base::_M_allocate;
197 using _Base::_M_deallocate;
198 using _Base::_M_impl;
199 using _Base::_M_get_Tp_allocator;
202 // [23.2.4.1] construct/copy/destroy
203 // (assign() and get_allocator() are also listed in this section)
205 * @brief Default constructor creates no elements.
211 * @brief Creates a %vector with no elements.
212 * @param a An allocator object.
215 vector(const allocator_type& __a)
219 * @brief Creates a %vector with copies of an exemplar element.
220 * @param n The number of elements to initially create.
221 * @param value An element to copy.
222 * @param a An allocator.
224 * This constructor fills the %vector with @a n copies of @a value.
227 vector(size_type __n, const value_type& __value = value_type(),
228 const allocator_type& __a = allocator_type())
230 { _M_fill_initialize(__n, __value); }
233 * @brief %Vector copy constructor.
234 * @param x A %vector of identical element and allocator types.
236 * The newly-created %vector uses a copy of the allocation
237 * object used by @a x. All the elements of @a x are copied,
238 * but any extra memory in
239 * @a x (for fast expansion) will not be copied.
241 vector(const vector& __x)
242 : _Base(__x.size(), __x._M_get_Tp_allocator())
243 { this->_M_impl._M_finish =
244 std::__uninitialized_copy_a(__x.begin(), __x.end(),
245 this->_M_impl._M_start,
246 _M_get_Tp_allocator());
249 #ifdef __GXX_EXPERIMENTAL_CXX0X__
251 * @brief %Vector move constructor.
252 * @param x A %vector of identical element and allocator types.
254 * The newly-created %vector contains the exact contents of @a x.
255 * The contents of @a x are a valid, but unspecified %vector.
258 : _Base(std::forward<_Base>(__x)) { }
261 * @brief Builds a %vector from an initializer list.
262 * @param l An initializer_list.
263 * @param a An allocator.
265 * Create a %vector consisting of copies of the elements in the
266 * initializer_list @a l.
268 * This will call the element type's copy constructor N times
269 * (where N is @a l.size()) and do no memory reallocation.
271 vector(initializer_list<value_type> __l,
272 const allocator_type& __a = allocator_type())
275 _M_range_initialize(__l.begin(), __l.end(),
276 random_access_iterator_tag());
281 * @brief Builds a %vector from a range.
282 * @param first An input iterator.
283 * @param last An input iterator.
284 * @param a An allocator.
286 * Create a %vector consisting of copies of the elements from
289 * If the iterators are forward, bidirectional, or
290 * random-access, then this will call the elements' copy
291 * constructor N times (where N is distance(first,last)) and do
292 * no memory reallocation. But if only input iterators are
293 * used, then this will do at most 2N calls to the copy
294 * constructor, and logN memory reallocations.
296 template<typename _InputIterator>
297 vector(_InputIterator __first, _InputIterator __last,
298 const allocator_type& __a = allocator_type())
301 // Check whether it's an integral type. If so, it's not an iterator.
302 typedef typename std::__is_integer<_InputIterator>::__type _Integral;
303 _M_initialize_dispatch(__first, __last, _Integral());
307 * The dtor only erases the elements, and note that if the
308 * elements themselves are pointers, the pointed-to memory is
309 * not touched in any way. Managing the pointer is the user's
313 { std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
314 _M_get_Tp_allocator()); }
317 * @brief %Vector assignment operator.
318 * @param x A %vector of identical element and allocator types.
320 * All the elements of @a x are copied, but any extra memory in
321 * @a x (for fast expansion) will not be copied. Unlike the
322 * copy constructor, the allocator object is not copied.
325 operator=(const vector& __x);
327 #ifdef __GXX_EXPERIMENTAL_CXX0X__
329 * @brief %Vector move assignment operator.
330 * @param x A %vector of identical element and allocator types.
332 * The contents of @a x are moved into this %vector (without copying).
333 * @a x is a valid, but unspecified %vector.
336 operator=(vector&& __x)
345 * @brief %Vector list assignment operator.
346 * @param l An initializer_list.
348 * This function fills a %vector with copies of the elements in the
349 * initializer list @a l.
351 * Note that the assignment completely changes the %vector and
352 * that the resulting %vector's size is the same as the number
353 * of elements assigned. Old data may be lost.
356 operator=(initializer_list<value_type> __l)
358 this->assign(__l.begin(), __l.end());
364 * @brief Assigns a given value to a %vector.
365 * @param n Number of elements to be assigned.
366 * @param val Value to be assigned.
368 * This function fills a %vector with @a n copies of the given
369 * value. Note that the assignment completely changes the
370 * %vector and that the resulting %vector's size is the same as
371 * the number of elements assigned. Old data may be lost.
374 assign(size_type __n, const value_type& __val)
375 { _M_fill_assign(__n, __val); }
378 * @brief Assigns a range to a %vector.
379 * @param first An input iterator.
380 * @param last An input iterator.
382 * This function fills a %vector with copies of the elements in the
383 * range [first,last).
385 * Note that the assignment completely changes the %vector and
386 * that the resulting %vector's size is the same as the number
387 * of elements assigned. Old data may be lost.
389 template<typename _InputIterator>
391 assign(_InputIterator __first, _InputIterator __last)
393 // Check whether it's an integral type. If so, it's not an iterator.
394 typedef typename std::__is_integer<_InputIterator>::__type _Integral;
395 _M_assign_dispatch(__first, __last, _Integral());
398 #ifdef __GXX_EXPERIMENTAL_CXX0X__
400 * @brief Assigns an initializer list to a %vector.
401 * @param l An initializer_list.
403 * This function fills a %vector with copies of the elements in the
404 * initializer list @a l.
406 * Note that the assignment completely changes the %vector and
407 * that the resulting %vector's size is the same as the number
408 * of elements assigned. Old data may be lost.
411 assign(initializer_list<value_type> __l)
412 { this->assign(__l.begin(), __l.end()); }
415 /// Get a copy of the memory allocation object.
416 using _Base::get_allocator;
420 * Returns a read/write iterator that points to the first
421 * element in the %vector. Iteration is done in ordinary
426 { return iterator(this->_M_impl._M_start); }
429 * Returns a read-only (constant) iterator that points to the
430 * first element in the %vector. Iteration is done in ordinary
435 { return const_iterator(this->_M_impl._M_start); }
438 * Returns a read/write iterator that points one past the last
439 * element in the %vector. Iteration is done in ordinary
444 { return iterator(this->_M_impl._M_finish); }
447 * Returns a read-only (constant) iterator that points one past
448 * the last element in the %vector. Iteration is done in
449 * ordinary element order.
453 { return const_iterator(this->_M_impl._M_finish); }
456 * Returns a read/write reverse iterator that points to the
457 * last element in the %vector. Iteration is done in reverse
462 { return reverse_iterator(end()); }
465 * Returns a read-only (constant) reverse iterator that points
466 * to the last element in the %vector. Iteration is done in
467 * reverse element order.
469 const_reverse_iterator
471 { return const_reverse_iterator(end()); }
474 * Returns a read/write reverse iterator that points to one
475 * before the first element in the %vector. Iteration is done
476 * in reverse element order.
480 { return reverse_iterator(begin()); }
483 * Returns a read-only (constant) reverse iterator that points
484 * to one before the first element in the %vector. Iteration
485 * is done in reverse element order.
487 const_reverse_iterator
489 { return const_reverse_iterator(begin()); }
491 #ifdef __GXX_EXPERIMENTAL_CXX0X__
493 * Returns a read-only (constant) iterator that points to the
494 * first element in the %vector. Iteration is done in ordinary
499 { return const_iterator(this->_M_impl._M_start); }
502 * Returns a read-only (constant) iterator that points one past
503 * the last element in the %vector. Iteration is done in
504 * ordinary element order.
508 { return const_iterator(this->_M_impl._M_finish); }
511 * Returns a read-only (constant) reverse iterator that points
512 * to the last element in the %vector. Iteration is done in
513 * reverse element order.
515 const_reverse_iterator
517 { return const_reverse_iterator(end()); }
520 * Returns a read-only (constant) reverse iterator that points
521 * to one before the first element in the %vector. Iteration
522 * is done in reverse element order.
524 const_reverse_iterator
526 { return const_reverse_iterator(begin()); }
529 // [23.2.4.2] capacity
530 /** Returns the number of elements in the %vector. */
533 { return size_type(this->_M_impl._M_finish - this->_M_impl._M_start); }
535 /** Returns the size() of the largest possible %vector. */
538 { return _M_get_Tp_allocator().max_size(); }
541 * @brief Resizes the %vector to the specified number of elements.
542 * @param new_size Number of elements the %vector should contain.
543 * @param x Data with which new elements should be populated.
545 * This function will %resize the %vector to the specified
546 * number of elements. If the number is smaller than the
547 * %vector's current size the %vector is truncated, otherwise
548 * the %vector is extended and new elements are populated with
552 resize(size_type __new_size, value_type __x = value_type())
554 if (__new_size < size())
555 _M_erase_at_end(this->_M_impl._M_start + __new_size);
557 insert(end(), __new_size - size(), __x);
561 * Returns the total number of elements that the %vector can
562 * hold before needing to allocate more memory.
566 { return size_type(this->_M_impl._M_end_of_storage
567 - this->_M_impl._M_start); }
570 * Returns true if the %vector is empty. (Thus begin() would
575 { return begin() == end(); }
578 * @brief Attempt to preallocate enough memory for specified number of
580 * @param n Number of elements required.
581 * @throw std::length_error If @a n exceeds @c max_size().
583 * This function attempts to reserve enough memory for the
584 * %vector to hold the specified number of elements. If the
585 * number requested is more than max_size(), length_error is
588 * The advantage of this function is that if optimal code is a
589 * necessity and the user can determine the number of elements
590 * that will be required, the user can reserve the memory in
591 * %advance, and thus prevent a possible reallocation of memory
592 * and copying of %vector data.
595 reserve(size_type __n);
599 * @brief Subscript access to the data contained in the %vector.
600 * @param n The index of the element for which data should be
602 * @return Read/write reference to data.
604 * This operator allows for easy, array-style, data access.
605 * Note that data access with this operator is unchecked and
606 * out_of_range lookups are not defined. (For checked lookups
610 operator[](size_type __n)
611 { return *(this->_M_impl._M_start + __n); }
614 * @brief Subscript access to the data contained in the %vector.
615 * @param n The index of the element for which data should be
617 * @return Read-only (constant) reference to data.
619 * This operator allows for easy, array-style, data access.
620 * Note that data access with this operator is unchecked and
621 * out_of_range lookups are not defined. (For checked lookups
625 operator[](size_type __n) const
626 { return *(this->_M_impl._M_start + __n); }
629 /// Safety check used only from at().
631 _M_range_check(size_type __n) const
633 if (__n >= this->size())
634 __throw_out_of_range(__N("vector::_M_range_check"));
639 * @brief Provides access to the data contained in the %vector.
640 * @param n The index of the element for which data should be
642 * @return Read/write reference to data.
643 * @throw std::out_of_range If @a n is an invalid index.
645 * This function provides for safer data access. The parameter
646 * is first checked that it is in the range of the vector. The
647 * function throws out_of_range if the check fails.
657 * @brief Provides access to the data contained in the %vector.
658 * @param n The index of the element for which data should be
660 * @return Read-only (constant) reference to data.
661 * @throw std::out_of_range If @a n is an invalid index.
663 * This function provides for safer data access. The parameter
664 * is first checked that it is in the range of the vector. The
665 * function throws out_of_range if the check fails.
668 at(size_type __n) const
675 * Returns a read/write reference to the data at the first
676 * element of the %vector.
683 * Returns a read-only (constant) reference to the data at the first
684 * element of the %vector.
691 * Returns a read/write reference to the data at the last
692 * element of the %vector.
696 { return *(end() - 1); }
699 * Returns a read-only (constant) reference to the data at the
700 * last element of the %vector.
704 { return *(end() - 1); }
706 // _GLIBCXX_RESOLVE_LIB_DEFECTS
707 // DR 464. Suggestion for new member functions in standard containers.
710 * Returns a pointer such that [data(), data() + size()) is a valid
711 * range. For a non-empty %vector, data() == &front().
715 { return pointer(this->_M_impl._M_start); }
719 { return const_pointer(this->_M_impl._M_start); }
721 // [23.2.4.3] modifiers
723 * @brief Add data to the end of the %vector.
724 * @param x Data to be added.
726 * This is a typical stack operation. The function creates an
727 * element at the end of the %vector and assigns the given data
728 * to it. Due to the nature of a %vector this operation can be
729 * done in constant time if the %vector has preallocated space
733 push_back(const value_type& __x)
735 if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)
737 this->_M_impl.construct(this->_M_impl._M_finish, __x);
738 ++this->_M_impl._M_finish;
741 _M_insert_aux(end(), __x);
744 #ifdef __GXX_EXPERIMENTAL_CXX0X__
746 push_back(value_type&& __x)
747 { emplace_back(std::move(__x)); }
749 template<typename... _Args>
751 emplace_back(_Args&&... __args);
755 * @brief Removes last element.
757 * This is a typical stack operation. It shrinks the %vector by one.
759 * Note that no data is returned, and if the last element's
760 * data is needed, it should be retrieved before pop_back() is
766 --this->_M_impl._M_finish;
767 this->_M_impl.destroy(this->_M_impl._M_finish);
770 #ifdef __GXX_EXPERIMENTAL_CXX0X__
772 * @brief Inserts an object in %vector before specified iterator.
773 * @param position An iterator into the %vector.
774 * @param args Arguments.
775 * @return An iterator that points to the inserted data.
777 * This function will insert an object of type T constructed
778 * with T(std::forward<Args>(args)...) before the specified location.
779 * Note that this kind of operation could be expensive for a %vector
780 * and if it is frequently used the user should consider using
783 template<typename... _Args>
785 emplace(iterator __position, _Args&&... __args);
789 * @brief Inserts given value into %vector before specified iterator.
790 * @param position An iterator into the %vector.
791 * @param x Data to be inserted.
792 * @return An iterator that points to the inserted data.
794 * This function will insert a copy of the given value before
795 * the specified location. Note that this kind of operation
796 * could be expensive for a %vector and if it is frequently
797 * used the user should consider using std::list.
800 insert(iterator __position, const value_type& __x);
802 #ifdef __GXX_EXPERIMENTAL_CXX0X__
804 * @brief Inserts given rvalue into %vector before specified iterator.
805 * @param position An iterator into the %vector.
806 * @param x Data to be inserted.
807 * @return An iterator that points to the inserted data.
809 * This function will insert a copy of the given rvalue before
810 * the specified location. Note that this kind of operation
811 * could be expensive for a %vector and if it is frequently
812 * used the user should consider using std::list.
815 insert(iterator __position, value_type&& __x)
816 { return emplace(__position, std::move(__x)); }
819 * @brief Inserts an initializer_list into the %vector.
820 * @param position An iterator into the %vector.
821 * @param l An initializer_list.
823 * This function will insert copies of the data in the
824 * initializer_list @a l into the %vector before the location
825 * specified by @a position.
827 * Note that this kind of operation could be expensive for a
828 * %vector and if it is frequently used the user should
829 * consider using std::list.
832 insert(iterator __position, initializer_list<value_type> __l)
833 { this->insert(__position, __l.begin(), __l.end()); }
837 * @brief Inserts a number of copies of given data into the %vector.
838 * @param position An iterator into the %vector.
839 * @param n Number of elements to be inserted.
840 * @param x Data to be inserted.
842 * This function will insert a specified number of copies of
843 * the given data before the location specified by @a position.
845 * Note that this kind of operation could be expensive for a
846 * %vector and if it is frequently used the user should
847 * consider using std::list.
850 insert(iterator __position, size_type __n, const value_type& __x)
851 { _M_fill_insert(__position, __n, __x); }
854 * @brief Inserts a range into the %vector.
855 * @param position An iterator into the %vector.
856 * @param first An input iterator.
857 * @param last An input iterator.
859 * This function will insert copies of the data in the range
860 * [first,last) into the %vector before the location specified
863 * Note that this kind of operation could be expensive for a
864 * %vector and if it is frequently used the user should
865 * consider using std::list.
867 template<typename _InputIterator>
869 insert(iterator __position, _InputIterator __first,
870 _InputIterator __last)
872 // Check whether it's an integral type. If so, it's not an iterator.
873 typedef typename std::__is_integer<_InputIterator>::__type _Integral;
874 _M_insert_dispatch(__position, __first, __last, _Integral());
878 * @brief Remove element at given position.
879 * @param position Iterator pointing to element to be erased.
880 * @return An iterator pointing to the next element (or end()).
882 * This function will erase the element at the given position and thus
883 * shorten the %vector by one.
885 * Note This operation could be expensive and if it is
886 * frequently used the user should consider using std::list.
887 * The user is also cautioned that this function only erases
888 * the element, and that if the element is itself a pointer,
889 * the pointed-to memory is not touched in any way. Managing
890 * the pointer is the user's responsibility.
893 erase(iterator __position);
896 * @brief Remove a range of elements.
897 * @param first Iterator pointing to the first element to be erased.
898 * @param last Iterator pointing to one past the last element to be
900 * @return An iterator pointing to the element pointed to by @a last
901 * prior to erasing (or end()).
903 * This function will erase the elements in the range [first,last) and
904 * shorten the %vector accordingly.
906 * Note This operation could be expensive and if it is
907 * frequently used the user should consider using std::list.
908 * The user is also cautioned that this function only erases
909 * the elements, and that if the elements themselves are
910 * pointers, the pointed-to memory is not touched in any way.
911 * Managing the pointer is the user's responsibility.
914 erase(iterator __first, iterator __last);
917 * @brief Swaps data with another %vector.
918 * @param x A %vector of the same element and allocator types.
920 * This exchanges the elements between two vectors in constant time.
921 * (Three pointers, so it should be quite fast.)
922 * Note that the global std::swap() function is specialized such that
923 * std::swap(v1,v2) will feed to this function.
926 #ifdef __GXX_EXPERIMENTAL_CXX0X__
932 std::swap(this->_M_impl._M_start, __x._M_impl._M_start);
933 std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish);
934 std::swap(this->_M_impl._M_end_of_storage,
935 __x._M_impl._M_end_of_storage);
937 // _GLIBCXX_RESOLVE_LIB_DEFECTS
938 // 431. Swapping containers with unequal allocators.
939 std::__alloc_swap<_Tp_alloc_type>::_S_do_it(_M_get_Tp_allocator(),
940 __x._M_get_Tp_allocator());
944 * Erases all the elements. Note that this function only erases the
945 * elements, and that if the elements themselves are pointers, the
946 * pointed-to memory is not touched in any way. Managing the pointer is
947 * the user's responsibility.
951 { _M_erase_at_end(this->_M_impl._M_start); }
955 * Memory expansion handler. Uses the member allocation function to
956 * obtain @a n bytes of memory, and then copies [first,last) into it.
958 template<typename _ForwardIterator>
960 _M_allocate_and_copy(size_type __n,
961 _ForwardIterator __first, _ForwardIterator __last)
963 pointer __result = this->_M_allocate(__n);
966 std::__uninitialized_copy_a(__first, __last, __result,
967 _M_get_Tp_allocator());
972 _M_deallocate(__result, __n);
973 __throw_exception_again;
978 // Internal constructor functions follow.
980 // Called by the range constructor to implement [23.1.1]/9
982 // _GLIBCXX_RESOLVE_LIB_DEFECTS
983 // 438. Ambiguity in the "do the right thing" clause
984 template<typename _Integer>
986 _M_initialize_dispatch(_Integer __n, _Integer __value, __true_type)
988 this->_M_impl._M_start = _M_allocate(static_cast<size_type>(__n));
989 this->_M_impl._M_end_of_storage =
990 this->_M_impl._M_start + static_cast<size_type>(__n);
991 _M_fill_initialize(static_cast<size_type>(__n), __value);
994 // Called by the range constructor to implement [23.1.1]/9
995 template<typename _InputIterator>
997 _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,
1000 typedef typename std::iterator_traits<_InputIterator>::
1001 iterator_category _IterCategory;
1002 _M_range_initialize(__first, __last, _IterCategory());
1005 // Called by the second initialize_dispatch above
1006 template<typename _InputIterator>
1008 _M_range_initialize(_InputIterator __first,
1009 _InputIterator __last, std::input_iterator_tag)
1011 for (; __first != __last; ++__first)
1012 push_back(*__first);
1015 // Called by the second initialize_dispatch above
1016 template<typename _ForwardIterator>
1018 _M_range_initialize(_ForwardIterator __first,
1019 _ForwardIterator __last, std::forward_iterator_tag)
1021 const size_type __n = std::distance(__first, __last);
1022 this->_M_impl._M_start = this->_M_allocate(__n);
1023 this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;
1024 this->_M_impl._M_finish =
1025 std::__uninitialized_copy_a(__first, __last,
1026 this->_M_impl._M_start,
1027 _M_get_Tp_allocator());
1030 // Called by the first initialize_dispatch above and by the
1031 // vector(n,value,a) constructor.
1033 _M_fill_initialize(size_type __n, const value_type& __value)
1035 std::__uninitialized_fill_n_a(this->_M_impl._M_start, __n, __value,
1036 _M_get_Tp_allocator());
1037 this->_M_impl._M_finish = this->_M_impl._M_end_of_storage;
1041 // Internal assign functions follow. The *_aux functions do the actual
1042 // assignment work for the range versions.
1044 // Called by the range assign to implement [23.1.1]/9
1046 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1047 // 438. Ambiguity in the "do the right thing" clause
1048 template<typename _Integer>
1050 _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
1051 { _M_fill_assign(__n, __val); }
1053 // Called by the range assign to implement [23.1.1]/9
1054 template<typename _InputIterator>
1056 _M_assign_dispatch(_InputIterator __first, _InputIterator __last,
1059 typedef typename std::iterator_traits<_InputIterator>::
1060 iterator_category _IterCategory;
1061 _M_assign_aux(__first, __last, _IterCategory());
1064 // Called by the second assign_dispatch above
1065 template<typename _InputIterator>
1067 _M_assign_aux(_InputIterator __first, _InputIterator __last,
1068 std::input_iterator_tag);
1070 // Called by the second assign_dispatch above
1071 template<typename _ForwardIterator>
1073 _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
1074 std::forward_iterator_tag);
1076 // Called by assign(n,t), and the range assign when it turns out
1077 // to be the same thing.
1079 _M_fill_assign(size_type __n, const value_type& __val);
1082 // Internal insert functions follow.
1084 // Called by the range insert to implement [23.1.1]/9
1086 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1087 // 438. Ambiguity in the "do the right thing" clause
1088 template<typename _Integer>
1090 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val,
1092 { _M_fill_insert(__pos, __n, __val); }
1094 // Called by the range insert to implement [23.1.1]/9
1095 template<typename _InputIterator>
1097 _M_insert_dispatch(iterator __pos, _InputIterator __first,
1098 _InputIterator __last, __false_type)
1100 typedef typename std::iterator_traits<_InputIterator>::
1101 iterator_category _IterCategory;
1102 _M_range_insert(__pos, __first, __last, _IterCategory());
1105 // Called by the second insert_dispatch above
1106 template<typename _InputIterator>
1108 _M_range_insert(iterator __pos, _InputIterator __first,
1109 _InputIterator __last, std::input_iterator_tag);
1111 // Called by the second insert_dispatch above
1112 template<typename _ForwardIterator>
1114 _M_range_insert(iterator __pos, _ForwardIterator __first,
1115 _ForwardIterator __last, std::forward_iterator_tag);
1117 // Called by insert(p,n,x), and the range insert when it turns out to be
1120 _M_fill_insert(iterator __pos, size_type __n, const value_type& __x);
1122 // Called by insert(p,x)
1123 #ifndef __GXX_EXPERIMENTAL_CXX0X__
1125 _M_insert_aux(iterator __position, const value_type& __x);
1127 template<typename... _Args>
1129 _M_insert_aux(iterator __position, _Args&&... __args);
1132 // Called by the latter.
1134 _M_check_len(size_type __n, const char* __s) const
1136 if (max_size() - size() < __n)
1137 __throw_length_error(__N(__s));
1139 const size_type __len = size() + std::max(size(), __n);
1140 return (__len < size() || __len > max_size()) ? max_size() : __len;
1143 // Internal erase functions follow.
1145 // Called by erase(q1,q2), clear(), resize(), _M_fill_assign,
1148 _M_erase_at_end(pointer __pos)
1150 std::_Destroy(__pos, this->_M_impl._M_finish, _M_get_Tp_allocator());
1151 this->_M_impl._M_finish = __pos;
1157 * @brief Vector equality comparison.
1158 * @param x A %vector.
1159 * @param y A %vector of the same type as @a x.
1160 * @return True iff the size and elements of the vectors are equal.
1162 * This is an equivalence relation. It is linear in the size of the
1163 * vectors. Vectors are considered equivalent if their sizes are equal,
1164 * and if corresponding elements compare equal.
1166 template<typename _Tp, typename _Alloc>
1168 operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
1169 { return (__x.size() == __y.size()
1170 && std::equal(__x.begin(), __x.end(), __y.begin())); }
1173 * @brief Vector ordering relation.
1174 * @param x A %vector.
1175 * @param y A %vector of the same type as @a x.
1176 * @return True iff @a x is lexicographically less than @a y.
1178 * This is a total ordering relation. It is linear in the size of the
1179 * vectors. The elements must be comparable with @c <.
1181 * See std::lexicographical_compare() for how the determination is made.
1183 template<typename _Tp, typename _Alloc>
1185 operator<(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
1186 { return std::lexicographical_compare(__x.begin(), __x.end(),
1187 __y.begin(), __y.end()); }
1189 /// Based on operator==
1190 template<typename _Tp, typename _Alloc>
1192 operator!=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
1193 { return !(__x == __y); }
1195 /// Based on operator<
1196 template<typename _Tp, typename _Alloc>
1198 operator>(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
1199 { return __y < __x; }
1201 /// Based on operator<
1202 template<typename _Tp, typename _Alloc>
1204 operator<=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
1205 { return !(__y < __x); }
1207 /// Based on operator<
1208 template<typename _Tp, typename _Alloc>
1210 operator>=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
1211 { return !(__x < __y); }
1213 /// See std::vector::swap().
1214 template<typename _Tp, typename _Alloc>
1216 swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>& __y)
1219 #ifdef __GXX_EXPERIMENTAL_CXX0X__
1220 template<typename _Tp, typename _Alloc>
1222 swap(vector<_Tp, _Alloc>&& __x, vector<_Tp, _Alloc>& __y)
1225 template<typename _Tp, typename _Alloc>
1227 swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>&& __y)
1231 _GLIBCXX_END_NESTED_NAMESPACE
1233 #endif /* _STL_VECTOR_H */