[llvm-branch-commits] [libcxx] [libc++][C++03] Remove macros that expand to nothing (PR #134046)
via llvm-branch-commits
llvm-branch-commits at lists.llvm.org
Wed Apr 2 00:59:16 PDT 2025
github-actions[bot] wrote:
<!--LLVM CODE FORMAT COMMENT: {clang-format}-->
:warning: C/C++ code formatter, clang-format found issues in your code. :warning:
<details>
<summary>
You can test this locally with the following command:
</summary>
``````````bash
git-clang-format --diff HEAD~1 HEAD --extensions ,h -- libcxx/include/__cxx03/__algorithm/adjacent_find.h libcxx/include/__cxx03/__algorithm/all_of.h libcxx/include/__cxx03/__algorithm/any_of.h libcxx/include/__cxx03/__algorithm/binary_search.h libcxx/include/__cxx03/__algorithm/comp.h libcxx/include/__cxx03/__algorithm/comp_ref_type.h libcxx/include/__cxx03/__algorithm/copy.h libcxx/include/__cxx03/__algorithm/copy_backward.h libcxx/include/__cxx03/__algorithm/copy_if.h libcxx/include/__cxx03/__algorithm/copy_move_common.h libcxx/include/__cxx03/__algorithm/copy_n.h libcxx/include/__cxx03/__algorithm/count.h libcxx/include/__cxx03/__algorithm/count_if.h libcxx/include/__cxx03/__algorithm/equal.h libcxx/include/__cxx03/__algorithm/equal_range.h libcxx/include/__cxx03/__algorithm/fill.h libcxx/include/__cxx03/__algorithm/fill_n.h libcxx/include/__cxx03/__algorithm/find.h libcxx/include/__cxx03/__algorithm/find_end.h libcxx/include/__cxx03/__algorithm/find_first_of.h libcxx/include/__cxx03/__algorithm/find_if.h libcxx/include/__cxx03/__algorithm/find_if_not.h libcxx/include/__cxx03/__algorithm/find_segment_if.h libcxx/include/__cxx03/__algorithm/for_each.h libcxx/include/__cxx03/__algorithm/for_each_segment.h libcxx/include/__cxx03/__algorithm/generate.h libcxx/include/__cxx03/__algorithm/generate_n.h libcxx/include/__cxx03/__algorithm/half_positive.h libcxx/include/__cxx03/__algorithm/includes.h libcxx/include/__cxx03/__algorithm/is_heap.h libcxx/include/__cxx03/__algorithm/is_heap_until.h libcxx/include/__cxx03/__algorithm/is_partitioned.h libcxx/include/__cxx03/__algorithm/is_permutation.h libcxx/include/__cxx03/__algorithm/is_sorted.h libcxx/include/__cxx03/__algorithm/is_sorted_until.h libcxx/include/__cxx03/__algorithm/iter_swap.h libcxx/include/__cxx03/__algorithm/iterator_operations.h libcxx/include/__cxx03/__algorithm/lexicographical_compare.h libcxx/include/__cxx03/__algorithm/lower_bound.h libcxx/include/__cxx03/__algorithm/make_heap.h libcxx/include/__cxx03/__algorithm/make_projected.h libcxx/include/__cxx03/__algorithm/max.h libcxx/include/__cxx03/__algorithm/max_element.h libcxx/include/__cxx03/__algorithm/merge.h libcxx/include/__cxx03/__algorithm/min.h libcxx/include/__cxx03/__algorithm/min_element.h libcxx/include/__cxx03/__algorithm/minmax.h libcxx/include/__cxx03/__algorithm/minmax_element.h libcxx/include/__cxx03/__algorithm/mismatch.h libcxx/include/__cxx03/__algorithm/move.h libcxx/include/__cxx03/__algorithm/move_backward.h libcxx/include/__cxx03/__algorithm/next_permutation.h libcxx/include/__cxx03/__algorithm/none_of.h libcxx/include/__cxx03/__algorithm/nth_element.h libcxx/include/__cxx03/__algorithm/partial_sort.h libcxx/include/__cxx03/__algorithm/partial_sort_copy.h libcxx/include/__cxx03/__algorithm/partition.h libcxx/include/__cxx03/__algorithm/partition_copy.h libcxx/include/__cxx03/__algorithm/partition_point.h libcxx/include/__cxx03/__algorithm/pop_heap.h libcxx/include/__cxx03/__algorithm/prev_permutation.h libcxx/include/__cxx03/__algorithm/push_heap.h libcxx/include/__cxx03/__algorithm/remove.h libcxx/include/__cxx03/__algorithm/remove_copy.h libcxx/include/__cxx03/__algorithm/remove_copy_if.h libcxx/include/__cxx03/__algorithm/remove_if.h libcxx/include/__cxx03/__algorithm/replace.h libcxx/include/__cxx03/__algorithm/replace_copy.h libcxx/include/__cxx03/__algorithm/replace_copy_if.h libcxx/include/__cxx03/__algorithm/replace_if.h libcxx/include/__cxx03/__algorithm/reverse.h libcxx/include/__cxx03/__algorithm/reverse_copy.h libcxx/include/__cxx03/__algorithm/rotate.h libcxx/include/__cxx03/__algorithm/rotate_copy.h libcxx/include/__cxx03/__algorithm/search.h libcxx/include/__cxx03/__algorithm/search_n.h libcxx/include/__cxx03/__algorithm/set_difference.h libcxx/include/__cxx03/__algorithm/set_intersection.h libcxx/include/__cxx03/__algorithm/set_symmetric_difference.h libcxx/include/__cxx03/__algorithm/set_union.h libcxx/include/__cxx03/__algorithm/shuffle.h libcxx/include/__cxx03/__algorithm/sift_down.h libcxx/include/__cxx03/__algorithm/sort.h libcxx/include/__cxx03/__algorithm/sort_heap.h libcxx/include/__cxx03/__algorithm/swap_ranges.h libcxx/include/__cxx03/__algorithm/transform.h libcxx/include/__cxx03/__algorithm/unique.h libcxx/include/__cxx03/__algorithm/unique_copy.h libcxx/include/__cxx03/__algorithm/unwrap_iter.h libcxx/include/__cxx03/__algorithm/unwrap_range.h libcxx/include/__cxx03/__algorithm/upper_bound.h libcxx/include/__cxx03/__atomic/atomic.h libcxx/include/__cxx03/__atomic/atomic_base.h libcxx/include/__cxx03/__atomic/atomic_flag.h libcxx/include/__cxx03/__atomic/cxx_atomic_impl.h libcxx/include/__cxx03/__atomic/to_gcc_order.h libcxx/include/__cxx03/__bit/blsr.h libcxx/include/__cxx03/__bit/countl.h libcxx/include/__cxx03/__bit/countr.h libcxx/include/__cxx03/__bit/invert_if.h libcxx/include/__cxx03/__bit/popcount.h libcxx/include/__cxx03/__bit/rotate.h libcxx/include/__cxx03/__bit_reference libcxx/include/__cxx03/__chrono/duration.h libcxx/include/__cxx03/__chrono/steady_clock.h libcxx/include/__cxx03/__chrono/system_clock.h libcxx/include/__cxx03/__chrono/time_point.h libcxx/include/__cxx03/__condition_variable/condition_variable.h libcxx/include/__cxx03/__config libcxx/include/__cxx03/__debug_utils/randomize_range.h libcxx/include/__cxx03/__debug_utils/sanitizers.h libcxx/include/__cxx03/__debug_utils/strict_weak_ordering_check.h libcxx/include/__cxx03/__functional/binary_function.h libcxx/include/__cxx03/__functional/binary_negate.h libcxx/include/__cxx03/__functional/binder1st.h libcxx/include/__cxx03/__functional/binder2nd.h libcxx/include/__cxx03/__functional/identity.h libcxx/include/__cxx03/__functional/mem_fn.h libcxx/include/__cxx03/__functional/mem_fun_ref.h libcxx/include/__cxx03/__functional/operations.h libcxx/include/__cxx03/__functional/pointer_to_binary_function.h libcxx/include/__cxx03/__functional/pointer_to_unary_function.h libcxx/include/__cxx03/__functional/reference_wrapper.h libcxx/include/__cxx03/__functional/unary_function.h libcxx/include/__cxx03/__functional/unary_negate.h libcxx/include/__cxx03/__functional/weak_result_type.h libcxx/include/__cxx03/__fwd/array.h libcxx/include/__cxx03/__fwd/pair.h libcxx/include/__cxx03/__hash_table libcxx/include/__cxx03/__iterator/access.h libcxx/include/__cxx03/__iterator/advance.h libcxx/include/__cxx03/__iterator/back_insert_iterator.h libcxx/include/__cxx03/__iterator/bounded_iter.h libcxx/include/__cxx03/__iterator/distance.h libcxx/include/__cxx03/__iterator/front_insert_iterator.h libcxx/include/__cxx03/__iterator/insert_iterator.h libcxx/include/__cxx03/__iterator/istream_iterator.h libcxx/include/__cxx03/__iterator/istreambuf_iterator.h libcxx/include/__cxx03/__iterator/iterator.h libcxx/include/__cxx03/__iterator/move_iterator.h libcxx/include/__cxx03/__iterator/next.h libcxx/include/__cxx03/__iterator/prev.h libcxx/include/__cxx03/__iterator/reverse_iterator.h libcxx/include/__cxx03/__iterator/wrap_iter.h libcxx/include/__cxx03/__locale libcxx/include/__cxx03/__math/traits.h libcxx/include/__cxx03/__memory/addressof.h libcxx/include/__cxx03/__memory/allocate_at_least.h libcxx/include/__cxx03/__memory/allocator.h libcxx/include/__cxx03/__memory/allocator_traits.h libcxx/include/__cxx03/__memory/assume_aligned.h libcxx/include/__cxx03/__memory/auto_ptr.h libcxx/include/__cxx03/__memory/builtin_new_allocator.h libcxx/include/__cxx03/__memory/compressed_pair.h libcxx/include/__cxx03/__memory/construct_at.h libcxx/include/__cxx03/__memory/pointer_traits.h libcxx/include/__cxx03/__memory/raw_storage_iterator.h libcxx/include/__cxx03/__memory/shared_ptr.h libcxx/include/__cxx03/__memory/swap_allocator.h libcxx/include/__cxx03/__memory/temp_value.h libcxx/include/__cxx03/__memory/temporary_buffer.h libcxx/include/__cxx03/__memory/uninitialized_algorithms.h libcxx/include/__cxx03/__memory/unique_ptr.h libcxx/include/__cxx03/__memory/voidify.h libcxx/include/__cxx03/__mutex/mutex.h libcxx/include/__cxx03/__mutex/once_flag.h libcxx/include/__cxx03/__numeric/accumulate.h libcxx/include/__cxx03/__numeric/adjacent_difference.h libcxx/include/__cxx03/__numeric/inner_product.h libcxx/include/__cxx03/__numeric/iota.h libcxx/include/__cxx03/__numeric/partial_sum.h libcxx/include/__cxx03/__random/clamp_to_integral.h libcxx/include/__cxx03/__random/discard_block_engine.h libcxx/include/__cxx03/__random/independent_bits_engine.h libcxx/include/__cxx03/__random/is_seed_sequence.h libcxx/include/__cxx03/__random/linear_congruential_engine.h libcxx/include/__cxx03/__random/mersenne_twister_engine.h libcxx/include/__cxx03/__random/random_device.h libcxx/include/__cxx03/__random/shuffle_order_engine.h libcxx/include/__cxx03/__random/subtract_with_carry_engine.h libcxx/include/__cxx03/__random/uniform_int_distribution.h libcxx/include/__cxx03/__split_buffer libcxx/include/__cxx03/__string/char_traits.h libcxx/include/__cxx03/__string/constexpr_c_functions.h libcxx/include/__cxx03/__system_error/error_category.h libcxx/include/__cxx03/__thread/poll_with_backoff.h libcxx/include/__cxx03/__thread/this_thread.h libcxx/include/__cxx03/__tree libcxx/include/__cxx03/__type_traits/aligned_storage.h libcxx/include/__cxx03/__type_traits/aligned_union.h libcxx/include/__cxx03/__type_traits/integral_constant.h libcxx/include/__cxx03/__type_traits/invoke.h libcxx/include/__cxx03/__type_traits/is_constant_evaluated.h libcxx/include/__cxx03/__type_traits/is_literal_type.h libcxx/include/__cxx03/__type_traits/is_swappable.h libcxx/include/__cxx03/__type_traits/result_of.h libcxx/include/__cxx03/__utility/convert_to_integral.h libcxx/include/__cxx03/__utility/exception_guard.h libcxx/include/__cxx03/__utility/forward.h libcxx/include/__cxx03/__utility/is_pointer_in_range.h libcxx/include/__cxx03/__utility/is_valid_range.h libcxx/include/__cxx03/__utility/move.h libcxx/include/__cxx03/__utility/no_destroy.h libcxx/include/__cxx03/__utility/pair.h libcxx/include/__cxx03/__utility/rel_ops.h libcxx/include/__cxx03/__utility/swap.h libcxx/include/__cxx03/array libcxx/include/__cxx03/bitset libcxx/include/__cxx03/cmath libcxx/include/__cxx03/codecvt libcxx/include/__cxx03/complex libcxx/include/__cxx03/cwchar libcxx/include/__cxx03/deque libcxx/include/__cxx03/forward_list libcxx/include/__cxx03/limits libcxx/include/__cxx03/list libcxx/include/__cxx03/locale libcxx/include/__cxx03/map libcxx/include/__cxx03/new libcxx/include/__cxx03/queue libcxx/include/__cxx03/ratio libcxx/include/__cxx03/regex libcxx/include/__cxx03/set libcxx/include/__cxx03/stack libcxx/include/__cxx03/string libcxx/include/__cxx03/string_view libcxx/include/__cxx03/typeinfo libcxx/include/__cxx03/unordered_map libcxx/include/__cxx03/unordered_set libcxx/include/__cxx03/vector
``````````
</details>
<details>
<summary>
View the diff from clang-format here.
</summary>
``````````diff
diff --git a/libcxx/include/__cxx03/__bit/blsr.h b/libcxx/include/__cxx03/__bit/blsr.h
index 30127086c..b8027d913 100644
--- a/libcxx/include/__cxx03/__bit/blsr.h
+++ b/libcxx/include/__cxx03/__bit/blsr.h
@@ -17,13 +17,9 @@
_LIBCPP_BEGIN_NAMESPACE_STD
-inline _LIBCPP_HIDE_FROM_ABI unsigned __libcpp_blsr(unsigned __x) _NOEXCEPT {
- return __x ^ (__x & -__x);
-}
+inline _LIBCPP_HIDE_FROM_ABI unsigned __libcpp_blsr(unsigned __x) _NOEXCEPT { return __x ^ (__x & -__x); }
-inline _LIBCPP_HIDE_FROM_ABI unsigned long __libcpp_blsr(unsigned long __x) _NOEXCEPT {
- return __x ^ (__x & -__x);
-}
+inline _LIBCPP_HIDE_FROM_ABI unsigned long __libcpp_blsr(unsigned long __x) _NOEXCEPT { return __x ^ (__x & -__x); }
inline _LIBCPP_HIDE_FROM_ABI unsigned long long __libcpp_blsr(unsigned long long __x) _NOEXCEPT {
return __x ^ (__x & -__x);
diff --git a/libcxx/include/__cxx03/__chrono/time_point.h b/libcxx/include/__cxx03/__chrono/time_point.h
index b067e37a1..8ec687d83 100644
--- a/libcxx/include/__cxx03/__chrono/time_point.h
+++ b/libcxx/include/__cxx03/__chrono/time_point.h
@@ -48,8 +48,7 @@ public:
// conversions
template <class _Duration2, __enable_if_t<is_convertible<_Duration2, duration>::value, int> = 0>
- _LIBCPP_HIDE_FROM_ABI time_point(const time_point<clock, _Duration2>& __t)
- : __d_(__t.time_since_epoch()) {}
+ _LIBCPP_HIDE_FROM_ABI time_point(const time_point<clock, _Duration2>& __t) : __d_(__t.time_since_epoch()) {}
// observer
@@ -83,8 +82,7 @@ common_type<chrono::time_point<_Clock, _Duration1>, chrono::time_point<_Clock, _
namespace chrono {
template <class _ToDuration, class _Clock, class _Duration>
-inline _LIBCPP_HIDE_FROM_ABI time_point<_Clock, _ToDuration>
-time_point_cast(const time_point<_Clock, _Duration>& __t) {
+inline _LIBCPP_HIDE_FROM_ABI time_point<_Clock, _ToDuration> time_point_cast(const time_point<_Clock, _Duration>& __t) {
return time_point<_Clock, _ToDuration>(chrono::duration_cast<_ToDuration>(__t.time_since_epoch()));
}
@@ -139,8 +137,7 @@ operator>=(const time_point<_Clock, _Duration1>& __lhs, const time_point<_Clock,
// time_point operator+(time_point x, duration y);
template <class _Clock, class _Duration1, class _Rep2, class _Period2>
-inline _LIBCPP_HIDE_FROM_ABI
-time_point<_Clock, typename common_type<_Duration1, duration<_Rep2, _Period2> >::type>
+inline _LIBCPP_HIDE_FROM_ABI time_point<_Clock, typename common_type<_Duration1, duration<_Rep2, _Period2> >::type>
operator+(const time_point<_Clock, _Duration1>& __lhs, const duration<_Rep2, _Period2>& __rhs) {
typedef time_point<_Clock, typename common_type<_Duration1, duration<_Rep2, _Period2> >::type> _Tr;
return _Tr(__lhs.time_since_epoch() + __rhs);
@@ -149,8 +146,7 @@ operator+(const time_point<_Clock, _Duration1>& __lhs, const duration<_Rep2, _Pe
// time_point operator+(duration x, time_point y);
template <class _Rep1, class _Period1, class _Clock, class _Duration2>
-inline _LIBCPP_HIDE_FROM_ABI
-time_point<_Clock, typename common_type<duration<_Rep1, _Period1>, _Duration2>::type>
+inline _LIBCPP_HIDE_FROM_ABI time_point<_Clock, typename common_type<duration<_Rep1, _Period1>, _Duration2>::type>
operator+(const duration<_Rep1, _Period1>& __lhs, const time_point<_Clock, _Duration2>& __rhs) {
return __rhs + __lhs;
}
@@ -158,8 +154,7 @@ operator+(const duration<_Rep1, _Period1>& __lhs, const time_point<_Clock, _Dura
// time_point operator-(time_point x, duration y);
template <class _Clock, class _Duration1, class _Rep2, class _Period2>
-inline _LIBCPP_HIDE_FROM_ABI
-time_point<_Clock, typename common_type<_Duration1, duration<_Rep2, _Period2> >::type>
+inline _LIBCPP_HIDE_FROM_ABI time_point<_Clock, typename common_type<_Duration1, duration<_Rep2, _Period2> >::type>
operator-(const time_point<_Clock, _Duration1>& __lhs, const duration<_Rep2, _Period2>& __rhs) {
typedef time_point<_Clock, typename common_type<_Duration1, duration<_Rep2, _Period2> >::type> _Ret;
return _Ret(__lhs.time_since_epoch() - __rhs);
diff --git a/libcxx/include/__cxx03/__config b/libcxx/include/__cxx03/__config
index 58e9769d7..a9d7a6073 100644
--- a/libcxx/include/__cxx03/__config
+++ b/libcxx/include/__cxx03/__config
@@ -296,11 +296,11 @@ _LIBCPP_HARDENING_MODE_DEBUG
# define _LIBCPP_ALIGNOF(_Tp) _Alignof(_Tp)
# define _ALIGNAS_TYPE(x) __attribute__((__aligned__(_LIBCPP_ALIGNOF(x))))
# define _ALIGNAS(x) __attribute__((__aligned__(x)))
-# define _LIBCPP_NORETURN __attribute__((__noreturn__))
-# define nullptr __nullptr
-# define _NOEXCEPT throw()
-# define static_assert(...) _Static_assert(__VA_ARGS__)
-# define decltype(...) __decltype(__VA_ARGS__)
+# define _LIBCPP_NORETURN __attribute__((__noreturn__))
+# define nullptr __nullptr
+# define _NOEXCEPT throw()
+# define static_assert(...) _Static_assert(__VA_ARGS__)
+# define decltype(...) __decltype(__VA_ARGS__)
typedef __char16_t char16_t;
typedef __char32_t char32_t;
diff --git a/libcxx/include/__cxx03/array b/libcxx/include/__cxx03/array
index d98204704..cacab3e86 100644
--- a/libcxx/include/__cxx03/array
+++ b/libcxx/include/__cxx03/array
@@ -182,42 +182,24 @@ struct _LIBCPP_TEMPLATE_VIS array {
_Tp __elems_[_Size];
// No explicit construct/copy/destroy for aggregate type
- _LIBCPP_HIDE_FROM_ABI void fill(const value_type& __u) {
- std::fill_n(data(), _Size, __u);
- }
+ _LIBCPP_HIDE_FROM_ABI void fill(const value_type& __u) { std::fill_n(data(), _Size, __u); }
- _LIBCPP_HIDE_FROM_ABI void swap(array& __a) {
- std::swap_ranges(data(), data() + _Size, __a.data());
- }
+ _LIBCPP_HIDE_FROM_ABI void swap(array& __a) { std::swap_ranges(data(), data() + _Size, __a.data()); }
// iterators:
_LIBCPP_HIDE_FROM_ABI iterator begin() _NOEXCEPT { return iterator(data()); }
- _LIBCPP_HIDE_FROM_ABI const_iterator begin() const _NOEXCEPT {
- return const_iterator(data());
- }
+ _LIBCPP_HIDE_FROM_ABI const_iterator begin() const _NOEXCEPT { return const_iterator(data()); }
_LIBCPP_HIDE_FROM_ABI iterator end() _NOEXCEPT { return iterator(data() + _Size); }
- _LIBCPP_HIDE_FROM_ABI const_iterator end() const _NOEXCEPT {
- return const_iterator(data() + _Size);
- }
+ _LIBCPP_HIDE_FROM_ABI const_iterator end() const _NOEXCEPT { return const_iterator(data() + _Size); }
- _LIBCPP_HIDE_FROM_ABI reverse_iterator rbegin() _NOEXCEPT {
- return reverse_iterator(end());
- }
- _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rbegin() const _NOEXCEPT {
- return const_reverse_iterator(end());
- }
- _LIBCPP_HIDE_FROM_ABI reverse_iterator rend() _NOEXCEPT {
- return reverse_iterator(begin());
- }
- _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rend() const _NOEXCEPT {
- return const_reverse_iterator(begin());
- }
+ _LIBCPP_HIDE_FROM_ABI reverse_iterator rbegin() _NOEXCEPT { return reverse_iterator(end()); }
+ _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rbegin() const _NOEXCEPT { return const_reverse_iterator(end()); }
+ _LIBCPP_HIDE_FROM_ABI reverse_iterator rend() _NOEXCEPT { return reverse_iterator(begin()); }
+ _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rend() const _NOEXCEPT { return const_reverse_iterator(begin()); }
_LIBCPP_HIDE_FROM_ABI const_iterator cbegin() const _NOEXCEPT { return begin(); }
_LIBCPP_HIDE_FROM_ABI const_iterator cend() const _NOEXCEPT { return end(); }
- _LIBCPP_HIDE_FROM_ABI const_reverse_iterator crbegin() const _NOEXCEPT {
- return rbegin();
- }
+ _LIBCPP_HIDE_FROM_ABI const_reverse_iterator crbegin() const _NOEXCEPT { return rbegin(); }
_LIBCPP_HIDE_FROM_ABI const_reverse_iterator crend() const _NOEXCEPT { return rend(); }
// capacity:
@@ -250,9 +232,7 @@ struct _LIBCPP_TEMPLATE_VIS array {
_LIBCPP_HIDE_FROM_ABI reference front() _NOEXCEPT { return (*this)[0]; }
_LIBCPP_HIDE_FROM_ABI const_reference front() const _NOEXCEPT { return (*this)[0]; }
_LIBCPP_HIDE_FROM_ABI reference back() _NOEXCEPT { return (*this)[_Size - 1]; }
- _LIBCPP_HIDE_FROM_ABI const_reference back() const _NOEXCEPT {
- return (*this)[_Size - 1];
- }
+ _LIBCPP_HIDE_FROM_ABI const_reference back() const _NOEXCEPT { return (*this)[_Size - 1]; }
_LIBCPP_HIDE_FROM_ABI value_type* data() _NOEXCEPT { return __elems_; }
_LIBCPP_HIDE_FROM_ABI const value_type* data() const _NOEXCEPT { return __elems_; }
@@ -295,32 +275,18 @@ struct _LIBCPP_TEMPLATE_VIS array<_Tp, 0> {
// iterators:
_LIBCPP_HIDE_FROM_ABI iterator begin() _NOEXCEPT { return iterator(data()); }
- _LIBCPP_HIDE_FROM_ABI const_iterator begin() const _NOEXCEPT {
- return const_iterator(data());
- }
+ _LIBCPP_HIDE_FROM_ABI const_iterator begin() const _NOEXCEPT { return const_iterator(data()); }
_LIBCPP_HIDE_FROM_ABI iterator end() _NOEXCEPT { return iterator(data()); }
- _LIBCPP_HIDE_FROM_ABI const_iterator end() const _NOEXCEPT {
- return const_iterator(data());
- }
+ _LIBCPP_HIDE_FROM_ABI const_iterator end() const _NOEXCEPT { return const_iterator(data()); }
- _LIBCPP_HIDE_FROM_ABI reverse_iterator rbegin() _NOEXCEPT {
- return reverse_iterator(end());
- }
- _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rbegin() const _NOEXCEPT {
- return const_reverse_iterator(end());
- }
- _LIBCPP_HIDE_FROM_ABI reverse_iterator rend() _NOEXCEPT {
- return reverse_iterator(begin());
- }
- _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rend() const _NOEXCEPT {
- return const_reverse_iterator(begin());
- }
+ _LIBCPP_HIDE_FROM_ABI reverse_iterator rbegin() _NOEXCEPT { return reverse_iterator(end()); }
+ _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rbegin() const _NOEXCEPT { return const_reverse_iterator(end()); }
+ _LIBCPP_HIDE_FROM_ABI reverse_iterator rend() _NOEXCEPT { return reverse_iterator(begin()); }
+ _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rend() const _NOEXCEPT { return const_reverse_iterator(begin()); }
_LIBCPP_HIDE_FROM_ABI const_iterator cbegin() const _NOEXCEPT { return begin(); }
_LIBCPP_HIDE_FROM_ABI const_iterator cend() const _NOEXCEPT { return end(); }
- _LIBCPP_HIDE_FROM_ABI const_reverse_iterator crbegin() const _NOEXCEPT {
- return rbegin();
- }
+ _LIBCPP_HIDE_FROM_ABI const_reverse_iterator crbegin() const _NOEXCEPT { return rbegin(); }
_LIBCPP_HIDE_FROM_ABI const_reverse_iterator crend() const _NOEXCEPT { return rend(); }
// capacity:
@@ -371,8 +337,7 @@ struct _LIBCPP_TEMPLATE_VIS array<_Tp, 0> {
};
template <class _Tp, size_t _Size>
-inline _LIBCPP_HIDE_FROM_ABI bool
-operator==(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) {
+inline _LIBCPP_HIDE_FROM_ABI bool operator==(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) {
return std::equal(__x.begin(), __x.end(), __y.begin());
}
diff --git a/libcxx/include/__cxx03/cwchar b/libcxx/include/__cxx03/cwchar
index 2f0b82b05..43ff5fcb9 100644
--- a/libcxx/include/__cxx03/cwchar
+++ b/libcxx/include/__cxx03/cwchar
@@ -226,7 +226,7 @@ inline _LIBCPP_HIDE_FROM_ABI int __constexpr_wmemcmp(const wchar_t* __lhs, const
template <class _Tp, class _Up>
_LIBCPP_HIDE_FROM_ABI _Tp* __constexpr_wmemchr(_Tp* __str, _Up __value, size_t __count) {
- static_assert(sizeof(_Tp) == sizeof(wchar_t) && _LIBCPP_ALIGNOF(_Tp) >= _LIBCPP_ALIGNOF(wchar_t) &&
+ static_assert(sizeof(_Tp) == sizeof(wchar_t)&& _LIBCPP_ALIGNOF(_Tp) >= _LIBCPP_ALIGNOF(wchar_t) &&
__libcpp_is_trivially_equality_comparable<_Tp, _Tp>::value,
"Calling wmemchr on non-trivially equality comparable types is unsafe.");
diff --git a/libcxx/include/__cxx03/deque b/libcxx/include/__cxx03/deque
index 5fe30a407..319fc1a39 100644
--- a/libcxx/include/__cxx03/deque
+++ b/libcxx/include/__cxx03/deque
@@ -698,9 +698,7 @@ public:
__move_assign_alloc(__c, integral_constant<bool, __alloc_traits::propagate_on_container_move_assignment::value>());
}
- _LIBCPP_HIDE_FROM_ABI void __move_assign_alloc(deque& __c, true_type) {
- __alloc() = std::move(__c.__alloc());
- }
+ _LIBCPP_HIDE_FROM_ABI void __move_assign_alloc(deque& __c, true_type) { __alloc() = std::move(__c.__alloc()); }
_LIBCPP_HIDE_FROM_ABI void __move_assign_alloc(deque&, false_type) _NOEXCEPT {}
diff --git a/libcxx/include/__cxx03/regex b/libcxx/include/__cxx03/regex
index df627f955..b96d59d3a 100644
--- a/libcxx/include/__cxx03/regex
+++ b/libcxx/include/__cxx03/regex
@@ -859,18 +859,15 @@ inline _LIBCPP_HIDE_FROM_ABI syntax_option_type operator~(syntax_option_type __x
return syntax_option_type(~int(__x) & 0x1FF);
}
-inline _LIBCPP_HIDE_FROM_ABI syntax_option_type
-operator&(syntax_option_type __x, syntax_option_type __y) {
+inline _LIBCPP_HIDE_FROM_ABI syntax_option_type operator&(syntax_option_type __x, syntax_option_type __y) {
return syntax_option_type(int(__x) & int(__y));
}
-inline _LIBCPP_HIDE_FROM_ABI syntax_option_type
-operator|(syntax_option_type __x, syntax_option_type __y) {
+inline _LIBCPP_HIDE_FROM_ABI syntax_option_type operator|(syntax_option_type __x, syntax_option_type __y) {
return syntax_option_type(int(__x) | int(__y));
}
-inline _LIBCPP_HIDE_FROM_ABI syntax_option_type
-operator^(syntax_option_type __x, syntax_option_type __y) {
+inline _LIBCPP_HIDE_FROM_ABI syntax_option_type operator^(syntax_option_type __x, syntax_option_type __y) {
return syntax_option_type(int(__x) ^ int(__y));
}
diff --git a/libcxx/include/__cxx03/unordered_set b/libcxx/include/__cxx03/unordered_set
index 0e0b5ca50..18a5b7090 100644
--- a/libcxx/include/__cxx03/unordered_set
+++ b/libcxx/include/__cxx03/unordered_set
@@ -664,9 +664,7 @@ public:
}
_LIBCPP_HIDE_FROM_ABI void clear() _NOEXCEPT { __table_.clear(); }
- _LIBCPP_HIDE_FROM_ABI void swap(unordered_set& __u) {
- __table_.swap(__u.__table_);
- }
+ _LIBCPP_HIDE_FROM_ABI void swap(unordered_set& __u) { __table_.swap(__u.__table_); }
_LIBCPP_HIDE_FROM_ABI hasher hash_function() const { return __table_.hash_function(); }
_LIBCPP_HIDE_FROM_ABI key_equal key_eq() const { return __table_.key_eq(); }
diff --git a/libcxx/include/__cxx03/vector b/libcxx/include/__cxx03/vector
index b5898a934..443c1f168 100644
--- a/libcxx/include/__cxx03/vector
+++ b/libcxx/include/__cxx03/vector
@@ -430,8 +430,7 @@ public:
}
template <__enable_if_t<__is_allocator<_Allocator>::value, int> = 0>
- _LIBCPP_HIDE_FROM_ABI
- vector(size_type __n, const value_type& __x, const allocator_type& __a)
+ _LIBCPP_HIDE_FROM_ABI vector(size_type __n, const value_type& __x, const allocator_type& __a)
: __end_cap_(nullptr, __a) {
if (__n > 0) {
__vallocate(__n);
@@ -448,8 +447,7 @@ public:
__enable_if_t<__has_exactly_input_iterator_category<_InputIterator>::value &&
is_constructible<value_type, typename iterator_traits<_InputIterator>::reference>::value,
int> = 0>
- _LIBCPP_HIDE_FROM_ABI
- vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a);
+ _LIBCPP_HIDE_FROM_ABI vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a);
template <
class _ForwardIterator,
@@ -463,8 +461,7 @@ public:
__enable_if_t<__has_forward_iterator_category<_ForwardIterator>::value &&
is_constructible<value_type, typename iterator_traits<_ForwardIterator>::reference>::value,
int> = 0>
- _LIBCPP_HIDE_FROM_ABI
- vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a);
+ _LIBCPP_HIDE_FROM_ABI vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a);
private:
class __destroy_vector {
@@ -487,14 +484,12 @@ public:
_LIBCPP_HIDE_FROM_ABI ~vector() { __destroy_vector (*this)(); }
_LIBCPP_HIDE_FROM_ABI vector(const vector& __x);
- _LIBCPP_HIDE_FROM_ABI
- vector(const vector& __x, const __type_identity_t<allocator_type>& __a);
+ _LIBCPP_HIDE_FROM_ABI vector(const vector& __x, const __type_identity_t<allocator_type>& __a);
_LIBCPP_HIDE_FROM_ABI vector& operator=(const vector& __x);
_LIBCPP_HIDE_FROM_ABI vector(vector&& __x);
- _LIBCPP_HIDE_FROM_ABI
- vector(vector&& __x, const __type_identity_t<allocator_type>& __a);
+ _LIBCPP_HIDE_FROM_ABI vector(vector&& __x, const __type_identity_t<allocator_type>& __a);
_LIBCPP_HIDE_FROM_ABI vector& operator=(vector&& __x);
template <class _InputIterator,
@@ -511,33 +506,21 @@ public:
_LIBCPP_HIDE_FROM_ABI void assign(size_type __n, const_reference __u);
- _LIBCPP_HIDE_FROM_ABI allocator_type get_allocator() const _NOEXCEPT {
- return this->__alloc();
- }
+ _LIBCPP_HIDE_FROM_ABI allocator_type get_allocator() const _NOEXCEPT { return this->__alloc(); }
_LIBCPP_HIDE_FROM_ABI iterator begin() _NOEXCEPT;
_LIBCPP_HIDE_FROM_ABI const_iterator begin() const _NOEXCEPT;
_LIBCPP_HIDE_FROM_ABI iterator end() _NOEXCEPT;
_LIBCPP_HIDE_FROM_ABI const_iterator end() const _NOEXCEPT;
- _LIBCPP_HIDE_FROM_ABI reverse_iterator rbegin() _NOEXCEPT {
- return reverse_iterator(end());
- }
- _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rbegin() const _NOEXCEPT {
- return const_reverse_iterator(end());
- }
- _LIBCPP_HIDE_FROM_ABI reverse_iterator rend() _NOEXCEPT {
- return reverse_iterator(begin());
- }
- _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rend() const _NOEXCEPT {
- return const_reverse_iterator(begin());
- }
+ _LIBCPP_HIDE_FROM_ABI reverse_iterator rbegin() _NOEXCEPT { return reverse_iterator(end()); }
+ _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rbegin() const _NOEXCEPT { return const_reverse_iterator(end()); }
+ _LIBCPP_HIDE_FROM_ABI reverse_iterator rend() _NOEXCEPT { return reverse_iterator(begin()); }
+ _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rend() const _NOEXCEPT { return const_reverse_iterator(begin()); }
_LIBCPP_HIDE_FROM_ABI const_iterator cbegin() const _NOEXCEPT { return begin(); }
_LIBCPP_HIDE_FROM_ABI const_iterator cend() const _NOEXCEPT { return end(); }
- _LIBCPP_HIDE_FROM_ABI const_reverse_iterator crbegin() const _NOEXCEPT {
- return rbegin();
- }
+ _LIBCPP_HIDE_FROM_ABI const_reverse_iterator crbegin() const _NOEXCEPT { return rbegin(); }
_LIBCPP_HIDE_FROM_ABI const_reverse_iterator crend() const _NOEXCEPT { return rend(); }
_LIBCPP_HIDE_FROM_ABI size_type size() const _NOEXCEPT {
@@ -546,9 +529,7 @@ public:
_LIBCPP_HIDE_FROM_ABI size_type capacity() const _NOEXCEPT {
return static_cast<size_type>(__end_cap() - this->__begin_);
}
- _LIBCPP_NODISCARD _LIBCPP_HIDE_FROM_ABI bool empty() const _NOEXCEPT {
- return this->__begin_ == this->__end_;
- }
+ _LIBCPP_NODISCARD _LIBCPP_HIDE_FROM_ABI bool empty() const _NOEXCEPT { return this->__begin_ == this->__end_; }
_LIBCPP_HIDE_FROM_ABI size_type max_size() const _NOEXCEPT;
_LIBCPP_HIDE_FROM_ABI void reserve(size_type __n);
_LIBCPP_HIDE_FROM_ABI void shrink_to_fit() _NOEXCEPT;
@@ -575,22 +556,16 @@ public:
return *(this->__end_ - 1);
}
- _LIBCPP_HIDE_FROM_ABI value_type* data() _NOEXCEPT {
- return std::__to_address(this->__begin_);
- }
+ _LIBCPP_HIDE_FROM_ABI value_type* data() _NOEXCEPT { return std::__to_address(this->__begin_); }
- _LIBCPP_HIDE_FROM_ABI const value_type* data() const _NOEXCEPT {
- return std::__to_address(this->__begin_);
- }
+ _LIBCPP_HIDE_FROM_ABI const value_type* data() const _NOEXCEPT { return std::__to_address(this->__begin_); }
_LIBCPP_HIDE_FROM_ABI void push_back(const_reference __x);
_LIBCPP_HIDE_FROM_ABI void push_back(value_type&& __x);
template <class... _Args>
- _LIBCPP_HIDE_FROM_ABI
- void
- emplace_back(_Args&&... __args);
+ _LIBCPP_HIDE_FROM_ABI void emplace_back(_Args&&... __args);
_LIBCPP_HIDE_FROM_ABI void pop_back();
@@ -600,23 +575,20 @@ public:
template <class... _Args>
_LIBCPP_HIDE_FROM_ABI iterator emplace(const_iterator __position, _Args&&... __args);
- _LIBCPP_HIDE_FROM_ABI iterator
- insert(const_iterator __position, size_type __n, const_reference __x);
+ _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __position, size_type __n, const_reference __x);
template <class _InputIterator,
__enable_if_t<__has_exactly_input_iterator_category<_InputIterator>::value &&
is_constructible< value_type, typename iterator_traits<_InputIterator>::reference>::value,
int> = 0>
- _LIBCPP_HIDE_FROM_ABI iterator
- insert(const_iterator __position, _InputIterator __first, _InputIterator __last);
+ _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __position, _InputIterator __first, _InputIterator __last);
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_HIDE_FROM_ABI iterator
- insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last);
+ _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last);
_LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __position);
_LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __first, const_iterator __last);
@@ -663,8 +635,7 @@ private:
_LIBCPP_HIDE_FROM_ABI void __construct_at_end(size_type __n, const_reference __x);
template <class _InputIterator, class _Sentinel>
- _LIBCPP_HIDE_FROM_ABI void
- __init_with_size(_InputIterator __first, _Sentinel __last, size_type __n) {
+ _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) {
@@ -676,8 +647,7 @@ private:
}
template <class _InputIterator, class _Sentinel>
- _LIBCPP_HIDE_FROM_ABI void
- __init_with_sentinel(_InputIterator __first, _Sentinel __last) {
+ _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)
@@ -690,8 +660,7 @@ private:
_LIBCPP_HIDE_FROM_ABI void __assign_with_sentinel(_Iterator __first, _Sentinel __last);
template <class _ForwardIterator, class _Sentinel>
- _LIBCPP_HIDE_FROM_ABI void
- __assign_with_size(_ForwardIterator __first, _Sentinel __last, difference_type __n);
+ _LIBCPP_HIDE_FROM_ABI void __assign_with_size(_ForwardIterator __first, _Sentinel __last, difference_type __n);
template <class _InputIterator, class _Sentinel>
_LIBCPP_HIDE_FROM_ABI iterator
@@ -702,8 +671,7 @@ private:
__insert_with_size(const_iterator __position, _Iterator __first, _Sentinel __last, difference_type __n);
template <class _InputIterator, class _Sentinel>
- _LIBCPP_HIDE_FROM_ABI void
- __construct_at_end(_InputIterator __first, _Sentinel __last, size_type __n);
+ _LIBCPP_HIDE_FROM_ABI void __construct_at_end(_InputIterator __first, _Sentinel __last, size_type __n);
_LIBCPP_HIDE_FROM_ABI void __append(size_type __n);
_LIBCPP_HIDE_FROM_ABI void __append(size_type __n, const_reference __x);
@@ -740,12 +708,10 @@ private:
#endif // _LIBCPP_ABI_BOUNDED_ITERATORS_IN_VECTOR
}
- _LIBCPP_HIDE_FROM_ABI void
- __swap_out_circular_buffer(__split_buffer<value_type, allocator_type&>& __v);
+ _LIBCPP_HIDE_FROM_ABI void __swap_out_circular_buffer(__split_buffer<value_type, allocator_type&>& __v);
_LIBCPP_HIDE_FROM_ABI pointer
__swap_out_circular_buffer(__split_buffer<value_type, allocator_type&>& __v, pointer __p);
- _LIBCPP_HIDE_FROM_ABI void
- __move_range(pointer __from_s, pointer __from_e, pointer __to);
+ _LIBCPP_HIDE_FROM_ABI void __move_range(pointer __from_s, pointer __from_e, pointer __to);
_LIBCPP_HIDE_FROM_ABI void __move_assign(vector& __c, true_type);
_LIBCPP_HIDE_FROM_ABI void __move_assign(vector& __c, false_type);
_LIBCPP_HIDE_FROM_ABI void __destruct_at_end(pointer __new_last) _NOEXCEPT {
@@ -768,8 +734,7 @@ private:
// For more details, see the "Using libc++" documentation page or
// the documentation for __sanitizer_annotate_contiguous_container.
- _LIBCPP_HIDE_FROM_ABI void
- __annotate_contiguous_container(const void* __old_mid, const void* __new_mid) const {
+ _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);
}
@@ -832,22 +797,12 @@ private:
++__tx.__pos_;
}
- _LIBCPP_HIDE_FROM_ABI allocator_type& __alloc() _NOEXCEPT {
- return this->__end_cap_.second();
- }
- _LIBCPP_HIDE_FROM_ABI const allocator_type& __alloc() const _NOEXCEPT {
- return this->__end_cap_.second();
- }
- _LIBCPP_HIDE_FROM_ABI pointer& __end_cap() _NOEXCEPT {
- return this->__end_cap_.first();
- }
- _LIBCPP_HIDE_FROM_ABI const pointer& __end_cap() const _NOEXCEPT {
- return this->__end_cap_.first();
- }
+ _LIBCPP_HIDE_FROM_ABI allocator_type& __alloc() _NOEXCEPT { return this->__end_cap_.second(); }
+ _LIBCPP_HIDE_FROM_ABI const allocator_type& __alloc() const _NOEXCEPT { return this->__end_cap_.second(); }
+ _LIBCPP_HIDE_FROM_ABI pointer& __end_cap() _NOEXCEPT { return this->__end_cap_.first(); }
+ _LIBCPP_HIDE_FROM_ABI const pointer& __end_cap() const _NOEXCEPT { return this->__end_cap_.first(); }
- _LIBCPP_HIDE_FROM_ABI void __clear() _NOEXCEPT {
- __base_destruct_at_end(this->__begin_);
- }
+ _LIBCPP_HIDE_FROM_ABI void __clear() _NOEXCEPT { __base_destruct_at_end(this->__begin_); }
_LIBCPP_HIDE_FROM_ABI void __base_destruct_at_end(pointer __new_last) _NOEXCEPT {
pointer __soon_to_be_end = this->__end_;
@@ -880,9 +835,7 @@ private:
_LIBCPP_HIDE_FROM_ABI void __copy_assign_alloc(const vector&, false_type) {}
- _LIBCPP_HIDE_FROM_ABI void __move_assign_alloc(vector& __c, true_type) {
- __alloc() = std::move(__c.__alloc());
- }
+ _LIBCPP_HIDE_FROM_ABI void __move_assign_alloc(vector& __c, true_type) { __alloc() = std::move(__c.__alloc()); }
_LIBCPP_HIDE_FROM_ABI void __move_assign_alloc(vector&, false_type) _NOEXCEPT {}
};
@@ -891,8 +844,7 @@ private:
// *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 <class _Tp, class _Allocator>
-void
-vector<_Tp, _Allocator>::__swap_out_circular_buffer(__split_buffer<value_type, allocator_type&>& __v) {
+void vector<_Tp, _Allocator>::__swap_out_circular_buffer(__split_buffer<value_type, allocator_type&>& __v) {
__annotate_delete();
auto __new_begin = __v.__begin_ - (__end_ - __begin_);
std::__uninitialized_allocator_relocate(
@@ -948,8 +900,7 @@ void vector<_Tp, _Allocator>::__vdeallocate() _NOEXCEPT {
}
template <class _Tp, class _Allocator>
-typename vector<_Tp, _Allocator>::size_type
-vector<_Tp, _Allocator>::max_size() const _NOEXCEPT {
+typename vector<_Tp, _Allocator>::size_type vector<_Tp, _Allocator>::max_size() const _NOEXCEPT {
return std::min<size_type>(__alloc_traits::max_size(this->__alloc()), numeric_limits<difference_type>::max());
}
@@ -987,8 +938,7 @@ void vector<_Tp, _Allocator>::__construct_at_end(size_type __n) {
// Postcondition: size() == old size() + __n
// Postcondition: [i] == __x for all i in [size() - __n, __n)
template <class _Tp, class _Allocator>
-inline void
-vector<_Tp, _Allocator>::__construct_at_end(size_type __n, const_reference __x) {
+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) {
@@ -998,8 +948,7 @@ vector<_Tp, _Allocator>::__construct_at_end(size_type __n, const_reference __x)
template <class _Tp, class _Allocator>
template <class _InputIterator, class _Sentinel>
-void
-vector<_Tp, _Allocator>::__construct_at_end(_InputIterator __first, _Sentinel __last, size_type __n) {
+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_);
}
@@ -1098,8 +1047,7 @@ inline _LIBCPP_HIDE_FROM_ABI vector<_Tp, _Allocator>::vector(vector&& __x)
}
template <class _Tp, class _Allocator>
-inline _LIBCPP_HIDE_FROM_ABI
-vector<_Tp, _Allocator>::vector(vector&& __x, const __type_identity_t<allocator_type>& __a)
+inline _LIBCPP_HIDE_FROM_ABI vector<_Tp, _Allocator>::vector(vector&& __x, const __type_identity_t<allocator_type>& __a)
: __end_cap_(nullptr, __a) {
if (__a == __x.__alloc()) {
this->__begin_ = __x.__begin_;
@@ -1115,8 +1063,7 @@ vector<_Tp, _Allocator>::vector(vector&& __x, const __type_identity_t<allocator_
}
template <class _Tp, class _Allocator>
-inline _LIBCPP_HIDE_FROM_ABI vector<_Tp, _Allocator>&
-vector<_Tp, _Allocator>::operator=(vector&& __x) {
+inline _LIBCPP_HIDE_FROM_ABI vector<_Tp, _Allocator>& vector<_Tp, _Allocator>::operator=(vector&& __x) {
__move_assign(__x, integral_constant<bool, __alloc_traits::propagate_on_container_move_assignment::value>());
return *this;
}
@@ -1141,8 +1088,7 @@ void vector<_Tp, _Allocator>::__move_assign(vector& __c, true_type) {
}
template <class _Tp, class _Allocator>
-inline _LIBCPP_HIDE_FROM_ABI vector<_Tp, _Allocator>&
-vector<_Tp, _Allocator>::operator=(const vector& __x) {
+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_);
@@ -1161,8 +1107,7 @@ void vector<_Tp, _Allocator>::assign(_InputIterator __first, _InputIterator __la
template <class _Tp, class _Allocator>
template <class _Iterator, class _Sentinel>
-_LIBCPP_HIDE_FROM_ABI void
-vector<_Tp, _Allocator>::__assign_with_sentinel(_Iterator __first, _Sentinel __last) {
+_LIBCPP_HIDE_FROM_ABI void vector<_Tp, _Allocator>::__assign_with_sentinel(_Iterator __first, _Sentinel __last) {
clear();
for (; __first != __last; ++__first)
emplace_back(*__first);
@@ -1215,8 +1160,7 @@ void vector<_Tp, _Allocator>::assign(size_type __n, const_reference __u) {
}
template <class _Tp, class _Allocator>
-inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::iterator
-vector<_Tp, _Allocator>::begin() _NOEXCEPT {
+inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::iterator vector<_Tp, _Allocator>::begin() _NOEXCEPT {
return __make_iter(this->__begin_);
}
@@ -1227,8 +1171,7 @@ vector<_Tp, _Allocator>::begin() const _NOEXCEPT {
}
template <class _Tp, class _Allocator>
-inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::iterator
-vector<_Tp, _Allocator>::end() _NOEXCEPT {
+inline _LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::iterator vector<_Tp, _Allocator>::end() _NOEXCEPT {
return __make_iter(this->__end_);
}
@@ -1260,8 +1203,7 @@ typename vector<_Tp, _Allocator>::reference vector<_Tp, _Allocator>::at(size_typ
}
template <class _Tp, class _Allocator>
-typename vector<_Tp, _Allocator>::const_reference
-vector<_Tp, _Allocator>::at(size_type __n) const {
+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];
@@ -1300,8 +1242,7 @@ void vector<_Tp, _Allocator>::shrink_to_fit() _NOEXCEPT {
template <class _Tp, class _Allocator>
template <class _Up>
-typename vector<_Tp, _Allocator>::pointer
-vector<_Tp, _Allocator>::__push_back_slow_path(_Up&& __x) {
+typename vector<_Tp, _Allocator>::pointer vector<_Tp, _Allocator>::__push_back_slow_path(_Up&& __x) {
allocator_type& __a = this->__alloc();
__split_buffer<value_type, allocator_type&> __v(__recommend(size() + 1), size(), __a);
// __v.push_back(std::forward<_Up>(__x));
@@ -1312,8 +1253,7 @@ vector<_Tp, _Allocator>::__push_back_slow_path(_Up&& __x) {
}
template <class _Tp, class _Allocator>
-inline _LIBCPP_HIDE_FROM_ABI void
-vector<_Tp, _Allocator>::push_back(const_reference __x) {
+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);
@@ -1338,8 +1278,7 @@ inline _LIBCPP_HIDE_FROM_ABI void vector<_Tp, _Allocator>::push_back(value_type&
template <class _Tp, class _Allocator>
template <class... _Args>
-typename vector<_Tp, _Allocator>::pointer
-vector<_Tp, _Allocator>::__emplace_back_slow_path(_Args&&... __args) {
+typename vector<_Tp, _Allocator>::pointer vector<_Tp, _Allocator>::__emplace_back_slow_path(_Args&&... __args) {
allocator_type& __a = this->__alloc();
__split_buffer<value_type, allocator_type&> __v(__recommend(size() + 1), size(), __a);
// __v.emplace_back(std::forward<_Args>(__args)...);
@@ -1351,9 +1290,7 @@ vector<_Tp, _Allocator>::__emplace_back_slow_path(_Args&&... __args) {
template <class _Tp, class _Allocator>
template <class... _Args>
-inline
- void
- vector<_Tp, _Allocator>::emplace_back(_Args&&... __args) {
+inline void vector<_Tp, _Allocator>::emplace_back(_Args&&... __args) {
pointer __end = this->__end_;
if (__end < this->__end_cap()) {
__construct_one_at_end(std::forward<_Args>(__args)...);
@@ -1393,8 +1330,7 @@ vector<_Tp, _Allocator>::erase(const_iterator __first, const_iterator __last) {
}
template <class _Tp, class _Allocator>
-void
-vector<_Tp, _Allocator>::__move_range(pointer __from_s, pointer __from_e, pointer __to) {
+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;
{
@@ -1558,8 +1494,7 @@ vector<_Tp, _Allocator>::insert(const_iterator __position, _ForwardIterator __fi
template <class _Tp, class _Allocator>
template <class _Iterator, class _Sentinel>
-_LIBCPP_HIDE_FROM_ABI typename vector<_Tp, _Allocator>::iterator
-vector<_Tp, _Allocator>::__insert_with_size(
+_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());
@@ -1687,24 +1622,16 @@ public:
private:
_LIBCPP_HIDE_FROM_ABI size_type& __cap() _NOEXCEPT { return __cap_alloc_.first(); }
- _LIBCPP_HIDE_FROM_ABI const size_type& __cap() const _NOEXCEPT {
- return __cap_alloc_.first();
- }
- _LIBCPP_HIDE_FROM_ABI __storage_allocator& __alloc() _NOEXCEPT {
- return __cap_alloc_.second();
- }
- _LIBCPP_HIDE_FROM_ABI const __storage_allocator& __alloc() const _NOEXCEPT {
- return __cap_alloc_.second();
- }
+ _LIBCPP_HIDE_FROM_ABI const size_type& __cap() const _NOEXCEPT { return __cap_alloc_.first(); }
+ _LIBCPP_HIDE_FROM_ABI __storage_allocator& __alloc() _NOEXCEPT { return __cap_alloc_.second(); }
+ _LIBCPP_HIDE_FROM_ABI const __storage_allocator& __alloc() const _NOEXCEPT { return __cap_alloc_.second(); }
static const unsigned __bits_per_word = static_cast<unsigned>(sizeof(__storage_type) * CHAR_BIT);
- _LIBCPP_HIDE_FROM_ABI static size_type
- __internal_cap_to_external(size_type __n) _NOEXCEPT {
+ _LIBCPP_HIDE_FROM_ABI static size_type __internal_cap_to_external(size_type __n) _NOEXCEPT {
return __n * __bits_per_word;
}
- _LIBCPP_HIDE_FROM_ABI static size_type
- __external_cap_to_internal(size_type __n) _NOEXCEPT {
+ _LIBCPP_HIDE_FROM_ABI static size_type __external_cap_to_internal(size_type __n) _NOEXCEPT {
return (__n - 1) / __bits_per_word + 1;
}
@@ -1732,22 +1659,22 @@ public:
_LIBCPP_HIDE_FROM_ABI explicit vector(size_type __n);
_LIBCPP_HIDE_FROM_ABI vector(size_type __n, const value_type& __v);
- _LIBCPP_HIDE_FROM_ABI vector(size_type __n, const value_type& __v, const allocator_type& __a);
+ _LIBCPP_HIDE_FROM_ABI vector(size_type __n, const value_type& __v, const allocator_type& __a);
template <class _InputIterator, __enable_if_t<__has_exactly_input_iterator_category<_InputIterator>::value, int> = 0>
_LIBCPP_HIDE_FROM_ABI vector(_InputIterator __first, _InputIterator __last);
template <class _InputIterator, __enable_if_t<__has_exactly_input_iterator_category<_InputIterator>::value, int> = 0>
- _LIBCPP_HIDE_FROM_ABI vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a);
+ _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, int> = 0>
_LIBCPP_HIDE_FROM_ABI vector(_ForwardIterator __first, _ForwardIterator __last);
template <class _ForwardIterator, __enable_if_t<__has_forward_iterator_category<_ForwardIterator>::value, int> = 0>
- _LIBCPP_HIDE_FROM_ABI vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a);
+ _LIBCPP_HIDE_FROM_ABI vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a);
_LIBCPP_HIDE_FROM_ABI vector(const vector& __v);
_LIBCPP_HIDE_FROM_ABI vector(const vector& __v, const allocator_type& __a);
_LIBCPP_HIDE_FROM_ABI vector& operator=(const vector& __v);
_LIBCPP_HIDE_FROM_ABI vector(vector&& __v);
- _LIBCPP_HIDE_FROM_ABI vector(vector&& __v, const __type_identity_t<allocator_type>& __a);
+ _LIBCPP_HIDE_FROM_ABI vector(vector&& __v, const __type_identity_t<allocator_type>& __a);
_LIBCPP_HIDE_FROM_ABI vector& operator=(vector&& __v);
template <class _InputIterator, __enable_if_t<__has_exactly_input_iterator_category<_InputIterator>::value, int> = 0>
@@ -1757,54 +1684,32 @@ public:
_LIBCPP_HIDE_FROM_ABI void assign(size_type __n, const value_type& __x);
- _LIBCPP_HIDE_FROM_ABI allocator_type get_allocator() const _NOEXCEPT {
- return allocator_type(this->__alloc());
- }
+ _LIBCPP_HIDE_FROM_ABI allocator_type get_allocator() const _NOEXCEPT { return allocator_type(this->__alloc()); }
_LIBCPP_HIDE_FROM_ABI size_type max_size() const _NOEXCEPT;
- _LIBCPP_HIDE_FROM_ABI size_type capacity() const _NOEXCEPT {
- return __internal_cap_to_external(__cap());
- }
+ _LIBCPP_HIDE_FROM_ABI size_type capacity() const _NOEXCEPT { return __internal_cap_to_external(__cap()); }
_LIBCPP_HIDE_FROM_ABI size_type size() const _NOEXCEPT { return __size_; }
- _LIBCPP_NODISCARD _LIBCPP_HIDE_FROM_ABI bool empty() const _NOEXCEPT {
- return __size_ == 0;
- }
+ _LIBCPP_NODISCARD _LIBCPP_HIDE_FROM_ABI bool empty() const _NOEXCEPT { return __size_ == 0; }
_LIBCPP_HIDE_FROM_ABI void reserve(size_type __n);
_LIBCPP_HIDE_FROM_ABI void shrink_to_fit() _NOEXCEPT;
_LIBCPP_HIDE_FROM_ABI iterator begin() _NOEXCEPT { return __make_iter(0); }
_LIBCPP_HIDE_FROM_ABI const_iterator begin() const _NOEXCEPT { return __make_iter(0); }
_LIBCPP_HIDE_FROM_ABI iterator end() _NOEXCEPT { return __make_iter(__size_); }
- _LIBCPP_HIDE_FROM_ABI const_iterator end() const _NOEXCEPT {
- return __make_iter(__size_);
- }
+ _LIBCPP_HIDE_FROM_ABI const_iterator end() const _NOEXCEPT { return __make_iter(__size_); }
- _LIBCPP_HIDE_FROM_ABI reverse_iterator rbegin() _NOEXCEPT {
- return reverse_iterator(end());
- }
- _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rbegin() const _NOEXCEPT {
- return const_reverse_iterator(end());
- }
- _LIBCPP_HIDE_FROM_ABI reverse_iterator rend() _NOEXCEPT {
- return reverse_iterator(begin());
- }
- _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rend() const _NOEXCEPT {
- return const_reverse_iterator(begin());
- }
+ _LIBCPP_HIDE_FROM_ABI reverse_iterator rbegin() _NOEXCEPT { return reverse_iterator(end()); }
+ _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rbegin() const _NOEXCEPT { return const_reverse_iterator(end()); }
+ _LIBCPP_HIDE_FROM_ABI reverse_iterator rend() _NOEXCEPT { return reverse_iterator(begin()); }
+ _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rend() const _NOEXCEPT { return const_reverse_iterator(begin()); }
_LIBCPP_HIDE_FROM_ABI const_iterator cbegin() const _NOEXCEPT { return __make_iter(0); }
- _LIBCPP_HIDE_FROM_ABI const_iterator cend() const _NOEXCEPT {
- return __make_iter(__size_);
- }
- _LIBCPP_HIDE_FROM_ABI const_reverse_iterator crbegin() const _NOEXCEPT {
- return rbegin();
- }
+ _LIBCPP_HIDE_FROM_ABI const_iterator cend() const _NOEXCEPT { return __make_iter(__size_); }
+ _LIBCPP_HIDE_FROM_ABI const_reverse_iterator crbegin() const _NOEXCEPT { return rbegin(); }
_LIBCPP_HIDE_FROM_ABI const_reverse_iterator crend() const _NOEXCEPT { return rend(); }
_LIBCPP_HIDE_FROM_ABI reference operator[](size_type __n) { return __make_ref(__n); }
- _LIBCPP_HIDE_FROM_ABI const_reference operator[](size_type __n) const {
- return __make_ref(__n);
- }
+ _LIBCPP_HIDE_FROM_ABI 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;
@@ -1817,12 +1722,11 @@ public:
_LIBCPP_HIDE_FROM_ABI void pop_back() { --__size_; }
_LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __position, const value_type& __x);
- _LIBCPP_HIDE_FROM_ABI iterator
- insert(const_iterator __position, size_type __n, const value_type& __x);
+ _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __position, size_type __n, const value_type& __x);
template <class _InputIterator, __enable_if_t<__has_exactly_input_iterator_category<_InputIterator>::value, int> = 0>
- iterator _LIBCPP_HIDE_FROM_ABI insert(const_iterator __position, _InputIterator __first, _InputIterator __last);
+ iterator _LIBCPP_HIDE_FROM_ABI insert(const_iterator __position, _InputIterator __first, _InputIterator __last);
template <class _ForwardIterator, __enable_if_t<__has_forward_iterator_category<_ForwardIterator>::value, int> = 0>
- iterator _LIBCPP_HIDE_FROM_ABI insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last);
+ iterator _LIBCPP_HIDE_FROM_ABI insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last);
_LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __position);
_LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __first, const_iterator __last);
@@ -1830,9 +1734,7 @@ public:
_LIBCPP_HIDE_FROM_ABI void clear() _NOEXCEPT { __size_ = 0; }
_LIBCPP_HIDE_FROM_ABI void swap(vector&);
- _LIBCPP_HIDE_FROM_ABI static void swap(reference __x, reference __y) _NOEXCEPT {
- std::swap(__x, __y);
- }
+ _LIBCPP_HIDE_FROM_ABI static void swap(reference __x, reference __y) _NOEXCEPT { std::swap(__x, __y); }
_LIBCPP_HIDE_FROM_ABI void resize(size_type __sz, value_type __x = false);
_LIBCPP_HIDE_FROM_ABI void flip() _NOEXCEPT;
@@ -1845,8 +1747,7 @@ private:
_LIBCPP_NORETURN _LIBCPP_HIDE_FROM_ABI void __throw_out_of_range() const { std::__throw_out_of_range("vector"); }
template <class _InputIterator, class _Sentinel>
- _LIBCPP_HIDE_FROM_ABI void
- __init_with_size(_InputIterator __first, _Sentinel __last, size_type __n) {
+ _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) {
@@ -1858,8 +1759,7 @@ private:
}
template <class _InputIterator, class _Sentinel>
- _LIBCPP_HIDE_FROM_ABI void
- __init_with_sentinel(_InputIterator __first, _Sentinel __last) {
+ _LIBCPP_HIDE_FROM_ABI void __init_with_sentinel(_InputIterator __first, _Sentinel __last) {
#ifndef _LIBCPP_HAS_NO_EXCEPTIONS
try {
#endif // _LIBCPP_HAS_NO_EXCEPTIONS
@@ -1878,8 +1778,7 @@ private:
_LIBCPP_HIDE_FROM_ABI void __assign_with_sentinel(_Iterator __first, _Sentinel __last);
template <class _ForwardIterator, class _Sentinel>
- _LIBCPP_HIDE_FROM_ABI void
- __assign_with_size(_ForwardIterator __first, _Sentinel __last, difference_type __ns);
+ _LIBCPP_HIDE_FROM_ABI void __assign_with_size(_ForwardIterator __first, _Sentinel __last, difference_type __ns);
template <class _InputIterator, class _Sentinel>
_LIBCPP_HIDE_FROM_ABI iterator
@@ -1916,8 +1815,7 @@ private:
_LIBCPP_HIDE_FROM_ABI size_type __recommend(size_type __new_size) const;
_LIBCPP_HIDE_FROM_ABI void __construct_at_end(size_type __n, bool __x);
template <class _InputIterator, class _Sentinel>
- _LIBCPP_HIDE_FROM_ABI void
- __construct_at_end(_InputIterator __first, _Sentinel __last, size_type __n);
+ _LIBCPP_HIDE_FROM_ABI void __construct_at_end(_InputIterator __first, _Sentinel __last, size_type __n);
_LIBCPP_HIDE_FROM_ABI void __append(size_type __n, const_reference __x);
_LIBCPP_HIDE_FROM_ABI reference __make_ref(size_type __pos) _NOEXCEPT {
return reference(__begin_ + __pos / __bits_per_word, __storage_type(1) << __pos % __bits_per_word);
@@ -1954,9 +1852,7 @@ private:
__move_assign_alloc(
__c, integral_constant<bool, __storage_traits::propagate_on_container_move_assignment::value>());
}
- _LIBCPP_HIDE_FROM_ABI void __move_assign_alloc(vector& __c, true_type) {
- __alloc() = std::move(__c.__alloc());
- }
+ _LIBCPP_HIDE_FROM_ABI void __move_assign_alloc(vector& __c, true_type) { __alloc() = std::move(__c.__alloc()); }
_LIBCPP_HIDE_FROM_ABI void __move_assign_alloc(vector&, false_type) _NOEXCEPT {}
@@ -1980,8 +1876,7 @@ void vector<bool, _Allocator>::__vdeallocate() _NOEXCEPT {
}
template <class _Allocator>
-typename vector<bool, _Allocator>::size_type
-vector<bool, _Allocator>::max_size() const _NOEXCEPT {
+typename vector<bool, _Allocator>::size_type vector<bool, _Allocator>::max_size() const _NOEXCEPT {
size_type __amax = __storage_traits::max_size(__alloc());
size_type __nmax = numeric_limits<size_type>::max() / 2; // end() >= begin(), always
if (__nmax / __bits_per_word <= __amax)
@@ -2007,8 +1902,7 @@ vector<bool, _Allocator>::__recommend(size_type __new_size) const {
// Precondition: size() + __n <= capacity()
// Postcondition: size() == size() + __n
template <class _Allocator>
-inline _LIBCPP_HIDE_FROM_ABI void
-vector<bool, _Allocator>::__construct_at_end(size_type __n, bool __x) {
+inline _LIBCPP_HIDE_FROM_ABI void vector<bool, _Allocator>::__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)) {
@@ -2022,8 +1916,7 @@ vector<bool, _Allocator>::__construct_at_end(size_type __n, bool __x) {
template <class _Allocator>
template <class _InputIterator, class _Sentinel>
-void
-vector<bool, _Allocator>::__construct_at_end(_InputIterator __first, _Sentinel __last, size_type __n) {
+void vector<bool, _Allocator>::__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)) {
@@ -2044,8 +1937,7 @@ inline _LIBCPP_HIDE_FROM_ABI vector<bool, _Allocator>::vector(const allocator_ty
: __begin_(nullptr), __size_(0), __cap_alloc_(0, static_cast<__storage_allocator>(__a)) {}
template <class _Allocator>
-vector<bool, _Allocator>::vector(size_type __n)
- : __begin_(nullptr), __size_(0), __cap_alloc_(0, __default_init_tag()) {
+vector<bool, _Allocator>::vector(size_type __n) : __begin_(nullptr), __size_(0), __cap_alloc_(0, __default_init_tag()) {
if (__n > 0) {
__vallocate(__n);
__construct_at_end(__n, false);
@@ -2160,8 +2052,7 @@ vector<bool, _Allocator>::vector(vector&& __v, const __type_identity_t<allocator
}
template <class _Allocator>
-inline _LIBCPP_HIDE_FROM_ABI vector<bool, _Allocator>&
-vector<bool, _Allocator>::operator=(vector&& __v) {
+inline _LIBCPP_HIDE_FROM_ABI vector<bool, _Allocator>& vector<bool, _Allocator>::operator=(vector&& __v) {
__move_assign(__v, integral_constant<bool, __storage_traits::propagate_on_container_move_assignment::value>());
return *this;
}
@@ -2210,8 +2101,7 @@ void vector<bool, _Allocator>::assign(_InputIterator __first, _InputIterator __l
template <class _Allocator>
template <class _Iterator, class _Sentinel>
-_LIBCPP_HIDE_FROM_ABI void
-vector<bool, _Allocator>::__assign_with_sentinel(_Iterator __first, _Sentinel __last) {
+_LIBCPP_HIDE_FROM_ABI void vector<bool, _Allocator>::__assign_with_sentinel(_Iterator __first, _Sentinel __last) {
clear();
for (; __first != __last; ++__first)
push_back(*__first);
@@ -2382,8 +2272,7 @@ vector<bool, _Allocator>::insert(const_iterator __position, _ForwardIterator __f
template <class _Allocator>
template <class _ForwardIterator, class _Sentinel>
-_LIBCPP_HIDE_FROM_ABI typename vector<bool, _Allocator>::iterator
-vector<bool, _Allocator>::__insert_with_size(
+_LIBCPP_HIDE_FROM_ABI typename vector<bool, _Allocator>::iterator vector<bool, _Allocator>::__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<size_type>(__n_signed);
@@ -2505,15 +2394,13 @@ size_t vector<bool, _Allocator>::__hash_code() const _NOEXCEPT {
template <class _Allocator>
struct _LIBCPP_TEMPLATE_VIS hash<vector<bool, _Allocator> >
: public __unary_function<vector<bool, _Allocator>, size_t> {
- _LIBCPP_HIDE_FROM_ABI size_t
- operator()(const vector<bool, _Allocator>& __vec) const _NOEXCEPT {
+ _LIBCPP_HIDE_FROM_ABI size_t operator()(const vector<bool, _Allocator>& __vec) const _NOEXCEPT {
return __vec.__hash_code();
}
};
template <class _Tp, class _Allocator>
-inline _LIBCPP_HIDE_FROM_ABI bool
-operator==(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y) {
+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());
}
``````````
</details>
https://github.com/llvm/llvm-project/pull/134046
More information about the llvm-branch-commits
mailing list