b281e13eca
This is another piece of P1206R7, adding new members to std::vector and std::vector<bool>. The __uninitialized_copy_a extension needs to be enhanced to support passing non-common ranges (i.e. a sentinel that is a different type from the iterator) and move-only input iterators. libstdc++-v3/ChangeLog: PR libstdc++/111055 * include/bits/ranges_base.h (__container_compatible_range): New concept. * include/bits/stl_bvector.h (vector(from_range, R&&, const Alloc&)) (assign_range, insert_range, append_range): Define. * include/bits/stl_uninitialized.h (__do_uninit_copy): Support non-common ranges. (__uninitialized_copy_a): Likewise. * include/bits/stl_vector.h (_Vector_base::_M_append_range_to): New function. (_Vector_base::_M_append_range): Likewise. (vector(from_range, R&&, const Alloc&), assign_range): Define. (append_range): Define. (insert_range): Declare. * include/debug/vector (vector(from_range, R&&, const Alloc&)) (assign_range, insert_range, append_range): Define. * include/bits/vector.tcc (insert_range): Define. * testsuite/util/testsuite_iterators.h (input_iterator_wrapper_rval): New class template. * testsuite/23_containers/vector/bool/cons/from_range.cc: New test. * testsuite/23_containers/vector/bool/modifiers/assign/assign_range.cc: New test. * testsuite/23_containers/vector/bool/modifiers/insert/append_range.cc: New test. * testsuite/23_containers/vector/bool/modifiers/insert/insert_range.cc: New test. * testsuite/23_containers/vector/cons/from_range.cc: New test. * testsuite/23_containers/vector/modifiers/append_range.cc: New test. * testsuite/23_containers/vector/modifiers/assign/assign_range.cc: New test. * testsuite/23_containers/vector/modifiers/insert/insert_range.cc: New test. Reviewed-by: Patrick Palka <ppalka@redhat.com>
1313 lines
40 KiB
C++
1313 lines
40 KiB
C++
// Vector implementation (out of line) -*- C++ -*-
|
|
|
|
// Copyright (C) 2001-2024 Free Software Foundation, Inc.
|
|
//
|
|
// This file is part of the GNU ISO C++ Library. This library is free
|
|
// software; you can redistribute it and/or modify it under the
|
|
// terms of the GNU General Public License as published by the
|
|
// Free Software Foundation; either version 3, or (at your option)
|
|
// any later version.
|
|
|
|
// This library is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
|
|
// Under Section 7 of GPL version 3, you are granted additional
|
|
// permissions described in the GCC Runtime Library Exception, version
|
|
// 3.1, as published by the Free Software Foundation.
|
|
|
|
// You should have received a copy of the GNU General Public License and
|
|
// a copy of the GCC Runtime Library Exception along with this program;
|
|
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
|
// <http://www.gnu.org/licenses/>.
|
|
|
|
/*
|
|
*
|
|
* Copyright (c) 1994
|
|
* Hewlett-Packard Company
|
|
*
|
|
* Permission to use, copy, modify, distribute and sell this software
|
|
* and its documentation for any purpose is hereby granted without fee,
|
|
* provided that the above copyright notice appear in all copies and
|
|
* that both that copyright notice and this permission notice appear
|
|
* in supporting documentation. Hewlett-Packard Company makes no
|
|
* representations about the suitability of this software for any
|
|
* purpose. It is provided "as is" without express or implied warranty.
|
|
*
|
|
*
|
|
* Copyright (c) 1996
|
|
* Silicon Graphics Computer Systems, Inc.
|
|
*
|
|
* Permission to use, copy, modify, distribute and sell this software
|
|
* and its documentation for any purpose is hereby granted without fee,
|
|
* provided that the above copyright notice appear in all copies and
|
|
* that both that copyright notice and this permission notice appear
|
|
* in supporting documentation. Silicon Graphics makes no
|
|
* representations about the suitability of this software for any
|
|
* purpose. It is provided "as is" without express or implied warranty.
|
|
*/
|
|
|
|
/** @file bits/vector.tcc
|
|
* This is an internal header file, included by other library headers.
|
|
* Do not attempt to use it directly. @headername{vector}
|
|
*/
|
|
|
|
#ifndef _VECTOR_TCC
|
|
#define _VECTOR_TCC 1
|
|
|
|
namespace std _GLIBCXX_VISIBILITY(default)
|
|
{
|
|
_GLIBCXX_BEGIN_NAMESPACE_VERSION
|
|
_GLIBCXX_BEGIN_NAMESPACE_CONTAINER
|
|
|
|
template<typename _Tp, typename _Alloc>
|
|
_GLIBCXX20_CONSTEXPR
|
|
void
|
|
vector<_Tp, _Alloc>::
|
|
reserve(size_type __n)
|
|
{
|
|
if (__n > this->max_size())
|
|
__throw_length_error(__N("vector::reserve"));
|
|
if (this->capacity() < __n)
|
|
{
|
|
const size_type __old_size = size();
|
|
pointer __tmp;
|
|
#if __cplusplus >= 201103L
|
|
if _GLIBCXX17_CONSTEXPR (_S_use_relocate())
|
|
{
|
|
__tmp = this->_M_allocate(__n);
|
|
_S_relocate(this->_M_impl._M_start, this->_M_impl._M_finish,
|
|
__tmp, _M_get_Tp_allocator());
|
|
}
|
|
else
|
|
#endif
|
|
{
|
|
__tmp = _M_allocate_and_copy(__n,
|
|
_GLIBCXX_MAKE_MOVE_IF_NOEXCEPT_ITERATOR(this->_M_impl._M_start),
|
|
_GLIBCXX_MAKE_MOVE_IF_NOEXCEPT_ITERATOR(this->_M_impl._M_finish));
|
|
std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
|
|
_M_get_Tp_allocator());
|
|
}
|
|
_GLIBCXX_ASAN_ANNOTATE_REINIT;
|
|
_M_deallocate(this->_M_impl._M_start,
|
|
this->_M_impl._M_end_of_storage
|
|
- this->_M_impl._M_start);
|
|
this->_M_impl._M_start = __tmp;
|
|
this->_M_impl._M_finish = __tmp + __old_size;
|
|
this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;
|
|
}
|
|
}
|
|
|
|
#if __cplusplus >= 201103L
|
|
template<typename _Tp, typename _Alloc>
|
|
template<typename... _Args>
|
|
#if __cplusplus > 201402L
|
|
_GLIBCXX20_CONSTEXPR
|
|
typename vector<_Tp, _Alloc>::reference
|
|
#else
|
|
void
|
|
#endif
|
|
vector<_Tp, _Alloc>::
|
|
emplace_back(_Args&&... __args)
|
|
{
|
|
if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)
|
|
{
|
|
_GLIBCXX_ASAN_ANNOTATE_GROW(1);
|
|
_Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish,
|
|
std::forward<_Args>(__args)...);
|
|
++this->_M_impl._M_finish;
|
|
_GLIBCXX_ASAN_ANNOTATE_GREW(1);
|
|
}
|
|
else
|
|
_M_realloc_append(std::forward<_Args>(__args)...);
|
|
#if __cplusplus > 201402L
|
|
return back();
|
|
#endif
|
|
}
|
|
#endif
|
|
|
|
template<typename _Tp, typename _Alloc>
|
|
_GLIBCXX20_CONSTEXPR
|
|
typename vector<_Tp, _Alloc>::iterator
|
|
vector<_Tp, _Alloc>::
|
|
#if __cplusplus >= 201103L
|
|
insert(const_iterator __position, const value_type& __x)
|
|
#else
|
|
insert(iterator __position, const value_type& __x)
|
|
#endif
|
|
{
|
|
const size_type __n = __position - begin();
|
|
if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)
|
|
{
|
|
__glibcxx_assert(__position != const_iterator());
|
|
if (!(__position != const_iterator()))
|
|
__builtin_unreachable(); // PR 106434
|
|
|
|
if (__position == end())
|
|
{
|
|
_GLIBCXX_ASAN_ANNOTATE_GROW(1);
|
|
_Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish,
|
|
__x);
|
|
++this->_M_impl._M_finish;
|
|
_GLIBCXX_ASAN_ANNOTATE_GREW(1);
|
|
}
|
|
else
|
|
{
|
|
#if __cplusplus >= 201103L
|
|
const auto __pos = begin() + (__position - cbegin());
|
|
// __x could be an existing element of this vector, so make a
|
|
// copy of it before _M_insert_aux moves elements around.
|
|
_Temporary_value __x_copy(this, __x);
|
|
_M_insert_aux(__pos, std::move(__x_copy._M_val()));
|
|
#else
|
|
_M_insert_aux(__position, __x);
|
|
#endif
|
|
}
|
|
}
|
|
else
|
|
#if __cplusplus >= 201103L
|
|
_M_realloc_insert(begin() + (__position - cbegin()), __x);
|
|
#else
|
|
_M_realloc_insert(__position, __x);
|
|
#endif
|
|
|
|
return iterator(this->_M_impl._M_start + __n);
|
|
}
|
|
|
|
template<typename _Tp, typename _Alloc>
|
|
_GLIBCXX20_CONSTEXPR
|
|
typename vector<_Tp, _Alloc>::iterator
|
|
vector<_Tp, _Alloc>::
|
|
_M_erase(iterator __position)
|
|
{
|
|
if (__position + 1 != end())
|
|
_GLIBCXX_MOVE3(__position + 1, end(), __position);
|
|
--this->_M_impl._M_finish;
|
|
_Alloc_traits::destroy(this->_M_impl, this->_M_impl._M_finish);
|
|
_GLIBCXX_ASAN_ANNOTATE_SHRINK(1);
|
|
return __position;
|
|
}
|
|
|
|
template<typename _Tp, typename _Alloc>
|
|
_GLIBCXX20_CONSTEXPR
|
|
typename vector<_Tp, _Alloc>::iterator
|
|
vector<_Tp, _Alloc>::
|
|
_M_erase(iterator __first, iterator __last)
|
|
{
|
|
if (__first != __last)
|
|
{
|
|
if (__last != end())
|
|
_GLIBCXX_MOVE3(__last, end(), __first);
|
|
_M_erase_at_end(__first.base() + (end() - __last));
|
|
}
|
|
return __first;
|
|
}
|
|
|
|
template<typename _Tp, typename _Alloc>
|
|
_GLIBCXX20_CONSTEXPR
|
|
vector<_Tp, _Alloc>&
|
|
vector<_Tp, _Alloc>::
|
|
operator=(const vector<_Tp, _Alloc>& __x)
|
|
{
|
|
if (std::__addressof(__x) != this)
|
|
{
|
|
_GLIBCXX_ASAN_ANNOTATE_REINIT;
|
|
#if __cplusplus >= 201103L
|
|
if (_Alloc_traits::_S_propagate_on_copy_assign())
|
|
{
|
|
if (!_Alloc_traits::_S_always_equal()
|
|
&& _M_get_Tp_allocator() != __x._M_get_Tp_allocator())
|
|
{
|
|
// replacement allocator cannot free existing storage
|
|
this->clear();
|
|
_M_deallocate(this->_M_impl._M_start,
|
|
this->_M_impl._M_end_of_storage
|
|
- this->_M_impl._M_start);
|
|
this->_M_impl._M_start = nullptr;
|
|
this->_M_impl._M_finish = nullptr;
|
|
this->_M_impl._M_end_of_storage = nullptr;
|
|
}
|
|
std::__alloc_on_copy(_M_get_Tp_allocator(),
|
|
__x._M_get_Tp_allocator());
|
|
}
|
|
#endif
|
|
const size_type __xlen = __x.size();
|
|
if (__xlen > capacity())
|
|
{
|
|
pointer __tmp = _M_allocate_and_copy(__xlen, __x.begin(),
|
|
__x.end());
|
|
std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
|
|
_M_get_Tp_allocator());
|
|
_M_deallocate(this->_M_impl._M_start,
|
|
this->_M_impl._M_end_of_storage
|
|
- this->_M_impl._M_start);
|
|
this->_M_impl._M_start = __tmp;
|
|
this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __xlen;
|
|
}
|
|
else if (size() >= __xlen)
|
|
{
|
|
std::_Destroy(std::copy(__x.begin(), __x.end(), begin()),
|
|
end(), _M_get_Tp_allocator());
|
|
}
|
|
else
|
|
{
|
|
std::copy(__x._M_impl._M_start, __x._M_impl._M_start + size(),
|
|
this->_M_impl._M_start);
|
|
std::__uninitialized_copy_a(__x._M_impl._M_start + size(),
|
|
__x._M_impl._M_finish,
|
|
this->_M_impl._M_finish,
|
|
_M_get_Tp_allocator());
|
|
}
|
|
this->_M_impl._M_finish = this->_M_impl._M_start + __xlen;
|
|
}
|
|
return *this;
|
|
}
|
|
|
|
template<typename _Tp, typename _Alloc>
|
|
_GLIBCXX20_CONSTEXPR
|
|
void
|
|
vector<_Tp, _Alloc>::
|
|
_M_fill_assign(size_t __n, const value_type& __val)
|
|
{
|
|
const size_type __sz = size();
|
|
if (__n > capacity())
|
|
{
|
|
if (__n <= __sz)
|
|
__builtin_unreachable();
|
|
vector __tmp(__n, __val, _M_get_Tp_allocator());
|
|
__tmp._M_impl._M_swap_data(this->_M_impl);
|
|
}
|
|
else if (__n > __sz)
|
|
{
|
|
std::fill(begin(), end(), __val);
|
|
const size_type __add = __n - __sz;
|
|
_GLIBCXX_ASAN_ANNOTATE_GROW(__add);
|
|
this->_M_impl._M_finish =
|
|
std::__uninitialized_fill_n_a(this->_M_impl._M_finish,
|
|
__add, __val, _M_get_Tp_allocator());
|
|
_GLIBCXX_ASAN_ANNOTATE_GREW(__add);
|
|
}
|
|
else
|
|
_M_erase_at_end(std::fill_n(this->_M_impl._M_start, __n, __val));
|
|
}
|
|
|
|
template<typename _Tp, typename _Alloc>
|
|
template<typename _InputIterator>
|
|
_GLIBCXX20_CONSTEXPR
|
|
void
|
|
vector<_Tp, _Alloc>::
|
|
_M_assign_aux(_InputIterator __first, _InputIterator __last,
|
|
std::input_iterator_tag)
|
|
{
|
|
pointer __cur(this->_M_impl._M_start);
|
|
for (; __first != __last && __cur != this->_M_impl._M_finish;
|
|
++__cur, (void)++__first)
|
|
*__cur = *__first;
|
|
if (__first == __last)
|
|
_M_erase_at_end(__cur);
|
|
else
|
|
_M_range_insert(end(), __first, __last,
|
|
std::__iterator_category(__first));
|
|
}
|
|
|
|
template<typename _Tp, typename _Alloc>
|
|
template<typename _ForwardIterator>
|
|
_GLIBCXX20_CONSTEXPR
|
|
void
|
|
vector<_Tp, _Alloc>::
|
|
_M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
|
|
std::forward_iterator_tag)
|
|
{
|
|
const size_type __sz = size();
|
|
const size_type __len = std::distance(__first, __last);
|
|
|
|
if (__len > capacity())
|
|
{
|
|
if (__len <= __sz)
|
|
__builtin_unreachable();
|
|
|
|
_S_check_init_len(__len, _M_get_Tp_allocator());
|
|
pointer __tmp(_M_allocate_and_copy(__len, __first, __last));
|
|
std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
|
|
_M_get_Tp_allocator());
|
|
_GLIBCXX_ASAN_ANNOTATE_REINIT;
|
|
_M_deallocate(this->_M_impl._M_start,
|
|
this->_M_impl._M_end_of_storage
|
|
- this->_M_impl._M_start);
|
|
this->_M_impl._M_start = __tmp;
|
|
this->_M_impl._M_finish = this->_M_impl._M_start + __len;
|
|
this->_M_impl._M_end_of_storage = this->_M_impl._M_finish;
|
|
}
|
|
else if (__sz >= __len)
|
|
_M_erase_at_end(std::copy(__first, __last, this->_M_impl._M_start));
|
|
else
|
|
{
|
|
_ForwardIterator __mid = __first;
|
|
std::advance(__mid, __sz);
|
|
std::copy(__first, __mid, this->_M_impl._M_start);
|
|
const size_type __attribute__((__unused__)) __n = __len - __sz;
|
|
_GLIBCXX_ASAN_ANNOTATE_GROW(__n);
|
|
this->_M_impl._M_finish =
|
|
std::__uninitialized_copy_a(__mid, __last,
|
|
this->_M_impl._M_finish,
|
|
_M_get_Tp_allocator());
|
|
_GLIBCXX_ASAN_ANNOTATE_GREW(__n);
|
|
}
|
|
}
|
|
|
|
#if __cplusplus >= 201103L
|
|
template<typename _Tp, typename _Alloc>
|
|
_GLIBCXX20_CONSTEXPR
|
|
auto
|
|
vector<_Tp, _Alloc>::
|
|
_M_insert_rval(const_iterator __position, value_type&& __v) -> iterator
|
|
{
|
|
const auto __n = __position - cbegin();
|
|
if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)
|
|
if (__position == cend())
|
|
{
|
|
_GLIBCXX_ASAN_ANNOTATE_GROW(1);
|
|
_Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish,
|
|
std::move(__v));
|
|
++this->_M_impl._M_finish;
|
|
_GLIBCXX_ASAN_ANNOTATE_GREW(1);
|
|
}
|
|
else
|
|
_M_insert_aux(begin() + __n, std::move(__v));
|
|
else
|
|
_M_realloc_insert(begin() + __n, std::move(__v));
|
|
|
|
return iterator(this->_M_impl._M_start + __n);
|
|
}
|
|
|
|
template<typename _Tp, typename _Alloc>
|
|
template<typename... _Args>
|
|
_GLIBCXX20_CONSTEXPR
|
|
auto
|
|
vector<_Tp, _Alloc>::
|
|
_M_emplace_aux(const_iterator __position, _Args&&... __args)
|
|
-> iterator
|
|
{
|
|
const auto __n = __position - cbegin();
|
|
if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)
|
|
if (__position == cend())
|
|
{
|
|
_GLIBCXX_ASAN_ANNOTATE_GROW(1);
|
|
_Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish,
|
|
std::forward<_Args>(__args)...);
|
|
++this->_M_impl._M_finish;
|
|
_GLIBCXX_ASAN_ANNOTATE_GREW(1);
|
|
}
|
|
else
|
|
{
|
|
// We need to construct a temporary because something in __args...
|
|
// could alias one of the elements of the container and so we
|
|
// need to use it before _M_insert_aux moves elements around.
|
|
_Temporary_value __tmp(this, std::forward<_Args>(__args)...);
|
|
_M_insert_aux(begin() + __n, std::move(__tmp._M_val()));
|
|
}
|
|
else
|
|
_M_realloc_insert(begin() + __n, std::forward<_Args>(__args)...);
|
|
|
|
return iterator(this->_M_impl._M_start + __n);
|
|
}
|
|
|
|
template<typename _Tp, typename _Alloc>
|
|
template<typename _Arg>
|
|
_GLIBCXX20_CONSTEXPR
|
|
void
|
|
vector<_Tp, _Alloc>::
|
|
_M_insert_aux(iterator __position, _Arg&& __arg)
|
|
#else
|
|
template<typename _Tp, typename _Alloc>
|
|
void
|
|
vector<_Tp, _Alloc>::
|
|
_M_insert_aux(iterator __position, const _Tp& __x)
|
|
#endif
|
|
{
|
|
_GLIBCXX_ASAN_ANNOTATE_GROW(1);
|
|
_Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish,
|
|
_GLIBCXX_MOVE(*(this->_M_impl._M_finish - 1)));
|
|
++this->_M_impl._M_finish;
|
|
_GLIBCXX_ASAN_ANNOTATE_GREW(1);
|
|
#if __cplusplus < 201103L
|
|
_Tp __x_copy = __x;
|
|
#endif
|
|
_GLIBCXX_MOVE_BACKWARD3(__position.base(),
|
|
this->_M_impl._M_finish - 2,
|
|
this->_M_impl._M_finish - 1);
|
|
#if __cplusplus < 201103L
|
|
*__position = __x_copy;
|
|
#else
|
|
*__position = std::forward<_Arg>(__arg);
|
|
#endif
|
|
}
|
|
|
|
#if __cplusplus >= 201103L
|
|
template<typename _Tp, typename _Alloc>
|
|
template<typename... _Args>
|
|
_GLIBCXX20_CONSTEXPR
|
|
void
|
|
vector<_Tp, _Alloc>::
|
|
_M_realloc_insert(iterator __position, _Args&&... __args)
|
|
#else
|
|
template<typename _Tp, typename _Alloc>
|
|
void
|
|
vector<_Tp, _Alloc>::
|
|
_M_realloc_insert(iterator __position, const _Tp& __x)
|
|
#endif
|
|
{
|
|
const size_type __len = _M_check_len(1u, "vector::_M_realloc_insert");
|
|
if (__len <= 0)
|
|
__builtin_unreachable ();
|
|
pointer __old_start = this->_M_impl._M_start;
|
|
pointer __old_finish = this->_M_impl._M_finish;
|
|
const size_type __elems_before = __position - begin();
|
|
pointer __new_start(this->_M_allocate(__len));
|
|
pointer __new_finish(__new_start);
|
|
|
|
{
|
|
_Guard_alloc __guard(__new_start, __len, *this);
|
|
|
|
// The order of the three operations is dictated by the C++11
|
|
// case, where the moves could alter a new element belonging
|
|
// to the existing vector. This is an issue only for callers
|
|
// taking the element by lvalue ref (see last bullet of C++11
|
|
// [res.on.arguments]).
|
|
|
|
// If this throws, the existing elements are unchanged.
|
|
#if __cplusplus >= 201103L
|
|
_Alloc_traits::construct(this->_M_impl,
|
|
std::__to_address(__new_start + __elems_before),
|
|
std::forward<_Args>(__args)...);
|
|
#else
|
|
_Alloc_traits::construct(this->_M_impl,
|
|
__new_start + __elems_before,
|
|
__x);
|
|
#endif
|
|
|
|
#if __cplusplus >= 201103L
|
|
if _GLIBCXX17_CONSTEXPR (_S_use_relocate())
|
|
{
|
|
// Relocation cannot throw.
|
|
__new_finish = _S_relocate(__old_start, __position.base(),
|
|
__new_start, _M_get_Tp_allocator());
|
|
++__new_finish;
|
|
__new_finish = _S_relocate(__position.base(), __old_finish,
|
|
__new_finish, _M_get_Tp_allocator());
|
|
}
|
|
else
|
|
#endif
|
|
{
|
|
// RAII type to destroy initialized elements.
|
|
struct _Guard_elts
|
|
{
|
|
pointer _M_first, _M_last; // Elements to destroy
|
|
_Tp_alloc_type& _M_alloc;
|
|
|
|
_GLIBCXX20_CONSTEXPR
|
|
_Guard_elts(pointer __elt, _Tp_alloc_type& __a)
|
|
: _M_first(__elt), _M_last(__elt + 1), _M_alloc(__a)
|
|
{ }
|
|
|
|
_GLIBCXX20_CONSTEXPR
|
|
~_Guard_elts()
|
|
{ std::_Destroy(_M_first, _M_last, _M_alloc); }
|
|
|
|
private:
|
|
_Guard_elts(const _Guard_elts&);
|
|
};
|
|
|
|
// Guard the new element so it will be destroyed if anything throws.
|
|
_Guard_elts __guard_elts(__new_start + __elems_before, _M_impl);
|
|
|
|
__new_finish = std::__uninitialized_move_if_noexcept_a(
|
|
__old_start, __position.base(),
|
|
__new_start, _M_get_Tp_allocator());
|
|
|
|
++__new_finish;
|
|
// Guard everything before the new element too.
|
|
__guard_elts._M_first = __new_start;
|
|
|
|
__new_finish = std::__uninitialized_move_if_noexcept_a(
|
|
__position.base(), __old_finish,
|
|
__new_finish, _M_get_Tp_allocator());
|
|
|
|
// New storage has been fully initialized, destroy the old elements.
|
|
__guard_elts._M_first = __old_start;
|
|
__guard_elts._M_last = __old_finish;
|
|
}
|
|
__guard._M_storage = __old_start;
|
|
__guard._M_len = this->_M_impl._M_end_of_storage - __old_start;
|
|
}
|
|
// deallocate should be called before assignments to _M_impl,
|
|
// to avoid call-clobbering
|
|
|
|
this->_M_impl._M_start = __new_start;
|
|
this->_M_impl._M_finish = __new_finish;
|
|
this->_M_impl._M_end_of_storage = __new_start + __len;
|
|
}
|
|
|
|
#if __cplusplus >= 201103L
|
|
template<typename _Tp, typename _Alloc>
|
|
template<typename... _Args>
|
|
_GLIBCXX20_CONSTEXPR
|
|
void
|
|
vector<_Tp, _Alloc>::
|
|
_M_realloc_append(_Args&&... __args)
|
|
#else
|
|
template<typename _Tp, typename _Alloc>
|
|
void
|
|
vector<_Tp, _Alloc>::
|
|
_M_realloc_append(const _Tp& __x)
|
|
#endif
|
|
{
|
|
const size_type __len = _M_check_len(1u, "vector::_M_realloc_append");
|
|
if (__len <= 0)
|
|
__builtin_unreachable ();
|
|
pointer __old_start = this->_M_impl._M_start;
|
|
pointer __old_finish = this->_M_impl._M_finish;
|
|
const size_type __elems = end() - begin();
|
|
pointer __new_start(this->_M_allocate(__len));
|
|
pointer __new_finish(__new_start);
|
|
|
|
{
|
|
_Guard_alloc __guard(__new_start, __len, *this);
|
|
|
|
// The order of the three operations is dictated by the C++11
|
|
// case, where the moves could alter a new element belonging
|
|
// to the existing vector. This is an issue only for callers
|
|
// taking the element by lvalue ref (see last bullet of C++11
|
|
// [res.on.arguments]).
|
|
|
|
// If this throws, the existing elements are unchanged.
|
|
#if __cplusplus >= 201103L
|
|
_Alloc_traits::construct(this->_M_impl,
|
|
std::__to_address(__new_start + __elems),
|
|
std::forward<_Args>(__args)...);
|
|
#else
|
|
_Alloc_traits::construct(this->_M_impl,
|
|
__new_start + __elems,
|
|
__x);
|
|
#endif
|
|
|
|
#if __cplusplus >= 201103L
|
|
if _GLIBCXX17_CONSTEXPR (_S_use_relocate())
|
|
{
|
|
// Relocation cannot throw.
|
|
__new_finish = _S_relocate(__old_start, __old_finish,
|
|
__new_start, _M_get_Tp_allocator());
|
|
++__new_finish;
|
|
}
|
|
else
|
|
#endif
|
|
{
|
|
// RAII type to destroy initialized elements.
|
|
struct _Guard_elts
|
|
{
|
|
pointer _M_first, _M_last; // Elements to destroy
|
|
_Tp_alloc_type& _M_alloc;
|
|
|
|
_GLIBCXX20_CONSTEXPR
|
|
_Guard_elts(pointer __elt, _Tp_alloc_type& __a)
|
|
: _M_first(__elt), _M_last(__elt + 1), _M_alloc(__a)
|
|
{ }
|
|
|
|
_GLIBCXX20_CONSTEXPR
|
|
~_Guard_elts()
|
|
{ std::_Destroy(_M_first, _M_last, _M_alloc); }
|
|
|
|
private:
|
|
_Guard_elts(const _Guard_elts&);
|
|
};
|
|
|
|
// Guard the new element so it will be destroyed if anything throws.
|
|
_Guard_elts __guard_elts(__new_start + __elems, _M_impl);
|
|
|
|
__new_finish = std::__uninitialized_move_if_noexcept_a(
|
|
__old_start, __old_finish,
|
|
__new_start, _M_get_Tp_allocator());
|
|
|
|
++__new_finish;
|
|
|
|
// New storage has been fully initialized, destroy the old elements.
|
|
__guard_elts._M_first = __old_start;
|
|
__guard_elts._M_last = __old_finish;
|
|
}
|
|
__guard._M_storage = __old_start;
|
|
__guard._M_len = this->_M_impl._M_end_of_storage - __old_start;
|
|
}
|
|
// deallocate should be called before assignments to _M_impl,
|
|
// to avoid call-clobbering
|
|
|
|
this->_M_impl._M_start = __new_start;
|
|
this->_M_impl._M_finish = __new_finish;
|
|
this->_M_impl._M_end_of_storage = __new_start + __len;
|
|
}
|
|
|
|
template<typename _Tp, typename _Alloc>
|
|
_GLIBCXX20_CONSTEXPR
|
|
void
|
|
vector<_Tp, _Alloc>::
|
|
_M_fill_insert(iterator __position, size_type __n, const value_type& __x)
|
|
{
|
|
if (__n != 0)
|
|
{
|
|
if (size_type(this->_M_impl._M_end_of_storage
|
|
- this->_M_impl._M_finish) >= __n)
|
|
{
|
|
#if __cplusplus < 201103L
|
|
value_type __x_copy = __x;
|
|
#else
|
|
_Temporary_value __tmp(this, __x);
|
|
value_type& __x_copy = __tmp._M_val();
|
|
#endif
|
|
const size_type __elems_after = end() - __position;
|
|
pointer __old_finish(this->_M_impl._M_finish);
|
|
if (__elems_after > __n)
|
|
{
|
|
_GLIBCXX_ASAN_ANNOTATE_GROW(__n);
|
|
std::__uninitialized_move_a(__old_finish - __n,
|
|
__old_finish,
|
|
__old_finish,
|
|
_M_get_Tp_allocator());
|
|
this->_M_impl._M_finish += __n;
|
|
_GLIBCXX_ASAN_ANNOTATE_GREW(__n);
|
|
_GLIBCXX_MOVE_BACKWARD3(__position.base(),
|
|
__old_finish - __n, __old_finish);
|
|
std::fill(__position.base(), __position.base() + __n,
|
|
__x_copy);
|
|
}
|
|
else
|
|
{
|
|
_GLIBCXX_ASAN_ANNOTATE_GROW(__n);
|
|
this->_M_impl._M_finish =
|
|
std::__uninitialized_fill_n_a(__old_finish,
|
|
__n - __elems_after,
|
|
__x_copy,
|
|
_M_get_Tp_allocator());
|
|
_GLIBCXX_ASAN_ANNOTATE_GREW(__n - __elems_after);
|
|
std::__uninitialized_move_a(__position.base(), __old_finish,
|
|
this->_M_impl._M_finish,
|
|
_M_get_Tp_allocator());
|
|
this->_M_impl._M_finish += __elems_after;
|
|
_GLIBCXX_ASAN_ANNOTATE_GREW(__elems_after);
|
|
std::fill(__position.base(), __old_finish, __x_copy);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
// Make local copies of these members because the compiler thinks
|
|
// the allocator can alter them if 'this' is globally reachable.
|
|
pointer __old_start = this->_M_impl._M_start;
|
|
pointer __old_finish = this->_M_impl._M_finish;
|
|
const pointer __pos = __position.base();
|
|
|
|
const size_type __len =
|
|
_M_check_len(__n, "vector::_M_fill_insert");
|
|
const size_type __elems_before = __pos - __old_start;
|
|
pointer __new_start(this->_M_allocate(__len));
|
|
pointer __new_finish(__new_start);
|
|
__try
|
|
{
|
|
// See _M_realloc_insert above.
|
|
std::__uninitialized_fill_n_a(__new_start + __elems_before,
|
|
__n, __x,
|
|
_M_get_Tp_allocator());
|
|
__new_finish = pointer();
|
|
|
|
__new_finish
|
|
= std::__uninitialized_move_if_noexcept_a
|
|
(__old_start, __pos, __new_start, _M_get_Tp_allocator());
|
|
|
|
__new_finish += __n;
|
|
|
|
__new_finish
|
|
= std::__uninitialized_move_if_noexcept_a
|
|
(__pos, __old_finish, __new_finish, _M_get_Tp_allocator());
|
|
}
|
|
__catch(...)
|
|
{
|
|
if (!__new_finish)
|
|
std::_Destroy(__new_start + __elems_before,
|
|
__new_start + __elems_before + __n,
|
|
_M_get_Tp_allocator());
|
|
else
|
|
std::_Destroy(__new_start, __new_finish,
|
|
_M_get_Tp_allocator());
|
|
_M_deallocate(__new_start, __len);
|
|
__throw_exception_again;
|
|
}
|
|
std::_Destroy(__old_start, __old_finish, _M_get_Tp_allocator());
|
|
_GLIBCXX_ASAN_ANNOTATE_REINIT;
|
|
_M_deallocate(__old_start,
|
|
this->_M_impl._M_end_of_storage - __old_start);
|
|
this->_M_impl._M_start = __new_start;
|
|
this->_M_impl._M_finish = __new_finish;
|
|
this->_M_impl._M_end_of_storage = __new_start + __len;
|
|
}
|
|
}
|
|
}
|
|
|
|
#if __cplusplus >= 201103L
|
|
template<typename _Tp, typename _Alloc>
|
|
_GLIBCXX20_CONSTEXPR
|
|
void
|
|
vector<_Tp, _Alloc>::
|
|
_M_default_append(size_type __n)
|
|
{
|
|
if (__n != 0)
|
|
{
|
|
const size_type __size = size();
|
|
size_type __navail = size_type(this->_M_impl._M_end_of_storage
|
|
- this->_M_impl._M_finish);
|
|
|
|
if (__size > max_size() || __navail > max_size() - __size)
|
|
__builtin_unreachable();
|
|
|
|
if (__navail >= __n)
|
|
{
|
|
_GLIBCXX_ASAN_ANNOTATE_GROW(__n);
|
|
this->_M_impl._M_finish =
|
|
std::__uninitialized_default_n_a(this->_M_impl._M_finish,
|
|
__n, _M_get_Tp_allocator());
|
|
_GLIBCXX_ASAN_ANNOTATE_GREW(__n);
|
|
}
|
|
else
|
|
{
|
|
// Make local copies of these members because the compiler thinks
|
|
// the allocator can alter them if 'this' is globally reachable.
|
|
pointer __old_start = this->_M_impl._M_start;
|
|
pointer __old_finish = this->_M_impl._M_finish;
|
|
|
|
const size_type __len =
|
|
_M_check_len(__n, "vector::_M_default_append");
|
|
pointer __new_start(this->_M_allocate(__len));
|
|
|
|
{
|
|
_Guard_alloc __guard(__new_start, __len, *this);
|
|
|
|
std::__uninitialized_default_n_a(__new_start + __size, __n,
|
|
_M_get_Tp_allocator());
|
|
|
|
if _GLIBCXX17_CONSTEXPR (_S_use_relocate())
|
|
{
|
|
_S_relocate(__old_start, __old_finish,
|
|
__new_start, _M_get_Tp_allocator());
|
|
}
|
|
else
|
|
{
|
|
// RAII type to destroy initialized elements.
|
|
struct _Guard_elts
|
|
{
|
|
pointer _M_first, _M_last; // Elements to destroy
|
|
_Tp_alloc_type& _M_alloc;
|
|
|
|
_GLIBCXX20_CONSTEXPR
|
|
_Guard_elts(pointer __first, size_type __n,
|
|
_Tp_alloc_type& __a)
|
|
: _M_first(__first), _M_last(__first + __n), _M_alloc(__a)
|
|
{ }
|
|
|
|
_GLIBCXX20_CONSTEXPR
|
|
~_Guard_elts()
|
|
{ std::_Destroy(_M_first, _M_last, _M_alloc); }
|
|
|
|
private:
|
|
_Guard_elts(const _Guard_elts&);
|
|
};
|
|
_Guard_elts __guard_elts(__new_start + __size, __n, _M_impl);
|
|
|
|
std::__uninitialized_move_if_noexcept_a(
|
|
__old_start, __old_finish, __new_start,
|
|
_M_get_Tp_allocator());
|
|
|
|
__guard_elts._M_first = __old_start;
|
|
__guard_elts._M_last = __old_finish;
|
|
}
|
|
_GLIBCXX_ASAN_ANNOTATE_REINIT;
|
|
__guard._M_storage = __old_start;
|
|
__guard._M_len = this->_M_impl._M_end_of_storage - __old_start;
|
|
}
|
|
// deallocate should be called before assignments to _M_impl,
|
|
// to avoid call-clobbering
|
|
|
|
this->_M_impl._M_start = __new_start;
|
|
this->_M_impl._M_finish = __new_start + __size + __n;
|
|
this->_M_impl._M_end_of_storage = __new_start + __len;
|
|
}
|
|
}
|
|
}
|
|
|
|
template<typename _Tp, typename _Alloc>
|
|
_GLIBCXX20_CONSTEXPR
|
|
bool
|
|
vector<_Tp, _Alloc>::
|
|
_M_shrink_to_fit()
|
|
{
|
|
if (capacity() == size())
|
|
return false;
|
|
_GLIBCXX_ASAN_ANNOTATE_REINIT;
|
|
return std::__shrink_to_fit_aux<vector>::_S_do_it(*this);
|
|
}
|
|
#endif
|
|
|
|
template<typename _Tp, typename _Alloc>
|
|
template<typename _InputIterator>
|
|
_GLIBCXX20_CONSTEXPR
|
|
void
|
|
vector<_Tp, _Alloc>::
|
|
_M_range_insert(iterator __pos, _InputIterator __first,
|
|
_InputIterator __last, std::input_iterator_tag)
|
|
{
|
|
if (__pos == end())
|
|
{
|
|
for (; __first != __last; ++__first)
|
|
insert(end(), *__first);
|
|
}
|
|
else if (__first != __last)
|
|
{
|
|
vector __tmp(__first, __last, _M_get_Tp_allocator());
|
|
insert(__pos,
|
|
_GLIBCXX_MAKE_MOVE_ITERATOR(__tmp.begin()),
|
|
_GLIBCXX_MAKE_MOVE_ITERATOR(__tmp.end()));
|
|
}
|
|
}
|
|
|
|
template<typename _Tp, typename _Alloc>
|
|
template<typename _ForwardIterator>
|
|
_GLIBCXX20_CONSTEXPR
|
|
void
|
|
vector<_Tp, _Alloc>::
|
|
_M_range_insert(iterator __position, _ForwardIterator __first,
|
|
_ForwardIterator __last, std::forward_iterator_tag)
|
|
{
|
|
if (__first != __last)
|
|
{
|
|
const size_type __n = std::distance(__first, __last);
|
|
if (size_type(this->_M_impl._M_end_of_storage
|
|
- this->_M_impl._M_finish) >= __n)
|
|
{
|
|
const size_type __elems_after = end() - __position;
|
|
pointer __old_finish(this->_M_impl._M_finish);
|
|
if (__elems_after > __n)
|
|
{
|
|
_GLIBCXX_ASAN_ANNOTATE_GROW(__n);
|
|
std::__uninitialized_move_a(this->_M_impl._M_finish - __n,
|
|
this->_M_impl._M_finish,
|
|
this->_M_impl._M_finish,
|
|
_M_get_Tp_allocator());
|
|
this->_M_impl._M_finish += __n;
|
|
_GLIBCXX_ASAN_ANNOTATE_GREW(__n);
|
|
_GLIBCXX_MOVE_BACKWARD3(__position.base(),
|
|
__old_finish - __n, __old_finish);
|
|
std::copy(__first, __last, __position);
|
|
}
|
|
else
|
|
{
|
|
_ForwardIterator __mid = __first;
|
|
std::advance(__mid, __elems_after);
|
|
_GLIBCXX_ASAN_ANNOTATE_GROW(__n);
|
|
std::__uninitialized_copy_a(__mid, __last,
|
|
this->_M_impl._M_finish,
|
|
_M_get_Tp_allocator());
|
|
this->_M_impl._M_finish += __n - __elems_after;
|
|
_GLIBCXX_ASAN_ANNOTATE_GREW(__n - __elems_after);
|
|
std::__uninitialized_move_a(__position.base(),
|
|
__old_finish,
|
|
this->_M_impl._M_finish,
|
|
_M_get_Tp_allocator());
|
|
this->_M_impl._M_finish += __elems_after;
|
|
_GLIBCXX_ASAN_ANNOTATE_GREW(__elems_after);
|
|
std::copy(__first, __mid, __position);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
// Make local copies of these members because the compiler
|
|
// thinks the allocator can alter them if 'this' is globally
|
|
// reachable.
|
|
pointer __old_start = this->_M_impl._M_start;
|
|
pointer __old_finish = this->_M_impl._M_finish;
|
|
|
|
const size_type __len =
|
|
_M_check_len(__n, "vector::_M_range_insert");
|
|
#if __cplusplus < 201103L
|
|
if (__len < (__n + (__old_start - __old_finish)))
|
|
__builtin_unreachable();
|
|
#endif
|
|
|
|
pointer __new_start(this->_M_allocate(__len));
|
|
pointer __new_finish(__new_start);
|
|
__try
|
|
{
|
|
__new_finish
|
|
= std::__uninitialized_move_if_noexcept_a
|
|
(__old_start, __position.base(),
|
|
__new_start, _M_get_Tp_allocator());
|
|
__new_finish
|
|
= std::__uninitialized_copy_a(__first, __last,
|
|
__new_finish,
|
|
_M_get_Tp_allocator());
|
|
__new_finish
|
|
= std::__uninitialized_move_if_noexcept_a
|
|
(__position.base(), __old_finish,
|
|
__new_finish, _M_get_Tp_allocator());
|
|
}
|
|
__catch(...)
|
|
{
|
|
std::_Destroy(__new_start, __new_finish,
|
|
_M_get_Tp_allocator());
|
|
_M_deallocate(__new_start, __len);
|
|
__throw_exception_again;
|
|
}
|
|
std::_Destroy(__old_start, __old_finish,
|
|
_M_get_Tp_allocator());
|
|
_GLIBCXX_ASAN_ANNOTATE_REINIT;
|
|
_M_deallocate(__old_start,
|
|
this->_M_impl._M_end_of_storage - __old_start);
|
|
this->_M_impl._M_start = __new_start;
|
|
this->_M_impl._M_finish = __new_finish;
|
|
this->_M_impl._M_end_of_storage = __new_start + __len;
|
|
}
|
|
}
|
|
}
|
|
|
|
#if __glibcxx_ranges_to_container // C++ >= 23
|
|
template<typename _Tp, typename _Alloc>
|
|
template<__detail::__container_compatible_range<_Tp> _Rg>
|
|
constexpr auto
|
|
vector<_Tp, _Alloc>::
|
|
insert_range(const_iterator __pos, _Rg&& __rg)
|
|
-> iterator
|
|
{
|
|
if (__pos == cend())
|
|
{
|
|
append_range(std::forward<_Rg>(__rg));
|
|
return end();
|
|
}
|
|
|
|
if constexpr (ranges::forward_range<_Rg>)
|
|
{
|
|
// Start of existing elements:
|
|
pointer __old_start = this->_M_impl._M_start;
|
|
// End of existing elements:
|
|
pointer __old_finish = this->_M_impl._M_finish;
|
|
// Insertion point:
|
|
const auto __ins_idx = __pos - cbegin();
|
|
pointer __ins = __old_start + __ins_idx;
|
|
// Number of new elements to insert:
|
|
const auto __n = size_type(ranges::distance(__rg));
|
|
// Number of elements that can fit in unused capacity:
|
|
const auto __cap = this->_M_impl._M_end_of_storage - __old_finish;
|
|
if (__cap >= __n)
|
|
{
|
|
// Number of existing elements after insertion point:
|
|
const size_type __elems_after = cend() - __pos;
|
|
if (__elems_after > __n)
|
|
{
|
|
_GLIBCXX_ASAN_ANNOTATE_GROW(__n);
|
|
std::__uninitialized_move_a(__old_finish - __n,
|
|
__old_finish,
|
|
__old_finish,
|
|
_M_get_Tp_allocator());
|
|
this->_M_impl._M_finish += __n;
|
|
_GLIBCXX_ASAN_ANNOTATE_GREW(__n);
|
|
std::move_backward(__ins, __old_finish - __n, __old_finish);
|
|
ranges::copy(__rg, __ins);
|
|
}
|
|
else
|
|
{
|
|
auto __first = ranges::begin(__rg);
|
|
const auto __last = ranges::end(__rg);
|
|
auto __mid = ranges::next(__first, __elems_after);
|
|
_GLIBCXX_ASAN_ANNOTATE_GROW(__n);
|
|
_Base::_M_append_range(ranges::subrange(__mid, __last));
|
|
_GLIBCXX_ASAN_ANNOTATE_GREW(__n - __elems_after);
|
|
std::__uninitialized_move_a(__ins, __old_finish,
|
|
this->_M_impl._M_finish,
|
|
_M_get_Tp_allocator());
|
|
this->_M_impl._M_finish += __elems_after;
|
|
_GLIBCXX_ASAN_ANNOTATE_GREW(__elems_after);
|
|
ranges::copy(__first, __mid, __ins);
|
|
}
|
|
}
|
|
else // Reallocate
|
|
{
|
|
const size_type __len
|
|
= _M_check_len(__n, "vector::insert_range");
|
|
|
|
struct _Guard : _Guard_alloc
|
|
{
|
|
// End of elements to destroy:
|
|
pointer _M_finish = _Guard_alloc::_M_storage;
|
|
|
|
using _Guard_alloc::_Guard_alloc;
|
|
|
|
constexpr
|
|
~_Guard()
|
|
{
|
|
std::_Destroy(this->_M_storage, _M_finish,
|
|
this->_M_vect._M_get_Tp_allocator());
|
|
}
|
|
};
|
|
|
|
// Allocate new storage:
|
|
pointer __new_start(this->_M_allocate(__len));
|
|
_Guard __guard(__new_start, __len, *this);
|
|
|
|
auto& __alloc = _M_get_Tp_allocator();
|
|
|
|
// Populate the new storage in three steps. After each step,
|
|
// __guard owns the new storage and any elements that have
|
|
// been constructed there.
|
|
|
|
// Move elements from before insertion point to new storage:
|
|
__guard._M_finish
|
|
= std::__uninitialized_move_if_noexcept_a(
|
|
__old_start, __ins, __new_start, __alloc);
|
|
|
|
// Append new elements to new storage:
|
|
_Base::_M_append_range_to(__rg, __guard._M_finish);
|
|
|
|
// Move elements from after insertion point to new storage:
|
|
__guard._M_finish
|
|
= std::__uninitialized_move_if_noexcept_a(
|
|
__ins, __old_finish, __guard._M_finish, __alloc);
|
|
|
|
_GLIBCXX_ASAN_ANNOTATE_REINIT; // Creates _Asan::_Reinit.
|
|
|
|
// All elements are in the new storage, exchange ownership
|
|
// with __guard so that it cleans up the old storage:
|
|
this->_M_impl._M_start = __guard._M_storage;
|
|
this->_M_impl._M_finish = __guard._M_finish;
|
|
this->_M_impl._M_end_of_storage = __new_start + __len;
|
|
__guard._M_storage = __old_start;
|
|
__guard._M_finish = __old_finish;
|
|
__guard._M_len = (__old_finish - __old_start) + __cap;
|
|
// _Asan::_Reinit destructor marks unused capacity.
|
|
// _Guard destructor destroys [old_start,old_finish).
|
|
// _Guard_alloc destructor frees [old_start,old_start+len).
|
|
}
|
|
return begin() + __ins_idx;
|
|
}
|
|
else
|
|
return insert_range(__pos, vector(from_range, std::move(__rg),
|
|
_M_get_Tp_allocator()));
|
|
}
|
|
#endif // ranges_to_container
|
|
|
|
// vector<bool>
|
|
template<typename _Alloc>
|
|
_GLIBCXX20_CONSTEXPR
|
|
void
|
|
vector<bool, _Alloc>::
|
|
_M_reallocate(size_type __n)
|
|
{
|
|
_Bit_pointer __q = this->_M_allocate(__n);
|
|
iterator __start(std::__addressof(*__q), 0);
|
|
iterator __finish(_M_copy_aligned(begin(), end(), __start));
|
|
this->_M_deallocate();
|
|
this->_M_impl._M_start = __start;
|
|
this->_M_impl._M_finish = __finish;
|
|
this->_M_impl._M_end_of_storage = __q + _S_nword(__n);
|
|
}
|
|
|
|
template<typename _Alloc>
|
|
_GLIBCXX20_CONSTEXPR
|
|
void
|
|
vector<bool, _Alloc>::
|
|
_M_fill_insert(iterator __position, size_type __n, bool __x)
|
|
{
|
|
if (__n == 0)
|
|
return;
|
|
if (capacity() - size() >= __n)
|
|
{
|
|
std::copy_backward(__position, end(),
|
|
this->_M_impl._M_finish + difference_type(__n));
|
|
std::fill(__position, __position + difference_type(__n), __x);
|
|
this->_M_impl._M_finish += difference_type(__n);
|
|
}
|
|
else
|
|
{
|
|
const size_type __len =
|
|
_M_check_len(__n, "vector<bool>::_M_fill_insert");
|
|
_Bit_pointer __q = this->_M_allocate(__len);
|
|
iterator __start(std::__addressof(*__q), 0);
|
|
iterator __i = _M_copy_aligned(begin(), __position, __start);
|
|
std::fill(__i, __i + difference_type(__n), __x);
|
|
iterator __finish = std::copy(__position, end(),
|
|
__i + difference_type(__n));
|
|
this->_M_deallocate();
|
|
this->_M_impl._M_end_of_storage = __q + _S_nword(__len);
|
|
this->_M_impl._M_start = __start;
|
|
this->_M_impl._M_finish = __finish;
|
|
}
|
|
}
|
|
|
|
template<typename _Alloc>
|
|
template<typename _ForwardIterator>
|
|
_GLIBCXX20_CONSTEXPR
|
|
void
|
|
vector<bool, _Alloc>::
|
|
_M_insert_range(iterator __position, _ForwardIterator __first,
|
|
_ForwardIterator __last, std::forward_iterator_tag)
|
|
{
|
|
if (__first != __last)
|
|
{
|
|
size_type __n = std::distance(__first, __last);
|
|
if (capacity() - size() >= __n)
|
|
{
|
|
std::copy_backward(__position, end(),
|
|
this->_M_impl._M_finish
|
|
+ difference_type(__n));
|
|
std::copy(__first, __last, __position);
|
|
this->_M_impl._M_finish += difference_type(__n);
|
|
}
|
|
else
|
|
{
|
|
const size_type __len =
|
|
_M_check_len(__n, "vector<bool>::_M_insert_range");
|
|
const iterator __begin = begin(), __end = end();
|
|
_Bit_pointer __q = this->_M_allocate(__len);
|
|
iterator __start(std::__addressof(*__q), 0);
|
|
iterator __i = _M_copy_aligned(__begin, __position, __start);
|
|
__i = std::copy(__first, __last, __i);
|
|
iterator __finish = std::copy(__position, __end, __i);
|
|
this->_M_deallocate();
|
|
this->_M_impl._M_end_of_storage = __q + _S_nword(__len);
|
|
this->_M_impl._M_start = __start;
|
|
this->_M_impl._M_finish = __finish;
|
|
}
|
|
}
|
|
}
|
|
|
|
template<typename _Alloc>
|
|
_GLIBCXX20_CONSTEXPR
|
|
void
|
|
vector<bool, _Alloc>::
|
|
_M_insert_aux(iterator __position, bool __x)
|
|
{
|
|
if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_addr())
|
|
{
|
|
std::copy_backward(__position, this->_M_impl._M_finish,
|
|
this->_M_impl._M_finish + 1);
|
|
*__position = __x;
|
|
++this->_M_impl._M_finish;
|
|
}
|
|
else
|
|
{
|
|
const size_type __len =
|
|
_M_check_len(size_type(1), "vector<bool>::_M_insert_aux");
|
|
_Bit_pointer __q = this->_M_allocate(__len);
|
|
iterator __start(std::__addressof(*__q), 0);
|
|
iterator __i = _M_copy_aligned(begin(), __position, __start);
|
|
*__i++ = __x;
|
|
iterator __finish = std::copy(__position, end(), __i);
|
|
this->_M_deallocate();
|
|
this->_M_impl._M_end_of_storage = __q + _S_nword(__len);
|
|
this->_M_impl._M_start = __start;
|
|
this->_M_impl._M_finish = __finish;
|
|
}
|
|
}
|
|
|
|
template<typename _Alloc>
|
|
_GLIBCXX20_CONSTEXPR
|
|
typename vector<bool, _Alloc>::iterator
|
|
vector<bool, _Alloc>::
|
|
_M_erase(iterator __position)
|
|
{
|
|
if (__position + 1 != end())
|
|
std::copy(__position + 1, end(), __position);
|
|
--this->_M_impl._M_finish;
|
|
return __position;
|
|
}
|
|
|
|
template<typename _Alloc>
|
|
_GLIBCXX20_CONSTEXPR
|
|
typename vector<bool, _Alloc>::iterator
|
|
vector<bool, _Alloc>::
|
|
_M_erase(iterator __first, iterator __last)
|
|
{
|
|
if (__first != __last)
|
|
_M_erase_at_end(std::copy(__last, end(), __first));
|
|
return __first;
|
|
}
|
|
|
|
#if __cplusplus >= 201103L
|
|
template<typename _Alloc>
|
|
_GLIBCXX20_CONSTEXPR
|
|
bool
|
|
vector<bool, _Alloc>::
|
|
_M_shrink_to_fit()
|
|
{
|
|
if (capacity() - size() < int(_S_word_bit))
|
|
return false;
|
|
__try
|
|
{
|
|
if (size_type __n = size())
|
|
_M_reallocate(__n);
|
|
else
|
|
{
|
|
this->_M_deallocate();
|
|
this->_M_impl._M_reset();
|
|
}
|
|
return true;
|
|
}
|
|
__catch(...)
|
|
{ return false; }
|
|
}
|
|
#endif
|
|
|
|
_GLIBCXX_END_NAMESPACE_CONTAINER
|
|
_GLIBCXX_END_NAMESPACE_VERSION
|
|
} // namespace std
|
|
|
|
#if __cplusplus >= 201103L
|
|
|
|
namespace std _GLIBCXX_VISIBILITY(default)
|
|
{
|
|
_GLIBCXX_BEGIN_NAMESPACE_VERSION
|
|
|
|
template<typename _Alloc>
|
|
size_t
|
|
hash<_GLIBCXX_STD_C::vector<bool, _Alloc>>::
|
|
operator()(const _GLIBCXX_STD_C::vector<bool, _Alloc>& __b) const noexcept
|
|
{
|
|
size_t __hash = 0;
|
|
const size_t __words = __b.size() / _S_word_bit;
|
|
if (__words)
|
|
{
|
|
const size_t __clength = __words * sizeof(_Bit_type);
|
|
__hash = std::_Hash_impl::hash(__b._M_impl._M_start._M_p, __clength);
|
|
}
|
|
|
|
const size_t __extrabits = __b.size() % _S_word_bit;
|
|
if (__extrabits)
|
|
{
|
|
_Bit_type __hiword = *__b._M_impl._M_finish._M_p;
|
|
__hiword &= ~((~static_cast<_Bit_type>(0)) << __extrabits);
|
|
|
|
const size_t __clength
|
|
= (__extrabits + __CHAR_BIT__ - 1) / __CHAR_BIT__;
|
|
if (__words)
|
|
__hash = std::_Hash_impl::hash(&__hiword, __clength, __hash);
|
|
else
|
|
__hash = std::_Hash_impl::hash(&__hiword, __clength);
|
|
}
|
|
|
|
return __hash;
|
|
}
|
|
|
|
_GLIBCXX_END_NAMESPACE_VERSION
|
|
} // namespace std
|
|
|
|
#endif // C++11
|
|
|
|
#undef _GLIBCXX_ASAN_ANNOTATE_REINIT
|
|
#undef _GLIBCXX_ASAN_ANNOTATE_GROW
|
|
#undef _GLIBCXX_ASAN_ANNOTATE_GREW
|
|
#undef _GLIBCXX_ASAN_ANNOTATE_SHRINK
|
|
|
|
#endif /* _VECTOR_TCC */
|