From 71982330053af6fe85fe4dbf04555571cd53b1b2 Mon Sep 17 00:00:00 2001 From: Nikolas Klauser Date: Fri, 19 Jul 2024 22:43:24 +0200 Subject: [PATCH] [libc++] Granularize --- libcxx/include/CMakeLists.txt | 8 + libcxx/include/__chrono/tzdb.h | 2 +- .../__functional/boyer_moore_searcher.h | 3 +- libcxx/include/__fwd/vector.h | 3 + .../include/__random/discrete_distribution.h | 3 +- .../piecewise_constant_distribution.h | 3 +- .../__random/piecewise_linear_distribution.h | 4 +- libcxx/include/__random/seed_seq.h | 2 +- libcxx/include/__vector/comparison.h | 71 + libcxx/include/__vector/container_traits.h | 39 + libcxx/include/__vector/erase.h | 50 + libcxx/include/__vector/pmr.h | 33 + libcxx/include/__vector/swap.h | 29 + libcxx/include/__vector/vector.h | 1536 ++++++++++ libcxx/include/__vector/vector_bool.h | 1123 +++++++ .../include/__vector/vector_bool_formatter.h | 49 + libcxx/include/chrono | 1 + libcxx/include/functional | 2 +- libcxx/include/module.modulemap | 33 + libcxx/include/vector | 2726 +---------------- .../vector.bool/abi.compile.pass.cpp | 2 +- .../libcxx/memory/swap_allocator.pass.cpp | 3 +- .../test/libcxx/transitive_includes/cxx23.csv | 16 - .../test/libcxx/transitive_includes/cxx26.csv | 16 - .../std/atomics/atomics.ref/assign.pass.cpp | 1 + .../thread.lock.shared.cons/mutex.pass.cpp | 1 + .../time.zone.leap/cons.copy.pass.cpp | 3 +- .../time.zone.leap/members/value.pass.cpp | 1 + .../time.zone.link.members/name.pass.cpp | 1 + .../time.zone.link.members/target.pass.cpp | 1 + .../time.zone.members/name.pass.cpp | 1 + .../const_time_zone_default_zone.pass.cpp | 2 +- .../dereference.single.pass.cpp | 3 +- 33 files changed, 3028 insertions(+), 2743 deletions(-) create mode 100644 libcxx/include/__vector/comparison.h create mode 100644 libcxx/include/__vector/container_traits.h create mode 100644 libcxx/include/__vector/erase.h create mode 100644 libcxx/include/__vector/pmr.h create mode 100644 libcxx/include/__vector/swap.h create mode 100644 libcxx/include/__vector/vector.h create mode 100644 libcxx/include/__vector/vector_bool.h create mode 100644 libcxx/include/__vector/vector_bool_formatter.h diff --git a/libcxx/include/CMakeLists.txt b/libcxx/include/CMakeLists.txt index 86d2fc2c2c679d..975adc03ec81da 100644 --- a/libcxx/include/CMakeLists.txt +++ b/libcxx/include/CMakeLists.txt @@ -882,6 +882,14 @@ set(files __utility/to_underlying.h __utility/unreachable.h __variant/monostate.h + __vector/comparison.h + __vector/container_traits.h + __vector/erase.h + __vector/pmr.h + __vector/swap.h + __vector/vector.h + __vector/vector_bool.h + __vector/vector_bool_formatter.h __verbose_abort algorithm any diff --git a/libcxx/include/__chrono/tzdb.h b/libcxx/include/__chrono/tzdb.h index dce97c3adfa1ba..5bbb82f4424171 100644 --- a/libcxx/include/__chrono/tzdb.h +++ b/libcxx/include/__chrono/tzdb.h @@ -22,10 +22,10 @@ # include <__chrono/time_zone_link.h> # include <__config> # include <__memory/addressof.h> +# include <__vector/vector.h> # include # include # include -# include # if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) # pragma GCC system_header diff --git a/libcxx/include/__functional/boyer_moore_searcher.h b/libcxx/include/__functional/boyer_moore_searcher.h index 648b60c5052191..52a58d57a8d40a 100644 --- a/libcxx/include/__functional/boyer_moore_searcher.h +++ b/libcxx/include/__functional/boyer_moore_searcher.h @@ -22,9 +22,10 @@ #include <__memory/shared_ptr.h> #include <__type_traits/make_unsigned.h> #include <__utility/pair.h> +#include <__vector/vector.h> #include +#include #include -#include #if _LIBCPP_STD_VER >= 17 diff --git a/libcxx/include/__fwd/vector.h b/libcxx/include/__fwd/vector.h index c9cc96137449f8..6980e40ec91879 100644 --- a/libcxx/include/__fwd/vector.h +++ b/libcxx/include/__fwd/vector.h @@ -21,6 +21,9 @@ _LIBCPP_BEGIN_NAMESPACE_STD template > class _LIBCPP_TEMPLATE_VIS vector; +template +class vector; + _LIBCPP_END_NAMESPACE_STD #endif // _LIBCPP___FWD_VECTOR_H diff --git a/libcxx/include/__random/discrete_distribution.h b/libcxx/include/__random/discrete_distribution.h index bb72dd6cb5074c..931f7704ff9767 100644 --- a/libcxx/include/__random/discrete_distribution.h +++ b/libcxx/include/__random/discrete_distribution.h @@ -13,10 +13,11 @@ #include <__config> #include <__random/is_valid.h> #include <__random/uniform_real_distribution.h> +#include <__vector/vector.h> #include +#include #include #include -#include #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) # pragma GCC system_header diff --git a/libcxx/include/__random/piecewise_constant_distribution.h b/libcxx/include/__random/piecewise_constant_distribution.h index e19380f97c35ec..a864f848143ba1 100644 --- a/libcxx/include/__random/piecewise_constant_distribution.h +++ b/libcxx/include/__random/piecewise_constant_distribution.h @@ -13,9 +13,10 @@ #include <__config> #include <__random/is_valid.h> #include <__random/uniform_real_distribution.h> +#include <__vector/vector.h> +#include #include #include -#include #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) # pragma GCC system_header diff --git a/libcxx/include/__random/piecewise_linear_distribution.h b/libcxx/include/__random/piecewise_linear_distribution.h index 43769dc825e65b..24aa6cce91cf2d 100644 --- a/libcxx/include/__random/piecewise_linear_distribution.h +++ b/libcxx/include/__random/piecewise_linear_distribution.h @@ -13,9 +13,11 @@ #include <__config> #include <__random/is_valid.h> #include <__random/uniform_real_distribution.h> +#include <__vector/comparison.h> +#include <__vector/vector.h> #include +#include #include -#include #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) # pragma GCC system_header diff --git a/libcxx/include/__random/seed_seq.h b/libcxx/include/__random/seed_seq.h index c1a320a75c88aa..3f60069a916db1 100644 --- a/libcxx/include/__random/seed_seq.h +++ b/libcxx/include/__random/seed_seq.h @@ -17,9 +17,9 @@ #include <__type_traits/enable_if.h> #include <__type_traits/is_integral.h> #include <__type_traits/is_unsigned.h> +#include <__vector/vector.h> #include #include -#include #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) # pragma GCC system_header diff --git a/libcxx/include/__vector/comparison.h b/libcxx/include/__vector/comparison.h new file mode 100644 index 00000000000000..27178e41ec5134 --- /dev/null +++ b/libcxx/include/__vector/comparison.h @@ -0,0 +1,71 @@ +//===----------------------------------------------------------------------===// +// +// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. +// See https://llvm.org/LICENSE.txt for license information. +// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception +// +//===----------------------------------------------------------------------===// + +#ifndef _LIBCPP___VECTOR_COMPARISON_H +#define _LIBCPP___VECTOR_COMPARISON_H + +#include <__algorithm/equal.h> +#include <__algorithm/lexicographical_compare.h> +#include <__algorithm/lexicographical_compare_three_way.h> +#include <__compare/synth_three_way.h> +#include <__config> +#include <__fwd/vector.h> + +#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) +# pragma GCC system_header +#endif + +_LIBCPP_BEGIN_NAMESPACE_STD + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI bool +operator==(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y) { + const typename vector<_Tp, _Allocator>::size_type __sz = __x.size(); + return __sz == __y.size() && std::equal(__x.begin(), __x.end(), __y.begin()); +} + +#if _LIBCPP_STD_VER <= 17 + +template +inline _LIBCPP_HIDE_FROM_ABI bool operator!=(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y) { + return !(__x == __y); +} + +template +inline _LIBCPP_HIDE_FROM_ABI bool operator<(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y) { + return std::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end()); +} + +template +inline _LIBCPP_HIDE_FROM_ABI bool operator>(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y) { + return __y < __x; +} + +template +inline _LIBCPP_HIDE_FROM_ABI bool operator>=(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y) { + return !(__x < __y); +} + +template +inline _LIBCPP_HIDE_FROM_ABI bool operator<=(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y) { + return !(__y < __x); +} + +#else // _LIBCPP_STD_VER <= 17 + +template +_LIBCPP_HIDE_FROM_ABI constexpr __synth_three_way_result<_Tp> +operator<=>(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y) { + return std::lexicographical_compare_three_way(__x.begin(), __x.end(), __y.begin(), __y.end(), std::__synth_three_way); +} + +#endif // _LIBCPP_STD_VER <= 17 + +_LIBCPP_END_NAMESPACE_STD + +#endif // _LIBCPP___VECTOR_COMPARISON_H diff --git a/libcxx/include/__vector/container_traits.h b/libcxx/include/__vector/container_traits.h new file mode 100644 index 00000000000000..7b1497a404f2bb --- /dev/null +++ b/libcxx/include/__vector/container_traits.h @@ -0,0 +1,39 @@ +//===----------------------------------------------------------------------===// +// +// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. +// See https://llvm.org/LICENSE.txt for license information. +// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception +// +//===----------------------------------------------------------------------===// + +#ifndef _LIBCPP___VECTOR_CONTAINER_TRAITS_H +#define _LIBCPP___VECTOR_CONTAINER_TRAITS_H + +#include <__config> +#include <__fwd/vector.h> +#include <__memory/allocator_traits.h> +#include <__type_traits/container_traits.h> +#include <__type_traits/disjunction.h> +#include <__type_traits/is_nothrow_constructible.h> + +#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) +# pragma GCC system_header +#endif + +_LIBCPP_BEGIN_NAMESPACE_STD + +template +struct __container_traits > { + // http://eel.is/c++draft/vector.modifiers#2 + // If an exception is thrown other than by the copy constructor, move constructor, assignment operator, or move + // assignment operator of T or by any InputIterator operation, there are no effects. If an exception is thrown while + // inserting a single element at the end and T is Cpp17CopyInsertable or is_nothrow_move_constructible_v is true, + // there are no effects. Otherwise, if an exception is thrown by the move constructor of a non-Cpp17CopyInsertable T, + // the effects are unspecified. + static _LIBCPP_CONSTEXPR const bool __emplacement_has_strong_exception_safety_guarantee = + _Or, __is_cpp17_copy_insertable<_Allocator> >::value; +}; + +_LIBCPP_END_NAMESPACE_STD + +#endif // _LIBCPP___VECTOR_CONTAINER_TRAITS_H diff --git a/libcxx/include/__vector/erase.h b/libcxx/include/__vector/erase.h new file mode 100644 index 00000000000000..d7379fc1d04e1f --- /dev/null +++ b/libcxx/include/__vector/erase.h @@ -0,0 +1,50 @@ +//===----------------------------------------------------------------------===// +// +// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. +// See https://llvm.org/LICENSE.txt for license information. +// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception +// +//===----------------------------------------------------------------------===// + +#ifndef _LIBCPP___VECTOR_ERASE_H +#define _LIBCPP___VECTOR_ERASE_H + +#include <__algorithm/remove.h> +#include <__algorithm/remove_if.h> +#include <__config> +#include <__fwd/vector.h> + +#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) +# pragma GCC system_header +#endif + +_LIBCPP_PUSH_MACROS +#include <__undef_macros> + +#if _LIBCPP_STD_VER >= 20 + +_LIBCPP_BEGIN_NAMESPACE_STD + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::size_type +erase(vector<_Tp, _Allocator>& __c, const _Up& __v) { + auto __old_size = __c.size(); + __c.erase(std::remove(__c.begin(), __c.end(), __v), __c.end()); + return __old_size - __c.size(); +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::size_type +erase_if(vector<_Tp, _Allocator>& __c, _Predicate __pred) { + auto __old_size = __c.size(); + __c.erase(std::remove_if(__c.begin(), __c.end(), __pred), __c.end()); + return __old_size - __c.size(); +} + +_LIBCPP_END_NAMESPACE_STD + +#endif // _LIBCPP_STD_VER >= 20 + +_LIBCPP_POP_MACROS + +#endif // _LIBCPP___VECTOR_ERASE_H diff --git a/libcxx/include/__vector/pmr.h b/libcxx/include/__vector/pmr.h new file mode 100644 index 00000000000000..8ef603c739a178 --- /dev/null +++ b/libcxx/include/__vector/pmr.h @@ -0,0 +1,33 @@ +//===----------------------------------------------------------------------===// +// +// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. +// See https://llvm.org/LICENSE.txt for license information. +// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception +// +//===----------------------------------------------------------------------===// + +#ifndef _LIBCPP___VECTOR_PMR_H +#define _LIBCPP___VECTOR_PMR_H + +#include <__config> +#include <__fwd/vector.h> +#include <__memory_resource/polymorphic_allocator.h> + +#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) +# pragma GCC system_header +#endif + +#if _LIBCPP_STD_VER >= 17 + +_LIBCPP_BEGIN_NAMESPACE_STD + +namespace pmr { +template +using vector _LIBCPP_AVAILABILITY_PMR = std::vector<_ValueT, polymorphic_allocator<_ValueT>>; +} // namespace pmr + +_LIBCPP_END_NAMESPACE_STD + +#endif + +#endif // _LIBCPP___VECTOR_PMR_H diff --git a/libcxx/include/__vector/swap.h b/libcxx/include/__vector/swap.h new file mode 100644 index 00000000000000..7fe27a91419b39 --- /dev/null +++ b/libcxx/include/__vector/swap.h @@ -0,0 +1,29 @@ +//===----------------------------------------------------------------------===// +// +// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. +// See https://llvm.org/LICENSE.txt for license information. +// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception +// +//===----------------------------------------------------------------------===// + +#ifndef _LIBCPP___VECTOR_SWAP_H +#define _LIBCPP___VECTOR_SWAP_H + +#include <__config> +#include <__fwd/vector.h> + +#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) +# pragma GCC system_header +#endif + +_LIBCPP_BEGIN_NAMESPACE_STD + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI void +swap(vector<_Tp, _Allocator>& __x, vector<_Tp, _Allocator>& __y) _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y))) { + __x.swap(__y); +} + +_LIBCPP_END_NAMESPACE_STD + +#endif // _LIBCPP___VECTOR_SWAP_H diff --git a/libcxx/include/__vector/vector.h b/libcxx/include/__vector/vector.h new file mode 100644 index 00000000000000..d0e69208ea4602 --- /dev/null +++ b/libcxx/include/__vector/vector.h @@ -0,0 +1,1536 @@ +//===----------------------------------------------------------------------===// +// +// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. +// See https://llvm.org/LICENSE.txt for license information. +// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception +// +//===----------------------------------------------------------------------===// + +#ifndef _LIBCPP___VECTOR_VECTOR_H +#define _LIBCPP___VECTOR_VECTOR_H + +#include <__algorithm/copy.h> +#include <__algorithm/fill_n.h> +#include <__algorithm/iterator_operations.h> +#include <__algorithm/max.h> +#include <__algorithm/min.h> +#include <__algorithm/move.h> +#include <__algorithm/move_backward.h> +#include <__algorithm/rotate.h> +#include <__assert> +#include <__config> +#include <__debug_utils/sanitizers.h> +#include <__format/enable_insertable.h> +#include <__fwd/vector.h> +#include <__iterator/bounded_iter.h> +#include <__iterator/distance.h> +#include <__iterator/iterator_traits.h> +#include <__iterator/move_iterator.h> +#include <__iterator/next.h> +#include <__iterator/reverse_iterator.h> +#include <__iterator/wrap_iter.h> +#include <__memory/addressof.h> +#include <__memory/allocate_at_least.h> +#include <__memory/allocator.h> +#include <__memory/allocator_traits.h> +#include <__memory/compressed_pair.h> +#include <__memory/noexcept_move_assign_container.h> +#include <__memory/pointer_traits.h> +#include <__memory/swap_allocator.h> +#include <__memory/temp_value.h> +#include <__memory/uninitialized_algorithms.h> +#include <__ranges/access.h> +#include <__ranges/concepts.h> +#include <__ranges/container_compatible_range.h> +#include <__ranges/from_range.h> +#include <__split_buffer> +#include <__type_traits/conditional.h> +#include <__type_traits/enable_if.h> +#include <__type_traits/is_allocator.h> +#include <__type_traits/is_constant_evaluated.h> +#include <__type_traits/is_constructible.h> +#include <__type_traits/is_nothrow_assignable.h> +#include <__type_traits/is_nothrow_constructible.h> +#include <__type_traits/is_same.h> +#include <__type_traits/is_trivially_relocatable.h> +#include <__type_traits/type_identity.h> +#include <__utility/exception_guard.h> +#include <__utility/forward.h> +#include <__utility/is_pointer_in_range.h> +#include <__utility/move.h> +#include <__utility/pair.h> +#include <__utility/swap.h> +#include +#include +#include + +// These headers define parts of vectors definition, since they define ADL functions or class specializations. +#include <__vector/comparison.h> +#include <__vector/container_traits.h> +#include <__vector/swap.h> + +#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) +# pragma GCC system_header +#endif + +_LIBCPP_PUSH_MACROS +#include <__undef_macros> + +_LIBCPP_BEGIN_NAMESPACE_STD + +template */> +class _LIBCPP_TEMPLATE_VIS vector { +private: + typedef allocator<_Tp> __default_allocator_type; + +public: + typedef vector __self; + typedef _Tp value_type; + typedef _Allocator allocator_type; + typedef allocator_traits __alloc_traits; + typedef value_type& reference; + typedef const value_type& const_reference; + typedef typename __alloc_traits::size_type size_type; + typedef typename __alloc_traits::difference_type difference_type; + typedef typename __alloc_traits::pointer pointer; + typedef typename __alloc_traits::const_pointer const_pointer; +#ifdef _LIBCPP_ABI_BOUNDED_ITERATORS_IN_VECTOR + // Users might provide custom allocators, and prior to C++20 we have no existing way to detect whether the allocator's + // pointer type is contiguous (though it has to be by the Standard). Using the wrapper type ensures the iterator is + // considered contiguous. + typedef __bounded_iter<__wrap_iter > iterator; + typedef __bounded_iter<__wrap_iter > const_iterator; +#else + typedef __wrap_iter iterator; + typedef __wrap_iter const_iterator; +#endif + typedef std::reverse_iterator reverse_iterator; + typedef std::reverse_iterator const_reverse_iterator; + + // A vector containers the following members which may be trivially relocatable: + // - pointer: may be trivially relocatable, so it's checked + // - allocator_type: may be trivially relocatable, so it's checked + // vector doesn't contain any self-references, so it's trivially relocatable if its members are. + using __trivially_relocatable = __conditional_t< + __libcpp_is_trivially_relocatable::value && __libcpp_is_trivially_relocatable::value, + vector, + void>; + + static_assert(__check_valid_allocator::value, ""); + static_assert(is_same::value, + "Allocator::value_type must be same type as value_type"); + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector() + _NOEXCEPT_(is_nothrow_default_constructible::value) {} + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI explicit vector(const allocator_type& __a) +#if _LIBCPP_STD_VER <= 14 + _NOEXCEPT_(is_nothrow_copy_constructible::value) +#else + noexcept +#endif + : __alloc_(__a) { + } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI explicit vector(size_type __n) { + auto __guard = std::__make_exception_guard(__destroy_vector(*this)); + if (__n > 0) { + __vallocate(__n); + __construct_at_end(__n); + } + __guard.__complete(); + } + +#if _LIBCPP_STD_VER >= 14 + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI explicit vector(size_type __n, const allocator_type& __a) + : __alloc_(__a) { + auto __guard = std::__make_exception_guard(__destroy_vector(*this)); + if (__n > 0) { + __vallocate(__n); + __construct_at_end(__n); + } + __guard.__complete(); + } +#endif + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector(size_type __n, const value_type& __x) { + auto __guard = std::__make_exception_guard(__destroy_vector(*this)); + if (__n > 0) { + __vallocate(__n); + __construct_at_end(__n, __x); + } + __guard.__complete(); + } + + template <__enable_if_t<__is_allocator<_Allocator>::value, int> = 0> + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI + vector(size_type __n, const value_type& __x, const allocator_type& __a) + : __alloc_(__a) { + if (__n > 0) { + __vallocate(__n); + __construct_at_end(__n, __x); + } + } + + template ::value && + is_constructible::reference>::value, + int> = 0> + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector(_InputIterator __first, _InputIterator __last); + template ::value && + is_constructible::reference>::value, + int> = 0> + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI + vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a); + + template < + class _ForwardIterator, + __enable_if_t<__has_forward_iterator_category<_ForwardIterator>::value && + is_constructible::reference>::value, + int> = 0> + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector(_ForwardIterator __first, _ForwardIterator __last); + + template < + class _ForwardIterator, + __enable_if_t<__has_forward_iterator_category<_ForwardIterator>::value && + is_constructible::reference>::value, + int> = 0> + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI + vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a); + +#if _LIBCPP_STD_VER >= 23 + template <_ContainerCompatibleRange<_Tp> _Range> + _LIBCPP_HIDE_FROM_ABI constexpr vector( + from_range_t, _Range&& __range, const allocator_type& __alloc = allocator_type()) + : __alloc_(__alloc) { + if constexpr (ranges::forward_range<_Range> || ranges::sized_range<_Range>) { + auto __n = static_cast(ranges::distance(__range)); + __init_with_size(ranges::begin(__range), ranges::end(__range), __n); + + } else { + __init_with_sentinel(ranges::begin(__range), ranges::end(__range)); + } + } +#endif + +private: + class __destroy_vector { + public: + _LIBCPP_CONSTEXPR _LIBCPP_HIDE_FROM_ABI __destroy_vector(vector& __vec) : __vec_(__vec) {} + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void operator()() { + if (__vec_.__begin_ != nullptr) { + __vec_.__clear(); + __vec_.__annotate_delete(); + __alloc_traits::deallocate(__vec_.__alloc(), __vec_.__begin_, __vec_.capacity()); + } + } + + private: + vector& __vec_; + }; + +public: + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI ~vector() { __destroy_vector (*this)(); } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector(const vector& __x); + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI + vector(const vector& __x, const __type_identity_t& __a); + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector& operator=(const vector& __x); + +#ifndef _LIBCPP_CXX03_LANG + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector(initializer_list __il); + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI + vector(initializer_list __il, const allocator_type& __a); + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector& operator=(initializer_list __il) { + assign(__il.begin(), __il.end()); + return *this; + } +#endif // !_LIBCPP_CXX03_LANG + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector(vector&& __x) +#if _LIBCPP_STD_VER >= 17 + noexcept; +#else + _NOEXCEPT_(is_nothrow_move_constructible::value); +#endif + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI + vector(vector&& __x, const __type_identity_t& __a); + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector& operator=(vector&& __x) + _NOEXCEPT_(__noexcept_move_assign_container<_Allocator, __alloc_traits>::value); + + template ::value && + is_constructible::reference>::value, + int> = 0> + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void assign(_InputIterator __first, _InputIterator __last); + template < + class _ForwardIterator, + __enable_if_t<__has_forward_iterator_category<_ForwardIterator>::value && + is_constructible::reference>::value, + int> = 0> + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void assign(_ForwardIterator __first, _ForwardIterator __last); + +#if _LIBCPP_STD_VER >= 23 + template <_ContainerCompatibleRange<_Tp> _Range> + _LIBCPP_HIDE_FROM_ABI constexpr void assign_range(_Range&& __range) { + if constexpr (ranges::forward_range<_Range> || ranges::sized_range<_Range>) { + auto __n = static_cast(ranges::distance(__range)); + __assign_with_size(ranges::begin(__range), ranges::end(__range), __n); + + } else { + __assign_with_sentinel(ranges::begin(__range), ranges::end(__range)); + } + } +#endif + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void assign(size_type __n, const_reference __u); + +#ifndef _LIBCPP_CXX03_LANG + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void assign(initializer_list __il) { + assign(__il.begin(), __il.end()); + } +#endif + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI allocator_type get_allocator() const _NOEXCEPT { + return this->__alloc(); + } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator begin() _NOEXCEPT; + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_iterator begin() const _NOEXCEPT; + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator end() _NOEXCEPT; + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_iterator end() const _NOEXCEPT; + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI reverse_iterator rbegin() _NOEXCEPT { + return reverse_iterator(end()); + } + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rbegin() const _NOEXCEPT { + return const_reverse_iterator(end()); + } + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI reverse_iterator rend() _NOEXCEPT { + return reverse_iterator(begin()); + } + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rend() const _NOEXCEPT { + return const_reverse_iterator(begin()); + } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_iterator cbegin() const _NOEXCEPT { return begin(); } + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_iterator cend() const _NOEXCEPT { return end(); } + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_reverse_iterator crbegin() const _NOEXCEPT { + return rbegin(); + } + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_reverse_iterator crend() const _NOEXCEPT { return rend(); } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI size_type size() const _NOEXCEPT { + return static_cast(this->__end_ - this->__begin_); + } + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI size_type capacity() const _NOEXCEPT { + return static_cast(__end_cap() - this->__begin_); + } + [[__nodiscard__]] _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI bool empty() const _NOEXCEPT { + return this->__begin_ == this->__end_; + } + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI size_type max_size() const _NOEXCEPT; + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void reserve(size_type __n); + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void shrink_to_fit() _NOEXCEPT; + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI reference operator[](size_type __n) _NOEXCEPT; + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_reference operator[](size_type __n) const _NOEXCEPT; + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI reference at(size_type __n); + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_reference at(size_type __n) const; + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI reference front() _NOEXCEPT { + _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(!empty(), "front() called on an empty vector"); + return *this->__begin_; + } + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_reference front() const _NOEXCEPT { + _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(!empty(), "front() called on an empty vector"); + return *this->__begin_; + } + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI reference back() _NOEXCEPT { + _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(!empty(), "back() called on an empty vector"); + return *(this->__end_ - 1); + } + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_reference back() const _NOEXCEPT { + _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(!empty(), "back() called on an empty vector"); + return *(this->__end_ - 1); + } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI value_type* data() _NOEXCEPT { + return std::__to_address(this->__begin_); + } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const value_type* data() const _NOEXCEPT { + return std::__to_address(this->__begin_); + } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void push_back(const_reference __x); + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void push_back(value_type&& __x); + + template + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI +#if _LIBCPP_STD_VER >= 17 + reference + emplace_back(_Args&&... __args); +#else + void + emplace_back(_Args&&... __args); +#endif + +#if _LIBCPP_STD_VER >= 23 + template <_ContainerCompatibleRange<_Tp> _Range> + _LIBCPP_HIDE_FROM_ABI constexpr void append_range(_Range&& __range) { + insert_range(end(), std::forward<_Range>(__range)); + } +#endif + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void pop_back(); + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __position, const_reference __x); + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __position, value_type&& __x); + template + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator emplace(const_iterator __position, _Args&&... __args); + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator + insert(const_iterator __position, size_type __n, const_reference __x); + + template ::value && + is_constructible< value_type, typename iterator_traits<_InputIterator>::reference>::value, + int> = 0> + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator + insert(const_iterator __position, _InputIterator __first, _InputIterator __last); + +#if _LIBCPP_STD_VER >= 23 + template <_ContainerCompatibleRange<_Tp> _Range> + _LIBCPP_HIDE_FROM_ABI constexpr iterator insert_range(const_iterator __position, _Range&& __range) { + if constexpr (ranges::forward_range<_Range> || ranges::sized_range<_Range>) { + auto __n = static_cast(ranges::distance(__range)); + return __insert_with_size(__position, ranges::begin(__range), ranges::end(__range), __n); + + } else { + return __insert_with_sentinel(__position, ranges::begin(__range), ranges::end(__range)); + } + } +#endif + + template < + class _ForwardIterator, + __enable_if_t<__has_forward_iterator_category<_ForwardIterator>::value && + is_constructible< value_type, typename iterator_traits<_ForwardIterator>::reference>::value, + int> = 0> + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator + insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last); + +#ifndef _LIBCPP_CXX03_LANG + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator + insert(const_iterator __position, initializer_list __il) { + return insert(__position, __il.begin(), __il.end()); + } +#endif + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __position); + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __first, const_iterator __last); + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void clear() _NOEXCEPT { + size_type __old_size = size(); + __clear(); + __annotate_shrink(__old_size); + } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void resize(size_type __sz); + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void resize(size_type __sz, const_reference __x); + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void swap(vector&) +#if _LIBCPP_STD_VER >= 14 + _NOEXCEPT; +#else + _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value || __is_nothrow_swappable_v); +#endif + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI bool __invariants() const; + +private: + pointer __begin_ = nullptr; + pointer __end_ = nullptr; + _LIBCPP_COMPRESSED_PAIR(pointer, __cap_ = nullptr, allocator_type, __alloc_); + + // Allocate space for __n objects + // throws length_error if __n > max_size() + // throws (probably bad_alloc) if memory run out + // Precondition: __begin_ == __end_ == __end_cap() == 0 + // Precondition: __n > 0 + // Postcondition: capacity() >= __n + // Postcondition: size() == 0 + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __vallocate(size_type __n) { + if (__n > max_size()) + __throw_length_error(); + auto __allocation = std::__allocate_at_least(__alloc(), __n); + __begin_ = __allocation.ptr; + __end_ = __allocation.ptr; + __end_cap() = __begin_ + __allocation.count; + __annotate_new(0); + } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __vdeallocate() _NOEXCEPT; + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI size_type __recommend(size_type __new_size) const; + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __construct_at_end(size_type __n); + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __construct_at_end(size_type __n, const_reference __x); + + template + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void + __init_with_size(_InputIterator __first, _Sentinel __last, size_type __n) { + auto __guard = std::__make_exception_guard(__destroy_vector(*this)); + + if (__n > 0) { + __vallocate(__n); + __construct_at_end(__first, __last, __n); + } + + __guard.__complete(); + } + + template + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void + __init_with_sentinel(_InputIterator __first, _Sentinel __last) { + auto __guard = std::__make_exception_guard(__destroy_vector(*this)); + + for (; __first != __last; ++__first) + emplace_back(*__first); + + __guard.__complete(); + } + + template + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __assign_with_sentinel(_Iterator __first, _Sentinel __last); + + template + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void + __assign_with_size(_ForwardIterator __first, _Sentinel __last, difference_type __n); + + template + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator + __insert_with_sentinel(const_iterator __position, _InputIterator __first, _Sentinel __last); + + template + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator + __insert_with_size(const_iterator __position, _Iterator __first, _Sentinel __last, difference_type __n); + + template + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void + __construct_at_end(_InputIterator __first, _Sentinel __last, size_type __n); + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __append(size_type __n); + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __append(size_type __n, const_reference __x); + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator __make_iter(pointer __p) _NOEXCEPT { +#ifdef _LIBCPP_ABI_BOUNDED_ITERATORS_IN_VECTOR + // Bound the iterator according to the capacity, rather than the size. + // + // Vector guarantees that iterators stay valid as long as no reallocation occurs even if new elements are inserted + // into the container; for these cases, we need to make sure that the newly-inserted elements can be accessed + // through the bounded iterator without failing checks. The downside is that the bounded iterator won't catch + // access that is logically out-of-bounds, i.e., goes beyond the size, but is still within the capacity. With the + // current implementation, there is no connection between a bounded iterator and its associated container, so we + // don't have a way to update existing valid iterators when the container is resized and thus have to go with + // a laxer approach. + return std::__make_bounded_iter( + std::__wrap_iter(__p), + std::__wrap_iter(this->__begin_), + std::__wrap_iter(this->__end_cap())); +#else + return iterator(__p); +#endif // _LIBCPP_ABI_BOUNDED_ITERATORS_IN_VECTOR + } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_iterator __make_iter(const_pointer __p) const _NOEXCEPT { +#ifdef _LIBCPP_ABI_BOUNDED_ITERATORS_IN_VECTOR + // Bound the iterator according to the capacity, rather than the size. + return std::__make_bounded_iter( + std::__wrap_iter(__p), + std::__wrap_iter(this->__begin_), + std::__wrap_iter(this->__end_cap())); +#else + return const_iterator(__p); +#endif // _LIBCPP_ABI_BOUNDED_ITERATORS_IN_VECTOR + } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void + __swap_out_circular_buffer(__split_buffer& __v); + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI pointer + __swap_out_circular_buffer(__split_buffer& __v, pointer __p); + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void + __move_range(pointer __from_s, pointer __from_e, pointer __to); + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __move_assign(vector& __c, true_type) + _NOEXCEPT_(is_nothrow_move_assignable::value); + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __move_assign(vector& __c, false_type) + _NOEXCEPT_(__alloc_traits::is_always_equal::value); + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __destruct_at_end(pointer __new_last) _NOEXCEPT { + size_type __old_size = size(); + __base_destruct_at_end(__new_last); + __annotate_shrink(__old_size); + } + + template + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI inline pointer __push_back_slow_path(_Up&& __x); + + template + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI inline pointer __emplace_back_slow_path(_Args&&... __args); + + // The following functions are no-ops outside of AddressSanitizer mode. + // We call annotations for every allocator, unless explicitly disabled. + // + // To disable annotations for a particular allocator, change value of + // __asan_annotate_container_with_allocator to false. + // For more details, see the "Using libc++" documentation page or + // the documentation for __sanitizer_annotate_contiguous_container. + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void + __annotate_contiguous_container(const void* __old_mid, const void* __new_mid) const { + std::__annotate_contiguous_container<_Allocator>(data(), data() + capacity(), __old_mid, __new_mid); + } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __annotate_new(size_type __current_size) const _NOEXCEPT { + (void)__current_size; +#if _LIBCPP_HAS_ASAN + __annotate_contiguous_container(data() + capacity(), data() + __current_size); +#endif + } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __annotate_delete() const _NOEXCEPT { +#if _LIBCPP_HAS_ASAN + __annotate_contiguous_container(data() + size(), data() + capacity()); +#endif + } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __annotate_increase(size_type __n) const _NOEXCEPT { + (void)__n; +#if _LIBCPP_HAS_ASAN + __annotate_contiguous_container(data() + size(), data() + size() + __n); +#endif + } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __annotate_shrink(size_type __old_size) const _NOEXCEPT { + (void)__old_size; +#if _LIBCPP_HAS_ASAN + __annotate_contiguous_container(data() + __old_size, data() + size()); +#endif + } + + struct _ConstructTransaction { + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI explicit _ConstructTransaction(vector& __v, size_type __n) + : __v_(__v), __pos_(__v.__end_), __new_end_(__v.__end_ + __n) { +#if _LIBCPP_HAS_ASAN + __v_.__annotate_increase(__n); +#endif + } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI ~_ConstructTransaction() { + __v_.__end_ = __pos_; +#if _LIBCPP_HAS_ASAN + if (__pos_ != __new_end_) { + __v_.__annotate_shrink(__new_end_ - __v_.__begin_); + } +#endif + } + + vector& __v_; + pointer __pos_; + const_pointer const __new_end_; + + _ConstructTransaction(_ConstructTransaction const&) = delete; + _ConstructTransaction& operator=(_ConstructTransaction const&) = delete; + }; + + template + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __construct_one_at_end(_Args&&... __args) { + _ConstructTransaction __tx(*this, 1); + __alloc_traits::construct(this->__alloc(), std::__to_address(__tx.__pos_), std::forward<_Args>(__args)...); + ++__tx.__pos_; + } + + // TODO: Remove these now redundant accessors + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI allocator_type& __alloc() _NOEXCEPT { return this->__alloc_; } + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const allocator_type& __alloc() const _NOEXCEPT { + return this->__alloc_; + } + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI pointer& __end_cap() _NOEXCEPT { return this->__cap_; } + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const pointer& __end_cap() const _NOEXCEPT { + return this->__cap_; + } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __clear() _NOEXCEPT { + __base_destruct_at_end(this->__begin_); + } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __base_destruct_at_end(pointer __new_last) _NOEXCEPT { + pointer __soon_to_be_end = this->__end_; + while (__new_last != __soon_to_be_end) + __alloc_traits::destroy(__alloc(), std::__to_address(--__soon_to_be_end)); + this->__end_ = __new_last; + } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __copy_assign_alloc(const vector& __c) { + __copy_assign_alloc(__c, integral_constant()); + } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __move_assign_alloc(vector& __c) + _NOEXCEPT_(!__alloc_traits::propagate_on_container_move_assignment::value || + is_nothrow_move_assignable::value) { + __move_assign_alloc(__c, integral_constant()); + } + + [[__noreturn__]] _LIBCPP_HIDE_FROM_ABI void __throw_length_error() const { std::__throw_length_error("vector"); } + + [[__noreturn__]] _LIBCPP_HIDE_FROM_ABI void __throw_out_of_range() const { std::__throw_out_of_range("vector"); } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __copy_assign_alloc(const vector& __c, true_type) { + if (__alloc() != __c.__alloc()) { + __clear(); + __annotate_delete(); + __alloc_traits::deallocate(__alloc(), this->__begin_, capacity()); + this->__begin_ = this->__end_ = __end_cap() = nullptr; + } + __alloc() = __c.__alloc(); + } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __copy_assign_alloc(const vector&, false_type) {} + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __move_assign_alloc(vector& __c, true_type) + _NOEXCEPT_(is_nothrow_move_assignable::value) { + __alloc() = std::move(__c.__alloc()); + } + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __move_assign_alloc(vector&, false_type) _NOEXCEPT {} +}; + +#if _LIBCPP_STD_VER >= 17 +template >, + class = enable_if_t<__has_input_iterator_category<_InputIterator>::value>, + class = enable_if_t<__is_allocator<_Alloc>::value> > +vector(_InputIterator, _InputIterator) -> vector<__iter_value_type<_InputIterator>, _Alloc>; + +template ::value>, + class = enable_if_t<__is_allocator<_Alloc>::value> > +vector(_InputIterator, _InputIterator, _Alloc) -> vector<__iter_value_type<_InputIterator>, _Alloc>; +#endif + +#if _LIBCPP_STD_VER >= 23 +template >, + class = enable_if_t<__is_allocator<_Alloc>::value> > +vector(from_range_t, _Range&&, _Alloc = _Alloc()) -> vector, _Alloc>; +#endif + +// __swap_out_circular_buffer relocates the objects in [__begin_, __end_) into the front of __v and swaps the buffers of +// *this and __v. It is assumed that __v provides space for exactly (__end_ - __begin_) objects in the front. This +// function has a strong exception guarantee. +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void +vector<_Tp, _Allocator>::__swap_out_circular_buffer(__split_buffer& __v) { + __annotate_delete(); + auto __new_begin = __v.__begin_ - (__end_ - __begin_); + std::__uninitialized_allocator_relocate( + __alloc(), std::__to_address(__begin_), std::__to_address(__end_), std::__to_address(__new_begin)); + __v.__begin_ = __new_begin; + __end_ = __begin_; // All the objects have been destroyed by relocating them. + std::swap(this->__begin_, __v.__begin_); + std::swap(this->__end_, __v.__end_); + std::swap(this->__end_cap(), __v.__end_cap()); + __v.__first_ = __v.__begin_; + __annotate_new(size()); +} + +// __swap_out_circular_buffer relocates the objects in [__begin_, __p) into the front of __v, the objects in +// [__p, __end_) into the back of __v and swaps the buffers of *this and __v. It is assumed that __v provides space for +// exactly (__p - __begin_) objects in the front and space for at least (__end_ - __p) objects in the back. This +// function has a strong exception guarantee if __begin_ == __p || __end_ == __p. +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::pointer +vector<_Tp, _Allocator>::__swap_out_circular_buffer(__split_buffer& __v, pointer __p) { + __annotate_delete(); + pointer __ret = __v.__begin_; + + // Relocate [__p, __end_) first to avoid having a hole in [__begin_, __end_) + // in case something in [__begin_, __p) throws. + std::__uninitialized_allocator_relocate( + __alloc(), std::__to_address(__p), std::__to_address(__end_), std::__to_address(__v.__end_)); + __v.__end_ += (__end_ - __p); + __end_ = __p; // The objects in [__p, __end_) have been destroyed by relocating them. + auto __new_begin = __v.__begin_ - (__p - __begin_); + + std::__uninitialized_allocator_relocate( + __alloc(), std::__to_address(__begin_), std::__to_address(__p), std::__to_address(__new_begin)); + __v.__begin_ = __new_begin; + __end_ = __begin_; // All the objects have been destroyed by relocating them. + + std::swap(this->__begin_, __v.__begin_); + std::swap(this->__end_, __v.__end_); + std::swap(this->__end_cap(), __v.__end_cap()); + __v.__first_ = __v.__begin_; + __annotate_new(size()); + return __ret; +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::__vdeallocate() _NOEXCEPT { + if (this->__begin_ != nullptr) { + clear(); + __annotate_delete(); + __alloc_traits::deallocate(this->__alloc(), this->__begin_, capacity()); + this->__begin_ = this->__end_ = this->__end_cap() = nullptr; + } +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::size_type +vector<_Tp, _Allocator>::max_size() const _NOEXCEPT { + return std::min(__alloc_traits::max_size(this->__alloc()), numeric_limits::max()); +} + +// Precondition: __new_size > capacity() +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::size_type +vector<_Tp, _Allocator>::__recommend(size_type __new_size) const { + const size_type __ms = max_size(); + if (__new_size > __ms) + this->__throw_length_error(); + const size_type __cap = capacity(); + if (__cap >= __ms / 2) + return __ms; + return std::max(2 * __cap, __new_size); +} + +// Default constructs __n objects starting at __end_ +// throws if construction throws +// Precondition: __n > 0 +// Precondition: size() + __n <= capacity() +// Postcondition: size() == size() + __n +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::__construct_at_end(size_type __n) { + _ConstructTransaction __tx(*this, __n); + const_pointer __new_end = __tx.__new_end_; + for (pointer __pos = __tx.__pos_; __pos != __new_end; __tx.__pos_ = ++__pos) { + __alloc_traits::construct(this->__alloc(), std::__to_address(__pos)); + } +} + +// Copy constructs __n objects starting at __end_ from __x +// throws if construction throws +// Precondition: __n > 0 +// Precondition: size() + __n <= capacity() +// Postcondition: size() == old size() + __n +// Postcondition: [i] == __x for all i in [size() - __n, __n) +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline void +vector<_Tp, _Allocator>::__construct_at_end(size_type __n, const_reference __x) { + _ConstructTransaction __tx(*this, __n); + const_pointer __new_end = __tx.__new_end_; + for (pointer __pos = __tx.__pos_; __pos != __new_end; __tx.__pos_ = ++__pos) { + __alloc_traits::construct(this->__alloc(), std::__to_address(__pos), __x); + } +} + +template +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void +vector<_Tp, _Allocator>::__construct_at_end(_InputIterator __first, _Sentinel __last, size_type __n) { + _ConstructTransaction __tx(*this, __n); + __tx.__pos_ = std::__uninitialized_allocator_copy(__alloc(), __first, __last, __tx.__pos_); +} + +// Default constructs __n objects starting at __end_ +// throws if construction throws +// Postcondition: size() == size() + __n +// Exception safety: strong. +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::__append(size_type __n) { + if (static_cast(this->__end_cap() - this->__end_) >= __n) + this->__construct_at_end(__n); + else { + allocator_type& __a = this->__alloc(); + __split_buffer __v(__recommend(size() + __n), size(), __a); + __v.__construct_at_end(__n); + __swap_out_circular_buffer(__v); + } +} + +// Default constructs __n objects starting at __end_ +// throws if construction throws +// Postcondition: size() == size() + __n +// Exception safety: strong. +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::__append(size_type __n, const_reference __x) { + if (static_cast(this->__end_cap() - this->__end_) >= __n) + this->__construct_at_end(__n, __x); + else { + allocator_type& __a = this->__alloc(); + __split_buffer __v(__recommend(size() + __n), size(), __a); + __v.__construct_at_end(__n, __x); + __swap_out_circular_buffer(__v); + } +} + +template +template ::value && + is_constructible<_Tp, typename iterator_traits<_InputIterator>::reference>::value, + int> > +_LIBCPP_CONSTEXPR_SINCE_CXX20 vector<_Tp, _Allocator>::vector(_InputIterator __first, _InputIterator __last) { + __init_with_sentinel(__first, __last); +} + +template +template ::value && + is_constructible<_Tp, typename iterator_traits<_InputIterator>::reference>::value, + int> > +_LIBCPP_CONSTEXPR_SINCE_CXX20 +vector<_Tp, _Allocator>::vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a) + : __alloc_(__a) { + __init_with_sentinel(__first, __last); +} + +template +template ::value && + is_constructible<_Tp, typename iterator_traits<_ForwardIterator>::reference>::value, + int> > +_LIBCPP_CONSTEXPR_SINCE_CXX20 vector<_Tp, _Allocator>::vector(_ForwardIterator __first, _ForwardIterator __last) { + size_type __n = static_cast(std::distance(__first, __last)); + __init_with_size(__first, __last, __n); +} + +template +template ::value && + is_constructible<_Tp, typename iterator_traits<_ForwardIterator>::reference>::value, + int> > +_LIBCPP_CONSTEXPR_SINCE_CXX20 +vector<_Tp, _Allocator>::vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a) + : __alloc_(__a) { + size_type __n = static_cast(std::distance(__first, __last)); + __init_with_size(__first, __last, __n); +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 vector<_Tp, _Allocator>::vector(const vector& __x) + : __alloc_(__alloc_traits::select_on_container_copy_construction(__x.__alloc())) { + __init_with_size(__x.__begin_, __x.__end_, __x.size()); +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 +vector<_Tp, _Allocator>::vector(const vector& __x, const __type_identity_t& __a) + : __alloc_(__a) { + __init_with_size(__x.__begin_, __x.__end_, __x.size()); +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI vector<_Tp, _Allocator>::vector(vector&& __x) +#if _LIBCPP_STD_VER >= 17 + noexcept +#else + _NOEXCEPT_(is_nothrow_move_constructible::value) +#endif + : __alloc_(std::move(__x.__alloc())) { + this->__begin_ = __x.__begin_; + this->__end_ = __x.__end_; + this->__end_cap() = __x.__end_cap(); + __x.__begin_ = __x.__end_ = __x.__end_cap() = nullptr; +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI +vector<_Tp, _Allocator>::vector(vector&& __x, const __type_identity_t& __a) + : __alloc_(__a) { + if (__a == __x.__alloc()) { + this->__begin_ = __x.__begin_; + this->__end_ = __x.__end_; + this->__end_cap() = __x.__end_cap(); + __x.__begin_ = __x.__end_ = __x.__end_cap() = nullptr; + } else { + typedef move_iterator _Ip; + auto __guard = std::__make_exception_guard(__destroy_vector(*this)); + assign(_Ip(__x.begin()), _Ip(__x.end())); + __guard.__complete(); + } +} + +#ifndef _LIBCPP_CXX03_LANG + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI +vector<_Tp, _Allocator>::vector(initializer_list __il) { + __init_with_size(__il.begin(), __il.end(), __il.size()); +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI +vector<_Tp, _Allocator>::vector(initializer_list __il, const allocator_type& __a) + : __alloc_(__a) { + __init_with_size(__il.begin(), __il.end(), __il.size()); +} + +#endif // _LIBCPP_CXX03_LANG + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI vector<_Tp, _Allocator>& +vector<_Tp, _Allocator>::operator=(vector&& __x) + _NOEXCEPT_(__noexcept_move_assign_container<_Allocator, __alloc_traits>::value) { + __move_assign(__x, integral_constant()); + return *this; +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::__move_assign(vector& __c, false_type) + _NOEXCEPT_(__alloc_traits::is_always_equal::value) { + if (__alloc() != __c.__alloc()) { + typedef move_iterator _Ip; + assign(_Ip(__c.begin()), _Ip(__c.end())); + } else + __move_assign(__c, true_type()); +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::__move_assign(vector& __c, true_type) + _NOEXCEPT_(is_nothrow_move_assignable::value) { + __vdeallocate(); + __move_assign_alloc(__c); // this can throw + this->__begin_ = __c.__begin_; + this->__end_ = __c.__end_; + this->__end_cap() = __c.__end_cap(); + __c.__begin_ = __c.__end_ = __c.__end_cap() = nullptr; +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI vector<_Tp, _Allocator>& +vector<_Tp, _Allocator>::operator=(const vector& __x) { + if (this != std::addressof(__x)) { + __copy_assign_alloc(__x); + assign(__x.__begin_, __x.__end_); + } + return *this; +} + +template +template ::value && + is_constructible<_Tp, typename iterator_traits<_InputIterator>::reference>::value, + int> > +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::assign(_InputIterator __first, _InputIterator __last) { + __assign_with_sentinel(__first, __last); +} + +template +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void +vector<_Tp, _Allocator>::__assign_with_sentinel(_Iterator __first, _Sentinel __last) { + clear(); + for (; __first != __last; ++__first) + emplace_back(*__first); +} + +template +template ::value && + is_constructible<_Tp, typename iterator_traits<_ForwardIterator>::reference>::value, + int> > +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::assign(_ForwardIterator __first, _ForwardIterator __last) { + __assign_with_size(__first, __last, std::distance(__first, __last)); +} + +template +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void +vector<_Tp, _Allocator>::__assign_with_size(_ForwardIterator __first, _Sentinel __last, difference_type __n) { + size_type __new_size = static_cast(__n); + if (__new_size <= capacity()) { + if (__new_size > size()) { + _ForwardIterator __mid = std::next(__first, size()); + std::copy(__first, __mid, this->__begin_); + __construct_at_end(__mid, __last, __new_size - size()); + } else { + pointer __m = std::__copy<_ClassicAlgPolicy>(__first, __last, this->__begin_).second; + this->__destruct_at_end(__m); + } + } else { + __vdeallocate(); + __vallocate(__recommend(__new_size)); + __construct_at_end(__first, __last, __new_size); + } +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::assign(size_type __n, const_reference __u) { + if (__n <= capacity()) { + size_type __s = size(); + std::fill_n(this->__begin_, std::min(__n, __s), __u); + if (__n > __s) + __construct_at_end(__n - __s, __u); + else + this->__destruct_at_end(this->__begin_ + __n); + } else { + __vdeallocate(); + __vallocate(__recommend(static_cast(__n))); + __construct_at_end(__n, __u); + } +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::iterator +vector<_Tp, _Allocator>::begin() _NOEXCEPT { + return __make_iter(this->__begin_); +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::const_iterator +vector<_Tp, _Allocator>::begin() const _NOEXCEPT { + return __make_iter(this->__begin_); +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::iterator +vector<_Tp, _Allocator>::end() _NOEXCEPT { + return __make_iter(this->__end_); +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::const_iterator +vector<_Tp, _Allocator>::end() const _NOEXCEPT { + return __make_iter(this->__end_); +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::reference +vector<_Tp, _Allocator>::operator[](size_type __n) _NOEXCEPT { + _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(__n < size(), "vector[] index out of bounds"); + return this->__begin_[__n]; +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::const_reference +vector<_Tp, _Allocator>::operator[](size_type __n) const _NOEXCEPT { + _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(__n < size(), "vector[] index out of bounds"); + return this->__begin_[__n]; +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::reference vector<_Tp, _Allocator>::at(size_type __n) { + if (__n >= size()) + this->__throw_out_of_range(); + return this->__begin_[__n]; +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::const_reference +vector<_Tp, _Allocator>::at(size_type __n) const { + if (__n >= size()) + this->__throw_out_of_range(); + return this->__begin_[__n]; +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::reserve(size_type __n) { + if (__n > capacity()) { + if (__n > max_size()) + this->__throw_length_error(); + allocator_type& __a = this->__alloc(); + __split_buffer __v(__n, size(), __a); + __swap_out_circular_buffer(__v); + } +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::shrink_to_fit() _NOEXCEPT { + if (capacity() > size()) { +#if _LIBCPP_HAS_EXCEPTIONS + try { +#endif // _LIBCPP_HAS_EXCEPTIONS + allocator_type& __a = this->__alloc(); + __split_buffer __v(size(), size(), __a); + // The Standard mandates shrink_to_fit() does not increase the capacity. + // With equal capacity keep the existing buffer. This avoids extra work + // due to swapping the elements. + if (__v.capacity() < capacity()) + __swap_out_circular_buffer(__v); +#if _LIBCPP_HAS_EXCEPTIONS + } catch (...) { + } +#endif // _LIBCPP_HAS_EXCEPTIONS + } +} + +template +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::pointer +vector<_Tp, _Allocator>::__push_back_slow_path(_Up&& __x) { + allocator_type& __a = this->__alloc(); + __split_buffer __v(__recommend(size() + 1), size(), __a); + // __v.push_back(std::forward<_Up>(__x)); + __alloc_traits::construct(__a, std::__to_address(__v.__end_), std::forward<_Up>(__x)); + __v.__end_++; + __swap_out_circular_buffer(__v); + return this->__end_; +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI void +vector<_Tp, _Allocator>::push_back(const_reference __x) { + pointer __end = this->__end_; + if (__end < this->__end_cap()) { + __construct_one_at_end(__x); + ++__end; + } else { + __end = __push_back_slow_path(__x); + } + this->__end_ = __end; +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI void vector<_Tp, _Allocator>::push_back(value_type&& __x) { + pointer __end = this->__end_; + if (__end < this->__end_cap()) { + __construct_one_at_end(std::move(__x)); + ++__end; + } else { + __end = __push_back_slow_path(std::move(__x)); + } + this->__end_ = __end; +} + +template +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::pointer +vector<_Tp, _Allocator>::__emplace_back_slow_path(_Args&&... __args) { + allocator_type& __a = this->__alloc(); + __split_buffer __v(__recommend(size() + 1), size(), __a); + // __v.emplace_back(std::forward<_Args>(__args)...); + __alloc_traits::construct(__a, std::__to_address(__v.__end_), std::forward<_Args>(__args)...); + __v.__end_++; + __swap_out_circular_buffer(__v); + return this->__end_; +} + +template +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline +#if _LIBCPP_STD_VER >= 17 + typename vector<_Tp, _Allocator>::reference +#else + void +#endif + vector<_Tp, _Allocator>::emplace_back(_Args&&... __args) { + pointer __end = this->__end_; + if (__end < this->__end_cap()) { + __construct_one_at_end(std::forward<_Args>(__args)...); + ++__end; + } else { + __end = __emplace_back_slow_path(std::forward<_Args>(__args)...); + } + this->__end_ = __end; +#if _LIBCPP_STD_VER >= 17 + return *(__end - 1); +#endif +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline void vector<_Tp, _Allocator>::pop_back() { + _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(!empty(), "vector::pop_back called on an empty vector"); + this->__destruct_at_end(this->__end_ - 1); +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::iterator +vector<_Tp, _Allocator>::erase(const_iterator __position) { + _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS( + __position != end(), "vector::erase(iterator) called with a non-dereferenceable iterator"); + difference_type __ps = __position - cbegin(); + pointer __p = this->__begin_ + __ps; + this->__destruct_at_end(std::move(__p + 1, this->__end_, __p)); + return __make_iter(__p); +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::iterator +vector<_Tp, _Allocator>::erase(const_iterator __first, const_iterator __last) { + _LIBCPP_ASSERT_VALID_INPUT_RANGE(__first <= __last, "vector::erase(first, last) called with invalid range"); + pointer __p = this->__begin_ + (__first - begin()); + if (__first != __last) { + this->__destruct_at_end(std::move(__p + (__last - __first), this->__end_, __p)); + } + return __make_iter(__p); +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void +vector<_Tp, _Allocator>::__move_range(pointer __from_s, pointer __from_e, pointer __to) { + pointer __old_last = this->__end_; + difference_type __n = __old_last - __to; + { + pointer __i = __from_s + __n; + _ConstructTransaction __tx(*this, __from_e - __i); + for (pointer __pos = __tx.__pos_; __i < __from_e; ++__i, (void)++__pos, __tx.__pos_ = __pos) { + __alloc_traits::construct(this->__alloc(), std::__to_address(__pos), std::move(*__i)); + } + } + std::move_backward(__from_s, __from_s + __n, __old_last); +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::iterator +vector<_Tp, _Allocator>::insert(const_iterator __position, const_reference __x) { + pointer __p = this->__begin_ + (__position - begin()); + if (this->__end_ < this->__end_cap()) { + if (__p == this->__end_) { + __construct_one_at_end(__x); + } else { + __move_range(__p, this->__end_, __p + 1); + const_pointer __xr = pointer_traits::pointer_to(__x); + if (std::__is_pointer_in_range(std::__to_address(__p), std::__to_address(__end_), std::addressof(__x))) + ++__xr; + *__p = *__xr; + } + } else { + allocator_type& __a = this->__alloc(); + __split_buffer __v(__recommend(size() + 1), __p - this->__begin_, __a); + __v.push_back(__x); + __p = __swap_out_circular_buffer(__v, __p); + } + return __make_iter(__p); +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::iterator +vector<_Tp, _Allocator>::insert(const_iterator __position, value_type&& __x) { + pointer __p = this->__begin_ + (__position - begin()); + if (this->__end_ < this->__end_cap()) { + if (__p == this->__end_) { + __construct_one_at_end(std::move(__x)); + } else { + __move_range(__p, this->__end_, __p + 1); + *__p = std::move(__x); + } + } else { + allocator_type& __a = this->__alloc(); + __split_buffer __v(__recommend(size() + 1), __p - this->__begin_, __a); + __v.push_back(std::move(__x)); + __p = __swap_out_circular_buffer(__v, __p); + } + return __make_iter(__p); +} + +template +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::iterator +vector<_Tp, _Allocator>::emplace(const_iterator __position, _Args&&... __args) { + pointer __p = this->__begin_ + (__position - begin()); + if (this->__end_ < this->__end_cap()) { + if (__p == this->__end_) { + __construct_one_at_end(std::forward<_Args>(__args)...); + } else { + __temp_value __tmp(this->__alloc(), std::forward<_Args>(__args)...); + __move_range(__p, this->__end_, __p + 1); + *__p = std::move(__tmp.get()); + } + } else { + allocator_type& __a = this->__alloc(); + __split_buffer __v(__recommend(size() + 1), __p - this->__begin_, __a); + __v.emplace_back(std::forward<_Args>(__args)...); + __p = __swap_out_circular_buffer(__v, __p); + } + return __make_iter(__p); +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::iterator +vector<_Tp, _Allocator>::insert(const_iterator __position, size_type __n, const_reference __x) { + pointer __p = this->__begin_ + (__position - begin()); + if (__n > 0) { + // We can't compare unrelated pointers inside constant expressions + if (!__libcpp_is_constant_evaluated() && __n <= static_cast(this->__end_cap() - this->__end_)) { + size_type __old_n = __n; + pointer __old_last = this->__end_; + if (__n > static_cast(this->__end_ - __p)) { + size_type __cx = __n - (this->__end_ - __p); + __construct_at_end(__cx, __x); + __n -= __cx; + } + if (__n > 0) { + __move_range(__p, __old_last, __p + __old_n); + const_pointer __xr = pointer_traits::pointer_to(__x); + if (__p <= __xr && __xr < this->__end_) + __xr += __old_n; + std::fill_n(__p, __n, *__xr); + } + } else { + allocator_type& __a = this->__alloc(); + __split_buffer __v(__recommend(size() + __n), __p - this->__begin_, __a); + __v.__construct_at_end(__n, __x); + __p = __swap_out_circular_buffer(__v, __p); + } + } + return __make_iter(__p); +} +template +template ::value && + is_constructible<_Tp, typename iterator_traits<_InputIterator>::reference>::value, + int> > +_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::iterator +vector<_Tp, _Allocator>::insert(const_iterator __position, _InputIterator __first, _InputIterator __last) { + return __insert_with_sentinel(__position, __first, __last); +} + +template +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::iterator +vector<_Tp, _Allocator>::__insert_with_sentinel(const_iterator __position, _InputIterator __first, _Sentinel __last) { + difference_type __off = __position - begin(); + pointer __p = this->__begin_ + __off; + allocator_type& __a = this->__alloc(); + pointer __old_last = this->__end_; + for (; this->__end_ != this->__end_cap() && __first != __last; ++__first) { + __construct_one_at_end(*__first); + } + __split_buffer __v(__a); + if (__first != __last) { +#if _LIBCPP_HAS_EXCEPTIONS + try { +#endif // _LIBCPP_HAS_EXCEPTIONS + __v.__construct_at_end_with_sentinel(std::move(__first), std::move(__last)); + difference_type __old_size = __old_last - this->__begin_; + difference_type __old_p = __p - this->__begin_; + reserve(__recommend(size() + __v.size())); + __p = this->__begin_ + __old_p; + __old_last = this->__begin_ + __old_size; +#if _LIBCPP_HAS_EXCEPTIONS + } catch (...) { + erase(__make_iter(__old_last), end()); + throw; + } +#endif // _LIBCPP_HAS_EXCEPTIONS + } + __p = std::rotate(__p, __old_last, this->__end_); + insert(__make_iter(__p), std::make_move_iterator(__v.begin()), std::make_move_iterator(__v.end())); + return begin() + __off; +} + +template +template ::value && + is_constructible<_Tp, typename iterator_traits<_ForwardIterator>::reference>::value, + int> > +_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::iterator +vector<_Tp, _Allocator>::insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last) { + return __insert_with_size(__position, __first, __last, std::distance(__first, __last)); +} + +template +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::iterator +vector<_Tp, _Allocator>::__insert_with_size( + const_iterator __position, _Iterator __first, _Sentinel __last, difference_type __n) { + auto __insertion_size = __n; + pointer __p = this->__begin_ + (__position - begin()); + if (__n > 0) { + if (__n <= this->__end_cap() - this->__end_) { + size_type __old_n = __n; + pointer __old_last = this->__end_; + _Iterator __m = std::next(__first, __n); + difference_type __dx = this->__end_ - __p; + if (__n > __dx) { + __m = __first; + difference_type __diff = this->__end_ - __p; + std::advance(__m, __diff); + __construct_at_end(__m, __last, __n - __diff); + __n = __dx; + } + if (__n > 0) { + __move_range(__p, __old_last, __p + __old_n); + std::copy(__first, __m, __p); + } + } else { + allocator_type& __a = this->__alloc(); + __split_buffer __v(__recommend(size() + __n), __p - this->__begin_, __a); + __v.__construct_at_end_with_size(__first, __insertion_size); + __p = __swap_out_circular_buffer(__v, __p); + } + } + return __make_iter(__p); +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::resize(size_type __sz) { + size_type __cs = size(); + if (__cs < __sz) + this->__append(__sz - __cs); + else if (__cs > __sz) + this->__destruct_at_end(this->__begin_ + __sz); +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::resize(size_type __sz, const_reference __x) { + size_type __cs = size(); + if (__cs < __sz) + this->__append(__sz - __cs, __x); + else if (__cs > __sz) + this->__destruct_at_end(this->__begin_ + __sz); +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::swap(vector& __x) +#if _LIBCPP_STD_VER >= 14 + _NOEXCEPT +#else + _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value || __is_nothrow_swappable_v) +#endif +{ + _LIBCPP_ASSERT_COMPATIBLE_ALLOCATOR( + __alloc_traits::propagate_on_container_swap::value || this->__alloc() == __x.__alloc(), + "vector::swap: Either propagate_on_container_swap must be true" + " or the allocators must compare equal"); + std::swap(this->__begin_, __x.__begin_); + std::swap(this->__end_, __x.__end_); + std::swap(this->__end_cap(), __x.__end_cap()); + std::__swap_allocator(this->__alloc(), __x.__alloc()); +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 bool vector<_Tp, _Allocator>::__invariants() const { + if (this->__begin_ == nullptr) { + if (this->__end_ != nullptr || this->__end_cap() != nullptr) + return false; + } else { + if (this->__begin_ > this->__end_) + return false; + if (this->__begin_ == this->__end_cap()) + return false; + if (this->__end_ > this->__end_cap()) + return false; + } + return true; +} + +#if _LIBCPP_STD_VER >= 20 +template <> +inline constexpr bool __format::__enable_insertable> = true; +# ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS +template <> +inline constexpr bool __format::__enable_insertable> = true; +# endif +#endif // _LIBCPP_STD_VER >= 20 + +_LIBCPP_END_NAMESPACE_STD + +_LIBCPP_POP_MACROS + +#endif // _LIBCPP___VECTOR_VECTOR_H diff --git a/libcxx/include/__vector/vector_bool.h b/libcxx/include/__vector/vector_bool.h new file mode 100644 index 00000000000000..462095fd07acf7 --- /dev/null +++ b/libcxx/include/__vector/vector_bool.h @@ -0,0 +1,1123 @@ +//===----------------------------------------------------------------------===// +// +// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. +// See https://llvm.org/LICENSE.txt for license information. +// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception +// +//===----------------------------------------------------------------------===// + +#ifndef _LIBCPP___VECTOR_VECTOR_BOOL_H +#define _LIBCPP___VECTOR_VECTOR_BOOL_H + +#include <__algorithm/copy.h> +#include <__algorithm/fill_n.h> +#include <__algorithm/iterator_operations.h> +#include <__algorithm/max.h> +#include <__assert> +#include <__bit_reference> +#include <__config> +#include <__functional/unary_function.h> +#include <__fwd/functional.h> +#include <__fwd/vector.h> +#include <__iterator/distance.h> +#include <__iterator/iterator_traits.h> +#include <__iterator/reverse_iterator.h> +#include <__memory/addressof.h> +#include <__memory/allocate_at_least.h> +#include <__memory/allocator.h> +#include <__memory/allocator_traits.h> +#include <__memory/compressed_pair.h> +#include <__memory/construct_at.h> +#include <__memory/noexcept_move_assign_container.h> +#include <__memory/pointer_traits.h> +#include <__memory/swap_allocator.h> +#include <__ranges/access.h> +#include <__ranges/concepts.h> +#include <__ranges/container_compatible_range.h> +#include <__ranges/from_range.h> +#include <__type_traits/enable_if.h> +#include <__type_traits/is_constant_evaluated.h> +#include <__type_traits/is_nothrow_assignable.h> +#include <__type_traits/is_nothrow_constructible.h> +#include <__type_traits/type_identity.h> +#include <__utility/exception_guard.h> +#include <__utility/forward.h> +#include <__utility/move.h> +#include <__utility/swap.h> +#include +#include +#include +#include + +// These headers define parts of vectors definition, since they define ADL functions or class specializations. +#include <__vector/comparison.h> +#include <__vector/container_traits.h> +#include <__vector/swap.h> + +#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) +# pragma GCC system_header +#endif + +_LIBCPP_PUSH_MACROS +#include <__undef_macros> + +_LIBCPP_BEGIN_NAMESPACE_STD + +template +struct hash >; + +template +struct __has_storage_type > { + static const bool value = true; +}; + +template +class _LIBCPP_TEMPLATE_VIS vector { +public: + typedef vector __self; + typedef bool value_type; + typedef _Allocator allocator_type; + typedef allocator_traits __alloc_traits; + typedef typename __alloc_traits::size_type size_type; + typedef typename __alloc_traits::difference_type difference_type; + typedef size_type __storage_type; + typedef __bit_iterator pointer; + typedef __bit_iterator const_pointer; + typedef pointer iterator; + typedef const_pointer const_iterator; + typedef std::reverse_iterator reverse_iterator; + typedef std::reverse_iterator const_reverse_iterator; + +private: + typedef __rebind_alloc<__alloc_traits, __storage_type> __storage_allocator; + typedef allocator_traits<__storage_allocator> __storage_traits; + typedef typename __storage_traits::pointer __storage_pointer; + typedef typename __storage_traits::const_pointer __const_storage_pointer; + + __storage_pointer __begin_; + size_type __size_; + _LIBCPP_COMPRESSED_PAIR(size_type, __cap_, __storage_allocator, __alloc_); + +public: + typedef __bit_reference reference; +#ifdef _LIBCPP_ABI_BITSET_VECTOR_BOOL_CONST_SUBSCRIPT_RETURN_BOOL + using const_reference = bool; +#else + typedef __bit_const_reference const_reference; +#endif + +private: + // TODO: Remove these now redundant accessors + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 size_type& __cap() _NOEXCEPT { return __cap_; } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const size_type& __cap() const _NOEXCEPT { return __cap_; } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 __storage_allocator& __alloc() _NOEXCEPT { return __alloc_; } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const __storage_allocator& __alloc() const _NOEXCEPT { + return __alloc_; + } + + static const unsigned __bits_per_word = static_cast(sizeof(__storage_type) * CHAR_BIT); + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 static size_type + __internal_cap_to_external(size_type __n) _NOEXCEPT { + return __n * __bits_per_word; + } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 static size_type + __external_cap_to_internal(size_type __n) _NOEXCEPT { + return (__n - 1) / __bits_per_word + 1; + } + +public: + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector() + _NOEXCEPT_(is_nothrow_default_constructible::value); + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 explicit vector(const allocator_type& __a) +#if _LIBCPP_STD_VER <= 14 + _NOEXCEPT_(is_nothrow_copy_constructible::value); +#else + _NOEXCEPT; +#endif + +private: + class __destroy_vector { + public: + _LIBCPP_CONSTEXPR _LIBCPP_HIDE_FROM_ABI __destroy_vector(vector& __vec) : __vec_(__vec) {} + + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void operator()() { + if (__vec_.__begin_ != nullptr) + __storage_traits::deallocate(__vec_.__alloc(), __vec_.__begin_, __vec_.__cap()); + } + + private: + vector& __vec_; + }; + +public: + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 ~vector() { __destroy_vector (*this)(); } + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 explicit vector(size_type __n); +#if _LIBCPP_STD_VER >= 14 + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 explicit vector(size_type __n, const allocator_type& __a); +#endif + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(size_type __n, const value_type& __v); + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 + vector(size_type __n, const value_type& __v, const allocator_type& __a); + template ::value, int> = 0> + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(_InputIterator __first, _InputIterator __last); + template ::value, int> = 0> + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 + vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a); + template ::value, int> = 0> + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(_ForwardIterator __first, _ForwardIterator __last); + template ::value, int> = 0> + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 + vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a); + +#if _LIBCPP_STD_VER >= 23 + template <_ContainerCompatibleRange _Range> + _LIBCPP_HIDE_FROM_ABI constexpr vector(from_range_t, _Range&& __range, const allocator_type& __a = allocator_type()) + : __begin_(nullptr), __size_(0), __cap_(0), __alloc_(static_cast<__storage_allocator>(__a)) { + if constexpr (ranges::forward_range<_Range> || ranges::sized_range<_Range>) { + auto __n = static_cast(ranges::distance(__range)); + __init_with_size(ranges::begin(__range), ranges::end(__range), __n); + + } else { + __init_with_sentinel(ranges::begin(__range), ranges::end(__range)); + } + } +#endif + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(const vector& __v); + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(const vector& __v, const allocator_type& __a); + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector& operator=(const vector& __v); + +#ifndef _LIBCPP_CXX03_LANG + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(initializer_list __il); + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 + vector(initializer_list __il, const allocator_type& __a); + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector& operator=(initializer_list __il) { + assign(__il.begin(), __il.end()); + return *this; + } + +#endif // !_LIBCPP_CXX03_LANG + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(vector&& __v) +#if _LIBCPP_STD_VER >= 17 + noexcept; +#else + _NOEXCEPT_(is_nothrow_move_constructible::value); +#endif + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 + vector(vector&& __v, const __type_identity_t& __a); + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector& operator=(vector&& __v) + _NOEXCEPT_(__noexcept_move_assign_container<_Allocator, __alloc_traits>::value); + + template ::value, int> = 0> + void _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 assign(_InputIterator __first, _InputIterator __last); + template ::value, int> = 0> + void _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 assign(_ForwardIterator __first, _ForwardIterator __last); + +#if _LIBCPP_STD_VER >= 23 + template <_ContainerCompatibleRange _Range> + _LIBCPP_HIDE_FROM_ABI constexpr void assign_range(_Range&& __range) { + if constexpr (ranges::forward_range<_Range> || ranges::sized_range<_Range>) { + auto __n = static_cast(ranges::distance(__range)); + __assign_with_size(ranges::begin(__range), ranges::end(__range), __n); + + } else { + __assign_with_sentinel(ranges::begin(__range), ranges::end(__range)); + } + } +#endif + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void assign(size_type __n, const value_type& __x); + +#ifndef _LIBCPP_CXX03_LANG + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void assign(initializer_list __il) { + assign(__il.begin(), __il.end()); + } +#endif + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 allocator_type get_allocator() const _NOEXCEPT { + return allocator_type(this->__alloc()); + } + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 size_type max_size() const _NOEXCEPT; + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 size_type capacity() const _NOEXCEPT { + return __internal_cap_to_external(__cap()); + } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 size_type size() const _NOEXCEPT { return __size_; } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool empty() const _NOEXCEPT { + return __size_ == 0; + } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void reserve(size_type __n); + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void shrink_to_fit() _NOEXCEPT; + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator begin() _NOEXCEPT { return __make_iter(0); } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_iterator begin() const _NOEXCEPT { return __make_iter(0); } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator end() _NOEXCEPT { return __make_iter(__size_); } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_iterator end() const _NOEXCEPT { + return __make_iter(__size_); + } + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 reverse_iterator rbegin() _NOEXCEPT { + return reverse_iterator(end()); + } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reverse_iterator rbegin() const _NOEXCEPT { + return const_reverse_iterator(end()); + } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 reverse_iterator rend() _NOEXCEPT { + return reverse_iterator(begin()); + } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reverse_iterator rend() const _NOEXCEPT { + return const_reverse_iterator(begin()); + } + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_iterator cbegin() const _NOEXCEPT { return __make_iter(0); } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_iterator cend() const _NOEXCEPT { + return __make_iter(__size_); + } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reverse_iterator crbegin() const _NOEXCEPT { + return rbegin(); + } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reverse_iterator crend() const _NOEXCEPT { return rend(); } + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 reference operator[](size_type __n) { return __make_ref(__n); } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reference operator[](size_type __n) const { + return __make_ref(__n); + } + _LIBCPP_HIDE_FROM_ABI reference at(size_type __n); + _LIBCPP_HIDE_FROM_ABI const_reference at(size_type __n) const; + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 reference front() { return __make_ref(0); } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reference front() const { return __make_ref(0); } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 reference back() { return __make_ref(__size_ - 1); } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reference back() const { return __make_ref(__size_ - 1); } + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void push_back(const value_type& __x); +#if _LIBCPP_STD_VER >= 14 + template +# if _LIBCPP_STD_VER >= 17 + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 reference emplace_back(_Args&&... __args) +# else + _LIBCPP_HIDE_FROM_ABI void emplace_back(_Args&&... __args) +# endif + { + push_back(value_type(std::forward<_Args>(__args)...)); +# if _LIBCPP_STD_VER >= 17 + return this->back(); +# endif + } +#endif + +#if _LIBCPP_STD_VER >= 23 + template <_ContainerCompatibleRange _Range> + _LIBCPP_HIDE_FROM_ABI constexpr void append_range(_Range&& __range) { + insert_range(end(), std::forward<_Range>(__range)); + } +#endif + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void pop_back() { --__size_; } + +#if _LIBCPP_STD_VER >= 14 + template + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator emplace(const_iterator __position, _Args&&... __args) { + return insert(__position, value_type(std::forward<_Args>(__args)...)); + } +#endif + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator insert(const_iterator __position, const value_type& __x); + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator + insert(const_iterator __position, size_type __n, const value_type& __x); + template ::value, int> = 0> + iterator _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 + insert(const_iterator __position, _InputIterator __first, _InputIterator __last); + template ::value, int> = 0> + iterator _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 + insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last); + +#if _LIBCPP_STD_VER >= 23 + template <_ContainerCompatibleRange _Range> + _LIBCPP_HIDE_FROM_ABI constexpr iterator insert_range(const_iterator __position, _Range&& __range) { + if constexpr (ranges::forward_range<_Range> || ranges::sized_range<_Range>) { + auto __n = static_cast(ranges::distance(__range)); + return __insert_with_size(__position, ranges::begin(__range), ranges::end(__range), __n); + + } else { + return __insert_with_sentinel(__position, ranges::begin(__range), ranges::end(__range)); + } + } +#endif + +#ifndef _LIBCPP_CXX03_LANG + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator + insert(const_iterator __position, initializer_list __il) { + return insert(__position, __il.begin(), __il.end()); + } +#endif + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator erase(const_iterator __position); + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator erase(const_iterator __first, const_iterator __last); + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void clear() _NOEXCEPT { __size_ = 0; } + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void swap(vector&) +#if _LIBCPP_STD_VER >= 14 + _NOEXCEPT; +#else + _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value || __is_nothrow_swappable_v); +#endif + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 static void swap(reference __x, reference __y) _NOEXCEPT { + std::swap(__x, __y); + } + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void resize(size_type __sz, value_type __x = false); + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void flip() _NOEXCEPT; + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool __invariants() const; + +private: + [[__noreturn__]] _LIBCPP_HIDE_FROM_ABI void __throw_length_error() const { std::__throw_length_error("vector"); } + + [[__noreturn__]] _LIBCPP_HIDE_FROM_ABI void __throw_out_of_range() const { std::__throw_out_of_range("vector"); } + + template + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void + __init_with_size(_InputIterator __first, _Sentinel __last, size_type __n) { + auto __guard = std::__make_exception_guard(__destroy_vector(*this)); + + if (__n > 0) { + __vallocate(__n); + __construct_at_end(std::move(__first), std::move(__last), __n); + } + + __guard.__complete(); + } + + template + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void + __init_with_sentinel(_InputIterator __first, _Sentinel __last) { +#if _LIBCPP_HAS_EXCEPTIONS + try { +#endif // _LIBCPP_HAS_EXCEPTIONS + for (; __first != __last; ++__first) + push_back(*__first); +#if _LIBCPP_HAS_EXCEPTIONS + } catch (...) { + if (__begin_ != nullptr) + __storage_traits::deallocate(__alloc(), __begin_, __cap()); + throw; + } +#endif // _LIBCPP_HAS_EXCEPTIONS + } + + template + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __assign_with_sentinel(_Iterator __first, _Sentinel __last); + + template + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void + __assign_with_size(_ForwardIterator __first, _Sentinel __last, difference_type __ns); + + template + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator + __insert_with_sentinel(const_iterator __position, _InputIterator __first, _Sentinel __last); + + template + _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator + __insert_with_size(const_iterator __position, _Iterator __first, _Sentinel __last, difference_type __n); + + // Allocate space for __n objects + // throws length_error if __n > max_size() + // throws (probably bad_alloc) if memory run out + // Precondition: __begin_ == __end_ == __cap() == 0 + // Precondition: __n > 0 + // Postcondition: capacity() >= __n + // Postcondition: size() == 0 + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __vallocate(size_type __n) { + if (__n > max_size()) + __throw_length_error(); + auto __allocation = std::__allocate_at_least(__alloc(), __external_cap_to_internal(__n)); + __begin_ = __allocation.ptr; + __size_ = 0; + __cap() = __allocation.count; + if (__libcpp_is_constant_evaluated()) { + for (size_type __i = 0; __i != __cap(); ++__i) + std::__construct_at(std::__to_address(__begin_) + __i); + } + } + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __vdeallocate() _NOEXCEPT; + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 static size_type __align_it(size_type __new_size) _NOEXCEPT { + return (__new_size + (__bits_per_word - 1)) & ~((size_type)__bits_per_word - 1); + } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 size_type __recommend(size_type __new_size) const; + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __construct_at_end(size_type __n, bool __x); + template + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void + __construct_at_end(_InputIterator __first, _Sentinel __last, size_type __n); + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __append(size_type __n, const_reference __x); + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 reference __make_ref(size_type __pos) _NOEXCEPT { + return reference(__begin_ + __pos / __bits_per_word, __storage_type(1) << __pos % __bits_per_word); + } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reference __make_ref(size_type __pos) const _NOEXCEPT { + return __bit_const_reference( + __begin_ + __pos / __bits_per_word, __storage_type(1) << __pos % __bits_per_word); + } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator __make_iter(size_type __pos) _NOEXCEPT { + return iterator(__begin_ + __pos / __bits_per_word, static_cast(__pos % __bits_per_word)); + } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_iterator __make_iter(size_type __pos) const _NOEXCEPT { + return const_iterator(__begin_ + __pos / __bits_per_word, static_cast(__pos % __bits_per_word)); + } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator __const_iterator_cast(const_iterator __p) _NOEXCEPT { + return begin() + (__p - cbegin()); + } + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __copy_assign_alloc(const vector& __v) { + __copy_assign_alloc( + __v, integral_constant()); + } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __copy_assign_alloc(const vector& __c, true_type) { + if (__alloc() != __c.__alloc()) + __vdeallocate(); + __alloc() = __c.__alloc(); + } + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __copy_assign_alloc(const vector&, false_type) {} + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __move_assign(vector& __c, false_type); + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __move_assign(vector& __c, true_type) + _NOEXCEPT_(is_nothrow_move_assignable::value); + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __move_assign_alloc(vector& __c) + _NOEXCEPT_(!__storage_traits::propagate_on_container_move_assignment::value || + is_nothrow_move_assignable::value) { + __move_assign_alloc( + __c, integral_constant()); + } + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __move_assign_alloc(vector& __c, true_type) + _NOEXCEPT_(is_nothrow_move_assignable::value) { + __alloc() = std::move(__c.__alloc()); + } + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __move_assign_alloc(vector&, false_type) _NOEXCEPT {} + + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 size_t __hash_code() const _NOEXCEPT; + + friend class __bit_reference; + friend class __bit_const_reference; + friend class __bit_iterator; + friend class __bit_iterator; + friend struct __bit_array; + friend struct _LIBCPP_TEMPLATE_VIS hash; +}; + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::__vdeallocate() _NOEXCEPT { + if (this->__begin_ != nullptr) { + __storage_traits::deallocate(this->__alloc(), this->__begin_, __cap()); + this->__begin_ = nullptr; + this->__size_ = this->__cap() = 0; + } +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector::size_type +vector::max_size() const _NOEXCEPT { + size_type __amax = __storage_traits::max_size(__alloc()); + size_type __nmax = numeric_limits::max() / 2; // end() >= begin(), always + if (__nmax / __bits_per_word <= __amax) + return __nmax; + return __internal_cap_to_external(__amax); +} + +// Precondition: __new_size > capacity() +template +inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector::size_type +vector::__recommend(size_type __new_size) const { + const size_type __ms = max_size(); + if (__new_size > __ms) + this->__throw_length_error(); + const size_type __cap = capacity(); + if (__cap >= __ms / 2) + return __ms; + return std::max(2 * __cap, __align_it(__new_size)); +} + +// Default constructs __n objects starting at __end_ +// Precondition: __n > 0 +// Precondition: size() + __n <= capacity() +// Postcondition: size() == size() + __n +template +inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void +vector::__construct_at_end(size_type __n, bool __x) { + size_type __old_size = this->__size_; + this->__size_ += __n; + if (__old_size == 0 || ((__old_size - 1) / __bits_per_word) != ((this->__size_ - 1) / __bits_per_word)) { + if (this->__size_ <= __bits_per_word) + this->__begin_[0] = __storage_type(0); + else + this->__begin_[(this->__size_ - 1) / __bits_per_word] = __storage_type(0); + } + std::fill_n(__make_iter(__old_size), __n, __x); +} + +template +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void +vector::__construct_at_end(_InputIterator __first, _Sentinel __last, size_type __n) { + size_type __old_size = this->__size_; + this->__size_ += __n; + if (__old_size == 0 || ((__old_size - 1) / __bits_per_word) != ((this->__size_ - 1) / __bits_per_word)) { + if (this->__size_ <= __bits_per_word) + this->__begin_[0] = __storage_type(0); + else + this->__begin_[(this->__size_ - 1) / __bits_per_word] = __storage_type(0); + } + std::__copy<_ClassicAlgPolicy>(__first, __last, __make_iter(__old_size)); +} + +template +inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector::vector() + _NOEXCEPT_(is_nothrow_default_constructible::value) + : __begin_(nullptr), __size_(0), __cap_(0) {} + +template +inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector::vector(const allocator_type& __a) +#if _LIBCPP_STD_VER <= 14 + _NOEXCEPT_(is_nothrow_copy_constructible::value) +#else + _NOEXCEPT +#endif + : __begin_(nullptr), __size_(0), __cap_(0), __alloc_(static_cast<__storage_allocator>(__a)) { +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 vector::vector(size_type __n) + : __begin_(nullptr), __size_(0), __cap_(0) { + if (__n > 0) { + __vallocate(__n); + __construct_at_end(__n, false); + } +} + +#if _LIBCPP_STD_VER >= 14 +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 vector::vector(size_type __n, const allocator_type& __a) + : __begin_(nullptr), __size_(0), __cap_(0), __alloc_(static_cast<__storage_allocator>(__a)) { + if (__n > 0) { + __vallocate(__n); + __construct_at_end(__n, false); + } +} +#endif + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 vector::vector(size_type __n, const value_type& __x) + : __begin_(nullptr), __size_(0), __cap_(0) { + if (__n > 0) { + __vallocate(__n); + __construct_at_end(__n, __x); + } +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 +vector::vector(size_type __n, const value_type& __x, const allocator_type& __a) + : __begin_(nullptr), __size_(0), __cap_(0), __alloc_(static_cast<__storage_allocator>(__a)) { + if (__n > 0) { + __vallocate(__n); + __construct_at_end(__n, __x); + } +} + +template +template ::value, int> > +_LIBCPP_CONSTEXPR_SINCE_CXX20 vector::vector(_InputIterator __first, _InputIterator __last) + : __begin_(nullptr), __size_(0), __cap_(0) { + __init_with_sentinel(__first, __last); +} + +template +template ::value, int> > +_LIBCPP_CONSTEXPR_SINCE_CXX20 +vector::vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a) + : __begin_(nullptr), __size_(0), __cap_(0), __alloc_(static_cast<__storage_allocator>(__a)) { + __init_with_sentinel(__first, __last); +} + +template +template ::value, int> > +_LIBCPP_CONSTEXPR_SINCE_CXX20 vector::vector(_ForwardIterator __first, _ForwardIterator __last) + : __begin_(nullptr), __size_(0), __cap_(0) { + auto __n = static_cast(std::distance(__first, __last)); + __init_with_size(__first, __last, __n); +} + +template +template ::value, int> > +_LIBCPP_CONSTEXPR_SINCE_CXX20 +vector::vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a) + : __begin_(nullptr), __size_(0), __cap_(0), __alloc_(static_cast<__storage_allocator>(__a)) { + auto __n = static_cast(std::distance(__first, __last)); + __init_with_size(__first, __last, __n); +} + +#ifndef _LIBCPP_CXX03_LANG + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 vector::vector(initializer_list __il) + : __begin_(nullptr), __size_(0), __cap_(0) { + size_type __n = static_cast(__il.size()); + if (__n > 0) { + __vallocate(__n); + __construct_at_end(__il.begin(), __il.end(), __n); + } +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 +vector::vector(initializer_list __il, const allocator_type& __a) + : __begin_(nullptr), __size_(0), __cap_(0), __alloc_(static_cast<__storage_allocator>(__a)) { + size_type __n = static_cast(__il.size()); + if (__n > 0) { + __vallocate(__n); + __construct_at_end(__il.begin(), __il.end(), __n); + } +} + +#endif // _LIBCPP_CXX03_LANG + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 vector::vector(const vector& __v) + : __begin_(nullptr), + __size_(0), + __cap_(0), + __alloc_(__storage_traits::select_on_container_copy_construction(__v.__alloc())) { + if (__v.size() > 0) { + __vallocate(__v.size()); + __construct_at_end(__v.begin(), __v.end(), __v.size()); + } +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 vector::vector(const vector& __v, const allocator_type& __a) + : __begin_(nullptr), __size_(0), __cap_(0), __alloc_(__a) { + if (__v.size() > 0) { + __vallocate(__v.size()); + __construct_at_end(__v.begin(), __v.end(), __v.size()); + } +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 vector& vector::operator=(const vector& __v) { + if (this != std::addressof(__v)) { + __copy_assign_alloc(__v); + if (__v.__size_) { + if (__v.__size_ > capacity()) { + __vdeallocate(); + __vallocate(__v.__size_); + } + std::copy(__v.__begin_, __v.__begin_ + __external_cap_to_internal(__v.__size_), __begin_); + } + __size_ = __v.__size_; + } + return *this; +} + +template +inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector::vector(vector&& __v) +#if _LIBCPP_STD_VER >= 17 + _NOEXCEPT +#else + _NOEXCEPT_(is_nothrow_move_constructible::value) +#endif + : __begin_(__v.__begin_), + __size_(__v.__size_), + __cap_(__v.__cap_), + __alloc_(std::move(__v.__alloc_)) { + __v.__begin_ = nullptr; + __v.__size_ = 0; + __v.__cap() = 0; +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 +vector::vector(vector&& __v, const __type_identity_t& __a) + : __begin_(nullptr), __size_(0), __cap_(0), __alloc_(__a) { + if (__a == allocator_type(__v.__alloc())) { + this->__begin_ = __v.__begin_; + this->__size_ = __v.__size_; + this->__cap() = __v.__cap(); + __v.__begin_ = nullptr; + __v.__cap() = __v.__size_ = 0; + } else if (__v.size() > 0) { + __vallocate(__v.size()); + __construct_at_end(__v.begin(), __v.end(), __v.size()); + } +} + +template +inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector& +vector::operator=(vector&& __v) + _NOEXCEPT_(__noexcept_move_assign_container<_Allocator, __alloc_traits>::value) { + __move_assign(__v, integral_constant()); + return *this; +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::__move_assign(vector& __c, false_type) { + if (__alloc() != __c.__alloc()) + assign(__c.begin(), __c.end()); + else + __move_assign(__c, true_type()); +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::__move_assign(vector& __c, true_type) + _NOEXCEPT_(is_nothrow_move_assignable::value) { + __vdeallocate(); + __move_assign_alloc(__c); + this->__begin_ = __c.__begin_; + this->__size_ = __c.__size_; + this->__cap() = __c.__cap(); + __c.__begin_ = nullptr; + __c.__cap() = __c.__size_ = 0; +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::assign(size_type __n, const value_type& __x) { + __size_ = 0; + if (__n > 0) { + size_type __c = capacity(); + if (__n <= __c) + __size_ = __n; + else { + vector __v(get_allocator()); + __v.reserve(__recommend(__n)); + __v.__size_ = __n; + swap(__v); + } + std::fill_n(begin(), __n, __x); + } +} + +template +template ::value, int> > +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::assign(_InputIterator __first, _InputIterator __last) { + __assign_with_sentinel(__first, __last); +} + +template +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void +vector::__assign_with_sentinel(_Iterator __first, _Sentinel __last) { + clear(); + for (; __first != __last; ++__first) + push_back(*__first); +} + +template +template ::value, int> > +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::assign(_ForwardIterator __first, _ForwardIterator __last) { + __assign_with_size(__first, __last, std::distance(__first, __last)); +} + +template +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void +vector::__assign_with_size(_ForwardIterator __first, _Sentinel __last, difference_type __ns) { + _LIBCPP_ASSERT_VALID_INPUT_RANGE(__ns >= 0, "invalid range specified"); + + clear(); + + const size_t __n = static_cast(__ns); + if (__n) { + if (__n > capacity()) { + __vdeallocate(); + __vallocate(__n); + } + __construct_at_end(__first, __last, __n); + } +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::reserve(size_type __n) { + if (__n > capacity()) { + if (__n > max_size()) + this->__throw_length_error(); + vector __v(this->get_allocator()); + __v.__vallocate(__n); + __v.__construct_at_end(this->begin(), this->end(), this->size()); + swap(__v); + } +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::shrink_to_fit() _NOEXCEPT { + if (__external_cap_to_internal(size()) > __cap()) { +#if _LIBCPP_HAS_EXCEPTIONS + try { +#endif // _LIBCPP_HAS_EXCEPTIONS + vector(*this, allocator_type(__alloc())).swap(*this); +#if _LIBCPP_HAS_EXCEPTIONS + } catch (...) { + } +#endif // _LIBCPP_HAS_EXCEPTIONS + } +} + +template +typename vector::reference vector::at(size_type __n) { + if (__n >= size()) + this->__throw_out_of_range(); + return (*this)[__n]; +} + +template +typename vector::const_reference vector::at(size_type __n) const { + if (__n >= size()) + this->__throw_out_of_range(); + return (*this)[__n]; +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::push_back(const value_type& __x) { + if (this->__size_ == this->capacity()) + reserve(__recommend(this->__size_ + 1)); + ++this->__size_; + back() = __x; +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector::iterator +vector::insert(const_iterator __position, const value_type& __x) { + iterator __r; + if (size() < capacity()) { + const_iterator __old_end = end(); + ++__size_; + std::copy_backward(__position, __old_end, end()); + __r = __const_iterator_cast(__position); + } else { + vector __v(get_allocator()); + __v.reserve(__recommend(__size_ + 1)); + __v.__size_ = __size_ + 1; + __r = std::copy(cbegin(), __position, __v.begin()); + std::copy_backward(__position, cend(), __v.end()); + swap(__v); + } + *__r = __x; + return __r; +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector::iterator +vector::insert(const_iterator __position, size_type __n, const value_type& __x) { + iterator __r; + size_type __c = capacity(); + if (__n <= __c && size() <= __c - __n) { + const_iterator __old_end = end(); + __size_ += __n; + std::copy_backward(__position, __old_end, end()); + __r = __const_iterator_cast(__position); + } else { + vector __v(get_allocator()); + __v.reserve(__recommend(__size_ + __n)); + __v.__size_ = __size_ + __n; + __r = std::copy(cbegin(), __position, __v.begin()); + std::copy_backward(__position, cend(), __v.end()); + swap(__v); + } + std::fill_n(__r, __n, __x); + return __r; +} + +template +template ::value, int> > +_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector::iterator +vector::insert(const_iterator __position, _InputIterator __first, _InputIterator __last) { + return __insert_with_sentinel(__position, __first, __last); +} + +template +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI typename vector::iterator +vector::__insert_with_sentinel(const_iterator __position, _InputIterator __first, _Sentinel __last) { + difference_type __off = __position - begin(); + iterator __p = __const_iterator_cast(__position); + iterator __old_end = end(); + for (; size() != capacity() && __first != __last; ++__first) { + ++this->__size_; + back() = *__first; + } + vector __v(get_allocator()); + if (__first != __last) { +#if _LIBCPP_HAS_EXCEPTIONS + try { +#endif // _LIBCPP_HAS_EXCEPTIONS + __v.__assign_with_sentinel(std::move(__first), std::move(__last)); + difference_type __old_size = static_cast(__old_end - begin()); + difference_type __old_p = __p - begin(); + reserve(__recommend(size() + __v.size())); + __p = begin() + __old_p; + __old_end = begin() + __old_size; +#if _LIBCPP_HAS_EXCEPTIONS + } catch (...) { + erase(__old_end, end()); + throw; + } +#endif // _LIBCPP_HAS_EXCEPTIONS + } + __p = std::rotate(__p, __old_end, end()); + insert(__p, __v.begin(), __v.end()); + return begin() + __off; +} + +template +template ::value, int> > +_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector::iterator +vector::insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last) { + return __insert_with_size(__position, __first, __last, std::distance(__first, __last)); +} + +template +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI typename vector::iterator +vector::__insert_with_size( + const_iterator __position, _ForwardIterator __first, _Sentinel __last, difference_type __n_signed) { + _LIBCPP_ASSERT_VALID_INPUT_RANGE(__n_signed >= 0, "invalid range specified"); + const size_type __n = static_cast(__n_signed); + iterator __r; + size_type __c = capacity(); + if (__n <= __c && size() <= __c - __n) { + const_iterator __old_end = end(); + __size_ += __n; + std::copy_backward(__position, __old_end, end()); + __r = __const_iterator_cast(__position); + } else { + vector __v(get_allocator()); + __v.reserve(__recommend(__size_ + __n)); + __v.__size_ = __size_ + __n; + __r = std::copy(cbegin(), __position, __v.begin()); + std::copy_backward(__position, cend(), __v.end()); + swap(__v); + } + std::__copy<_ClassicAlgPolicy>(__first, __last, __r); + return __r; +} + +template +inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector::iterator +vector::erase(const_iterator __position) { + iterator __r = __const_iterator_cast(__position); + std::copy(__position + 1, this->cend(), __r); + --__size_; + return __r; +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector::iterator +vector::erase(const_iterator __first, const_iterator __last) { + iterator __r = __const_iterator_cast(__first); + difference_type __d = __last - __first; + std::copy(__last, this->cend(), __r); + __size_ -= __d; + return __r; +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::swap(vector& __x) +#if _LIBCPP_STD_VER >= 14 + _NOEXCEPT +#else + _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value || __is_nothrow_swappable_v) +#endif +{ + std::swap(this->__begin_, __x.__begin_); + std::swap(this->__size_, __x.__size_); + std::swap(this->__cap(), __x.__cap()); + std::__swap_allocator(this->__alloc(), __x.__alloc()); +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::resize(size_type __sz, value_type __x) { + size_type __cs = size(); + if (__cs < __sz) { + iterator __r; + size_type __c = capacity(); + size_type __n = __sz - __cs; + if (__n <= __c && __cs <= __c - __n) { + __r = end(); + __size_ += __n; + } else { + vector __v(get_allocator()); + __v.reserve(__recommend(__size_ + __n)); + __v.__size_ = __size_ + __n; + __r = std::copy(cbegin(), cend(), __v.begin()); + swap(__v); + } + std::fill_n(__r, __n, __x); + } else + __size_ = __sz; +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::flip() _NOEXCEPT { + // do middle whole words + size_type __n = __size_; + __storage_pointer __p = __begin_; + for (; __n >= __bits_per_word; ++__p, __n -= __bits_per_word) + *__p = ~*__p; + // do last partial word + if (__n > 0) { + __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n); + __storage_type __b = *__p & __m; + *__p &= ~__m; + *__p |= ~__b & __m; + } +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 bool vector::__invariants() const { + if (this->__begin_ == nullptr) { + if (this->__size_ != 0 || this->__cap() != 0) + return false; + } else { + if (this->__cap() == 0) + return false; + if (this->__size_ > this->capacity()) + return false; + } + return true; +} + +template +_LIBCPP_CONSTEXPR_SINCE_CXX20 size_t vector::__hash_code() const _NOEXCEPT { + size_t __h = 0; + // do middle whole words + size_type __n = __size_; + __storage_pointer __p = __begin_; + for (; __n >= __bits_per_word; ++__p, __n -= __bits_per_word) + __h ^= *__p; + // do last partial word + if (__n > 0) { + const __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n); + __h ^= *__p & __m; + } + return __h; +} + +template +struct _LIBCPP_TEMPLATE_VIS hash > + : public __unary_function, size_t> { + _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 size_t + operator()(const vector& __vec) const _NOEXCEPT { + return __vec.__hash_code(); + } +}; + +_LIBCPP_END_NAMESPACE_STD + +_LIBCPP_POP_MACROS + +#endif // _LIBCPP___VECTOR_VECTOR_BOOL_H diff --git a/libcxx/include/__vector/vector_bool_formatter.h b/libcxx/include/__vector/vector_bool_formatter.h new file mode 100644 index 00000000000000..017f9405e329b8 --- /dev/null +++ b/libcxx/include/__vector/vector_bool_formatter.h @@ -0,0 +1,49 @@ +//===----------------------------------------------------------------------===// +// +// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. +// See https://llvm.org/LICENSE.txt for license information. +// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception +// +//===----------------------------------------------------------------------===// + +#ifndef _LIBCPP___VECTOR_VECTOR_BOOL_FORMATTER_H +#define _LIBCPP___VECTOR_VECTOR_BOOL_FORMATTER_H + +#include <__concepts/same_as.h> +#include <__config> +#include <__format/formatter.h> +#include <__format/formatter_bool.h> +#include <__fwd/vector.h> + +#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) +# pragma GCC system_header +#endif + +#if _LIBCPP_STD_VER >= 23 + +_LIBCPP_BEGIN_NAMESPACE_STD + +template +// Since is-vector-bool-reference is only used once it's inlined here. + requires same_as> +struct _LIBCPP_TEMPLATE_VIS formatter<_Tp, _CharT> { +private: + formatter __underlying_; + +public: + template + _LIBCPP_HIDE_FROM_ABI constexpr typename _ParseContext::iterator parse(_ParseContext& __ctx) { + return __underlying_.parse(__ctx); + } + + template + _LIBCPP_HIDE_FROM_ABI typename _FormatContext::iterator format(const _Tp& __ref, _FormatContext& __ctx) const { + return __underlying_.format(__ref, __ctx); + } +}; + +_LIBCPP_END_NAMESPACE_STD + +#endif // _LIBCPP_STD_VER >= 23 + +#endif // _LIBCPP___VECTOR_VECTOR_BOOL_FORMATTER_H diff --git a/libcxx/include/chrono b/libcxx/include/chrono index 7bec5e5a26ef4a..0f4223270c9d29 100644 --- a/libcxx/include/chrono +++ b/libcxx/include/chrono @@ -1009,6 +1009,7 @@ constexpr chrono::year operator ""y(unsigned lo # include # include # include +# include #endif #if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER == 20 diff --git a/libcxx/include/functional b/libcxx/include/functional index 489d82b2d43ab9..55b50eea84b732 100644 --- a/libcxx/include/functional +++ b/libcxx/include/functional @@ -578,7 +578,6 @@ POLICY: For non-variadic implementations, the number of arguments is limited # include # include # include -# include #endif #if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20 @@ -593,6 +592,7 @@ POLICY: For non-variadic implementations, the number of arguments is limited # include # include # include +# include #endif #endif // _LIBCPP_FUNCTIONAL diff --git a/libcxx/include/module.modulemap b/libcxx/include/module.modulemap index d775da489e35e5..51695a29f1f6d7 100644 --- a/libcxx/include/module.modulemap +++ b/libcxx/include/module.modulemap @@ -1523,6 +1523,7 @@ module std [system] { } module uninitialized_algorithms { header "__memory/uninitialized_algorithms.h" + export std.utility.pair } module unique_ptr { header "__memory/unique_ptr.h" @@ -2008,6 +2009,38 @@ module std [system] { module vector { module fwd { header "__fwd/vector.h" } + module comparison { header "__vector/comparison.h" } + module container_traits { header "__vector/container_traits.h" } + module erase { header "__vector/erase.h" } + module formatter { + header "__vector/formatter.h" + + export std.format.formatter + } + module pmr { + header "__vector/pmr.h" + + export std.memory_resource.polymorphic_allocator + } + module swap { header "__vector/swap.h" } + module vector_bool { + header "__vector/vector_bool.h" + export std.bit_reference + export std.memory.allocator + export std.vector.comparison + export std.vector.fwd + export std.vector.swap + } + module vector { + header "__vector/vector.h" + export std.iterator.bounded_iter + export std.iterator.wrap_iter + export std.memory.allocator + export std.vector.comparison + export std.vector.fwd + export std.vector.swap + } + header "vector" export * } diff --git a/libcxx/include/vector b/libcxx/include/vector index bfbf1ea1cfc9f0..de292d143b6e71 100644 --- a/libcxx/include/vector +++ b/libcxx/include/vector @@ -304,78 +304,25 @@ template requires is-vector-bool-reference // Since C++ // clang-format on -#include <__algorithm/copy.h> -#include <__algorithm/equal.h> -#include <__algorithm/fill_n.h> -#include <__algorithm/iterator_operations.h> -#include <__algorithm/lexicographical_compare.h> -#include <__algorithm/lexicographical_compare_three_way.h> -#include <__algorithm/max.h> -#include <__algorithm/min.h> -#include <__algorithm/move.h> -#include <__algorithm/move_backward.h> -#include <__algorithm/remove.h> -#include <__algorithm/remove_if.h> -#include <__algorithm/rotate.h> -#include <__algorithm/unwrap_iter.h> -#include <__assert> -#include <__bit_reference> -#include <__concepts/same_as.h> #include <__config> -#include <__debug_utils/sanitizers.h> -#include <__format/enable_insertable.h> -#include <__format/formatter.h> -#include <__format/formatter_bool.h> -#include <__functional/hash.h> -#include <__functional/unary_function.h> -#include <__fwd/vector.h> -#include <__iterator/advance.h> -#include <__iterator/bounded_iter.h> -#include <__iterator/distance.h> -#include <__iterator/iterator_traits.h> -#include <__iterator/move_iterator.h> -#include <__iterator/next.h> -#include <__iterator/reverse_iterator.h> -#include <__iterator/wrap_iter.h> -#include <__memory/addressof.h> -#include <__memory/allocate_at_least.h> -#include <__memory/allocator.h> -#include <__memory/allocator_traits.h> -#include <__memory/compressed_pair.h> -#include <__memory/construct_at.h> -#include <__memory/noexcept_move_assign_container.h> -#include <__memory/pointer_traits.h> -#include <__memory/swap_allocator.h> -#include <__memory/temp_value.h> -#include <__memory/uninitialized_algorithms.h> -#include <__memory_resource/polymorphic_allocator.h> -#include <__ranges/access.h> -#include <__ranges/concepts.h> -#include <__ranges/container_compatible_range.h> -#include <__ranges/from_range.h> -#include <__ranges/size.h> -#include <__split_buffer> -#include <__type_traits/conditional.h> -#include <__type_traits/container_traits.h> -#include <__type_traits/disjunction.h> -#include <__type_traits/enable_if.h> -#include <__type_traits/is_allocator.h> -#include <__type_traits/is_constructible.h> -#include <__type_traits/is_nothrow_assignable.h> -#include <__type_traits/is_nothrow_constructible.h> -#include <__type_traits/is_same.h> -#include <__type_traits/is_trivially_relocatable.h> -#include <__type_traits/type_identity.h> -#include <__utility/exception_guard.h> -#include <__utility/forward.h> -#include <__utility/is_pointer_in_range.h> -#include <__utility/move.h> -#include <__utility/pair.h> -#include <__utility/swap.h> -#include -#include -#include -#include + +#include <__vector/comparison.h> +#include <__vector/swap.h> +#include <__vector/vector.h> +#include <__vector/vector_bool.h> + +#if _LIBCPP_STD_VER >= 17 +# include <__vector/pmr.h> +#endif + +#if _LIBCPP_STD_VER >= 20 +# include <__vector/erase.h> +#endif + +#if _LIBCPP_STD_VER >= 23 +# include <__vector/formatter.h> +#endif + #include // standard-mandated includes @@ -391,2646 +338,29 @@ template requires is-vector-bool-reference // Since C++ #include #include +// [vector.syn], [unord.hash] +#include <__functional/hash.h> + #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) # pragma GCC system_header #endif -_LIBCPP_PUSH_MACROS -#include <__undef_macros> - -_LIBCPP_BEGIN_NAMESPACE_STD - -template */> -class _LIBCPP_TEMPLATE_VIS vector { -private: - typedef allocator<_Tp> __default_allocator_type; - -public: - typedef vector __self; - typedef _Tp value_type; - typedef _Allocator allocator_type; - typedef allocator_traits __alloc_traits; - typedef value_type& reference; - typedef const value_type& const_reference; - typedef typename __alloc_traits::size_type size_type; - typedef typename __alloc_traits::difference_type difference_type; - typedef typename __alloc_traits::pointer pointer; - typedef typename __alloc_traits::const_pointer const_pointer; -#ifdef _LIBCPP_ABI_BOUNDED_ITERATORS_IN_VECTOR - // Users might provide custom allocators, and prior to C++20 we have no existing way to detect whether the allocator's - // pointer type is contiguous (though it has to be by the Standard). Using the wrapper type ensures the iterator is - // considered contiguous. - typedef __bounded_iter<__wrap_iter > iterator; - typedef __bounded_iter<__wrap_iter > const_iterator; -#else - typedef __wrap_iter iterator; - typedef __wrap_iter const_iterator; -#endif - typedef std::reverse_iterator reverse_iterator; - typedef std::reverse_iterator const_reverse_iterator; - - // A vector containers the following members which may be trivially relocatable: - // - pointer: may be trivially relocatable, so it's checked - // - allocator_type: may be trivially relocatable, so it's checked - // vector doesn't contain any self-references, so it's trivially relocatable if its members are. - using __trivially_relocatable = __conditional_t< - __libcpp_is_trivially_relocatable::value && __libcpp_is_trivially_relocatable::value, - vector, - void>; - - static_assert(__check_valid_allocator::value, ""); - static_assert(is_same::value, - "Allocator::value_type must be same type as value_type"); - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector() - _NOEXCEPT_(is_nothrow_default_constructible::value) {} - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI explicit vector(const allocator_type& __a) -#if _LIBCPP_STD_VER <= 14 - _NOEXCEPT_(is_nothrow_copy_constructible::value) -#else - noexcept -#endif - : __alloc_(__a) { - } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI explicit vector(size_type __n) { - auto __guard = std::__make_exception_guard(__destroy_vector(*this)); - if (__n > 0) { - __vallocate(__n); - __construct_at_end(__n); - } - __guard.__complete(); - } - -#if _LIBCPP_STD_VER >= 14 - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI explicit vector(size_type __n, const allocator_type& __a) - : __alloc_(__a) { - auto __guard = std::__make_exception_guard(__destroy_vector(*this)); - if (__n > 0) { - __vallocate(__n); - __construct_at_end(__n); - } - __guard.__complete(); - } -#endif - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector(size_type __n, const value_type& __x) { - auto __guard = std::__make_exception_guard(__destroy_vector(*this)); - if (__n > 0) { - __vallocate(__n); - __construct_at_end(__n, __x); - } - __guard.__complete(); - } - - template <__enable_if_t<__is_allocator<_Allocator>::value, int> = 0> - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI - vector(size_type __n, const value_type& __x, const allocator_type& __a) - : __alloc_(__a) { - if (__n > 0) { - __vallocate(__n); - __construct_at_end(__n, __x); - } - } - - template ::value && - is_constructible::reference>::value, - int> = 0> - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector(_InputIterator __first, _InputIterator __last); - template ::value && - is_constructible::reference>::value, - int> = 0> - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI - vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a); - - template < - class _ForwardIterator, - __enable_if_t<__has_forward_iterator_category<_ForwardIterator>::value && - is_constructible::reference>::value, - int> = 0> - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector(_ForwardIterator __first, _ForwardIterator __last); - - template < - class _ForwardIterator, - __enable_if_t<__has_forward_iterator_category<_ForwardIterator>::value && - is_constructible::reference>::value, - int> = 0> - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI - vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a); - -#if _LIBCPP_STD_VER >= 23 - template <_ContainerCompatibleRange<_Tp> _Range> - _LIBCPP_HIDE_FROM_ABI constexpr vector( - from_range_t, _Range&& __range, const allocator_type& __alloc = allocator_type()) - : __alloc_(__alloc) { - if constexpr (ranges::forward_range<_Range> || ranges::sized_range<_Range>) { - auto __n = static_cast(ranges::distance(__range)); - __init_with_size(ranges::begin(__range), ranges::end(__range), __n); - - } else { - __init_with_sentinel(ranges::begin(__range), ranges::end(__range)); - } - } -#endif - -private: - class __destroy_vector { - public: - _LIBCPP_CONSTEXPR _LIBCPP_HIDE_FROM_ABI __destroy_vector(vector& __vec) : __vec_(__vec) {} - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void operator()() { - if (__vec_.__begin_ != nullptr) { - __vec_.__clear(); - __vec_.__annotate_delete(); - __alloc_traits::deallocate(__vec_.__alloc(), __vec_.__begin_, __vec_.capacity()); - } - } - - private: - vector& __vec_; - }; - -public: - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI ~vector() { __destroy_vector (*this)(); } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector(const vector& __x); - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI - vector(const vector& __x, const __type_identity_t& __a); - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector& operator=(const vector& __x); - -#ifndef _LIBCPP_CXX03_LANG - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector(initializer_list __il); - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI - vector(initializer_list __il, const allocator_type& __a); - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector& operator=(initializer_list __il) { - assign(__il.begin(), __il.end()); - return *this; - } -#endif // !_LIBCPP_CXX03_LANG - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector(vector&& __x) -#if _LIBCPP_STD_VER >= 17 - noexcept; -#else - _NOEXCEPT_(is_nothrow_move_constructible::value); -#endif - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI - vector(vector&& __x, const __type_identity_t& __a); - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI vector& operator=(vector&& __x) - _NOEXCEPT_(__noexcept_move_assign_container<_Allocator, __alloc_traits>::value); - - template ::value && - is_constructible::reference>::value, - int> = 0> - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void assign(_InputIterator __first, _InputIterator __last); - template < - class _ForwardIterator, - __enable_if_t<__has_forward_iterator_category<_ForwardIterator>::value && - is_constructible::reference>::value, - int> = 0> - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void assign(_ForwardIterator __first, _ForwardIterator __last); - -#if _LIBCPP_STD_VER >= 23 - template <_ContainerCompatibleRange<_Tp> _Range> - _LIBCPP_HIDE_FROM_ABI constexpr void assign_range(_Range&& __range) { - if constexpr (ranges::forward_range<_Range> || ranges::sized_range<_Range>) { - auto __n = static_cast(ranges::distance(__range)); - __assign_with_size(ranges::begin(__range), ranges::end(__range), __n); - - } else { - __assign_with_sentinel(ranges::begin(__range), ranges::end(__range)); - } - } -#endif - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void assign(size_type __n, const_reference __u); - -#ifndef _LIBCPP_CXX03_LANG - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void assign(initializer_list __il) { - assign(__il.begin(), __il.end()); - } -#endif - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI allocator_type get_allocator() const _NOEXCEPT { - return this->__alloc(); - } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator begin() _NOEXCEPT; - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_iterator begin() const _NOEXCEPT; - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator end() _NOEXCEPT; - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_iterator end() const _NOEXCEPT; - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI reverse_iterator rbegin() _NOEXCEPT { - return reverse_iterator(end()); - } - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rbegin() const _NOEXCEPT { - return const_reverse_iterator(end()); - } - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI reverse_iterator rend() _NOEXCEPT { - return reverse_iterator(begin()); - } - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rend() const _NOEXCEPT { - return const_reverse_iterator(begin()); - } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_iterator cbegin() const _NOEXCEPT { return begin(); } - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_iterator cend() const _NOEXCEPT { return end(); } - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_reverse_iterator crbegin() const _NOEXCEPT { - return rbegin(); - } - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_reverse_iterator crend() const _NOEXCEPT { return rend(); } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI size_type size() const _NOEXCEPT { - return static_cast(this->__end_ - this->__begin_); - } - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI size_type capacity() const _NOEXCEPT { - return static_cast(__end_cap() - this->__begin_); - } - [[__nodiscard__]] _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI bool empty() const _NOEXCEPT { - return this->__begin_ == this->__end_; - } - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI size_type max_size() const _NOEXCEPT; - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void reserve(size_type __n); - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void shrink_to_fit() _NOEXCEPT; - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI reference operator[](size_type __n) _NOEXCEPT; - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_reference operator[](size_type __n) const _NOEXCEPT; - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI reference at(size_type __n); - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_reference at(size_type __n) const; - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI reference front() _NOEXCEPT { - _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(!empty(), "front() called on an empty vector"); - return *this->__begin_; - } - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_reference front() const _NOEXCEPT { - _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(!empty(), "front() called on an empty vector"); - return *this->__begin_; - } - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI reference back() _NOEXCEPT { - _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(!empty(), "back() called on an empty vector"); - return *(this->__end_ - 1); - } - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_reference back() const _NOEXCEPT { - _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(!empty(), "back() called on an empty vector"); - return *(this->__end_ - 1); - } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI value_type* data() _NOEXCEPT { - return std::__to_address(this->__begin_); - } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const value_type* data() const _NOEXCEPT { - return std::__to_address(this->__begin_); - } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void push_back(const_reference __x); - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void push_back(value_type&& __x); - - template - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI -#if _LIBCPP_STD_VER >= 17 - reference - emplace_back(_Args&&... __args); -#else - void - emplace_back(_Args&&... __args); -#endif - -#if _LIBCPP_STD_VER >= 23 - template <_ContainerCompatibleRange<_Tp> _Range> - _LIBCPP_HIDE_FROM_ABI constexpr void append_range(_Range&& __range) { - insert_range(end(), std::forward<_Range>(__range)); - } -#endif - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void pop_back(); - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __position, const_reference __x); - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __position, value_type&& __x); - template - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator emplace(const_iterator __position, _Args&&... __args); - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator - insert(const_iterator __position, size_type __n, const_reference __x); - - template ::value && - is_constructible< value_type, typename iterator_traits<_InputIterator>::reference>::value, - int> = 0> - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator - insert(const_iterator __position, _InputIterator __first, _InputIterator __last); - -#if _LIBCPP_STD_VER >= 23 - template <_ContainerCompatibleRange<_Tp> _Range> - _LIBCPP_HIDE_FROM_ABI constexpr iterator insert_range(const_iterator __position, _Range&& __range) { - if constexpr (ranges::forward_range<_Range> || ranges::sized_range<_Range>) { - auto __n = static_cast(ranges::distance(__range)); - return __insert_with_size(__position, ranges::begin(__range), ranges::end(__range), __n); - - } else { - return __insert_with_sentinel(__position, ranges::begin(__range), ranges::end(__range)); - } - } -#endif - - template < - class _ForwardIterator, - __enable_if_t<__has_forward_iterator_category<_ForwardIterator>::value && - is_constructible< value_type, typename iterator_traits<_ForwardIterator>::reference>::value, - int> = 0> - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator - insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last); - -#ifndef _LIBCPP_CXX03_LANG - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator - insert(const_iterator __position, initializer_list __il) { - return insert(__position, __il.begin(), __il.end()); - } -#endif - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __position); - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __first, const_iterator __last); - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void clear() _NOEXCEPT { - size_type __old_size = size(); - __clear(); - __annotate_shrink(__old_size); - } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void resize(size_type __sz); - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void resize(size_type __sz, const_reference __x); - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void swap(vector&) -#if _LIBCPP_STD_VER >= 14 - _NOEXCEPT; -#else - _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value || __is_nothrow_swappable_v); -#endif - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI bool __invariants() const; - -private: - pointer __begin_ = nullptr; - pointer __end_ = nullptr; - _LIBCPP_COMPRESSED_PAIR(pointer, __cap_ = nullptr, allocator_type, __alloc_); - - // Allocate space for __n objects - // throws length_error if __n > max_size() - // throws (probably bad_alloc) if memory run out - // Precondition: __begin_ == __end_ == __end_cap() == 0 - // Precondition: __n > 0 - // Postcondition: capacity() >= __n - // Postcondition: size() == 0 - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __vallocate(size_type __n) { - if (__n > max_size()) - __throw_length_error(); - auto __allocation = std::__allocate_at_least(__alloc(), __n); - __begin_ = __allocation.ptr; - __end_ = __allocation.ptr; - __end_cap() = __begin_ + __allocation.count; - __annotate_new(0); - } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __vdeallocate() _NOEXCEPT; - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI size_type __recommend(size_type __new_size) const; - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __construct_at_end(size_type __n); - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __construct_at_end(size_type __n, const_reference __x); - - template - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void - __init_with_size(_InputIterator __first, _Sentinel __last, size_type __n) { - auto __guard = std::__make_exception_guard(__destroy_vector(*this)); - - if (__n > 0) { - __vallocate(__n); - __construct_at_end(__first, __last, __n); - } - - __guard.__complete(); - } - - template - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void - __init_with_sentinel(_InputIterator __first, _Sentinel __last) { - auto __guard = std::__make_exception_guard(__destroy_vector(*this)); - - for (; __first != __last; ++__first) - emplace_back(*__first); - - __guard.__complete(); - } - - template - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __assign_with_sentinel(_Iterator __first, _Sentinel __last); - - template - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void - __assign_with_size(_ForwardIterator __first, _Sentinel __last, difference_type __n); - - template - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator - __insert_with_sentinel(const_iterator __position, _InputIterator __first, _Sentinel __last); - - template - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator - __insert_with_size(const_iterator __position, _Iterator __first, _Sentinel __last, difference_type __n); - - template - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void - __construct_at_end(_InputIterator __first, _Sentinel __last, size_type __n); - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __append(size_type __n); - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __append(size_type __n, const_reference __x); - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator __make_iter(pointer __p) _NOEXCEPT { -#ifdef _LIBCPP_ABI_BOUNDED_ITERATORS_IN_VECTOR - // Bound the iterator according to the capacity, rather than the size. - // - // Vector guarantees that iterators stay valid as long as no reallocation occurs even if new elements are inserted - // into the container; for these cases, we need to make sure that the newly-inserted elements can be accessed - // through the bounded iterator without failing checks. The downside is that the bounded iterator won't catch - // access that is logically out-of-bounds, i.e., goes beyond the size, but is still within the capacity. With the - // current implementation, there is no connection between a bounded iterator and its associated container, so we - // don't have a way to update existing valid iterators when the container is resized and thus have to go with - // a laxer approach. - return std::__make_bounded_iter( - std::__wrap_iter(__p), - std::__wrap_iter(this->__begin_), - std::__wrap_iter(this->__end_cap())); -#else - return iterator(__p); -#endif // _LIBCPP_ABI_BOUNDED_ITERATORS_IN_VECTOR - } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const_iterator __make_iter(const_pointer __p) const _NOEXCEPT { -#ifdef _LIBCPP_ABI_BOUNDED_ITERATORS_IN_VECTOR - // Bound the iterator according to the capacity, rather than the size. - return std::__make_bounded_iter( - std::__wrap_iter(__p), - std::__wrap_iter(this->__begin_), - std::__wrap_iter(this->__end_cap())); -#else - return const_iterator(__p); -#endif // _LIBCPP_ABI_BOUNDED_ITERATORS_IN_VECTOR - } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void - __swap_out_circular_buffer(__split_buffer& __v); - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI pointer - __swap_out_circular_buffer(__split_buffer& __v, pointer __p); - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void - __move_range(pointer __from_s, pointer __from_e, pointer __to); - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __move_assign(vector& __c, true_type) - _NOEXCEPT_(is_nothrow_move_assignable::value); - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __move_assign(vector& __c, false_type) - _NOEXCEPT_(__alloc_traits::is_always_equal::value); - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __destruct_at_end(pointer __new_last) _NOEXCEPT { - size_type __old_size = size(); - __base_destruct_at_end(__new_last); - __annotate_shrink(__old_size); - } - - template - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI inline pointer __push_back_slow_path(_Up&& __x); - - template - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI inline pointer __emplace_back_slow_path(_Args&&... __args); - - // The following functions are no-ops outside of AddressSanitizer mode. - // We call annotations for every allocator, unless explicitly disabled. - // - // To disable annotations for a particular allocator, change value of - // __asan_annotate_container_with_allocator to false. - // For more details, see the "Using libc++" documentation page or - // the documentation for __sanitizer_annotate_contiguous_container. - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void - __annotate_contiguous_container(const void* __old_mid, const void* __new_mid) const { - std::__annotate_contiguous_container<_Allocator>(data(), data() + capacity(), __old_mid, __new_mid); - } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __annotate_new(size_type __current_size) const _NOEXCEPT { - (void)__current_size; -#if _LIBCPP_HAS_ASAN - __annotate_contiguous_container(data() + capacity(), data() + __current_size); -#endif - } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __annotate_delete() const _NOEXCEPT { -#if _LIBCPP_HAS_ASAN - __annotate_contiguous_container(data() + size(), data() + capacity()); -#endif - } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __annotate_increase(size_type __n) const _NOEXCEPT { - (void)__n; -#if _LIBCPP_HAS_ASAN - __annotate_contiguous_container(data() + size(), data() + size() + __n); -#endif - } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __annotate_shrink(size_type __old_size) const _NOEXCEPT { - (void)__old_size; -#if _LIBCPP_HAS_ASAN - __annotate_contiguous_container(data() + __old_size, data() + size()); -#endif - } - - struct _ConstructTransaction { - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI explicit _ConstructTransaction(vector& __v, size_type __n) - : __v_(__v), __pos_(__v.__end_), __new_end_(__v.__end_ + __n) { -#if _LIBCPP_HAS_ASAN - __v_.__annotate_increase(__n); -#endif - } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI ~_ConstructTransaction() { - __v_.__end_ = __pos_; -#if _LIBCPP_HAS_ASAN - if (__pos_ != __new_end_) { - __v_.__annotate_shrink(__new_end_ - __v_.__begin_); - } -#endif - } - - vector& __v_; - pointer __pos_; - const_pointer const __new_end_; - - _ConstructTransaction(_ConstructTransaction const&) = delete; - _ConstructTransaction& operator=(_ConstructTransaction const&) = delete; - }; - - template - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __construct_one_at_end(_Args&&... __args) { - _ConstructTransaction __tx(*this, 1); - __alloc_traits::construct(this->__alloc(), std::__to_address(__tx.__pos_), std::forward<_Args>(__args)...); - ++__tx.__pos_; - } - - // TODO: Remove these now redundant accessors - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI allocator_type& __alloc() _NOEXCEPT { return this->__alloc_; } - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const allocator_type& __alloc() const _NOEXCEPT { - return this->__alloc_; - } - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI pointer& __end_cap() _NOEXCEPT { return this->__cap_; } - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI const pointer& __end_cap() const _NOEXCEPT { - return this->__cap_; - } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __clear() _NOEXCEPT { - __base_destruct_at_end(this->__begin_); - } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __base_destruct_at_end(pointer __new_last) _NOEXCEPT { - pointer __soon_to_be_end = this->__end_; - while (__new_last != __soon_to_be_end) - __alloc_traits::destroy(__alloc(), std::__to_address(--__soon_to_be_end)); - this->__end_ = __new_last; - } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __copy_assign_alloc(const vector& __c) { - __copy_assign_alloc(__c, integral_constant()); - } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __move_assign_alloc(vector& __c) - _NOEXCEPT_(!__alloc_traits::propagate_on_container_move_assignment::value || - is_nothrow_move_assignable::value) { - __move_assign_alloc(__c, integral_constant()); - } - - [[__noreturn__]] _LIBCPP_HIDE_FROM_ABI void __throw_length_error() const { std::__throw_length_error("vector"); } - - [[__noreturn__]] _LIBCPP_HIDE_FROM_ABI void __throw_out_of_range() const { std::__throw_out_of_range("vector"); } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __copy_assign_alloc(const vector& __c, true_type) { - if (__alloc() != __c.__alloc()) { - __clear(); - __annotate_delete(); - __alloc_traits::deallocate(__alloc(), this->__begin_, capacity()); - this->__begin_ = this->__end_ = __end_cap() = nullptr; - } - __alloc() = __c.__alloc(); - } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __copy_assign_alloc(const vector&, false_type) {} - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __move_assign_alloc(vector& __c, true_type) - _NOEXCEPT_(is_nothrow_move_assignable::value) { - __alloc() = std::move(__c.__alloc()); - } - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __move_assign_alloc(vector&, false_type) _NOEXCEPT {} -}; - -#if _LIBCPP_STD_VER >= 17 -template >, - class = enable_if_t<__has_input_iterator_category<_InputIterator>::value>, - class = enable_if_t<__is_allocator<_Alloc>::value> > -vector(_InputIterator, _InputIterator) -> vector<__iter_value_type<_InputIterator>, _Alloc>; - -template ::value>, - class = enable_if_t<__is_allocator<_Alloc>::value> > -vector(_InputIterator, _InputIterator, _Alloc) -> vector<__iter_value_type<_InputIterator>, _Alloc>; -#endif - -#if _LIBCPP_STD_VER >= 23 -template >, - class = enable_if_t<__is_allocator<_Alloc>::value> > -vector(from_range_t, _Range&&, _Alloc = _Alloc()) -> vector, _Alloc>; -#endif - -// __swap_out_circular_buffer relocates the objects in [__begin_, __end_) into the front of __v and swaps the buffers of -// *this and __v. It is assumed that __v provides space for exactly (__end_ - __begin_) objects in the front. This -// function has a strong exception guarantee. -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void -vector<_Tp, _Allocator>::__swap_out_circular_buffer(__split_buffer& __v) { - __annotate_delete(); - auto __new_begin = __v.__begin_ - (__end_ - __begin_); - std::__uninitialized_allocator_relocate( - __alloc(), std::__to_address(__begin_), std::__to_address(__end_), std::__to_address(__new_begin)); - __v.__begin_ = __new_begin; - __end_ = __begin_; // All the objects have been destroyed by relocating them. - std::swap(this->__begin_, __v.__begin_); - std::swap(this->__end_, __v.__end_); - std::swap(this->__end_cap(), __v.__end_cap()); - __v.__first_ = __v.__begin_; - __annotate_new(size()); -} - -// __swap_out_circular_buffer relocates the objects in [__begin_, __p) into the front of __v, the objects in -// [__p, __end_) into the back of __v and swaps the buffers of *this and __v. It is assumed that __v provides space for -// exactly (__p - __begin_) objects in the front and space for at least (__end_ - __p) objects in the back. This -// function has a strong exception guarantee if __begin_ == __p || __end_ == __p. -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::pointer -vector<_Tp, _Allocator>::__swap_out_circular_buffer(__split_buffer& __v, pointer __p) { - __annotate_delete(); - pointer __ret = __v.__begin_; - - // Relocate [__p, __end_) first to avoid having a hole in [__begin_, __end_) - // in case something in [__begin_, __p) throws. - std::__uninitialized_allocator_relocate( - __alloc(), std::__to_address(__p), std::__to_address(__end_), std::__to_address(__v.__end_)); - __v.__end_ += (__end_ - __p); - __end_ = __p; // The objects in [__p, __end_) have been destroyed by relocating them. - auto __new_begin = __v.__begin_ - (__p - __begin_); - - std::__uninitialized_allocator_relocate( - __alloc(), std::__to_address(__begin_), std::__to_address(__p), std::__to_address(__new_begin)); - __v.__begin_ = __new_begin; - __end_ = __begin_; // All the objects have been destroyed by relocating them. - - std::swap(this->__begin_, __v.__begin_); - std::swap(this->__end_, __v.__end_); - std::swap(this->__end_cap(), __v.__end_cap()); - __v.__first_ = __v.__begin_; - __annotate_new(size()); - return __ret; -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::__vdeallocate() _NOEXCEPT { - if (this->__begin_ != nullptr) { - clear(); - __annotate_delete(); - __alloc_traits::deallocate(this->__alloc(), this->__begin_, capacity()); - this->__begin_ = this->__end_ = this->__end_cap() = nullptr; - } -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::size_type -vector<_Tp, _Allocator>::max_size() const _NOEXCEPT { - return std::min(__alloc_traits::max_size(this->__alloc()), numeric_limits::max()); -} - -// Precondition: __new_size > capacity() -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::size_type -vector<_Tp, _Allocator>::__recommend(size_type __new_size) const { - const size_type __ms = max_size(); - if (__new_size > __ms) - this->__throw_length_error(); - const size_type __cap = capacity(); - if (__cap >= __ms / 2) - return __ms; - return std::max(2 * __cap, __new_size); -} - -// Default constructs __n objects starting at __end_ -// throws if construction throws -// Precondition: __n > 0 -// Precondition: size() + __n <= capacity() -// Postcondition: size() == size() + __n -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::__construct_at_end(size_type __n) { - _ConstructTransaction __tx(*this, __n); - const_pointer __new_end = __tx.__new_end_; - for (pointer __pos = __tx.__pos_; __pos != __new_end; __tx.__pos_ = ++__pos) { - __alloc_traits::construct(this->__alloc(), std::__to_address(__pos)); - } -} - -// Copy constructs __n objects starting at __end_ from __x -// throws if construction throws -// Precondition: __n > 0 -// Precondition: size() + __n <= capacity() -// Postcondition: size() == old size() + __n -// Postcondition: [i] == __x for all i in [size() - __n, __n) -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline void -vector<_Tp, _Allocator>::__construct_at_end(size_type __n, const_reference __x) { - _ConstructTransaction __tx(*this, __n); - const_pointer __new_end = __tx.__new_end_; - for (pointer __pos = __tx.__pos_; __pos != __new_end; __tx.__pos_ = ++__pos) { - __alloc_traits::construct(this->__alloc(), std::__to_address(__pos), __x); - } -} - -template -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void -vector<_Tp, _Allocator>::__construct_at_end(_InputIterator __first, _Sentinel __last, size_type __n) { - _ConstructTransaction __tx(*this, __n); - __tx.__pos_ = std::__uninitialized_allocator_copy(__alloc(), __first, __last, __tx.__pos_); -} - -// Default constructs __n objects starting at __end_ -// throws if construction throws -// Postcondition: size() == size() + __n -// Exception safety: strong. -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::__append(size_type __n) { - if (static_cast(this->__end_cap() - this->__end_) >= __n) - this->__construct_at_end(__n); - else { - allocator_type& __a = this->__alloc(); - __split_buffer __v(__recommend(size() + __n), size(), __a); - __v.__construct_at_end(__n); - __swap_out_circular_buffer(__v); - } -} - -// Default constructs __n objects starting at __end_ -// throws if construction throws -// Postcondition: size() == size() + __n -// Exception safety: strong. -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::__append(size_type __n, const_reference __x) { - if (static_cast(this->__end_cap() - this->__end_) >= __n) - this->__construct_at_end(__n, __x); - else { - allocator_type& __a = this->__alloc(); - __split_buffer __v(__recommend(size() + __n), size(), __a); - __v.__construct_at_end(__n, __x); - __swap_out_circular_buffer(__v); - } -} - -template -template ::value && - is_constructible<_Tp, typename iterator_traits<_InputIterator>::reference>::value, - int> > -_LIBCPP_CONSTEXPR_SINCE_CXX20 vector<_Tp, _Allocator>::vector(_InputIterator __first, _InputIterator __last) { - __init_with_sentinel(__first, __last); -} - -template -template ::value && - is_constructible<_Tp, typename iterator_traits<_InputIterator>::reference>::value, - int> > -_LIBCPP_CONSTEXPR_SINCE_CXX20 -vector<_Tp, _Allocator>::vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a) - : __alloc_(__a) { - __init_with_sentinel(__first, __last); -} - -template -template ::value && - is_constructible<_Tp, typename iterator_traits<_ForwardIterator>::reference>::value, - int> > -_LIBCPP_CONSTEXPR_SINCE_CXX20 vector<_Tp, _Allocator>::vector(_ForwardIterator __first, _ForwardIterator __last) { - size_type __n = static_cast(std::distance(__first, __last)); - __init_with_size(__first, __last, __n); -} - -template -template ::value && - is_constructible<_Tp, typename iterator_traits<_ForwardIterator>::reference>::value, - int> > -_LIBCPP_CONSTEXPR_SINCE_CXX20 -vector<_Tp, _Allocator>::vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a) - : __alloc_(__a) { - size_type __n = static_cast(std::distance(__first, __last)); - __init_with_size(__first, __last, __n); -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 vector<_Tp, _Allocator>::vector(const vector& __x) - : __alloc_(__alloc_traits::select_on_container_copy_construction(__x.__alloc())) { - __init_with_size(__x.__begin_, __x.__end_, __x.size()); -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 -vector<_Tp, _Allocator>::vector(const vector& __x, const __type_identity_t& __a) - : __alloc_(__a) { - __init_with_size(__x.__begin_, __x.__end_, __x.size()); -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI vector<_Tp, _Allocator>::vector(vector&& __x) -#if _LIBCPP_STD_VER >= 17 - noexcept -#else - _NOEXCEPT_(is_nothrow_move_constructible::value) -#endif - : __alloc_(std::move(__x.__alloc())) { - this->__begin_ = __x.__begin_; - this->__end_ = __x.__end_; - this->__end_cap() = __x.__end_cap(); - __x.__begin_ = __x.__end_ = __x.__end_cap() = nullptr; -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI -vector<_Tp, _Allocator>::vector(vector&& __x, const __type_identity_t& __a) - : __alloc_(__a) { - if (__a == __x.__alloc()) { - this->__begin_ = __x.__begin_; - this->__end_ = __x.__end_; - this->__end_cap() = __x.__end_cap(); - __x.__begin_ = __x.__end_ = __x.__end_cap() = nullptr; - } else { - typedef move_iterator _Ip; - auto __guard = std::__make_exception_guard(__destroy_vector(*this)); - assign(_Ip(__x.begin()), _Ip(__x.end())); - __guard.__complete(); - } -} - -#ifndef _LIBCPP_CXX03_LANG - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI -vector<_Tp, _Allocator>::vector(initializer_list __il) { - __init_with_size(__il.begin(), __il.end(), __il.size()); -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI -vector<_Tp, _Allocator>::vector(initializer_list __il, const allocator_type& __a) - : __alloc_(__a) { - __init_with_size(__il.begin(), __il.end(), __il.size()); -} - -#endif // _LIBCPP_CXX03_LANG - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI vector<_Tp, _Allocator>& -vector<_Tp, _Allocator>::operator=(vector&& __x) - _NOEXCEPT_(__noexcept_move_assign_container<_Allocator, __alloc_traits>::value) { - __move_assign(__x, integral_constant()); - return *this; -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::__move_assign(vector& __c, false_type) - _NOEXCEPT_(__alloc_traits::is_always_equal::value) { - if (__alloc() != __c.__alloc()) { - typedef move_iterator _Ip; - assign(_Ip(__c.begin()), _Ip(__c.end())); - } else - __move_assign(__c, true_type()); -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::__move_assign(vector& __c, true_type) - _NOEXCEPT_(is_nothrow_move_assignable::value) { - __vdeallocate(); - __move_assign_alloc(__c); // this can throw - this->__begin_ = __c.__begin_; - this->__end_ = __c.__end_; - this->__end_cap() = __c.__end_cap(); - __c.__begin_ = __c.__end_ = __c.__end_cap() = nullptr; -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI vector<_Tp, _Allocator>& -vector<_Tp, _Allocator>::operator=(const vector& __x) { - if (this != std::addressof(__x)) { - __copy_assign_alloc(__x); - assign(__x.__begin_, __x.__end_); - } - return *this; -} - -template -template ::value && - is_constructible<_Tp, typename iterator_traits<_InputIterator>::reference>::value, - int> > -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::assign(_InputIterator __first, _InputIterator __last) { - __assign_with_sentinel(__first, __last); -} - -template -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void -vector<_Tp, _Allocator>::__assign_with_sentinel(_Iterator __first, _Sentinel __last) { - clear(); - for (; __first != __last; ++__first) - emplace_back(*__first); -} - -template -template ::value && - is_constructible<_Tp, typename iterator_traits<_ForwardIterator>::reference>::value, - int> > -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::assign(_ForwardIterator __first, _ForwardIterator __last) { - __assign_with_size(__first, __last, std::distance(__first, __last)); -} - -template -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void -vector<_Tp, _Allocator>::__assign_with_size(_ForwardIterator __first, _Sentinel __last, difference_type __n) { - size_type __new_size = static_cast(__n); - if (__new_size <= capacity()) { - if (__new_size > size()) { - _ForwardIterator __mid = std::next(__first, size()); - std::copy(__first, __mid, this->__begin_); - __construct_at_end(__mid, __last, __new_size - size()); - } else { - pointer __m = std::__copy<_ClassicAlgPolicy>(__first, __last, this->__begin_).second; - this->__destruct_at_end(__m); - } - } else { - __vdeallocate(); - __vallocate(__recommend(__new_size)); - __construct_at_end(__first, __last, __new_size); - } -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::assign(size_type __n, const_reference __u) { - if (__n <= capacity()) { - size_type __s = size(); - std::fill_n(this->__begin_, std::min(__n, __s), __u); - if (__n > __s) - __construct_at_end(__n - __s, __u); - else - this->__destruct_at_end(this->__begin_ + __n); - } else { - __vdeallocate(); - __vallocate(__recommend(static_cast(__n))); - __construct_at_end(__n, __u); - } -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::iterator -vector<_Tp, _Allocator>::begin() _NOEXCEPT { - return __make_iter(this->__begin_); -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::const_iterator -vector<_Tp, _Allocator>::begin() const _NOEXCEPT { - return __make_iter(this->__begin_); -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::iterator -vector<_Tp, _Allocator>::end() _NOEXCEPT { - return __make_iter(this->__end_); -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::const_iterator -vector<_Tp, _Allocator>::end() const _NOEXCEPT { - return __make_iter(this->__end_); -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::reference -vector<_Tp, _Allocator>::operator[](size_type __n) _NOEXCEPT { - _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(__n < size(), "vector[] index out of bounds"); - return this->__begin_[__n]; -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::const_reference -vector<_Tp, _Allocator>::operator[](size_type __n) const _NOEXCEPT { - _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(__n < size(), "vector[] index out of bounds"); - return this->__begin_[__n]; -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::reference vector<_Tp, _Allocator>::at(size_type __n) { - if (__n >= size()) - this->__throw_out_of_range(); - return this->__begin_[__n]; -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::const_reference -vector<_Tp, _Allocator>::at(size_type __n) const { - if (__n >= size()) - this->__throw_out_of_range(); - return this->__begin_[__n]; -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::reserve(size_type __n) { - if (__n > capacity()) { - if (__n > max_size()) - this->__throw_length_error(); - allocator_type& __a = this->__alloc(); - __split_buffer __v(__n, size(), __a); - __swap_out_circular_buffer(__v); - } -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::shrink_to_fit() _NOEXCEPT { - if (capacity() > size()) { -#if _LIBCPP_HAS_EXCEPTIONS - try { -#endif // _LIBCPP_HAS_EXCEPTIONS - allocator_type& __a = this->__alloc(); - __split_buffer __v(size(), size(), __a); - // The Standard mandates shrink_to_fit() does not increase the capacity. - // With equal capacity keep the existing buffer. This avoids extra work - // due to swapping the elements. - if (__v.capacity() < capacity()) - __swap_out_circular_buffer(__v); -#if _LIBCPP_HAS_EXCEPTIONS - } catch (...) { - } -#endif // _LIBCPP_HAS_EXCEPTIONS - } -} - -template -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::pointer -vector<_Tp, _Allocator>::__push_back_slow_path(_Up&& __x) { - allocator_type& __a = this->__alloc(); - __split_buffer __v(__recommend(size() + 1), size(), __a); - // __v.push_back(std::forward<_Up>(__x)); - __alloc_traits::construct(__a, std::__to_address(__v.__end_), std::forward<_Up>(__x)); - __v.__end_++; - __swap_out_circular_buffer(__v); - return this->__end_; -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI void -vector<_Tp, _Allocator>::push_back(const_reference __x) { - pointer __end = this->__end_; - if (__end < this->__end_cap()) { - __construct_one_at_end(__x); - ++__end; - } else { - __end = __push_back_slow_path(__x); - } - this->__end_ = __end; -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI void vector<_Tp, _Allocator>::push_back(value_type&& __x) { - pointer __end = this->__end_; - if (__end < this->__end_cap()) { - __construct_one_at_end(std::move(__x)); - ++__end; - } else { - __end = __push_back_slow_path(std::move(__x)); - } - this->__end_ = __end; -} - -template -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::pointer -vector<_Tp, _Allocator>::__emplace_back_slow_path(_Args&&... __args) { - allocator_type& __a = this->__alloc(); - __split_buffer __v(__recommend(size() + 1), size(), __a); - // __v.emplace_back(std::forward<_Args>(__args)...); - __alloc_traits::construct(__a, std::__to_address(__v.__end_), std::forward<_Args>(__args)...); - __v.__end_++; - __swap_out_circular_buffer(__v); - return this->__end_; -} - -template -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline -#if _LIBCPP_STD_VER >= 17 - typename vector<_Tp, _Allocator>::reference -#else - void -#endif - vector<_Tp, _Allocator>::emplace_back(_Args&&... __args) { - pointer __end = this->__end_; - if (__end < this->__end_cap()) { - __construct_one_at_end(std::forward<_Args>(__args)...); - ++__end; - } else { - __end = __emplace_back_slow_path(std::forward<_Args>(__args)...); - } - this->__end_ = __end; -#if _LIBCPP_STD_VER >= 17 - return *(__end - 1); -#endif -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline void vector<_Tp, _Allocator>::pop_back() { - _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(!empty(), "vector::pop_back called on an empty vector"); - this->__destruct_at_end(this->__end_ - 1); -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::iterator -vector<_Tp, _Allocator>::erase(const_iterator __position) { - _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS( - __position != end(), "vector::erase(iterator) called with a non-dereferenceable iterator"); - difference_type __ps = __position - cbegin(); - pointer __p = this->__begin_ + __ps; - this->__destruct_at_end(std::move(__p + 1, this->__end_, __p)); - return __make_iter(__p); -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::iterator -vector<_Tp, _Allocator>::erase(const_iterator __first, const_iterator __last) { - _LIBCPP_ASSERT_VALID_INPUT_RANGE(__first <= __last, "vector::erase(first, last) called with invalid range"); - pointer __p = this->__begin_ + (__first - begin()); - if (__first != __last) { - this->__destruct_at_end(std::move(__p + (__last - __first), this->__end_, __p)); - } - return __make_iter(__p); -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void -vector<_Tp, _Allocator>::__move_range(pointer __from_s, pointer __from_e, pointer __to) { - pointer __old_last = this->__end_; - difference_type __n = __old_last - __to; - { - pointer __i = __from_s + __n; - _ConstructTransaction __tx(*this, __from_e - __i); - for (pointer __pos = __tx.__pos_; __i < __from_e; ++__i, (void)++__pos, __tx.__pos_ = __pos) { - __alloc_traits::construct(this->__alloc(), std::__to_address(__pos), std::move(*__i)); - } - } - std::move_backward(__from_s, __from_s + __n, __old_last); -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::iterator -vector<_Tp, _Allocator>::insert(const_iterator __position, const_reference __x) { - pointer __p = this->__begin_ + (__position - begin()); - if (this->__end_ < this->__end_cap()) { - if (__p == this->__end_) { - __construct_one_at_end(__x); - } else { - __move_range(__p, this->__end_, __p + 1); - const_pointer __xr = pointer_traits::pointer_to(__x); - if (std::__is_pointer_in_range(std::__to_address(__p), std::__to_address(__end_), std::addressof(__x))) - ++__xr; - *__p = *__xr; - } - } else { - allocator_type& __a = this->__alloc(); - __split_buffer __v(__recommend(size() + 1), __p - this->__begin_, __a); - __v.push_back(__x); - __p = __swap_out_circular_buffer(__v, __p); - } - return __make_iter(__p); -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::iterator -vector<_Tp, _Allocator>::insert(const_iterator __position, value_type&& __x) { - pointer __p = this->__begin_ + (__position - begin()); - if (this->__end_ < this->__end_cap()) { - if (__p == this->__end_) { - __construct_one_at_end(std::move(__x)); - } else { - __move_range(__p, this->__end_, __p + 1); - *__p = std::move(__x); - } - } else { - allocator_type& __a = this->__alloc(); - __split_buffer __v(__recommend(size() + 1), __p - this->__begin_, __a); - __v.push_back(std::move(__x)); - __p = __swap_out_circular_buffer(__v, __p); - } - return __make_iter(__p); -} - -template -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::iterator -vector<_Tp, _Allocator>::emplace(const_iterator __position, _Args&&... __args) { - pointer __p = this->__begin_ + (__position - begin()); - if (this->__end_ < this->__end_cap()) { - if (__p == this->__end_) { - __construct_one_at_end(std::forward<_Args>(__args)...); - } else { - __temp_value __tmp(this->__alloc(), std::forward<_Args>(__args)...); - __move_range(__p, this->__end_, __p + 1); - *__p = std::move(__tmp.get()); - } - } else { - allocator_type& __a = this->__alloc(); - __split_buffer __v(__recommend(size() + 1), __p - this->__begin_, __a); - __v.emplace_back(std::forward<_Args>(__args)...); - __p = __swap_out_circular_buffer(__v, __p); - } - return __make_iter(__p); -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::iterator -vector<_Tp, _Allocator>::insert(const_iterator __position, size_type __n, const_reference __x) { - pointer __p = this->__begin_ + (__position - begin()); - if (__n > 0) { - // We can't compare unrelated pointers inside constant expressions - if (!__libcpp_is_constant_evaluated() && __n <= static_cast(this->__end_cap() - this->__end_)) { - size_type __old_n = __n; - pointer __old_last = this->__end_; - if (__n > static_cast(this->__end_ - __p)) { - size_type __cx = __n - (this->__end_ - __p); - __construct_at_end(__cx, __x); - __n -= __cx; - } - if (__n > 0) { - __move_range(__p, __old_last, __p + __old_n); - const_pointer __xr = pointer_traits::pointer_to(__x); - if (__p <= __xr && __xr < this->__end_) - __xr += __old_n; - std::fill_n(__p, __n, *__xr); - } - } else { - allocator_type& __a = this->__alloc(); - __split_buffer __v(__recommend(size() + __n), __p - this->__begin_, __a); - __v.__construct_at_end(__n, __x); - __p = __swap_out_circular_buffer(__v, __p); - } - } - return __make_iter(__p); -} -template -template ::value && - is_constructible<_Tp, typename iterator_traits<_InputIterator>::reference>::value, - int> > -_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::iterator -vector<_Tp, _Allocator>::insert(const_iterator __position, _InputIterator __first, _InputIterator __last) { - return __insert_with_sentinel(__position, __first, __last); -} - -template -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::iterator -vector<_Tp, _Allocator>::__insert_with_sentinel(const_iterator __position, _InputIterator __first, _Sentinel __last) { - difference_type __off = __position - begin(); - pointer __p = this->__begin_ + __off; - allocator_type& __a = this->__alloc(); - pointer __old_last = this->__end_; - for (; this->__end_ != this->__end_cap() && __first != __last; ++__first) { - __construct_one_at_end(*__first); - } - __split_buffer __v(__a); - if (__first != __last) { -#if _LIBCPP_HAS_EXCEPTIONS - try { -#endif // _LIBCPP_HAS_EXCEPTIONS - __v.__construct_at_end_with_sentinel(std::move(__first), std::move(__last)); - difference_type __old_size = __old_last - this->__begin_; - difference_type __old_p = __p - this->__begin_; - reserve(__recommend(size() + __v.size())); - __p = this->__begin_ + __old_p; - __old_last = this->__begin_ + __old_size; -#if _LIBCPP_HAS_EXCEPTIONS - } catch (...) { - erase(__make_iter(__old_last), end()); - throw; - } -#endif // _LIBCPP_HAS_EXCEPTIONS - } - __p = std::rotate(__p, __old_last, this->__end_); - insert(__make_iter(__p), std::make_move_iterator(__v.begin()), std::make_move_iterator(__v.end())); - return begin() + __off; -} - -template -template ::value && - is_constructible<_Tp, typename iterator_traits<_ForwardIterator>::reference>::value, - int> > -_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector<_Tp, _Allocator>::iterator -vector<_Tp, _Allocator>::insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last) { - return __insert_with_size(__position, __first, __last, std::distance(__first, __last)); -} - -template -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::iterator -vector<_Tp, _Allocator>::__insert_with_size( - const_iterator __position, _Iterator __first, _Sentinel __last, difference_type __n) { - auto __insertion_size = __n; - pointer __p = this->__begin_ + (__position - begin()); - if (__n > 0) { - if (__n <= this->__end_cap() - this->__end_) { - size_type __old_n = __n; - pointer __old_last = this->__end_; - _Iterator __m = std::next(__first, __n); - difference_type __dx = this->__end_ - __p; - if (__n > __dx) { - __m = __first; - difference_type __diff = this->__end_ - __p; - std::advance(__m, __diff); - __construct_at_end(__m, __last, __n - __diff); - __n = __dx; - } - if (__n > 0) { - __move_range(__p, __old_last, __p + __old_n); - std::copy(__first, __m, __p); - } - } else { - allocator_type& __a = this->__alloc(); - __split_buffer __v(__recommend(size() + __n), __p - this->__begin_, __a); - __v.__construct_at_end_with_size(__first, __insertion_size); - __p = __swap_out_circular_buffer(__v, __p); - } - } - return __make_iter(__p); -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::resize(size_type __sz) { - size_type __cs = size(); - if (__cs < __sz) - this->__append(__sz - __cs); - else if (__cs > __sz) - this->__destruct_at_end(this->__begin_ + __sz); -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::resize(size_type __sz, const_reference __x) { - size_type __cs = size(); - if (__cs < __sz) - this->__append(__sz - __cs, __x); - else if (__cs > __sz) - this->__destruct_at_end(this->__begin_ + __sz); -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector<_Tp, _Allocator>::swap(vector& __x) -#if _LIBCPP_STD_VER >= 14 - _NOEXCEPT -#else - _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value || __is_nothrow_swappable_v) -#endif -{ - _LIBCPP_ASSERT_COMPATIBLE_ALLOCATOR( - __alloc_traits::propagate_on_container_swap::value || this->__alloc() == __x.__alloc(), - "vector::swap: Either propagate_on_container_swap must be true" - " or the allocators must compare equal"); - std::swap(this->__begin_, __x.__begin_); - std::swap(this->__end_, __x.__end_); - std::swap(this->__end_cap(), __x.__end_cap()); - std::__swap_allocator(this->__alloc(), __x.__alloc()); -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 bool vector<_Tp, _Allocator>::__invariants() const { - if (this->__begin_ == nullptr) { - if (this->__end_ != nullptr || this->__end_cap() != nullptr) - return false; - } else { - if (this->__begin_ > this->__end_) - return false; - if (this->__begin_ == this->__end_cap()) - return false; - if (this->__end_ > this->__end_cap()) - return false; - } - return true; -} - -// vector - -template -class vector; - -template -struct hash >; - -template -struct __has_storage_type > { - static const bool value = true; -}; - -template -class _LIBCPP_TEMPLATE_VIS vector { -public: - typedef vector __self; - typedef bool value_type; - typedef _Allocator allocator_type; - typedef allocator_traits __alloc_traits; - typedef typename __alloc_traits::size_type size_type; - typedef typename __alloc_traits::difference_type difference_type; - typedef size_type __storage_type; - typedef __bit_iterator pointer; - typedef __bit_iterator const_pointer; - typedef pointer iterator; - typedef const_pointer const_iterator; - typedef std::reverse_iterator reverse_iterator; - typedef std::reverse_iterator const_reverse_iterator; - -private: - typedef __rebind_alloc<__alloc_traits, __storage_type> __storage_allocator; - typedef allocator_traits<__storage_allocator> __storage_traits; - typedef typename __storage_traits::pointer __storage_pointer; - typedef typename __storage_traits::const_pointer __const_storage_pointer; - - __storage_pointer __begin_; - size_type __size_; - _LIBCPP_COMPRESSED_PAIR(size_type, __cap_, __storage_allocator, __alloc_); - -public: - typedef __bit_reference reference; -#ifdef _LIBCPP_ABI_BITSET_VECTOR_BOOL_CONST_SUBSCRIPT_RETURN_BOOL - using const_reference = bool; -#else - typedef __bit_const_reference const_reference; -#endif - -private: - // TODO: Remove these now redundant accessors - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 size_type& __cap() _NOEXCEPT { return __cap_; } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const size_type& __cap() const _NOEXCEPT { return __cap_; } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 __storage_allocator& __alloc() _NOEXCEPT { return __alloc_; } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const __storage_allocator& __alloc() const _NOEXCEPT { - return __alloc_; - } - - static const unsigned __bits_per_word = static_cast(sizeof(__storage_type) * CHAR_BIT); - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 static size_type - __internal_cap_to_external(size_type __n) _NOEXCEPT { - return __n * __bits_per_word; - } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 static size_type - __external_cap_to_internal(size_type __n) _NOEXCEPT { - return (__n - 1) / __bits_per_word + 1; - } - -public: - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector() - _NOEXCEPT_(is_nothrow_default_constructible::value); - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 explicit vector(const allocator_type& __a) -#if _LIBCPP_STD_VER <= 14 - _NOEXCEPT_(is_nothrow_copy_constructible::value); -#else - _NOEXCEPT; -#endif - -private: - class __destroy_vector { - public: - _LIBCPP_CONSTEXPR _LIBCPP_HIDE_FROM_ABI __destroy_vector(vector& __vec) : __vec_(__vec) {} - - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void operator()() { - if (__vec_.__begin_ != nullptr) - __storage_traits::deallocate(__vec_.__alloc(), __vec_.__begin_, __vec_.__cap()); - } - - private: - vector& __vec_; - }; - -public: - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 ~vector() { __destroy_vector (*this)(); } - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 explicit vector(size_type __n); -#if _LIBCPP_STD_VER >= 14 - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 explicit vector(size_type __n, const allocator_type& __a); -#endif - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(size_type __n, const value_type& __v); - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 - vector(size_type __n, const value_type& __v, const allocator_type& __a); - template ::value, int> = 0> - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(_InputIterator __first, _InputIterator __last); - template ::value, int> = 0> - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 - vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a); - template ::value, int> = 0> - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(_ForwardIterator __first, _ForwardIterator __last); - template ::value, int> = 0> - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 - vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a); - -#if _LIBCPP_STD_VER >= 23 - template <_ContainerCompatibleRange _Range> - _LIBCPP_HIDE_FROM_ABI constexpr vector(from_range_t, _Range&& __range, const allocator_type& __a = allocator_type()) - : __begin_(nullptr), __size_(0), __cap_(0), __alloc_(static_cast<__storage_allocator>(__a)) { - if constexpr (ranges::forward_range<_Range> || ranges::sized_range<_Range>) { - auto __n = static_cast(ranges::distance(__range)); - __init_with_size(ranges::begin(__range), ranges::end(__range), __n); - - } else { - __init_with_sentinel(ranges::begin(__range), ranges::end(__range)); - } - } -#endif - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(const vector& __v); - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(const vector& __v, const allocator_type& __a); - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector& operator=(const vector& __v); - -#ifndef _LIBCPP_CXX03_LANG - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(initializer_list __il); - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 - vector(initializer_list __il, const allocator_type& __a); - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector& operator=(initializer_list __il) { - assign(__il.begin(), __il.end()); - return *this; - } - -#endif // !_LIBCPP_CXX03_LANG - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector(vector&& __v) -#if _LIBCPP_STD_VER >= 17 - noexcept; -#else - _NOEXCEPT_(is_nothrow_move_constructible::value); -#endif - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 - vector(vector&& __v, const __type_identity_t& __a); - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector& operator=(vector&& __v) - _NOEXCEPT_(__noexcept_move_assign_container<_Allocator, __alloc_traits>::value); - - template ::value, int> = 0> - void _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 assign(_InputIterator __first, _InputIterator __last); - template ::value, int> = 0> - void _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 assign(_ForwardIterator __first, _ForwardIterator __last); - -#if _LIBCPP_STD_VER >= 23 - template <_ContainerCompatibleRange _Range> - _LIBCPP_HIDE_FROM_ABI constexpr void assign_range(_Range&& __range) { - if constexpr (ranges::forward_range<_Range> || ranges::sized_range<_Range>) { - auto __n = static_cast(ranges::distance(__range)); - __assign_with_size(ranges::begin(__range), ranges::end(__range), __n); - - } else { - __assign_with_sentinel(ranges::begin(__range), ranges::end(__range)); - } - } -#endif - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void assign(size_type __n, const value_type& __x); - -#ifndef _LIBCPP_CXX03_LANG - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void assign(initializer_list __il) { - assign(__il.begin(), __il.end()); - } -#endif - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 allocator_type get_allocator() const _NOEXCEPT { - return allocator_type(this->__alloc()); - } - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 size_type max_size() const _NOEXCEPT; - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 size_type capacity() const _NOEXCEPT { - return __internal_cap_to_external(__cap()); - } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 size_type size() const _NOEXCEPT { return __size_; } - [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool empty() const _NOEXCEPT { - return __size_ == 0; - } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void reserve(size_type __n); - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void shrink_to_fit() _NOEXCEPT; - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator begin() _NOEXCEPT { return __make_iter(0); } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_iterator begin() const _NOEXCEPT { return __make_iter(0); } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator end() _NOEXCEPT { return __make_iter(__size_); } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_iterator end() const _NOEXCEPT { - return __make_iter(__size_); - } - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 reverse_iterator rbegin() _NOEXCEPT { - return reverse_iterator(end()); - } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reverse_iterator rbegin() const _NOEXCEPT { - return const_reverse_iterator(end()); - } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 reverse_iterator rend() _NOEXCEPT { - return reverse_iterator(begin()); - } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reverse_iterator rend() const _NOEXCEPT { - return const_reverse_iterator(begin()); - } - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_iterator cbegin() const _NOEXCEPT { return __make_iter(0); } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_iterator cend() const _NOEXCEPT { - return __make_iter(__size_); - } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reverse_iterator crbegin() const _NOEXCEPT { - return rbegin(); - } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reverse_iterator crend() const _NOEXCEPT { return rend(); } - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 reference operator[](size_type __n) { return __make_ref(__n); } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reference operator[](size_type __n) const { - return __make_ref(__n); - } - _LIBCPP_HIDE_FROM_ABI reference at(size_type __n); - _LIBCPP_HIDE_FROM_ABI const_reference at(size_type __n) const; - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 reference front() { return __make_ref(0); } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reference front() const { return __make_ref(0); } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 reference back() { return __make_ref(__size_ - 1); } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reference back() const { return __make_ref(__size_ - 1); } - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void push_back(const value_type& __x); -#if _LIBCPP_STD_VER >= 14 - template -# if _LIBCPP_STD_VER >= 17 - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 reference emplace_back(_Args&&... __args) -# else - _LIBCPP_HIDE_FROM_ABI void emplace_back(_Args&&... __args) -# endif - { - push_back(value_type(std::forward<_Args>(__args)...)); -# if _LIBCPP_STD_VER >= 17 - return this->back(); -# endif - } -#endif - -#if _LIBCPP_STD_VER >= 23 - template <_ContainerCompatibleRange _Range> - _LIBCPP_HIDE_FROM_ABI constexpr void append_range(_Range&& __range) { - insert_range(end(), std::forward<_Range>(__range)); - } -#endif - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void pop_back() { --__size_; } - -#if _LIBCPP_STD_VER >= 14 - template - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator emplace(const_iterator __position, _Args&&... __args) { - return insert(__position, value_type(std::forward<_Args>(__args)...)); - } -#endif - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator insert(const_iterator __position, const value_type& __x); - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator - insert(const_iterator __position, size_type __n, const value_type& __x); - template ::value, int> = 0> - iterator _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 - insert(const_iterator __position, _InputIterator __first, _InputIterator __last); - template ::value, int> = 0> - iterator _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 - insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last); - -#if _LIBCPP_STD_VER >= 23 - template <_ContainerCompatibleRange _Range> - _LIBCPP_HIDE_FROM_ABI constexpr iterator insert_range(const_iterator __position, _Range&& __range) { - if constexpr (ranges::forward_range<_Range> || ranges::sized_range<_Range>) { - auto __n = static_cast(ranges::distance(__range)); - return __insert_with_size(__position, ranges::begin(__range), ranges::end(__range), __n); - - } else { - return __insert_with_sentinel(__position, ranges::begin(__range), ranges::end(__range)); - } - } -#endif - -#ifndef _LIBCPP_CXX03_LANG - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator - insert(const_iterator __position, initializer_list __il) { - return insert(__position, __il.begin(), __il.end()); - } -#endif - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator erase(const_iterator __position); - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator erase(const_iterator __first, const_iterator __last); - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void clear() _NOEXCEPT { __size_ = 0; } - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void swap(vector&) -#if _LIBCPP_STD_VER >= 14 - _NOEXCEPT; -#else - _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value || __is_nothrow_swappable_v); -#endif - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 static void swap(reference __x, reference __y) _NOEXCEPT { - std::swap(__x, __y); - } - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void resize(size_type __sz, value_type __x = false); - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void flip() _NOEXCEPT; - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool __invariants() const; - -private: - [[__noreturn__]] _LIBCPP_HIDE_FROM_ABI void __throw_length_error() const { std::__throw_length_error("vector"); } - - [[__noreturn__]] _LIBCPP_HIDE_FROM_ABI void __throw_out_of_range() const { std::__throw_out_of_range("vector"); } - - template - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void - __init_with_size(_InputIterator __first, _Sentinel __last, size_type __n) { - auto __guard = std::__make_exception_guard(__destroy_vector(*this)); - - if (__n > 0) { - __vallocate(__n); - __construct_at_end(std::move(__first), std::move(__last), __n); - } - - __guard.__complete(); - } - - template - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void - __init_with_sentinel(_InputIterator __first, _Sentinel __last) { -#if _LIBCPP_HAS_EXCEPTIONS - try { -#endif // _LIBCPP_HAS_EXCEPTIONS - for (; __first != __last; ++__first) - push_back(*__first); -#if _LIBCPP_HAS_EXCEPTIONS - } catch (...) { - if (__begin_ != nullptr) - __storage_traits::deallocate(__alloc(), __begin_, __cap()); - throw; - } -#endif // _LIBCPP_HAS_EXCEPTIONS - } - - template - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void __assign_with_sentinel(_Iterator __first, _Sentinel __last); - - template - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void - __assign_with_size(_ForwardIterator __first, _Sentinel __last, difference_type __ns); - - template - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator - __insert_with_sentinel(const_iterator __position, _InputIterator __first, _Sentinel __last); - - template - _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator - __insert_with_size(const_iterator __position, _Iterator __first, _Sentinel __last, difference_type __n); - - // Allocate space for __n objects - // throws length_error if __n > max_size() - // throws (probably bad_alloc) if memory run out - // Precondition: __begin_ == __end_ == __cap() == 0 - // Precondition: __n > 0 - // Postcondition: capacity() >= __n - // Postcondition: size() == 0 - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __vallocate(size_type __n) { - if (__n > max_size()) - __throw_length_error(); - auto __allocation = std::__allocate_at_least(__alloc(), __external_cap_to_internal(__n)); - __begin_ = __allocation.ptr; - __size_ = 0; - __cap() = __allocation.count; - if (__libcpp_is_constant_evaluated()) { - for (size_type __i = 0; __i != __cap(); ++__i) - std::__construct_at(std::__to_address(__begin_) + __i); - } - } - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __vdeallocate() _NOEXCEPT; - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 static size_type __align_it(size_type __new_size) _NOEXCEPT { - return (__new_size + (__bits_per_word - 1)) & ~((size_type)__bits_per_word - 1); - } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 size_type __recommend(size_type __new_size) const; - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __construct_at_end(size_type __n, bool __x); - template - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void - __construct_at_end(_InputIterator __first, _Sentinel __last, size_type __n); - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __append(size_type __n, const_reference __x); - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 reference __make_ref(size_type __pos) _NOEXCEPT { - return reference(__begin_ + __pos / __bits_per_word, __storage_type(1) << __pos % __bits_per_word); - } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_reference __make_ref(size_type __pos) const _NOEXCEPT { - return __bit_const_reference( - __begin_ + __pos / __bits_per_word, __storage_type(1) << __pos % __bits_per_word); - } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator __make_iter(size_type __pos) _NOEXCEPT { - return iterator(__begin_ + __pos / __bits_per_word, static_cast(__pos % __bits_per_word)); - } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 const_iterator __make_iter(size_type __pos) const _NOEXCEPT { - return const_iterator(__begin_ + __pos / __bits_per_word, static_cast(__pos % __bits_per_word)); - } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 iterator __const_iterator_cast(const_iterator __p) _NOEXCEPT { - return begin() + (__p - cbegin()); - } - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __copy_assign_alloc(const vector& __v) { - __copy_assign_alloc( - __v, integral_constant()); - } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __copy_assign_alloc(const vector& __c, true_type) { - if (__alloc() != __c.__alloc()) - __vdeallocate(); - __alloc() = __c.__alloc(); - } - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __copy_assign_alloc(const vector&, false_type) {} - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __move_assign(vector& __c, false_type); - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __move_assign(vector& __c, true_type) - _NOEXCEPT_(is_nothrow_move_assignable::value); - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __move_assign_alloc(vector& __c) - _NOEXCEPT_(!__storage_traits::propagate_on_container_move_assignment::value || - is_nothrow_move_assignable::value) { - __move_assign_alloc( - __c, integral_constant()); - } - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __move_assign_alloc(vector& __c, true_type) - _NOEXCEPT_(is_nothrow_move_assignable::value) { - __alloc() = std::move(__c.__alloc()); - } - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __move_assign_alloc(vector&, false_type) _NOEXCEPT {} - - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 size_t __hash_code() const _NOEXCEPT; - - friend class __bit_reference; - friend class __bit_const_reference; - friend class __bit_iterator; - friend class __bit_iterator; - friend struct __bit_array; - friend struct _LIBCPP_TEMPLATE_VIS hash; -}; - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::__vdeallocate() _NOEXCEPT { - if (this->__begin_ != nullptr) { - __storage_traits::deallocate(this->__alloc(), this->__begin_, __cap()); - this->__begin_ = nullptr; - this->__size_ = this->__cap() = 0; - } -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector::size_type -vector::max_size() const _NOEXCEPT { - size_type __amax = __storage_traits::max_size(__alloc()); - size_type __nmax = numeric_limits::max() / 2; // end() >= begin(), always - if (__nmax / __bits_per_word <= __amax) - return __nmax; - return __internal_cap_to_external(__amax); -} - -// Precondition: __new_size > capacity() -template -inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector::size_type -vector::__recommend(size_type __new_size) const { - const size_type __ms = max_size(); - if (__new_size > __ms) - this->__throw_length_error(); - const size_type __cap = capacity(); - if (__cap >= __ms / 2) - return __ms; - return std::max(2 * __cap, __align_it(__new_size)); -} - -// Default constructs __n objects starting at __end_ -// Precondition: __n > 0 -// Precondition: size() + __n <= capacity() -// Postcondition: size() == size() + __n -template -inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void -vector::__construct_at_end(size_type __n, bool __x) { - size_type __old_size = this->__size_; - this->__size_ += __n; - if (__old_size == 0 || ((__old_size - 1) / __bits_per_word) != ((this->__size_ - 1) / __bits_per_word)) { - if (this->__size_ <= __bits_per_word) - this->__begin_[0] = __storage_type(0); - else - this->__begin_[(this->__size_ - 1) / __bits_per_word] = __storage_type(0); - } - std::fill_n(__make_iter(__old_size), __n, __x); -} - -template -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void -vector::__construct_at_end(_InputIterator __first, _Sentinel __last, size_type __n) { - size_type __old_size = this->__size_; - this->__size_ += __n; - if (__old_size == 0 || ((__old_size - 1) / __bits_per_word) != ((this->__size_ - 1) / __bits_per_word)) { - if (this->__size_ <= __bits_per_word) - this->__begin_[0] = __storage_type(0); - else - this->__begin_[(this->__size_ - 1) / __bits_per_word] = __storage_type(0); - } - std::__copy<_ClassicAlgPolicy>(__first, __last, __make_iter(__old_size)); -} - -template -inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector::vector() - _NOEXCEPT_(is_nothrow_default_constructible::value) - : __begin_(nullptr), __size_(0), __cap_(0) {} - -template -inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector::vector(const allocator_type& __a) -#if _LIBCPP_STD_VER <= 14 - _NOEXCEPT_(is_nothrow_copy_constructible::value) -#else - _NOEXCEPT -#endif - : __begin_(nullptr), __size_(0), __cap_(0), __alloc_(static_cast<__storage_allocator>(__a)) { -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 vector::vector(size_type __n) - : __begin_(nullptr), __size_(0), __cap_(0) { - if (__n > 0) { - __vallocate(__n); - __construct_at_end(__n, false); - } -} - -#if _LIBCPP_STD_VER >= 14 -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 vector::vector(size_type __n, const allocator_type& __a) - : __begin_(nullptr), __size_(0), __cap_(0), __alloc_(static_cast<__storage_allocator>(__a)) { - if (__n > 0) { - __vallocate(__n); - __construct_at_end(__n, false); - } -} -#endif - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 vector::vector(size_type __n, const value_type& __x) - : __begin_(nullptr), __size_(0), __cap_(0) { - if (__n > 0) { - __vallocate(__n); - __construct_at_end(__n, __x); - } -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 -vector::vector(size_type __n, const value_type& __x, const allocator_type& __a) - : __begin_(nullptr), __size_(0), __cap_(0), __alloc_(static_cast<__storage_allocator>(__a)) { - if (__n > 0) { - __vallocate(__n); - __construct_at_end(__n, __x); - } -} - -template -template ::value, int> > -_LIBCPP_CONSTEXPR_SINCE_CXX20 vector::vector(_InputIterator __first, _InputIterator __last) - : __begin_(nullptr), __size_(0), __cap_(0) { - __init_with_sentinel(__first, __last); -} - -template -template ::value, int> > -_LIBCPP_CONSTEXPR_SINCE_CXX20 -vector::vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a) - : __begin_(nullptr), __size_(0), __cap_(0), __alloc_(static_cast<__storage_allocator>(__a)) { - __init_with_sentinel(__first, __last); -} - -template -template ::value, int> > -_LIBCPP_CONSTEXPR_SINCE_CXX20 vector::vector(_ForwardIterator __first, _ForwardIterator __last) - : __begin_(nullptr), __size_(0), __cap_(0) { - auto __n = static_cast(std::distance(__first, __last)); - __init_with_size(__first, __last, __n); -} - -template -template ::value, int> > -_LIBCPP_CONSTEXPR_SINCE_CXX20 -vector::vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a) - : __begin_(nullptr), __size_(0), __cap_(0), __alloc_(static_cast<__storage_allocator>(__a)) { - auto __n = static_cast(std::distance(__first, __last)); - __init_with_size(__first, __last, __n); -} - -#ifndef _LIBCPP_CXX03_LANG - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 vector::vector(initializer_list __il) - : __begin_(nullptr), __size_(0), __cap_(0) { - size_type __n = static_cast(__il.size()); - if (__n > 0) { - __vallocate(__n); - __construct_at_end(__il.begin(), __il.end(), __n); - } -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 -vector::vector(initializer_list __il, const allocator_type& __a) - : __begin_(nullptr), __size_(0), __cap_(0), __alloc_(static_cast<__storage_allocator>(__a)) { - size_type __n = static_cast(__il.size()); - if (__n > 0) { - __vallocate(__n); - __construct_at_end(__il.begin(), __il.end(), __n); - } -} - -#endif // _LIBCPP_CXX03_LANG - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 vector::vector(const vector& __v) - : __begin_(nullptr), - __size_(0), - __cap_(0), - __alloc_(__storage_traits::select_on_container_copy_construction(__v.__alloc())) { - if (__v.size() > 0) { - __vallocate(__v.size()); - __construct_at_end(__v.begin(), __v.end(), __v.size()); - } -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 vector::vector(const vector& __v, const allocator_type& __a) - : __begin_(nullptr), __size_(0), __cap_(0), __alloc_(__a) { - if (__v.size() > 0) { - __vallocate(__v.size()); - __construct_at_end(__v.begin(), __v.end(), __v.size()); - } -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 vector& vector::operator=(const vector& __v) { - if (this != std::addressof(__v)) { - __copy_assign_alloc(__v); - if (__v.__size_) { - if (__v.__size_ > capacity()) { - __vdeallocate(); - __vallocate(__v.__size_); - } - std::copy(__v.__begin_, __v.__begin_ + __external_cap_to_internal(__v.__size_), __begin_); - } - __size_ = __v.__size_; - } - return *this; -} - -template -inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector::vector(vector&& __v) -#if _LIBCPP_STD_VER >= 17 - _NOEXCEPT -#else - _NOEXCEPT_(is_nothrow_move_constructible::value) -#endif - : __begin_(__v.__begin_), - __size_(__v.__size_), - __cap_(__v.__cap_), - __alloc_(std::move(__v.__alloc_)) { - __v.__begin_ = nullptr; - __v.__size_ = 0; - __v.__cap() = 0; -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 -vector::vector(vector&& __v, const __type_identity_t& __a) - : __begin_(nullptr), __size_(0), __cap_(0), __alloc_(__a) { - if (__a == allocator_type(__v.__alloc())) { - this->__begin_ = __v.__begin_; - this->__size_ = __v.__size_; - this->__cap() = __v.__cap(); - __v.__begin_ = nullptr; - __v.__cap() = __v.__size_ = 0; - } else if (__v.size() > 0) { - __vallocate(__v.size()); - __construct_at_end(__v.begin(), __v.end(), __v.size()); - } -} - -template -inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 vector& -vector::operator=(vector&& __v) - _NOEXCEPT_(__noexcept_move_assign_container<_Allocator, __alloc_traits>::value) { - __move_assign(__v, integral_constant()); - return *this; -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::__move_assign(vector& __c, false_type) { - if (__alloc() != __c.__alloc()) - assign(__c.begin(), __c.end()); - else - __move_assign(__c, true_type()); -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::__move_assign(vector& __c, true_type) - _NOEXCEPT_(is_nothrow_move_assignable::value) { - __vdeallocate(); - __move_assign_alloc(__c); - this->__begin_ = __c.__begin_; - this->__size_ = __c.__size_; - this->__cap() = __c.__cap(); - __c.__begin_ = nullptr; - __c.__cap() = __c.__size_ = 0; -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::assign(size_type __n, const value_type& __x) { - __size_ = 0; - if (__n > 0) { - size_type __c = capacity(); - if (__n <= __c) - __size_ = __n; - else { - vector __v(get_allocator()); - __v.reserve(__recommend(__n)); - __v.__size_ = __n; - swap(__v); - } - std::fill_n(begin(), __n, __x); - } -} - -template -template ::value, int> > -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::assign(_InputIterator __first, _InputIterator __last) { - __assign_with_sentinel(__first, __last); -} - -template -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void -vector::__assign_with_sentinel(_Iterator __first, _Sentinel __last) { - clear(); - for (; __first != __last; ++__first) - push_back(*__first); -} - -template -template ::value, int> > -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::assign(_ForwardIterator __first, _ForwardIterator __last) { - __assign_with_size(__first, __last, std::distance(__first, __last)); -} - -template -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI void -vector::__assign_with_size(_ForwardIterator __first, _Sentinel __last, difference_type __ns) { - _LIBCPP_ASSERT_VALID_INPUT_RANGE(__ns >= 0, "invalid range specified"); - - clear(); - - const size_t __n = static_cast(__ns); - if (__n) { - if (__n > capacity()) { - __vdeallocate(); - __vallocate(__n); - } - __construct_at_end(__first, __last, __n); - } -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::reserve(size_type __n) { - if (__n > capacity()) { - if (__n > max_size()) - this->__throw_length_error(); - vector __v(this->get_allocator()); - __v.__vallocate(__n); - __v.__construct_at_end(this->begin(), this->end(), this->size()); - swap(__v); - } -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::shrink_to_fit() _NOEXCEPT { - if (__external_cap_to_internal(size()) > __cap()) { -#if _LIBCPP_HAS_EXCEPTIONS - try { -#endif // _LIBCPP_HAS_EXCEPTIONS - vector(*this, allocator_type(__alloc())).swap(*this); -#if _LIBCPP_HAS_EXCEPTIONS - } catch (...) { - } -#endif // _LIBCPP_HAS_EXCEPTIONS - } -} - -template -typename vector::reference vector::at(size_type __n) { - if (__n >= size()) - this->__throw_out_of_range(); - return (*this)[__n]; -} - -template -typename vector::const_reference vector::at(size_type __n) const { - if (__n >= size()) - this->__throw_out_of_range(); - return (*this)[__n]; -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::push_back(const value_type& __x) { - if (this->__size_ == this->capacity()) - reserve(__recommend(this->__size_ + 1)); - ++this->__size_; - back() = __x; -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector::iterator -vector::insert(const_iterator __position, const value_type& __x) { - iterator __r; - if (size() < capacity()) { - const_iterator __old_end = end(); - ++__size_; - std::copy_backward(__position, __old_end, end()); - __r = __const_iterator_cast(__position); - } else { - vector __v(get_allocator()); - __v.reserve(__recommend(__size_ + 1)); - __v.__size_ = __size_ + 1; - __r = std::copy(cbegin(), __position, __v.begin()); - std::copy_backward(__position, cend(), __v.end()); - swap(__v); - } - *__r = __x; - return __r; -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector::iterator -vector::insert(const_iterator __position, size_type __n, const value_type& __x) { - iterator __r; - size_type __c = capacity(); - if (__n <= __c && size() <= __c - __n) { - const_iterator __old_end = end(); - __size_ += __n; - std::copy_backward(__position, __old_end, end()); - __r = __const_iterator_cast(__position); - } else { - vector __v(get_allocator()); - __v.reserve(__recommend(__size_ + __n)); - __v.__size_ = __size_ + __n; - __r = std::copy(cbegin(), __position, __v.begin()); - std::copy_backward(__position, cend(), __v.end()); - swap(__v); - } - std::fill_n(__r, __n, __x); - return __r; -} - -template -template ::value, int> > -_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector::iterator -vector::insert(const_iterator __position, _InputIterator __first, _InputIterator __last) { - return __insert_with_sentinel(__position, __first, __last); -} - -template -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI typename vector::iterator -vector::__insert_with_sentinel(const_iterator __position, _InputIterator __first, _Sentinel __last) { - difference_type __off = __position - begin(); - iterator __p = __const_iterator_cast(__position); - iterator __old_end = end(); - for (; size() != capacity() && __first != __last; ++__first) { - ++this->__size_; - back() = *__first; - } - vector __v(get_allocator()); - if (__first != __last) { -#if _LIBCPP_HAS_EXCEPTIONS - try { -#endif // _LIBCPP_HAS_EXCEPTIONS - __v.__assign_with_sentinel(std::move(__first), std::move(__last)); - difference_type __old_size = static_cast(__old_end - begin()); - difference_type __old_p = __p - begin(); - reserve(__recommend(size() + __v.size())); - __p = begin() + __old_p; - __old_end = begin() + __old_size; -#if _LIBCPP_HAS_EXCEPTIONS - } catch (...) { - erase(__old_end, end()); - throw; - } -#endif // _LIBCPP_HAS_EXCEPTIONS - } - __p = std::rotate(__p, __old_end, end()); - insert(__p, __v.begin(), __v.end()); - return begin() + __off; -} - -template -template ::value, int> > -_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector::iterator -vector::insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last) { - return __insert_with_size(__position, __first, __last, std::distance(__first, __last)); -} - -template -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI typename vector::iterator -vector::__insert_with_size( - const_iterator __position, _ForwardIterator __first, _Sentinel __last, difference_type __n_signed) { - _LIBCPP_ASSERT_VALID_INPUT_RANGE(__n_signed >= 0, "invalid range specified"); - const size_type __n = static_cast(__n_signed); - iterator __r; - size_type __c = capacity(); - if (__n <= __c && size() <= __c - __n) { - const_iterator __old_end = end(); - __size_ += __n; - std::copy_backward(__position, __old_end, end()); - __r = __const_iterator_cast(__position); - } else { - vector __v(get_allocator()); - __v.reserve(__recommend(__size_ + __n)); - __v.__size_ = __size_ + __n; - __r = std::copy(cbegin(), __position, __v.begin()); - std::copy_backward(__position, cend(), __v.end()); - swap(__v); - } - std::__copy<_ClassicAlgPolicy>(__first, __last, __r); - return __r; -} - -template -inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector::iterator -vector::erase(const_iterator __position) { - iterator __r = __const_iterator_cast(__position); - std::copy(__position + 1, this->cend(), __r); - --__size_; - return __r; -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 typename vector::iterator -vector::erase(const_iterator __first, const_iterator __last) { - iterator __r = __const_iterator_cast(__first); - difference_type __d = __last - __first; - std::copy(__last, this->cend(), __r); - __size_ -= __d; - return __r; -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::swap(vector& __x) -#if _LIBCPP_STD_VER >= 14 - _NOEXCEPT -#else - _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value || __is_nothrow_swappable_v) -#endif -{ - std::swap(this->__begin_, __x.__begin_); - std::swap(this->__size_, __x.__size_); - std::swap(this->__cap(), __x.__cap()); - std::__swap_allocator(this->__alloc(), __x.__alloc()); -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::resize(size_type __sz, value_type __x) { - size_type __cs = size(); - if (__cs < __sz) { - iterator __r; - size_type __c = capacity(); - size_type __n = __sz - __cs; - if (__n <= __c && __cs <= __c - __n) { - __r = end(); - __size_ += __n; - } else { - vector __v(get_allocator()); - __v.reserve(__recommend(__size_ + __n)); - __v.__size_ = __size_ + __n; - __r = std::copy(cbegin(), cend(), __v.begin()); - swap(__v); - } - std::fill_n(__r, __n, __x); - } else - __size_ = __sz; -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 void vector::flip() _NOEXCEPT { - // do middle whole words - size_type __n = __size_; - __storage_pointer __p = __begin_; - for (; __n >= __bits_per_word; ++__p, __n -= __bits_per_word) - *__p = ~*__p; - // do last partial word - if (__n > 0) { - __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n); - __storage_type __b = *__p & __m; - *__p &= ~__m; - *__p |= ~__b & __m; - } -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 bool vector::__invariants() const { - if (this->__begin_ == nullptr) { - if (this->__size_ != 0 || this->__cap() != 0) - return false; - } else { - if (this->__cap() == 0) - return false; - if (this->__size_ > this->capacity()) - return false; - } - return true; -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 size_t vector::__hash_code() const _NOEXCEPT { - size_t __h = 0; - // do middle whole words - size_type __n = __size_; - __storage_pointer __p = __begin_; - for (; __n >= __bits_per_word; ++__p, __n -= __bits_per_word) - __h ^= *__p; - // do last partial word - if (__n > 0) { - const __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n); - __h ^= *__p & __m; - } - return __h; -} - -template -struct _LIBCPP_TEMPLATE_VIS hash > - : public __unary_function, size_t> { - _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 size_t - operator()(const vector& __vec) const _NOEXCEPT { - return __vec.__hash_code(); - } -}; - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI bool -operator==(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y) { - const typename vector<_Tp, _Allocator>::size_type __sz = __x.size(); - return __sz == __y.size() && std::equal(__x.begin(), __x.end(), __y.begin()); -} - -#if _LIBCPP_STD_VER <= 17 - -template -inline _LIBCPP_HIDE_FROM_ABI bool operator!=(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y) { - return !(__x == __y); -} - -template -inline _LIBCPP_HIDE_FROM_ABI bool operator<(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y) { - return std::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end()); -} - -template -inline _LIBCPP_HIDE_FROM_ABI bool operator>(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y) { - return __y < __x; -} - -template -inline _LIBCPP_HIDE_FROM_ABI bool operator>=(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y) { - return !(__x < __y); -} - -template -inline _LIBCPP_HIDE_FROM_ABI bool operator<=(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y) { - return !(__y < __x); -} - -#else // _LIBCPP_STD_VER <= 17 - -template -_LIBCPP_HIDE_FROM_ABI constexpr __synth_three_way_result<_Tp> -operator<=>(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y) { - return std::lexicographical_compare_three_way(__x.begin(), __x.end(), __y.begin(), __y.end(), std::__synth_three_way); -} - -#endif // _LIBCPP_STD_VER <= 17 - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI void -swap(vector<_Tp, _Allocator>& __x, vector<_Tp, _Allocator>& __y) _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y))) { - __x.swap(__y); -} - -#if _LIBCPP_STD_VER >= 20 -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::size_type -erase(vector<_Tp, _Allocator>& __c, const _Up& __v) { - auto __old_size = __c.size(); - __c.erase(std::remove(__c.begin(), __c.end(), __v), __c.end()); - return __old_size - __c.size(); -} - -template -_LIBCPP_CONSTEXPR_SINCE_CXX20 inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::size_type -erase_if(vector<_Tp, _Allocator>& __c, _Predicate __pred) { - auto __old_size = __c.size(); - __c.erase(std::remove_if(__c.begin(), __c.end(), __pred), __c.end()); - return __old_size - __c.size(); -} - -template <> -inline constexpr bool __format::__enable_insertable> = true; -# ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS -template <> -inline constexpr bool __format::__enable_insertable> = true; -# endif - -#endif // _LIBCPP_STD_VER >= 20 - -#if _LIBCPP_STD_VER >= 23 -template -// Since is-vector-bool-reference is only used once it's inlined here. - requires same_as> -struct _LIBCPP_TEMPLATE_VIS formatter<_Tp, _CharT> { -private: - formatter __underlying_; - -public: - template - _LIBCPP_HIDE_FROM_ABI constexpr typename _ParseContext::iterator parse(_ParseContext& __ctx) { - return __underlying_.parse(__ctx); - } - - template - _LIBCPP_HIDE_FROM_ABI typename _FormatContext::iterator format(const _Tp& __ref, _FormatContext& __ctx) const { - return __underlying_.format(__ref, __ctx); - } -}; -#endif // _LIBCPP_STD_VER >= 23 - -template -struct __container_traits > { - // http://eel.is/c++draft/vector.modifiers#2 - // If an exception is thrown other than by the copy constructor, move constructor, assignment operator, or move - // assignment operator of T or by any InputIterator operation, there are no effects. If an exception is thrown while - // inserting a single element at the end and T is Cpp17CopyInsertable or is_nothrow_move_constructible_v is true, - // there are no effects. Otherwise, if an exception is thrown by the move constructor of a non-Cpp17CopyInsertable T, - // the effects are unspecified. - static _LIBCPP_CONSTEXPR const bool __emplacement_has_strong_exception_safety_guarantee = - _Or, __is_cpp17_copy_insertable<_Allocator> >::value; -}; - -_LIBCPP_END_NAMESPACE_STD - -#if _LIBCPP_STD_VER >= 17 -_LIBCPP_BEGIN_NAMESPACE_STD -namespace pmr { -template -using vector _LIBCPP_AVAILABILITY_PMR = std::vector<_ValueT, polymorphic_allocator<_ValueT>>; -} // namespace pmr -_LIBCPP_END_NAMESPACE_STD -#endif - -_LIBCPP_POP_MACROS - #if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20 # include +# include # include +# include +# include +# include # include +# include # include # include # if !defined(_LIBCPP_HAS_NO_LOCALIZATION) # include # endif +# include +# include # include # include # include diff --git a/libcxx/test/libcxx/containers/sequences/vector.bool/abi.compile.pass.cpp b/libcxx/test/libcxx/containers/sequences/vector.bool/abi.compile.pass.cpp index 9920d131da3e26..cc6b0d94e7dafc 100644 --- a/libcxx/test/libcxx/containers/sequences/vector.bool/abi.compile.pass.cpp +++ b/libcxx/test/libcxx/containers/sequences/vector.bool/abi.compile.pass.cpp @@ -8,8 +8,8 @@ // UNSUPPORTED: libcpp-abi-no-compressed-pair-padding -#include #include +#include #include "min_allocator.h" #include "test_allocator.h" diff --git a/libcxx/test/libcxx/memory/swap_allocator.pass.cpp b/libcxx/test/libcxx/memory/swap_allocator.pass.cpp index 5eeb1bede71f30..311660290eaef0 100644 --- a/libcxx/test/libcxx/memory/swap_allocator.pass.cpp +++ b/libcxx/test/libcxx/memory/swap_allocator.pass.cpp @@ -12,10 +12,9 @@ // template // void __swap_allocator(_Alloc& __a1, _Alloc& __a2); +#include <__memory/swap_allocator.h> #include #include -// Transitively includes `swap_allocator.h` (directly including it breaks the modules build). -#include #include #include "test_macros.h" diff --git a/libcxx/test/libcxx/transitive_includes/cxx23.csv b/libcxx/test/libcxx/transitive_includes/cxx23.csv index 861fd2bb9ba98f..c3db06f1547769 100644 --- a/libcxx/test/libcxx/transitive_includes/cxx23.csv +++ b/libcxx/test/libcxx/transitive_includes/cxx23.csv @@ -145,7 +145,6 @@ chrono string chrono string_view chrono tuple chrono typeinfo -chrono vector chrono version cinttypes cstdint cmath limits @@ -457,29 +456,20 @@ fstream typeinfo fstream version functional array functional cctype -functional cerrno -functional climits -functional clocale functional compare functional cstddef functional cstdint -functional cstdio -functional cstdlib functional cstring functional cwchar functional cwctype functional initializer_list -functional iosfwd functional limits functional new functional optional functional stdexcept -functional string -functional string_view functional tuple functional typeinfo functional unordered_map -functional vector functional version future array future atomic @@ -884,17 +874,13 @@ queue tuple queue typeinfo queue vector queue version -random array random cctype -random cerrno random climits -random clocale random cmath random compare random cstddef random cstdint random cstdio -random cstdlib random cstring random ctime random cwchar @@ -910,8 +896,6 @@ random stdexcept random string random string_view random tuple -random typeinfo -random vector random version ranges cctype ranges compare diff --git a/libcxx/test/libcxx/transitive_includes/cxx26.csv b/libcxx/test/libcxx/transitive_includes/cxx26.csv index a31139f1ee8565..8d7560344ee541 100644 --- a/libcxx/test/libcxx/transitive_includes/cxx26.csv +++ b/libcxx/test/libcxx/transitive_includes/cxx26.csv @@ -145,7 +145,6 @@ chrono string chrono string_view chrono tuple chrono typeinfo -chrono vector chrono version cinttypes cstdint cmath limits @@ -456,29 +455,20 @@ fstream typeinfo fstream version functional array functional cctype -functional cerrno -functional climits -functional clocale functional compare functional cstddef functional cstdint -functional cstdio -functional cstdlib functional cstring functional cwchar functional cwctype functional initializer_list -functional iosfwd functional limits functional new functional optional functional stdexcept -functional string -functional string_view functional tuple functional typeinfo functional unordered_map -functional vector functional version future array future atomic @@ -883,17 +873,13 @@ queue tuple queue typeinfo queue vector queue version -random array random cctype -random cerrno random climits -random clocale random cmath random compare random cstddef random cstdint random cstdio -random cstdlib random cstring random ctime random cwchar @@ -909,8 +895,6 @@ random stdexcept random string random string_view random tuple -random typeinfo -random vector random version ranges cctype ranges compare diff --git a/libcxx/test/std/atomics/atomics.ref/assign.pass.cpp b/libcxx/test/std/atomics/atomics.ref/assign.pass.cpp index 3887211752c6fb..9b2f9042e9836f 100644 --- a/libcxx/test/std/atomics/atomics.ref/assign.pass.cpp +++ b/libcxx/test/std/atomics/atomics.ref/assign.pass.cpp @@ -13,6 +13,7 @@ #include #include +#include #include #include "atomic_helpers.h" diff --git a/libcxx/test/std/thread/thread.mutex/thread.lock/thread.lock.shared/thread.lock.shared.cons/mutex.pass.cpp b/libcxx/test/std/thread/thread.mutex/thread.lock/thread.lock.shared/thread.lock.shared.cons/mutex.pass.cpp index ece330134f2cda..45d694ed5c257f 100644 --- a/libcxx/test/std/thread/thread.mutex/thread.lock/thread.lock.shared/thread.lock.shared.cons/mutex.pass.cpp +++ b/libcxx/test/std/thread/thread.mutex/thread.lock/thread.lock.shared/thread.lock.shared.cons/mutex.pass.cpp @@ -22,6 +22,7 @@ #include #include #include +#include #include #include "make_test_thread.h" diff --git a/libcxx/test/std/time/time.zone/time.zone.leap/cons.copy.pass.cpp b/libcxx/test/std/time/time.zone/time.zone.leap/cons.copy.pass.cpp index 79ed0860811588..8c20e45213c3a9 100644 --- a/libcxx/test/std/time/time.zone/time.zone.leap/cons.copy.pass.cpp +++ b/libcxx/test/std/time/time.zone/time.zone.leap/cons.copy.pass.cpp @@ -21,9 +21,10 @@ // ... // }; +#include #include #include -#include +#include #include "test_chrono_leap_second.h" diff --git a/libcxx/test/std/time/time.zone/time.zone.leap/members/value.pass.cpp b/libcxx/test/std/time/time.zone/time.zone.leap/members/value.pass.cpp index c6181ee7df9f58..4da807cd4f4b38 100644 --- a/libcxx/test/std/time/time.zone/time.zone.leap/members/value.pass.cpp +++ b/libcxx/test/std/time/time.zone/time.zone.leap/members/value.pass.cpp @@ -20,6 +20,7 @@ #include #include +#include #include "test_macros.h" diff --git a/libcxx/test/std/time/time.zone/time.zone.link/time.zone.link.members/name.pass.cpp b/libcxx/test/std/time/time.zone/time.zone.link/time.zone.link.members/name.pass.cpp index 593675cfba4598..1f9b15ec8f4a66 100644 --- a/libcxx/test/std/time/time.zone/time.zone.link/time.zone.link.members/name.pass.cpp +++ b/libcxx/test/std/time/time.zone/time.zone.link/time.zone.link.members/name.pass.cpp @@ -20,6 +20,7 @@ #include #include +#include #include "test_macros.h" diff --git a/libcxx/test/std/time/time.zone/time.zone.link/time.zone.link.members/target.pass.cpp b/libcxx/test/std/time/time.zone/time.zone.link/time.zone.link.members/target.pass.cpp index aa97fdadcebcc1..069132b0a39fa9 100644 --- a/libcxx/test/std/time/time.zone/time.zone.link/time.zone.link.members/target.pass.cpp +++ b/libcxx/test/std/time/time.zone/time.zone.link/time.zone.link.members/target.pass.cpp @@ -20,6 +20,7 @@ #include #include +#include #include "test_macros.h" diff --git a/libcxx/test/std/time/time.zone/time.zone.timezone/time.zone.members/name.pass.cpp b/libcxx/test/std/time/time.zone/time.zone.timezone/time.zone.members/name.pass.cpp index b9f47382927977..fd17d9a6978b57 100644 --- a/libcxx/test/std/time/time.zone/time.zone.timezone/time.zone.members/name.pass.cpp +++ b/libcxx/test/std/time/time.zone/time.zone.timezone/time.zone.members/name.pass.cpp @@ -20,6 +20,7 @@ #include #include +#include #include "test_macros.h" diff --git a/libcxx/test/std/time/time.zone/time.zone.zonedtraits/const_time_zone_default_zone.pass.cpp b/libcxx/test/std/time/time.zone/time.zone.zonedtraits/const_time_zone_default_zone.pass.cpp index 930de9d0fec9e3..e22d62390a77fa 100644 --- a/libcxx/test/std/time/time.zone/time.zone.zonedtraits/const_time_zone_default_zone.pass.cpp +++ b/libcxx/test/std/time/time.zone/time.zone.zonedtraits/const_time_zone_default_zone.pass.cpp @@ -18,8 +18,8 @@ // static const time_zone* default_zone(); -#include #include +#include #include int main(int, char**) { diff --git a/libcxx/test/std/utilities/smartptr/unique.ptr/unique.ptr.class/unique.ptr.observers/dereference.single.pass.cpp b/libcxx/test/std/utilities/smartptr/unique.ptr/unique.ptr.class/unique.ptr.observers/dereference.single.pass.cpp index ba7f8bbb76222a..4063190838a27f 100644 --- a/libcxx/test/std/utilities/smartptr/unique.ptr/unique.ptr.class/unique.ptr.observers/dereference.single.pass.cpp +++ b/libcxx/test/std/utilities/smartptr/unique.ptr/unique.ptr.class/unique.ptr.observers/dereference.single.pass.cpp @@ -12,8 +12,9 @@ // test op*() -#include #include +#include +#include #include #include "test_macros.h"