diff options
Diffstat (limited to 'libcxx')
98 files changed, 252 insertions, 252 deletions
diff --git a/libcxx/fuzzing/fuzz_test.cpp b/libcxx/fuzzing/fuzz_test.cpp index 9fa6f433404..508c3b65f2d 100644 --- a/libcxx/fuzzing/fuzz_test.cpp +++ b/libcxx/fuzzing/fuzz_test.cpp @@ -155,7 +155,7 @@ void test_one(const char *filename, FuzzProc fp) std::cout << "Execution time: " << std::chrono::duration_cast<std::chrono::milliseconds>(finish_time - start_time).count() << " milliseconds" << std::endl; - std::cout << "Memory: " + std::cout << "Memory: " << mc.totalBytesAllocated << " bytes allocated (" << mc.totalAllocationCount << " allocations); " << mc.netAllocationCount << " allocations remain" << std::endl; diff --git a/libcxx/include/__string b/libcxx/include/__string index b4c8815f72d..70fd1cc3930 100644 --- a/libcxx/include/__string +++ b/libcxx/include/__string @@ -31,7 +31,7 @@ struct char_traits static constexpr int compare(const char_type* s1, const char_type* s2, size_t n); static constexpr size_t length(const char_type* s); - static constexpr const char_type* + static constexpr const char_type* find(const char_type* s, size_t n, const char_type& a); static char_type* move(char_type* s1, const char_type* s2, size_t n); static char_type* copy(char_type* s1, const char_type* s2, size_t n); @@ -424,19 +424,19 @@ struct _LIBCPP_TEMPLATE_VIS char_traits<char8_t> static constexpr size_t length(const char_type* __s) _NOEXCEPT; - + _LIBCPP_INLINE_VISIBILITY static constexpr const char_type* find(const char_type* __s, size_t __n, const char_type& __a) _NOEXCEPT; - + static char_type* move(char_type* __s1, const char_type* __s2, size_t __n) _NOEXCEPT {return __n == 0 ? __s1 : (char_type*) memmove(__s1, __s2, __n);} - + static char_type* copy(char_type* __s1, const char_type* __s2, size_t __n) _NOEXCEPT { _LIBCPP_ASSERT(__s2 < __s1 || __s2 >= __s1+__n, "char_traits::copy overlapped range"); return __n == 0 ? __s1 : (char_type*)memcpy(__s1, __s2, __n); } - + static char_type* assign(char_type* __s, size_t __n, char_type __a) _NOEXCEPT {return __n == 0 ? __s : (char_type*)memset(__s, to_int_type(__a), __n);} @@ -744,7 +744,7 @@ char_traits<char32_t>::assign(char_type* __s, size_t __n, char_type __a) _NOEXCE // __str_find template<class _CharT, class _SizeT, class _Traits, _SizeT __npos> inline _SizeT _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY -__str_find(const _CharT *__p, _SizeT __sz, +__str_find(const _CharT *__p, _SizeT __sz, _CharT __c, _SizeT __pos) _NOEXCEPT { if (__pos >= __sz) @@ -796,7 +796,7 @@ __search_substring(const _CharT *__first1, const _CharT *__last1, template<class _CharT, class _SizeT, class _Traits, _SizeT __npos> inline _SizeT _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY -__str_find(const _CharT *__p, _SizeT __sz, +__str_find(const _CharT *__p, _SizeT __sz, const _CharT* __s, _SizeT __pos, _SizeT __n) _NOEXCEPT { if (__pos > __sz) @@ -818,7 +818,7 @@ __str_find(const _CharT *__p, _SizeT __sz, template<class _CharT, class _SizeT, class _Traits, _SizeT __npos> inline _SizeT _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY -__str_rfind(const _CharT *__p, _SizeT __sz, +__str_rfind(const _CharT *__p, _SizeT __sz, _CharT __c, _SizeT __pos) _NOEXCEPT { if (__sz < 1) @@ -837,7 +837,7 @@ __str_rfind(const _CharT *__p, _SizeT __sz, template<class _CharT, class _SizeT, class _Traits, _SizeT __npos> inline _SizeT _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY -__str_rfind(const _CharT *__p, _SizeT __sz, +__str_rfind(const _CharT *__p, _SizeT __sz, const _CharT* __s, _SizeT __pos, _SizeT __n) _NOEXCEPT { __pos = _VSTD::min(__pos, __sz); @@ -846,7 +846,7 @@ __str_rfind(const _CharT *__p, _SizeT __sz, else __pos = __sz; const _CharT* __r = _VSTD::__find_end( - __p, __p + __pos, __s, __s + __n, _Traits::eq, + __p, __p + __pos, __s, __s + __n, _Traits::eq, random_access_iterator_tag(), random_access_iterator_tag()); if (__n > 0 && __r == __p + __pos) return __npos; @@ -975,7 +975,7 @@ struct __quoted_output_proxy __quoted_output_proxy(_Iter __f, _Iter __l, _CharT __d, _CharT __e) : __first(__f), __last(__l), __delim(__d), __escape(__e) {} - // This would be a nice place for a string_ref + // This would be a nice place for a string_ref }; _LIBCPP_END_NAMESPACE_STD diff --git a/libcxx/include/__threading_support b/libcxx/include/__threading_support index 0d1f1e681f5..50cec7e0c95 100644 --- a/libcxx/include/__threading_support +++ b/libcxx/include/__threading_support @@ -453,7 +453,7 @@ public: _LIBCPP_INLINE_VISIBILITY void __reset() { __id_ = 0; } - + template<class _CharT, class _Traits> friend _LIBCPP_INLINE_VISIBILITY diff --git a/libcxx/include/bit b/libcxx/include/bit index 8800b22b7bc..6dc85b5d01f 100644 --- a/libcxx/include/bit +++ b/libcxx/include/bit @@ -42,7 +42,7 @@ namespace std { template<class T> constexpr int popcount(T x) noexcept; // C++20 - // 20.15.9, endian + // 20.15.9, endian enum class endian { little = see below, // C++20 big = see below, // C++20 @@ -350,7 +350,7 @@ _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR bool __ispow2(_Tp __t) _NOEXCEPT { static_assert(__bitop_unsigned_integer<_Tp>::value, "__ispow2 requires unsigned"); - return __t != 0 && (((__t & (__t - 1)) == 0)); + return __t != 0 && (((__t & (__t - 1)) == 0)); } diff --git a/libcxx/include/ctime b/libcxx/include/ctime index cb8474f8f0b..71e60b10fe5 100644 --- a/libcxx/include/ctime +++ b/libcxx/include/ctime @@ -18,7 +18,7 @@ Macros: NULL CLOCKS_PER_SEC TIME_UTC // C++17 - + namespace std { @@ -29,7 +29,7 @@ Types: time_t tm timespec // C++17 - + clock_t clock(); double difftime(time_t time1, time_t time0); time_t mktime(tm* timeptr); diff --git a/libcxx/include/experimental/functional b/libcxx/include/experimental/functional index 755eda64155..c7dda2254b3 100644 --- a/libcxx/include/experimental/functional +++ b/libcxx/include/experimental/functional @@ -112,7 +112,7 @@ template<class _ForwardIterator, class _BinaryPredicate = equal_to<>> class _LIBCPP_TYPE_VIS default_searcher { public: _LIBCPP_INLINE_VISIBILITY - default_searcher(_ForwardIterator __f, _ForwardIterator __l, + default_searcher(_ForwardIterator __f, _ForwardIterator __l, _BinaryPredicate __p = _BinaryPredicate()) : __first_(__f), __last_(__l), __pred_(__p) {} @@ -151,12 +151,12 @@ public: // TODO private: const _Value __default_value_; std::unordered_map<_Key, _Value, _Hash, _BinaryPredicate> __table; - + public: _LIBCPP_INLINE_VISIBILITY _BMSkipTable(std::size_t __sz, _Value __default, _Hash __hf, _BinaryPredicate __pred) : __default_value_(__default), __table(__sz, __hf, __pred) {} - + _LIBCPP_INLINE_VISIBILITY void insert(const key_type &__key, value_type __val) { @@ -170,7 +170,7 @@ public: return __it == __table.end() ? __default_value_ : __it->second; } }; - + // Special case small numeric values; use an array template<class _Key, typename _Value, class _Hash, class _BinaryPredicate> @@ -189,7 +189,7 @@ public: { std::fill_n(__table.begin(), __table.size(), __default); } - + _LIBCPP_INLINE_VISIBILITY void insert(key_type __key, value_type __val) { @@ -204,8 +204,8 @@ public: }; -template <class _RandomAccessIterator1, - class _Hash = hash<typename iterator_traits<_RandomAccessIterator1>::value_type>, +template <class _RandomAccessIterator1, + class _Hash = hash<typename iterator_traits<_RandomAccessIterator1>::value_type>, class _BinaryPredicate = equal_to<>> class _LIBCPP_TYPE_VIS boyer_moore_searcher { private: @@ -217,9 +217,9 @@ private: is_same<_Hash, hash<value_type>>::value && is_same<_BinaryPredicate, equal_to<>>::value > skip_table_type; - + public: - boyer_moore_searcher(_RandomAccessIterator1 __f, _RandomAccessIterator1 __l, + boyer_moore_searcher(_RandomAccessIterator1 __f, _RandomAccessIterator1 __l, _Hash __hf = _Hash(), _BinaryPredicate __pred = _BinaryPredicate()) : __first_(__f), __last_(__l), __pred_(__pred), __pattern_length_(_VSTD::distance(__first_, __last_)), @@ -232,13 +232,13 @@ public: this->__build_suffix_table ( __first_, __last_, __pred_ ); } - + template <typename _RandomAccessIterator2> pair<_RandomAccessIterator2, _RandomAccessIterator2> operator ()(_RandomAccessIterator2 __f, _RandomAccessIterator2 __l) const { static_assert ( std::is_same< - typename std::__uncvref<typename std::iterator_traits<_RandomAccessIterator1>::value_type>::type, + typename std::__uncvref<typename std::iterator_traits<_RandomAccessIterator1>::value_type>::type, typename std::__uncvref<typename std::iterator_traits<_RandomAccessIterator2>::value_type>::type >::value, "Corpus and Pattern iterators must point to the same type" ); @@ -247,13 +247,13 @@ public: if (__first_ == __last_) return make_pair(__f, __f); // empty pattern // If the pattern is larger than the corpus, we can't find it! - if ( __pattern_length_ > _VSTD::distance (__f, __l)) + if ( __pattern_length_ > _VSTD::distance (__f, __l)) return make_pair(__l, __l); - // Do the search + // Do the search return this->__search(__f, __l); } - + public: // TODO private: _RandomAccessIterator1 __first_; _RandomAccessIterator1 __last_; @@ -270,7 +270,7 @@ public: // TODO private: const _RandomAccessIterator2 __last = __l - __pattern_length_; const skip_table_type & __skip = *__skip_.get(); const vector<difference_type> & __suffix = *__suffix_.get(); - + while (__cur <= __last) { @@ -282,7 +282,7 @@ public: // TODO private: if ( __j == 0 ) return make_pair(__cur, __cur + __pattern_length_); } - + // Since we didn't match, figure out how far to skip forward difference_type __k = __skip[__cur [ __j - 1 ]]; difference_type __m = __j - __k - 1; @@ -291,7 +291,7 @@ public: // TODO private: else __cur += __suffix[ __j ]; } - + return make_pair(__l, __l); // We didn't find anything } @@ -300,21 +300,21 @@ public: // TODO private: void __compute_bm_prefix ( _Iterator __f, _Iterator __l, _BinaryPredicate __pred, _Container &__prefix ) { const std::size_t __count = _VSTD::distance(__f, __l); - + __prefix[0] = 0; std::size_t __k = 0; for ( std::size_t __i = 1; __i < __count; ++__i ) { while ( __k > 0 && !__pred ( __f[__k], __f[__i] )) __k = __prefix [ __k - 1 ]; - + if ( __pred ( __f[__k], __f[__i] )) __k++; __prefix [ __i ] = __k; } } - void __build_suffix_table(_RandomAccessIterator1 __f, _RandomAccessIterator1 __l, + void __build_suffix_table(_RandomAccessIterator1 __f, _RandomAccessIterator1 __l, _BinaryPredicate __pred) { const std::size_t __count = _VSTD::distance(__f, __l); @@ -322,19 +322,19 @@ public: // TODO private: if (__count > 0) { _VSTD::vector<value_type> __scratch(__count); - + __compute_bm_prefix(__f, __l, __pred, __scratch); for ( std::size_t __i = 0; __i <= __count; __i++ ) __suffix[__i] = __count - __scratch[__count-1]; - + typedef _VSTD::reverse_iterator<_RandomAccessIterator1> _RevIter; __compute_bm_prefix(_RevIter(__l), _RevIter(__f), __pred, __scratch); - + for ( std::size_t __i = 0; __i < __count; __i++ ) { const std::size_t __j = __count - __scratch[__i]; const difference_type __k = __i - __scratch[__i] + 1; - + if (__suffix[__j] > __k) __suffix[__j] = __k; } @@ -343,20 +343,20 @@ public: // TODO private: }; -template<class _RandomAccessIterator, - class _Hash = hash<typename iterator_traits<_RandomAccessIterator>::value_type>, +template<class _RandomAccessIterator, + class _Hash = hash<typename iterator_traits<_RandomAccessIterator>::value_type>, class _BinaryPredicate = equal_to<>> _LIBCPP_INLINE_VISIBILITY boyer_moore_searcher<_RandomAccessIterator, _Hash, _BinaryPredicate> -make_boyer_moore_searcher( _RandomAccessIterator __f, _RandomAccessIterator __l, +make_boyer_moore_searcher( _RandomAccessIterator __f, _RandomAccessIterator __l, _Hash __hf = _Hash(), _BinaryPredicate __p = _BinaryPredicate ()) { return boyer_moore_searcher<_RandomAccessIterator, _Hash, _BinaryPredicate>(__f, __l, __hf, __p); } // boyer-moore-horspool -template <class _RandomAccessIterator1, - class _Hash = hash<typename iterator_traits<_RandomAccessIterator1>::value_type>, +template <class _RandomAccessIterator1, + class _Hash = hash<typename iterator_traits<_RandomAccessIterator1>::value_type>, class _BinaryPredicate = equal_to<>> class _LIBCPP_TYPE_VIS boyer_moore_horspool_searcher { private: @@ -370,7 +370,7 @@ private: > skip_table_type; public: - boyer_moore_horspool_searcher(_RandomAccessIterator1 __f, _RandomAccessIterator1 __l, + boyer_moore_horspool_searcher(_RandomAccessIterator1 __f, _RandomAccessIterator1 __l, _Hash __hf = _Hash(), _BinaryPredicate __pred = _BinaryPredicate()) : __first_(__f), __last_(__l), __pred_(__pred), __pattern_length_(_VSTD::distance(__first_, __last_)), @@ -384,13 +384,13 @@ public: __skip_->insert(*__f, __pattern_length_ - 1 - __i); } } - + template <typename _RandomAccessIterator2> pair<_RandomAccessIterator2, _RandomAccessIterator2> operator ()(_RandomAccessIterator2 __f, _RandomAccessIterator2 __l) const { static_assert ( std::is_same< - typename std::__uncvref<typename std::iterator_traits<_RandomAccessIterator1>::value_type>::type, + typename std::__uncvref<typename std::iterator_traits<_RandomAccessIterator1>::value_type>::type, typename std::__uncvref<typename std::iterator_traits<_RandomAccessIterator2>::value_type>::type >::value, "Corpus and Pattern iterators must point to the same type" ); @@ -399,13 +399,13 @@ public: if (__first_ == __last_) return make_pair(__f, __f); // empty pattern // If the pattern is larger than the corpus, we can't find it! - if ( __pattern_length_ > _VSTD::distance (__f, __l)) + if ( __pattern_length_ > _VSTD::distance (__f, __l)) return make_pair(__l, __l); - // Do the search + // Do the search return this->__search(__f, __l); } - + private: _RandomAccessIterator1 __first_; _RandomAccessIterator1 __last_; @@ -433,17 +433,17 @@ private: } __cur += __skip[__cur[__pattern_length_-1]]; } - + return make_pair(__l, __l); } }; -template<class _RandomAccessIterator, - class _Hash = hash<typename iterator_traits<_RandomAccessIterator>::value_type>, +template<class _RandomAccessIterator, + class _Hash = hash<typename iterator_traits<_RandomAccessIterator>::value_type>, class _BinaryPredicate = equal_to<>> _LIBCPP_INLINE_VISIBILITY boyer_moore_horspool_searcher<_RandomAccessIterator, _Hash, _BinaryPredicate> -make_boyer_moore_horspool_searcher( _RandomAccessIterator __f, _RandomAccessIterator __l, +make_boyer_moore_horspool_searcher( _RandomAccessIterator __f, _RandomAccessIterator __l, _Hash __hf = _Hash(), _BinaryPredicate __p = _BinaryPredicate ()) { return boyer_moore_horspool_searcher<_RandomAccessIterator, _Hash, _BinaryPredicate>(__f, __l, __hf, __p); diff --git a/libcxx/include/experimental/iterator b/libcxx/include/experimental/iterator index 6a6e51d820d..10b0599138c 100644 --- a/libcxx/include/experimental/iterator +++ b/libcxx/include/experimental/iterator @@ -26,19 +26,19 @@ namespace std { typedef void difference_type; typedef void pointer; typedef void reference; - + ostream_joiner(ostream_type& s, const DelimT& delimiter); ostream_joiner(ostream_type& s, DelimT&& delimiter); - template<typename T> + template<typename T> ostream_joiner& operator=(const T& value); ostream_joiner& operator*() noexcept; ostream_joiner& operator++() noexcept; ostream_joiner& operator++(int) noexcept; private: - ostream_type* out_stream; // exposition only - DelimT delim; // exposition only + ostream_type* out_stream; // exposition only + DelimT delim; // exposition only bool first_element; // exposition only }; @@ -75,10 +75,10 @@ public: ostream_joiner(ostream_type& __os, _Delim&& __d) : __output_iter(_VSTD::addressof(__os)), __delim(_VSTD::move(__d)), __first(true) {} - + ostream_joiner(ostream_type& __os, const _Delim& __d) : __output_iter(_VSTD::addressof(__os)), __delim(__d), __first(true) {} - + template<typename _Tp> ostream_joiner& operator=(const _Tp& __v) diff --git a/libcxx/include/experimental/type_traits b/libcxx/include/experimental/type_traits index 19466e9a5a5..7ab097226b5 100644 --- a/libcxx/include/experimental/type_traits +++ b/libcxx/include/experimental/type_traits @@ -60,7 +60,7 @@ inline namespace fundamentals_v1 { using is_detected_convertible = is_convertible<detected_t<Op, Args...>, To>; template <class To, template<class...> class Op, class... Args> constexpr bool is_detected_convertible_v - = is_detected_convertible<To, Op, Args...>::value; + = is_detected_convertible<To, Op, Args...>::value; } // namespace fundamentals_v1 } // namespace experimental @@ -122,7 +122,7 @@ struct _DETECTOR<_Default, void_t<_Op<_Args...>>, _Op, _Args...> { using value_t = true_type; using type = _Op<_Args...>; }; - + template <template<class...> class _Op, class... _Args> using is_detected = typename _DETECTOR<nonesuch, void, _Op, _Args...>::value_t; @@ -144,7 +144,7 @@ template <class Expected, template<class...> class _Op, class... _Args> template <class To, template<class...> class _Op, class... _Args> using is_detected_convertible = is_convertible<detected_t<_Op, _Args...>, To>; template <class To, template<class...> class _Op, class... _Args> - _LIBCPP_CONSTEXPR bool is_detected_convertible_v = is_detected_convertible<To, _Op, _Args...>::value; + _LIBCPP_CONSTEXPR bool is_detected_convertible_v = is_detected_convertible<To, _Op, _Args...>::value; _LIBCPP_END_NAMESPACE_LFTS diff --git a/libcxx/include/ext/hash_map b/libcxx/include/ext/hash_map index 20f778be971..09beaa607d8 100644 --- a/libcxx/include/ext/hash_map +++ b/libcxx/include/ext/hash_map @@ -394,10 +394,10 @@ public: return __t; } - friend _LIBCPP_INLINE_VISIBILITY + friend _LIBCPP_INLINE_VISIBILITY bool operator==(const __hash_map_iterator& __x, const __hash_map_iterator& __y) {return __x.__i_ == __y.__i_;} - friend _LIBCPP_INLINE_VISIBILITY + friend _LIBCPP_INLINE_VISIBILITY bool operator!=(const __hash_map_iterator& __x, const __hash_map_iterator& __y) {return __x.__i_ != __y.__i_;} diff --git a/libcxx/include/forward_list b/libcxx/include/forward_list index d59ddd4ef97..29dc6615800 100644 --- a/libcxx/include/forward_list +++ b/libcxx/include/forward_list @@ -1525,7 +1525,7 @@ forward_list<_Tp, _Alloc>::remove(const value_type& __v) else ++__i; } - + return (__remove_return_type) __count_removed; } @@ -1553,7 +1553,7 @@ forward_list<_Tp, _Alloc>::remove_if(_Predicate __pred) else ++__i; } - + return (__remove_return_type) __count_removed; } @@ -1573,7 +1573,7 @@ forward_list<_Tp, _Alloc>::unique(_BinaryPredicate __binary_pred) __deleted_nodes.splice_after(__deleted_nodes.before_begin(), *this, __i, __j); __i = __j; } - + return (__remove_return_type) __count_removed; } diff --git a/libcxx/include/list b/libcxx/include/list index c92ef79282e..02d41644be3 100644 --- a/libcxx/include/list +++ b/libcxx/include/list @@ -2211,7 +2211,7 @@ list<_Tp, _Alloc>::unique(_BinaryPred __binary_pred) __i = __j; } } - + return (__remove_return_type) __deleted_nodes.size(); } diff --git a/libcxx/include/support/ibm/xlocale.h b/libcxx/include/support/ibm/xlocale.h index 9f0522c199e..431bf626876 100644 --- a/libcxx/include/support/ibm/xlocale.h +++ b/libcxx/include/support/ibm/xlocale.h @@ -87,7 +87,7 @@ int isxdigit_l(int c, locale_t locale) static inline int iswalnum_l(wchar_t wc, locale_t locale) { - return __xiswalnum(locale, wc); + return __xiswalnum(locale, wc); } static inline @@ -159,7 +159,7 @@ int iswxdigit_l(wchar_t wc, locale_t locale) static inline int iswctype_l(wint_t wc, wctype_t desc, locale_t locale) { - return __xiswctype(locale, wc, desc); + return __xiswctype(locale, wc, desc); } static inline @@ -261,7 +261,7 @@ int vasprintf(char **strp, const char *fmt, va_list ap) str_size = vsnprintf(*strp, str_size + 1, fmt, ap); } return str_size; -} +} #ifdef __cplusplus } diff --git a/libcxx/include/support/solaris/wchar.h b/libcxx/include/support/solaris/wchar.h index 9dc9ac3f006..f01fd743a23 100644 --- a/libcxx/include/support/solaris/wchar.h +++ b/libcxx/include/support/solaris/wchar.h @@ -26,7 +26,7 @@ #define wctype sun_wctype #define _WCHAR_T 1 #include_next "wchar.h" -#undef iswalpha +#undef iswalpha #undef iswupper #undef iswlower #undef iswdigit diff --git a/libcxx/test/libcxx/iterators/advance.debug1.pass.cpp b/libcxx/test/libcxx/iterators/advance.debug1.pass.cpp index 1cdaac088b4..fd67953c1f1 100644 --- a/libcxx/test/libcxx/iterators/advance.debug1.pass.cpp +++ b/libcxx/test/libcxx/iterators/advance.debug1.pass.cpp @@ -27,7 +27,7 @@ int main(int, char**) { int a[] = {1, 2, 3}; - + bidirectional_iterator<int *> bidi(a+1); std::advance(bidi, 1); // should work fine std::advance(bidi, 0); // should work fine diff --git a/libcxx/test/libcxx/numerics/bit.ops.pass.cpp b/libcxx/test/libcxx/numerics/bit.ops.pass.cpp index 5e220d6353c..084728971e4 100644 --- a/libcxx/test/libcxx/numerics/bit.ops.pass.cpp +++ b/libcxx/test/libcxx/numerics/bit.ops.pass.cpp @@ -17,7 +17,7 @@ int main(int, char **) { - + #if TEST_STD_VER > 11 { constexpr unsigned v = 0x1237U; @@ -29,7 +29,7 @@ int main(int, char **) static_assert( std::__countr_one(v) == 3, ""); static_assert( std::__countl_zero(v) == 19, ""); static_assert( std::__countr_zero(v) == 0, ""); - + static_assert( std::__libcpp_popcount(v) == 7, ""); static_assert( std::__bit_log2(v) == 12, ""); static_assert(!std::__ispow2(v), ""); @@ -62,8 +62,8 @@ int main(int, char **) assert( std::__libcpp_popcount(v) == 13); assert( std::__bit_log2(v) == 28); - assert(!std::__ispow2(v)); + assert(!std::__ispow2(v)); } - + return 0; } diff --git a/libcxx/test/libcxx/numerics/numeric.ops/midpoint.integer.pass.cpp b/libcxx/test/libcxx/numerics/numeric.ops/midpoint.integer.pass.cpp index d61d7fd4efd..8306cde6b7d 100644 --- a/libcxx/test/libcxx/numerics/numeric.ops/midpoint.integer.pass.cpp +++ b/libcxx/test/libcxx/numerics/numeric.ops/midpoint.integer.pass.cpp @@ -17,7 +17,7 @@ #include <cassert> #include "test_macros.h" -// Users are not supposed to provide template argument lists for +// Users are not supposed to provide template argument lists for // functions in the standard library (there's an exception for min and max) // However, libc++ protects against this for pointers, so we check to make // sure that our protection is working here. diff --git a/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap_comp.pass.cpp b/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap_comp.pass.cpp index 9aa3a226352..5c561094539 100644 --- a/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap_comp.pass.cpp +++ b/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap_comp.pass.cpp @@ -43,7 +43,7 @@ void test(int N) assert(std::is_heap(ia, ia+N, std::greater<int>())); std::shuffle(ia, ia+N, randomness); - std::make_heap(random_access_iterator<int *>(ia), + std::make_heap(random_access_iterator<int *>(ia), random_access_iterator<int *>(ia+N), std::greater<int>()); assert(std::is_heap(ia, ia+N, std::greater<int>())); } diff --git a/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap.pass.cpp b/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap.pass.cpp index 52f279bac6e..847988b9eb8 100644 --- a/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap.pass.cpp +++ b/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap.pass.cpp @@ -42,7 +42,7 @@ void test(int N) std::push_heap(RI(ia), RI(ia+i)); assert(std::is_heap(RI(ia), RI(ia+i))); } - + delete [] ia; } diff --git a/libcxx/test/std/containers/associative/map/map.erasure/erase_if.pass.cpp b/libcxx/test/std/containers/associative/map/map.erasure/erase_if.pass.cpp index 43cf3cbe525..f7442f4cfb9 100644 --- a/libcxx/test/std/containers/associative/map/map.erasure/erase_if.pass.cpp +++ b/libcxx/test/std/containers/associative/map/map.erasure/erase_if.pass.cpp @@ -47,7 +47,7 @@ void test() auto is4 = [](auto v) { return v.first == 4;}; auto True = [](auto) { return true; }; auto False = [](auto) { return false; }; - + test0<S>({}, is1, {}); test0<S>({1}, is1, {}); diff --git a/libcxx/test/std/containers/associative/multimap/multimap.erasure/erase_if.pass.cpp b/libcxx/test/std/containers/associative/multimap/multimap.erasure/erase_if.pass.cpp index 15893f77b63..4655da4b2dc 100644 --- a/libcxx/test/std/containers/associative/multimap/multimap.erasure/erase_if.pass.cpp +++ b/libcxx/test/std/containers/associative/multimap/multimap.erasure/erase_if.pass.cpp @@ -47,7 +47,7 @@ void test() auto is4 = [](auto v) { return v.first == 4;}; auto True = [](auto) { return true; }; auto False = [](auto) { return false; }; - + test0<S>({}, is1, {}); test0<S>({1}, is1, {}); @@ -72,7 +72,7 @@ void test() test0<S>({1,2,2}, is1, {2,2}); test0<S>({1,2,2}, is2, {1}); test0<S>({1,2,2}, is3, {1,2,2}); - + test0<S>({1,2,3}, True, {}); test0<S>({1,2,3}, False, {1,2,3}); } diff --git a/libcxx/test/std/containers/associative/multiset/multiset.erasure/erase_if.pass.cpp b/libcxx/test/std/containers/associative/multiset/multiset.erasure/erase_if.pass.cpp index 84d665cb151..1591fa1f2f8 100644 --- a/libcxx/test/std/containers/associative/multiset/multiset.erasure/erase_if.pass.cpp +++ b/libcxx/test/std/containers/associative/multiset/multiset.erasure/erase_if.pass.cpp @@ -36,7 +36,7 @@ void test() auto is4 = [](auto v) { return v == 4;}; auto True = [](auto) { return true; }; auto False = [](auto) { return false; }; - + test0(S(), is1, S()); test0(S({1}), is1, S()); @@ -61,7 +61,7 @@ void test() test0(S({1,2,2}), is1, S({2,2})); test0(S({1,2,2}), is2, S({1})); test0(S({1,2,2}), is3, S({1,2,2})); - + test0(S({1,2,3}), True, S()); test0(S({1,2,3}), False, S({1,2,3})); } diff --git a/libcxx/test/std/containers/associative/set/set.erasure/erase_if.pass.cpp b/libcxx/test/std/containers/associative/set/set.erasure/erase_if.pass.cpp index 43a60d79c02..519db6d6f4a 100644 --- a/libcxx/test/std/containers/associative/set/set.erasure/erase_if.pass.cpp +++ b/libcxx/test/std/containers/associative/set/set.erasure/erase_if.pass.cpp @@ -36,7 +36,7 @@ void test() auto is4 = [](auto v) { return v == 4;}; auto True = [](auto) { return true; }; auto False = [](auto) { return false; }; - + test0(S(), is1, S()); test0(S({1}), is1, S()); diff --git a/libcxx/test/std/containers/sequences/deque/deque.erasure/erase.pass.cpp b/libcxx/test/std/containers/sequences/deque/deque.erasure/erase.pass.cpp index 2293ef20531..2394c26dcbe 100644 --- a/libcxx/test/std/containers/sequences/deque/deque.erasure/erase.pass.cpp +++ b/libcxx/test/std/containers/sequences/deque/deque.erasure/erase.pass.cpp @@ -11,7 +11,7 @@ // template <class T, class Allocator, class U> // void erase(deque<T, Allocator>& c, const U& value); - + #include <deque> #include <optional> diff --git a/libcxx/test/std/containers/sequences/deque/deque.erasure/erase_if.pass.cpp b/libcxx/test/std/containers/sequences/deque/deque.erasure/erase_if.pass.cpp index e0828a3fad8..cb54e4e443f 100644 --- a/libcxx/test/std/containers/sequences/deque/deque.erasure/erase_if.pass.cpp +++ b/libcxx/test/std/containers/sequences/deque/deque.erasure/erase_if.pass.cpp @@ -10,7 +10,7 @@ // <deque> // template <class T, class Allocator, class Predicate> -// void erase_if(deque<T, Allocator>& c, Predicate pred); +// void erase_if(deque<T, Allocator>& c, Predicate pred); #include <deque> @@ -36,7 +36,7 @@ void test() auto is4 = [](auto v) { return v == 4;}; auto True = [](auto) { return true; }; auto False = [](auto) { return false; }; - + test0(S(), is1, S()); test0(S({1}), is1, S()); @@ -61,7 +61,7 @@ void test() test0(S({1,2,2}), is1, S({2,2})); test0(S({1,2,2}), is2, S({1})); test0(S({1,2,2}), is3, S({1,2,2})); - + test0(S({1,2,3}), True, S()); test0(S({1,2,3}), False, S({1,2,3})); } diff --git a/libcxx/test/std/containers/sequences/forwardlist/forwardlist.erasure/erase.pass.cpp b/libcxx/test/std/containers/sequences/forwardlist/forwardlist.erasure/erase.pass.cpp index 68a26fbc704..79155354802 100644 --- a/libcxx/test/std/containers/sequences/forwardlist/forwardlist.erasure/erase.pass.cpp +++ b/libcxx/test/std/containers/sequences/forwardlist/forwardlist.erasure/erase.pass.cpp @@ -11,7 +11,7 @@ // template <class T, class Allocator, class U> // void erase(forward_list<T, Allocator>& c, const U& value); - + #include <forward_list> #include <optional> diff --git a/libcxx/test/std/containers/sequences/forwardlist/forwardlist.erasure/erase_if.pass.cpp b/libcxx/test/std/containers/sequences/forwardlist/forwardlist.erasure/erase_if.pass.cpp index b2106b8c8de..103645d4b6e 100644 --- a/libcxx/test/std/containers/sequences/forwardlist/forwardlist.erasure/erase_if.pass.cpp +++ b/libcxx/test/std/containers/sequences/forwardlist/forwardlist.erasure/erase_if.pass.cpp @@ -10,7 +10,7 @@ // <forward_list> // template <class T, class Allocator, class Predicate> -// void erase_if(forward_list<T, Allocator>& c, Predicate pred); +// void erase_if(forward_list<T, Allocator>& c, Predicate pred); #include <forward_list> @@ -36,7 +36,7 @@ void test() auto is4 = [](auto v) { return v == 4;}; auto True = [](auto) { return true; }; auto False = [](auto) { return false; }; - + test0(S(), is1, S()); test0(S({1}), is1, S()); @@ -61,7 +61,7 @@ void test() test0(S({1,2,2}), is1, S({2,2})); test0(S({1,2,2}), is2, S({1})); test0(S({1,2,2}), is3, S({1,2,2})); - + test0(S({1,2,3}), True, S()); test0(S({1,2,3}), False, S({1,2,3})); } diff --git a/libcxx/test/std/containers/sequences/list/list.erasure/erase.pass.cpp b/libcxx/test/std/containers/sequences/list/list.erasure/erase.pass.cpp index 9c03c728248..298785ca52c 100644 --- a/libcxx/test/std/containers/sequences/list/list.erasure/erase.pass.cpp +++ b/libcxx/test/std/containers/sequences/list/list.erasure/erase.pass.cpp @@ -11,7 +11,7 @@ // template <class T, class Allocator, class U> // void erase(list<T, Allocator>& c, const U& value); - + #include <list> #include <optional> diff --git a/libcxx/test/std/containers/sequences/list/list.erasure/erase_if.pass.cpp b/libcxx/test/std/containers/sequences/list/list.erasure/erase_if.pass.cpp index f25d3e830f2..b2889eb67c4 100644 --- a/libcxx/test/std/containers/sequences/list/list.erasure/erase_if.pass.cpp +++ b/libcxx/test/std/containers/sequences/list/list.erasure/erase_if.pass.cpp @@ -10,7 +10,7 @@ // <list> // template <class T, class Allocator, class Predicate> -// void erase_if(list<T, Allocator>& c, Predicate pred); +// void erase_if(list<T, Allocator>& c, Predicate pred); #include <list> @@ -36,7 +36,7 @@ void test() auto is4 = [](auto v) { return v == 4;}; auto True = [](auto) { return true; }; auto False = [](auto) { return false; }; - + test0(S(), is1, S()); test0(S({1}), is1, S()); @@ -61,7 +61,7 @@ void test() test0(S({1,2,2}), is1, S({2,2})); test0(S({1,2,2}), is2, S({1})); test0(S({1,2,2}), is3, S({1,2,2})); - + test0(S({1,2,3}), True, S()); test0(S({1,2,3}), False, S({1,2,3})); } diff --git a/libcxx/test/std/containers/sequences/vector/vector.erasure/erase.pass.cpp b/libcxx/test/std/containers/sequences/vector/vector.erasure/erase.pass.cpp index 00676b52dc6..687a467e4f7 100644 --- a/libcxx/test/std/containers/sequences/vector/vector.erasure/erase.pass.cpp +++ b/libcxx/test/std/containers/sequences/vector/vector.erasure/erase.pass.cpp @@ -11,7 +11,7 @@ // template <class T, class Allocator, class U> // void erase(vector<T, Allocator>& c, const U& value); - + #include <vector> #include <optional> diff --git a/libcxx/test/std/containers/sequences/vector/vector.erasure/erase_if.pass.cpp b/libcxx/test/std/containers/sequences/vector/vector.erasure/erase_if.pass.cpp index 10d66a29b4e..49fece4b765 100644 --- a/libcxx/test/std/containers/sequences/vector/vector.erasure/erase_if.pass.cpp +++ b/libcxx/test/std/containers/sequences/vector/vector.erasure/erase_if.pass.cpp @@ -10,7 +10,7 @@ // <vector> // template <class T, class Allocator, class Predicate> -// void erase_if(vector<T, Allocator>& c, Predicate pred); +// void erase_if(vector<T, Allocator>& c, Predicate pred); #include <vector> @@ -36,7 +36,7 @@ void test() auto is4 = [](auto v) { return v == 4;}; auto True = [](auto) { return true; }; auto False = [](auto) { return false; }; - + test0(S(), is1, S()); test0(S({1}), is1, S()); @@ -61,7 +61,7 @@ void test() test0(S({1,2,2}), is1, S({2,2})); test0(S({1,2,2}), is2, S({1})); test0(S({1,2,2}), is3, S({1,2,2})); - + test0(S({1,2,3}), True, S()); test0(S({1,2,3}), False, S({1,2,3})); } diff --git a/libcxx/test/std/containers/unord/unord.map/erase_if.pass.cpp b/libcxx/test/std/containers/unord/unord.map/erase_if.pass.cpp index 1fc4ce81605..652e6f6b49f 100644 --- a/libcxx/test/std/containers/unord/unord.map/erase_if.pass.cpp +++ b/libcxx/test/std/containers/unord/unord.map/erase_if.pass.cpp @@ -48,7 +48,7 @@ void test() auto is4 = [](auto v) { return v.first == 4;}; auto True = [](auto) { return true; }; auto False = [](auto) { return false; }; - + test0<S>({}, is1, {}); test0<S>({1}, is1, {}); diff --git a/libcxx/test/std/containers/unord/unord.multimap/erase_if.pass.cpp b/libcxx/test/std/containers/unord/unord.multimap/erase_if.pass.cpp index 2cec092056d..6da279e915d 100644 --- a/libcxx/test/std/containers/unord/unord.multimap/erase_if.pass.cpp +++ b/libcxx/test/std/containers/unord/unord.multimap/erase_if.pass.cpp @@ -48,7 +48,7 @@ void test() auto is4 = [](auto v) { return v.first == 4;}; auto True = [](auto) { return true; }; auto False = [](auto) { return false; }; - + test0<S>({}, is1, {}); test0<S>({1}, is1, {}); @@ -73,7 +73,7 @@ void test() test0<S>({1,2,2}, is1, {2,2}); test0<S>({1,2,2}, is2, {1}); test0<S>({1,2,2}, is3, {1,2,2}); - + test0<S>({1,2,3}, True, {}); test0<S>({1,2,3}, False, {1,2,3}); } diff --git a/libcxx/test/std/containers/unord/unord.multiset/erase_if.pass.cpp b/libcxx/test/std/containers/unord/unord.multiset/erase_if.pass.cpp index bd587473ce7..72e553a734c 100644 --- a/libcxx/test/std/containers/unord/unord.multiset/erase_if.pass.cpp +++ b/libcxx/test/std/containers/unord/unord.multiset/erase_if.pass.cpp @@ -49,7 +49,7 @@ void test() auto is4 = [](auto v) { return v == 4;}; auto True = [](auto) { return true; }; auto False = [](auto) { return false; }; - + test0<S>({}, is1, {}); test0<S>({1}, is1, {}); @@ -74,7 +74,7 @@ void test() test0<S>({1,2,2}, is1, {2,2}); test0<S>({1,2,2}, is2, {1}); test0<S>({1,2,2}, is3, {1,2,2}); - + test0<S>({1,2,3}, True, {}); test0<S>({1,2,3}, False, {1,2,3}); } diff --git a/libcxx/test/std/containers/unord/unord.set/erase_if.pass.cpp b/libcxx/test/std/containers/unord/unord.set/erase_if.pass.cpp index cbd2ebb1afb..5bc692e8d9c 100644 --- a/libcxx/test/std/containers/unord/unord.set/erase_if.pass.cpp +++ b/libcxx/test/std/containers/unord/unord.set/erase_if.pass.cpp @@ -50,7 +50,7 @@ void test() auto is4 = [](auto v) { return v == 4;}; auto True = [](auto) { return true; }; auto False = [](auto) { return false; }; - + test0<S>({}, is1, {}); test0<S>({1}, is1, {}); diff --git a/libcxx/test/std/containers/views/span.cons/container.fail.cpp b/libcxx/test/std/containers/views/span.cons/container.fail.cpp index 9bc13a61069..b0b753cbd2d 100644 --- a/libcxx/test/std/containers/views/span.cons/container.fail.cpp +++ b/libcxx/test/std/containers/views/span.cons/container.fail.cpp @@ -96,7 +96,7 @@ int main(int, char**) IsAContainer<const int> c; IsAContainer<const volatile int> cv; IsAContainer< volatile int> v; - + std::span< int> s1{c}; // expected-error {{no matching constructor for initialization of 'std::span<int>'}} std::span< int> s2{v}; // expected-error {{no matching constructor for initialization of 'std::span<int>'}} std::span< int> s3{cv}; // expected-error {{no matching constructor for initialization of 'std::span<int>'}} diff --git a/libcxx/test/std/experimental/filesystem/fs.req.macros/feature_macro.pass.cpp b/libcxx/test/std/experimental/filesystem/fs.req.macros/feature_macro.pass.cpp index 595162d309a..76efcce9ace 100644 --- a/libcxx/test/std/experimental/filesystem/fs.req.macros/feature_macro.pass.cpp +++ b/libcxx/test/std/experimental/filesystem/fs.req.macros/feature_macro.pass.cpp @@ -25,6 +25,6 @@ #endif #endif -int main(int, char**) { +int main(int, char**) { return 0; } diff --git a/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.cons/ostream_joiner.cons.pass.cpp b/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.cons/ostream_joiner.cons.pass.cpp index e6f7d3147f4..335f284e4d6 100644 --- a/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.cons/ostream_joiner.cons.pass.cpp +++ b/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.cons/ostream_joiner.cons.pass.cpp @@ -54,6 +54,6 @@ int main(int, char**) { { exper::ostream_joiner<std::wstring, wchar_t> oj(std::wcout, ten); } { exper::ostream_joiner<int, wchar_t> oj(std::wcout, eleven); } - + return 0; } diff --git a/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.creation/make_ostream_joiner.pass.cpp b/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.creation/make_ostream_joiner.pass.cpp index 950dc4094e1..812b608c68c 100644 --- a/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.creation/make_ostream_joiner.pass.cpp +++ b/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.creation/make_ostream_joiner.pass.cpp @@ -49,6 +49,6 @@ int main(int, char**) { test('x', ints, ints+10, "10x11x12x13x14x15x16x17x18x19"); test("Z", chars, chars+10, "0Z1Z2Z3Z4Z5Z6Z7Z8Z9"); test("z", ints, ints+10, "10z11z12z13z14z15z16z17z18z19"); - + return 0; } diff --git a/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.ops/ostream_joiner.op.postincrement.pass.cpp b/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.ops/ostream_joiner.op.postincrement.pass.cpp index a23da345683..acdf56203cb 100644 --- a/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.ops/ostream_joiner.op.postincrement.pass.cpp +++ b/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.ops/ostream_joiner.op.postincrement.pass.cpp @@ -42,6 +42,6 @@ int main(int, char**) { { exper::ostream_joiner<std::string, wchar_t> oj(std::wcout, std::string("9")); test(oj); } { exper::ostream_joiner<std::wstring, wchar_t> oj(std::wcout, std::wstring(L"10")); test(oj); } { exper::ostream_joiner<int, wchar_t> oj(std::wcout, 11); test(oj); } - + return 0; } diff --git a/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.ops/ostream_joiner.op.pretincrement.pass.cpp b/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.ops/ostream_joiner.op.pretincrement.pass.cpp index b6a915f2da0..97b1791dcf4 100644 --- a/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.ops/ostream_joiner.op.pretincrement.pass.cpp +++ b/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.ops/ostream_joiner.op.pretincrement.pass.cpp @@ -42,6 +42,6 @@ int main(int, char**) { { exper::ostream_joiner<std::string, wchar_t> oj(std::wcout, std::string("9")); test(oj); } { exper::ostream_joiner<std::wstring, wchar_t> oj(std::wcout, std::wstring(L"10")); test(oj); } { exper::ostream_joiner<int, wchar_t> oj(std::wcout, 11); test(oj); } - + return 0; } diff --git a/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.ops/ostream_joiner.op.star.pass.cpp b/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.ops/ostream_joiner.op.star.pass.cpp index 0c2761a70ef..d5f23ca5dce 100644 --- a/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.ops/ostream_joiner.op.star.pass.cpp +++ b/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.ops/ostream_joiner.op.star.pass.cpp @@ -42,6 +42,6 @@ int main(int, char**) { { exper::ostream_joiner<std::string, wchar_t> oj(std::wcout, std::string("9")); test(oj); } { exper::ostream_joiner<std::wstring, wchar_t> oj(std::wcout, std::wstring(L"10")); test(oj); } { exper::ostream_joiner<int, wchar_t> oj(std::wcout, 11); test(oj); } - + return 0; } diff --git a/libcxx/test/std/experimental/utilities/meta/meta.detect/nonesuch.fail.cpp b/libcxx/test/std/experimental/utilities/meta/meta.detect/nonesuch.fail.cpp index e906887fe2e..13e6c91c0d1 100644 --- a/libcxx/test/std/experimental/utilities/meta/meta.detect/nonesuch.fail.cpp +++ b/libcxx/test/std/experimental/utilities/meta/meta.detect/nonesuch.fail.cpp @@ -10,8 +10,8 @@ // <experimental/type_traits> // // struct nonesuch; -// nonesuch has no default constructor (C++17 §15.1) -// or initializer-list constructor (C++17 §11.6.4), +// nonesuch has no default constructor (C++17 §15.1) +// or initializer-list constructor (C++17 §11.6.4), // and is not an aggregate (C++17 §11.6.1). diff --git a/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.assignment/assign.pass.cpp b/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.assignment/assign.pass.cpp index be9879e2526..83a1b10c2bf 100644 --- a/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.assignment/assign.pass.cpp +++ b/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.assignment/assign.pass.cpp @@ -21,6 +21,6 @@ using std::experimental::propagate_const; typedef propagate_const<X> P; -int main(int, char**) { static_assert(!std::is_assignable<P, const P &>::value, ""); +int main(int, char**) { static_assert(!std::is_assignable<P, const P &>::value, ""); return 0; } diff --git a/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.assignment/assign_convertible_propagate_const.pass.cpp b/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.assignment/assign_convertible_propagate_const.pass.cpp index 1fa0dd08c90..b4c847edd22 100644 --- a/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.assignment/assign_convertible_propagate_const.pass.cpp +++ b/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.assignment/assign_convertible_propagate_const.pass.cpp @@ -22,6 +22,6 @@ using std::experimental::propagate_const; typedef propagate_const<X> PX; typedef propagate_const<CopyConstructibleFromX> PY; -int main(int, char**) { static_assert(!std::is_assignable<PY, const PX &>::value, ""); +int main(int, char**) { static_assert(!std::is_assignable<PY, const PX &>::value, ""); return 0; } diff --git a/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.ctors/convertible_propagate_const.copy_ctor.pass.cpp b/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.ctors/convertible_propagate_const.copy_ctor.pass.cpp index 494d00b826a..0193d1856e9 100644 --- a/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.ctors/convertible_propagate_const.copy_ctor.pass.cpp +++ b/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.ctors/convertible_propagate_const.copy_ctor.pass.cpp @@ -22,6 +22,6 @@ using std::experimental::propagate_const; typedef propagate_const<X> PX; typedef propagate_const<CopyConstructibleFromX> PY; -int main(int, char**) { static_assert(!std::is_constructible<PX, PY>::value, ""); +int main(int, char**) { static_assert(!std::is_constructible<PX, PY>::value, ""); return 0; } diff --git a/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.ctors/copy_ctor.pass.cpp b/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.ctors/copy_ctor.pass.cpp index bed1f6b212d..1a9edda9fbf 100644 --- a/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.ctors/copy_ctor.pass.cpp +++ b/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.ctors/copy_ctor.pass.cpp @@ -21,6 +21,6 @@ using std::experimental::propagate_const; typedef propagate_const<X> P; -int main(int, char**) { static_assert(!std::is_constructible<P, const P &>::value, ""); +int main(int, char**) { static_assert(!std::is_constructible<P, const P &>::value, ""); return 0; } diff --git a/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.ctors/element_type.non-explicit.ctor.pass.cpp b/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.ctors/element_type.non-explicit.ctor.pass.cpp index 580d33d2057..e0a309d1b1d 100644 --- a/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.ctors/element_type.non-explicit.ctor.pass.cpp +++ b/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.ctors/element_type.non-explicit.ctor.pass.cpp @@ -25,6 +25,6 @@ void f(const P&) { } -int main(int, char**) { f(2); +int main(int, char**) { f(2); return 0; } diff --git a/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.non-const_observers/explicit_operator_element_type_ptr.pass.cpp b/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.non-const_observers/explicit_operator_element_type_ptr.pass.cpp index 08126f27cf1..5fe3371e578 100644 --- a/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.non-const_observers/explicit_operator_element_type_ptr.pass.cpp +++ b/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.non-const_observers/explicit_operator_element_type_ptr.pass.cpp @@ -21,6 +21,6 @@ using std::experimental::propagate_const; typedef propagate_const<X> P; -int main(int, char**) { static_assert(!std::is_convertible<P, int *>::value, ""); +int main(int, char**) { static_assert(!std::is_convertible<P, int *>::value, ""); return 0; } diff --git a/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.observers/operator_element_type_ptr.pass.cpp b/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.observers/operator_element_type_ptr.pass.cpp index 652ef2b853f..67d5ab802d4 100644 --- a/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.observers/operator_element_type_ptr.pass.cpp +++ b/libcxx/test/std/experimental/utilities/propagate_const/propagate_const.class/propagate_const.observers/operator_element_type_ptr.pass.cpp @@ -25,6 +25,6 @@ constexpr P p(1); constexpr const int *ptr_1 = p; -int main(int, char**) { assert(*ptr_1 == 1); +int main(int, char**) { assert(*ptr_1 == 1); return 0; } diff --git a/libcxx/test/std/input.output/filesystems/fs.req.macros/feature_macro.pass.cpp b/libcxx/test/std/input.output/filesystems/fs.req.macros/feature_macro.pass.cpp index dad1868bee3..6b7052b2403 100644 --- a/libcxx/test/std/input.output/filesystems/fs.req.macros/feature_macro.pass.cpp +++ b/libcxx/test/std/input.output/filesystems/fs.req.macros/feature_macro.pass.cpp @@ -25,6 +25,6 @@ #endif #endif -int main(int, char**) { +int main(int, char**) { return 0; } diff --git a/libcxx/test/std/iterators/iterator.container/ssize.pass.cpp b/libcxx/test/std/iterators/iterator.container/ssize.pass.cpp index c34614dd0de..886824e3944 100644 --- a/libcxx/test/std/iterators/iterator.container/ssize.pass.cpp +++ b/libcxx/test/std/iterators/iterator.container/ssize.pass.cpp @@ -115,6 +115,6 @@ int main(int, char**) static_assert( std::numeric_limits<std::make_signed_t<decltype(std:: size(sc))>>::max() < 60000, ""); assert (std::ssize(sc) == 60000); LIBCPP_ASSERT_NOT_NOEXCEPT(std::ssize(sc)); - + return 0; } diff --git a/libcxx/test/std/numerics/bit/bit.pow.two/ceil2.pass.cpp b/libcxx/test/std/numerics/bit/bit.pow.two/ceil2.pass.cpp index a469fad9257..5b66aca1400 100644 --- a/libcxx/test/std/numerics/bit/bit.pow.two/ceil2.pass.cpp +++ b/libcxx/test/std/numerics/bit/bit.pow.two/ceil2.pass.cpp @@ -6,14 +6,14 @@ // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// -// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17 +// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17 // template <class T> // constexpr T ceil2(T x) noexcept; -// Returns: The minimal value y such that ispow2(y) is true and y >= x; +// Returns: The minimal value y such that ispow2(y) is true and y >= x; // if y is not representable as a value of type T, the result is an unspecified value. -// Remarks: This function shall not participate in overload resolution unless +// Remarks: This function shall not participate in overload resolution unless // T is an unsigned integer type #include <bit> @@ -49,7 +49,7 @@ void runtime_test() { ASSERT_SAME_TYPE(T, decltype(std::ceil2(T(0)))); LIBCPP_ASSERT_NOEXCEPT( std::ceil2(T(0))); - + assert( std::ceil2(T(60)) == T( 64)); assert( std::ceil2(T(61)) == T( 64)); assert( std::ceil2(T(62)) == T( 64)); @@ -64,11 +64,11 @@ void runtime_test() int main() { - + { auto lambda = [](auto x) -> decltype(std::ceil2(x)) {}; using L = decltype(lambda); - + static_assert( std::is_invocable_v<L, unsigned char>, ""); static_assert( std::is_invocable_v<L, unsigned int>, ""); static_assert( std::is_invocable_v<L, unsigned long>, ""); @@ -104,7 +104,7 @@ int main() static_assert( std::is_invocable_v<L, __uint128_t>, ""); static_assert(!std::is_invocable_v<L, __int128_t>, ""); #endif - + static_assert(!std::is_invocable_v<L, A>, ""); static_assert(!std::is_invocable_v<L, E1>, ""); static_assert(!std::is_invocable_v<L, E2>, ""); diff --git a/libcxx/test/std/numerics/bit/bit.pow.two/floor2.pass.cpp b/libcxx/test/std/numerics/bit/bit.pow.two/floor2.pass.cpp index f6d183d5be1..9b4251c99bf 100644 --- a/libcxx/test/std/numerics/bit/bit.pow.two/floor2.pass.cpp +++ b/libcxx/test/std/numerics/bit/bit.pow.two/floor2.pass.cpp @@ -6,13 +6,13 @@ // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// -// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17 +// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17 // template <class T> // constexpr T floor2(T x) noexcept; // Returns: If x == 0, 0; otherwise the maximal value y such that floor2(y) is true and y <= x. -// Remarks: This function shall not participate in overload resolution unless +// Remarks: This function shall not participate in overload resolution unless // T is an unsigned integer type #include <bit> @@ -67,7 +67,7 @@ int main() { auto lambda = [](auto x) -> decltype(std::floor2(x)) {}; using L = decltype(lambda); - + static_assert( std::is_invocable_v<L, unsigned char>, ""); static_assert( std::is_invocable_v<L, unsigned int>, ""); static_assert( std::is_invocable_v<L, unsigned long>, ""); @@ -103,7 +103,7 @@ int main() static_assert( std::is_invocable_v<L, __uint128_t>, ""); static_assert(!std::is_invocable_v<L, __int128_t>, ""); #endif - + static_assert(!std::is_invocable_v<L, A>, ""); static_assert(!std::is_invocable_v<L, E1>, ""); static_assert(!std::is_invocable_v<L, E2>, ""); diff --git a/libcxx/test/std/numerics/bit/bit.pow.two/ispow2.pass.cpp b/libcxx/test/std/numerics/bit/bit.pow.two/ispow2.pass.cpp index d65f8189896..6d60539f249 100644 --- a/libcxx/test/std/numerics/bit/bit.pow.two/ispow2.pass.cpp +++ b/libcxx/test/std/numerics/bit/bit.pow.two/ispow2.pass.cpp @@ -6,12 +6,12 @@ // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// -// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17 +// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17 // template <class T> // constexpr bool ispow2(T x) noexcept; -// Remarks: This function shall not participate in overload resolution unless +// Remarks: This function shall not participate in overload resolution unless // T is an unsigned integer type #include <bit> @@ -65,7 +65,7 @@ int main() { auto lambda = [](auto x) -> decltype(std::ispow2(x)) {}; using L = decltype(lambda); - + static_assert( std::is_invocable_v<L, unsigned char>, ""); static_assert( std::is_invocable_v<L, unsigned int>, ""); static_assert( std::is_invocable_v<L, unsigned long>, ""); @@ -101,7 +101,7 @@ int main() static_assert( std::is_invocable_v<L, __uint128_t>, ""); static_assert(!std::is_invocable_v<L, __int128_t>, ""); #endif - + static_assert(!std::is_invocable_v<L, A>, ""); static_assert(!std::is_invocable_v<L, E1>, ""); static_assert(!std::is_invocable_v<L, E2>, ""); diff --git a/libcxx/test/std/numerics/bit/bit.pow.two/log2p1.pass.cpp b/libcxx/test/std/numerics/bit/bit.pow.two/log2p1.pass.cpp index 39054bcf905..55df3f1035e 100644 --- a/libcxx/test/std/numerics/bit/bit.pow.two/log2p1.pass.cpp +++ b/libcxx/test/std/numerics/bit/bit.pow.two/log2p1.pass.cpp @@ -6,14 +6,14 @@ // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// -// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17 +// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17 // template <class T> // constexpr T log2p1(T x) noexcept; // If x == 0, 0; otherwise one plus the base-2 logarithm of x, with any fractional part discarded. -// Remarks: This function shall not participate in overload resolution unless +// Remarks: This function shall not participate in overload resolution unless // T is an unsigned integer type #include <bit> @@ -79,7 +79,7 @@ int main() { auto lambda = [](auto x) -> decltype(std::log2p1(x)) {}; using L = decltype(lambda); - + static_assert( std::is_invocable_v<L, unsigned char>, ""); static_assert( std::is_invocable_v<L, unsigned int>, ""); static_assert( std::is_invocable_v<L, unsigned long>, ""); @@ -115,7 +115,7 @@ int main() static_assert( std::is_invocable_v<L, __uint128_t>, ""); static_assert(!std::is_invocable_v<L, __int128_t>, ""); #endif - + static_assert(!std::is_invocable_v<L, A>, ""); static_assert(!std::is_invocable_v<L, E1>, ""); static_assert(!std::is_invocable_v<L, E2>, ""); diff --git a/libcxx/test/std/numerics/bit/bitops.count/countl_one.pass.cpp b/libcxx/test/std/numerics/bit/bitops.count/countl_one.pass.cpp index 28cb52545c0..f7d837ed396 100644 --- a/libcxx/test/std/numerics/bit/bitops.count/countl_one.pass.cpp +++ b/libcxx/test/std/numerics/bit/bitops.count/countl_one.pass.cpp @@ -6,7 +6,7 @@ // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// -// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17 +// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17 // template <class T> // constexpr int countl_one(T x) noexcept; @@ -14,7 +14,7 @@ // The number of consecutive 1 bits, starting from the most significant bit. // [ Note: Returns N if x == std::numeric_limits<T>::max(). ] // -// Remarks: This function shall not participate in overload resolution unless +// Remarks: This function shall not participate in overload resolution unless // T is an unsigned integer type #include <bit> @@ -71,7 +71,7 @@ int main() { auto lambda = [](auto x) -> decltype(std::countl_one(x)) {}; using L = decltype(lambda); - + static_assert( std::is_invocable_v<L, unsigned char>, ""); static_assert( std::is_invocable_v<L, unsigned int>, ""); static_assert( std::is_invocable_v<L, unsigned long>, ""); @@ -107,7 +107,7 @@ int main() static_assert( std::is_invocable_v<L, __uint128_t>, ""); static_assert(!std::is_invocable_v<L, __int128_t>, ""); #endif - + static_assert(!std::is_invocable_v<L, A>, ""); static_assert(!std::is_invocable_v<L, E1>, ""); static_assert(!std::is_invocable_v<L, E2>, ""); diff --git a/libcxx/test/std/numerics/bit/bitops.count/countl_zero.pass.cpp b/libcxx/test/std/numerics/bit/bitops.count/countl_zero.pass.cpp index af39dc2905c..d984f4de564 100644 --- a/libcxx/test/std/numerics/bit/bitops.count/countl_zero.pass.cpp +++ b/libcxx/test/std/numerics/bit/bitops.count/countl_zero.pass.cpp @@ -6,7 +6,7 @@ // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// -// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17 +// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17 // template <class T> // constexpr int countl_zero(T x) noexcept; @@ -14,7 +14,7 @@ // Returns: The number of consecutive 0 bits, starting from the most significant bit. // [ Note: Returns N if x == 0. ] // -// Remarks: This function shall not participate in overload resolution unless +// Remarks: This function shall not participate in overload resolution unless // T is an unsigned integer type #include <bit> @@ -72,7 +72,7 @@ int main() { auto lambda = [](auto x) -> decltype(std::countl_zero(x)) {}; using L = decltype(lambda); - + static_assert( std::is_invocable_v<L, unsigned char>, ""); static_assert( std::is_invocable_v<L, unsigned int>, ""); static_assert( std::is_invocable_v<L, unsigned long>, ""); @@ -108,7 +108,7 @@ int main() static_assert( std::is_invocable_v<L, __uint128_t>, ""); static_assert(!std::is_invocable_v<L, __int128_t>, ""); #endif - + static_assert(!std::is_invocable_v<L, A>, ""); static_assert(!std::is_invocable_v<L, E1>, ""); static_assert(!std::is_invocable_v<L, E2>, ""); diff --git a/libcxx/test/std/numerics/bit/bitops.count/countr_one.pass.cpp b/libcxx/test/std/numerics/bit/bitops.count/countr_one.pass.cpp index e82b1f365e1..96d1a93af3f 100644 --- a/libcxx/test/std/numerics/bit/bitops.count/countr_one.pass.cpp +++ b/libcxx/test/std/numerics/bit/bitops.count/countr_one.pass.cpp @@ -6,7 +6,7 @@ // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// -// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17 +// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17 // template <class T> // constexpr int countr_one(T x) noexcept; @@ -14,7 +14,7 @@ // Returns: The number of consecutive 1 bits, starting from the least significant bit. // [ Note: Returns N if x == std::numeric_limits<T>::max(). ] // -// Remarks: This function shall not participate in overload resolution unless +// Remarks: This function shall not participate in overload resolution unless // T is an unsigned integer type #include <bit> @@ -71,7 +71,7 @@ int main() { auto lambda = [](auto x) -> decltype(std::countr_one(x)) {}; using L = decltype(lambda); - + static_assert( std::is_invocable_v<L, unsigned char>, ""); static_assert( std::is_invocable_v<L, unsigned int>, ""); static_assert( std::is_invocable_v<L, unsigned long>, ""); @@ -107,7 +107,7 @@ int main() static_assert( std::is_invocable_v<L, __uint128_t>, ""); static_assert(!std::is_invocable_v<L, __int128_t>, ""); #endif - + static_assert(!std::is_invocable_v<L, A>, ""); static_assert(!std::is_invocable_v<L, E1>, ""); static_assert(!std::is_invocable_v<L, E2>, ""); diff --git a/libcxx/test/std/numerics/bit/bitops.count/countr_zero.pass.cpp b/libcxx/test/std/numerics/bit/bitops.count/countr_zero.pass.cpp index 8d355bfb51b..730b645e76c 100644 --- a/libcxx/test/std/numerics/bit/bitops.count/countr_zero.pass.cpp +++ b/libcxx/test/std/numerics/bit/bitops.count/countr_zero.pass.cpp @@ -6,7 +6,7 @@ // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// -// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17 +// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17 // template <class T> // constexpr int countr_zero(T x) noexcept; @@ -14,7 +14,7 @@ // Returns: The number of consecutive 0 bits, starting from the most significant bit. // [ Note: Returns N if x == 0. ] // -// Remarks: This function shall not participate in overload resolution unless +// Remarks: This function shall not participate in overload resolution unless // T is an unsigned integer type #include <bit> @@ -71,7 +71,7 @@ int main() { auto lambda = [](auto x) -> decltype(std::countr_zero(x)) {}; using L = decltype(lambda); - + static_assert( std::is_invocable_v<L, unsigned char>, ""); static_assert( std::is_invocable_v<L, unsigned int>, ""); static_assert( std::is_invocable_v<L, unsigned long>, ""); @@ -107,7 +107,7 @@ int main() static_assert( std::is_invocable_v<L, __uint128_t>, ""); static_assert(!std::is_invocable_v<L, __int128_t>, ""); #endif - + static_assert(!std::is_invocable_v<L, A>, ""); static_assert(!std::is_invocable_v<L, E1>, ""); static_assert(!std::is_invocable_v<L, E2>, ""); diff --git a/libcxx/test/std/numerics/bit/bitops.count/popcount.pass.cpp b/libcxx/test/std/numerics/bit/bitops.count/popcount.pass.cpp index e3934a1318d..adc044cc073 100644 --- a/libcxx/test/std/numerics/bit/bitops.count/popcount.pass.cpp +++ b/libcxx/test/std/numerics/bit/bitops.count/popcount.pass.cpp @@ -6,14 +6,14 @@ // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// -// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17 +// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17 // template <class T> // constexpr int popcount(T x) noexcept; // Returns: The number of bits set to one in the value of x. // -// Remarks: This function shall not participate in overload resolution unless +// Remarks: This function shall not participate in overload resolution unless // T is an unsigned integer type #include <bit> @@ -69,7 +69,7 @@ int main() { auto lambda = [](auto x) -> decltype(std::popcount(x)) {}; using L = decltype(lambda); - + static_assert( std::is_invocable_v<L, unsigned char>, ""); static_assert( std::is_invocable_v<L, unsigned int>, ""); static_assert( std::is_invocable_v<L, unsigned long>, ""); @@ -105,7 +105,7 @@ int main() static_assert( std::is_invocable_v<L, __uint128_t>, ""); static_assert(!std::is_invocable_v<L, __int128_t>, ""); #endif - + static_assert(!std::is_invocable_v<L, A>, ""); static_assert(!std::is_invocable_v<L, E1>, ""); static_assert(!std::is_invocable_v<L, E2>, ""); diff --git a/libcxx/test/std/numerics/bit/bitops.rot/rotl.pass.cpp b/libcxx/test/std/numerics/bit/bitops.rot/rotl.pass.cpp index 84ffe5b84a8..b408f5a3f3f 100644 --- a/libcxx/test/std/numerics/bit/bitops.rot/rotl.pass.cpp +++ b/libcxx/test/std/numerics/bit/bitops.rot/rotl.pass.cpp @@ -6,12 +6,12 @@ // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// -// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17 +// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17 // template <class T> // constexpr int rotl(T x, unsigned int s) noexcept; -// Remarks: This function shall not participate in overload resolution unless +// Remarks: This function shall not participate in overload resolution unless // T is an unsigned integer type #include <bit> @@ -55,7 +55,7 @@ void runtime_test() ASSERT_SAME_TYPE(T, decltype(std::rotl(T(0), 0))); ASSERT_NOEXCEPT( std::rotl(T(0), 0)); const T val = std::numeric_limits<T>::max() - 1; - + assert( std::rotl(val, 0) == val); assert( std::rotl(val, 1) == T((val << 1) + 1)); assert( std::rotl(val, 2) == T((val << 2) + 3)); @@ -72,7 +72,7 @@ int main() { auto lambda = [](auto x) -> decltype(std::rotl(x, 1U)) {}; using L = decltype(lambda); - + static_assert( std::is_invocable_v<L, unsigned char>, ""); static_assert( std::is_invocable_v<L, unsigned int>, ""); static_assert( std::is_invocable_v<L, unsigned long>, ""); @@ -108,12 +108,12 @@ int main() static_assert( std::is_invocable_v<L, __uint128_t>, ""); static_assert(!std::is_invocable_v<L, __int128_t>, ""); #endif - + static_assert(!std::is_invocable_v<L, A>, ""); static_assert(!std::is_invocable_v<L, E1>, ""); static_assert(!std::is_invocable_v<L, E2>, ""); } - + static_assert(constexpr_test<unsigned char>(), ""); static_assert(constexpr_test<unsigned short>(), ""); static_assert(constexpr_test<unsigned>(), ""); diff --git a/libcxx/test/std/numerics/bit/bitops.rot/rotr.pass.cpp b/libcxx/test/std/numerics/bit/bitops.rot/rotr.pass.cpp index 4cd642f7374..7f1b29df15c 100644 --- a/libcxx/test/std/numerics/bit/bitops.rot/rotr.pass.cpp +++ b/libcxx/test/std/numerics/bit/bitops.rot/rotr.pass.cpp @@ -6,12 +6,12 @@ // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// -// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17 +// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17 // template <class T> // constexpr int rotr(T x, unsigned int s) noexcept; -// Remarks: This function shall not participate in overload resolution unless +// Remarks: This function shall not participate in overload resolution unless // T is an unsigned integer type #include <bit> @@ -69,7 +69,7 @@ void runtime_test() max - (max >> 6), // FC0 .. 0 max - (max >> 7), // FE0 .. 0 }; - + assert( std::rotr(val, 0) == val); assert( std::rotr(val, 1) == T((val >> 1) + uppers[1])); assert( std::rotr(val, 2) == T((val >> 2) + uppers[2])); @@ -82,11 +82,11 @@ void runtime_test() int main() { - + { auto lambda = [](auto x) -> decltype(std::rotr(x, 1U)) {}; using L = decltype(lambda); - + static_assert( std::is_invocable_v<L, unsigned char>, ""); static_assert( std::is_invocable_v<L, unsigned int>, ""); static_assert( std::is_invocable_v<L, unsigned long>, ""); @@ -122,7 +122,7 @@ int main() static_assert( std::is_invocable_v<L, __uint128_t>, ""); static_assert(!std::is_invocable_v<L, __int128_t>, ""); #endif - + static_assert(!std::is_invocable_v<L, A, unsigned>, ""); static_assert(!std::is_invocable_v<L, E1, unsigned>, ""); static_assert(!std::is_invocable_v<L, E2, unsigned>, ""); diff --git a/libcxx/test/std/numerics/c.math/c.math.lerp/c.math.lerp.pass.cpp b/libcxx/test/std/numerics/c.math/c.math.lerp/c.math.lerp.pass.cpp index 2ab41c18225..7d9ceef8b48 100644 --- a/libcxx/test/std/numerics/c.math/c.math.lerp/c.math.lerp.pass.cpp +++ b/libcxx/test/std/numerics/c.math/c.math.lerp/c.math.lerp.pass.cpp @@ -45,7 +45,7 @@ void test() assert((std::lerp(T( 0), T(12), T(1)) == T(12))); assert((std::lerp(T(12), T( 0), T(0)) == T(12))); assert((std::lerp(T(12), T( 0), T(1)) == T(0))); - + assert((std::lerp(T( 0), T(12), T(0.5)) == T(6))); assert((std::lerp(T(12), T( 0), T(0.5)) == T(6))); assert((std::lerp(T( 0), T(12), T(2)) == T(24))); @@ -66,10 +66,10 @@ int main(int, char**) static_assert(constexpr_test<float>(), ""); static_assert(constexpr_test<double>(), ""); static_assert(constexpr_test<long double>(), ""); - + test<float>(); test<double>(); test<long double>(); - + return 0; } diff --git a/libcxx/test/std/numerics/complex.number/complex.ops/complex_not_equals_scalar.pass.cpp b/libcxx/test/std/numerics/complex.number/complex.ops/complex_not_equals_scalar.pass.cpp index 69c71cde043..35074e5772d 100644 --- a/libcxx/test/std/numerics/complex.number/complex.ops/complex_not_equals_scalar.pass.cpp +++ b/libcxx/test/std/numerics/complex.number/complex.ops/complex_not_equals_scalar.pass.cpp @@ -79,6 +79,6 @@ int main(int, char**) test<double>(); test<long double>(); // test_constexpr<int> (); - + return 0; } diff --git a/libcxx/test/std/numerics/numeric.ops/numeric.ops.midpoint/midpoint.fail.cpp b/libcxx/test/std/numerics/numeric.ops/numeric.ops.midpoint/midpoint.fail.cpp index c7576108af5..0e08d06d3e9 100644 --- a/libcxx/test/std/numerics/numeric.ops/numeric.ops.midpoint/midpoint.fail.cpp +++ b/libcxx/test/std/numerics/numeric.ops/numeric.ops.midpoint/midpoint.fail.cpp @@ -34,6 +34,6 @@ int main(int, char**) (void) std::midpoint(func1, func2); // expected-error {{no matching function for call to 'midpoint'}} (void) std::midpoint(ip, ip); // expected-error {{no matching function for call to 'midpoint'}} (void) std::midpoint(vp, vp); // expected-error {{no matching function for call to 'midpoint'}} - + return 0; } diff --git a/libcxx/test/std/numerics/numeric.ops/numeric.ops.midpoint/midpoint.integer.pass.cpp b/libcxx/test/std/numerics/numeric.ops/numeric.ops.midpoint/midpoint.integer.pass.cpp index 1956c97c987..be960119ac1 100644 --- a/libcxx/test/std/numerics/numeric.ops/numeric.ops.midpoint/midpoint.integer.pass.cpp +++ b/libcxx/test/std/numerics/numeric.ops/numeric.ops.midpoint/midpoint.integer.pass.cpp @@ -31,7 +31,7 @@ void signed_test() ASSERT_SAME_TYPE(decltype(std::midpoint(T(), T())), T); ASSERT_NOEXCEPT( std::midpoint(T(), T())); using limits = std::numeric_limits<T>; - + static_assert(std::midpoint(one, three) == two, ""); static_assert(std::midpoint(three, one) == two, ""); @@ -53,7 +53,7 @@ void signed_test() assert(std::midpoint(T( 4), T(-3)) == T(1)); assert(std::midpoint(T(-3), T(-4)) == T(-3)); assert(std::midpoint(T(-4), T(-3)) == T(-4)); - + static_assert(std::midpoint(limits::min(), limits::max()) == T(-1), ""); static_assert(std::midpoint(limits::max(), limits::min()) == T( 0), ""); @@ -81,7 +81,7 @@ void unsigned_test() ASSERT_NOEXCEPT( std::midpoint(T(), T())); using limits = std::numeric_limits<T>; const T half_way = (limits::max() - limits::min())/2; - + static_assert(std::midpoint(one, three) == two, ""); static_assert(std::midpoint(three, one) == two, ""); @@ -94,7 +94,7 @@ void unsigned_test() assert(std::midpoint(four, one) == three); assert(std::midpoint(three, four) == three); assert(std::midpoint(four, three) == four); - + assert(std::midpoint(limits::min(), limits::max()) == T(half_way)); assert(std::midpoint(limits::max(), limits::min()) == T(half_way + 1)); diff --git a/libcxx/test/std/strings/c.strings/cwctype.pass.cpp b/libcxx/test/std/strings/c.strings/cwctype.pass.cpp index 3bcda1a472c..99027d9e934 100644 --- a/libcxx/test/std/strings/c.strings/cwctype.pass.cpp +++ b/libcxx/test/std/strings/c.strings/cwctype.pass.cpp @@ -107,7 +107,7 @@ int main(int, char**) ASSERT_SAME_TYPE(int, decltype(std::iswxdigit(w))); ASSERT_SAME_TYPE(int, decltype(std::iswctype(w, std::wctype_t()))); - + ASSERT_SAME_TYPE(std::wctype_t, decltype(std::wctype(""))); ASSERT_SAME_TYPE(std::wint_t, decltype(std::towlower(w))); ASSERT_SAME_TYPE(std::wint_t, decltype(std::towupper(w))); diff --git a/libcxx/test/std/strings/char.traits/char.traits.specializations/char.traits.specializations.char8_t/length.pass.cpp b/libcxx/test/std/strings/char.traits/char.traits.specializations/char.traits.specializations.char8_t/length.pass.cpp index 419366cd18c..a0cb0f6b4c5 100644 --- a/libcxx/test/std/strings/char.traits/char.traits.specializations/char.traits.specializations.char8_t/length.pass.cpp +++ b/libcxx/test/std/strings/char.traits/char.traits.specializations/char.traits.specializations.char8_t/length.pass.cpp @@ -37,7 +37,7 @@ int main(int, char**) return 0; } #else -int main(int, char**) { +int main(int, char**) { return 0; } #endif diff --git a/libcxx/test/std/strings/string.view/string_view.literals/literal.pass.cpp b/libcxx/test/std/strings/string.view/string_view.literals/literal.pass.cpp index a8a1dff6404..fc795e723d5 100644 --- a/libcxx/test/std/strings/string.view/string_view.literals/literal.pass.cpp +++ b/libcxx/test/std/strings/string.view/string_view.literals/literal.pass.cpp @@ -39,7 +39,7 @@ int main(int, char**) std::u16string_view ufoo; std::u32string_view Ufoo; - + foo = ""sv; assert( foo.size() == 0); u8foo = u8""sv; assert(u8foo.size() == 0); Lfoo = L""sv; assert( Lfoo.size() == 0); diff --git a/libcxx/test/std/strings/strings.erasure/erase.pass.cpp b/libcxx/test/std/strings/strings.erasure/erase.pass.cpp index 5013300d28b..26d6b8674e8 100644 --- a/libcxx/test/std/strings/strings.erasure/erase.pass.cpp +++ b/libcxx/test/std/strings/strings.erasure/erase.pass.cpp @@ -11,7 +11,7 @@ // template <class charT, class traits, class Allocator, class U> // void erase(basic_string<charT, traits, Allocator>& c, const U& value); - + #include <string> #include <optional> diff --git a/libcxx/test/std/strings/strings.erasure/erase_if.pass.cpp b/libcxx/test/std/strings/strings.erasure/erase_if.pass.cpp index 5f2fb0117f8..30a58c0e646 100644 --- a/libcxx/test/std/strings/strings.erasure/erase_if.pass.cpp +++ b/libcxx/test/std/strings/strings.erasure/erase_if.pass.cpp @@ -10,7 +10,7 @@ // <string> // template <class charT, class traits, class Allocator, class Predicate> -// void erase_if(basic_string<charT, traits, Allocator>& c, Predicate pred); +// void erase_if(basic_string<charT, traits, Allocator>& c, Predicate pred); #include <string> @@ -37,7 +37,7 @@ void test() auto isD = [](auto ch) { return ch == 'd';}; auto True = [](auto) { return true; }; auto False = [](auto) { return false; }; - + test0(S(""), isA, S("")); test0(S("a"), isA, S("")); diff --git a/libcxx/test/std/utilities/meta/meta.trans/meta.trans.other/underlying_type.fail.cpp b/libcxx/test/std/utilities/meta/meta.trans/meta.trans.other/underlying_type.fail.cpp index 9f762ad7e34..a6a8c0cd35d 100644 --- a/libcxx/test/std/utilities/meta/meta.trans/meta.trans.other/underlying_type.fail.cpp +++ b/libcxx/test/std/utilities/meta/meta.trans/meta.trans.other/underlying_type.fail.cpp @@ -18,7 +18,7 @@ enum E1 { E1Zero, E1One, E1Two = sizeof(std::underlying_type<E1>::type) }; // expected-error@type_traits:* {{cannot determine underlying type of incomplete enumeration type 'E1'}} -// None of these are incomplete. +// None of these are incomplete. // Scoped enums have an underlying type of 'int' unless otherwise specified // Unscoped enums with a specified underlying type become complete as soon as that type is specified. // enum E2 : char { E2Zero, E2One, E2Two = sizeof(std::underlying_type<E2>::type) }; diff --git a/libcxx/test/std/utilities/meta/meta.unary/meta.unary.comp/is_unbounded_array.pass.cpp b/libcxx/test/std/utilities/meta/meta.unary/meta.unary.comp/is_unbounded_array.pass.cpp index 5e587f4058d..e146df63566 100644 --- a/libcxx/test/std/utilities/meta/meta.unary/meta.unary.comp/is_unbounded_array.pass.cpp +++ b/libcxx/test/std/utilities/meta/meta.unary/meta.unary.comp/is_unbounded_array.pass.cpp @@ -63,7 +63,7 @@ int main(int, char**) test_array<Abstract, false>(); test_array<Enum, false>(); test_array<FunctionPtr, false>(); - + // Array types test_array<array, false>(); test_array<incomplete_array, true>(); diff --git a/libcxx/test/std/utilities/optional/optional.object/optional.object.ctor/ctor.fail.cpp b/libcxx/test/std/utilities/optional/optional.object/optional.object.ctor/ctor.fail.cpp index 9a646a18154..afde18518cf 100644 --- a/libcxx/test/std/utilities/optional/optional.object/optional.object.ctor/ctor.fail.cpp +++ b/libcxx/test/std/utilities/optional/optional.object/optional.object.ctor/ctor.fail.cpp @@ -9,7 +9,7 @@ // UNSUPPORTED: c++98, c++03, c++11, c++14 // <optional> -// T shall be an object type other than cv in_place_t or cv nullopt_t +// T shall be an object type other than cv in_place_t or cv nullopt_t // and shall satisfy the Cpp17Destructible requirements. // Note: array types do not satisfy the Cpp17Destructible requirements. diff --git a/libcxx/test/std/utilities/smartptr/unique.ptr/unique.ptr.class/unique.ptr.modifiers/reset_self.pass.cpp b/libcxx/test/std/utilities/smartptr/unique.ptr/unique.ptr.class/unique.ptr.modifiers/reset_self.pass.cpp index 7f60e416b8d..5285bca1637 100644 --- a/libcxx/test/std/utilities/smartptr/unique.ptr/unique.ptr.class/unique.ptr.modifiers/reset_self.pass.cpp +++ b/libcxx/test/std/utilities/smartptr/unique.ptr/unique.ptr.class/unique.ptr.modifiers/reset_self.pass.cpp @@ -23,6 +23,6 @@ struct A { void reset() { ptr_.reset(); } }; -int main(int, char**) { (new A)->reset(); +int main(int, char**) { (new A)->reset(); return 0; } diff --git a/libcxx/test/std/utilities/time/time.cal/time.cal.weekday/time.cal.weekday.members/ctor.local_days.pass.cpp b/libcxx/test/std/utilities/time/time.cal/time.cal.weekday/time.cal.weekday.members/ctor.local_days.pass.cpp index 3db78561fd2..d75b64cadf0 100644 --- a/libcxx/test/std/utilities/time/time.cal/time.cal.weekday/time.cal.weekday.members/ctor.local_days.pass.cpp +++ b/libcxx/test/std/utilities/time/time.cal/time.cal.weekday/time.cal.weekday.members/ctor.local_days.pass.cpp @@ -14,12 +14,12 @@ // // Effects: Constructs an object of type weekday by computing what day // of the week corresponds to the local_days dp, and representing -// that day of the week in wd_ +// that day of the week in wd_ // // Remarks: For any value ymd of type year_month_day for which ymd.ok() is true, // ymd == year_month_day{sys_days{ymd}} is true. -// -// [Example: +// +// [Example: // If dp represents 1970-01-01, the constructed weekday represents Thursday by storing 4 in wd_. // —end example] diff --git a/libcxx/test/std/utilities/time/time.cal/time.cal.weekday/time.cal.weekday.members/ctor.sys_days.pass.cpp b/libcxx/test/std/utilities/time/time.cal/time.cal.weekday/time.cal.weekday.members/ctor.sys_days.pass.cpp index 18d48a3801e..f8c4ab6898d 100644 --- a/libcxx/test/std/utilities/time/time.cal/time.cal.weekday/time.cal.weekday.members/ctor.sys_days.pass.cpp +++ b/libcxx/test/std/utilities/time/time.cal/time.cal.weekday/time.cal.weekday.members/ctor.sys_days.pass.cpp @@ -14,12 +14,12 @@ // // Effects: Constructs an object of type weekday by computing what day // of the week corresponds to the sys_days dp, and representing -// that day of the week in wd_ +// that day of the week in wd_ // // Remarks: For any value ymd of type year_month_day for which ymd.ok() is true, // ymd == year_month_day{sys_days{ymd}} is true. -// -// [Example: +// +// [Example: // If dp represents 1970-01-01, the constructed weekday represents Thursday by storing 4 in wd_. // —end example] diff --git a/libcxx/test/std/utilities/time/time.cal/time.cal.ymd/time.cal.ymd.members/ctor.sys_days.pass.cpp b/libcxx/test/std/utilities/time/time.cal/time.cal.ymd/time.cal.ymd.members/ctor.sys_days.pass.cpp index 433468477d5..09dc2351548 100644 --- a/libcxx/test/std/utilities/time/time.cal/time.cal.ymd/time.cal.ymd.members/ctor.sys_days.pass.cpp +++ b/libcxx/test/std/utilities/time/time.cal/time.cal.ymd/time.cal.ymd.members/ctor.sys_days.pass.cpp @@ -12,7 +12,7 @@ // constexpr year_month_day(const sys_days& dp) noexcept; // -// Effects: Constructs an object of type year_month_day that corresponds +// Effects: Constructs an object of type year_month_day that corresponds // to the date represented by dp. // // Remarks: For any value ymd of type year_month_day for which ymd.ok() is true, diff --git a/libcxx/test/std/utilities/time/time.cal/time.cal.ymd/time.cal.ymd.members/op.local_days.pass.cpp b/libcxx/test/std/utilities/time/time.cal/time.cal.ymd/time.cal.ymd.members/op.local_days.pass.cpp index 038d21c4670..28c13ab385d 100644 --- a/libcxx/test/std/utilities/time/time.cal/time.cal.ymd/time.cal.ymd.members/op.local_days.pass.cpp +++ b/libcxx/test/std/utilities/time/time.cal/time.cal.ymd/time.cal.ymd.members/op.local_days.pass.cpp @@ -41,7 +41,7 @@ void RunTheExample() static_assert(year_month_day{local_days{year{2017}/January/0}} == year{2016}/December/31); static_assert(year_month_day{local_days{year{2017}/January/31}} == year{2017}/January/31); - static_assert(year_month_day{local_days{year{2017}/January/32}} == year{2017}/February/1); + static_assert(year_month_day{local_days{year{2017}/January/32}} == year{2017}/February/1); } int main(int, char**) diff --git a/libcxx/test/std/utilities/time/time.cal/time.cal.ymd/time.cal.ymd.members/op.sys_days.pass.cpp b/libcxx/test/std/utilities/time/time.cal/time.cal.ymd/time.cal.ymd.members/op.sys_days.pass.cpp index 03d3bbbc895..f940f1498b9 100644 --- a/libcxx/test/std/utilities/time/time.cal/time.cal.ymd/time.cal.ymd.members/op.sys_days.pass.cpp +++ b/libcxx/test/std/utilities/time/time.cal/time.cal.ymd/time.cal.ymd.members/op.sys_days.pass.cpp @@ -41,7 +41,7 @@ void RunTheExample() static_assert(year_month_day{sys_days{year{2017}/January/0}} == year{2016}/December/31); static_assert(year_month_day{sys_days{year{2017}/January/31}} == year{2017}/January/31); - static_assert(year_month_day{sys_days{year{2017}/January/32}} == year{2017}/February/1); + static_assert(year_month_day{sys_days{year{2017}/January/32}} == year{2017}/February/1); } int main(int, char**) diff --git a/libcxx/test/std/utilities/time/time.cal/time.cal.ymdlast/time.cal.ymdlast.members/op_local_days.pass.cpp b/libcxx/test/std/utilities/time/time.cal/time.cal.ymdlast/time.cal.ymdlast.members/op_local_days.pass.cpp index a96dff338be..ee3b8246b10 100644 --- a/libcxx/test/std/utilities/time/time.cal/time.cal.ymdlast/time.cal.ymdlast.members/op_local_days.pass.cpp +++ b/libcxx/test/std/utilities/time/time.cal/time.cal.ymdlast/time.cal.ymdlast.members/op_local_days.pass.cpp @@ -33,7 +33,7 @@ int main(int, char**) { // Last day in Jan 1970 was the 31st constexpr year_month_day_last ymdl{year{1970}, month_day_last{std::chrono::January}}; constexpr local_days sd{ymdl}; - + static_assert(sd.time_since_epoch() == days{30}, ""); } diff --git a/libcxx/test/std/utilities/time/time.cal/time.cal.ymdlast/time.cal.ymdlast.members/op_sys_days.pass.cpp b/libcxx/test/std/utilities/time/time.cal/time.cal.ymdlast/time.cal.ymdlast.members/op_sys_days.pass.cpp index 250ca0f1123..43a879f62fe 100644 --- a/libcxx/test/std/utilities/time/time.cal/time.cal.ymdlast/time.cal.ymdlast.members/op_sys_days.pass.cpp +++ b/libcxx/test/std/utilities/time/time.cal/time.cal.ymdlast/time.cal.ymdlast.members/op_sys_days.pass.cpp @@ -33,7 +33,7 @@ int main(int, char**) { // Last day in Jan 1970 was the 31st constexpr year_month_day_last ymdl{year{1970}, month_day_last{std::chrono::January}}; constexpr sys_days sd{ymdl}; - + static_assert(sd.time_since_epoch() == days{30}, ""); } diff --git a/libcxx/test/std/utilities/time/time.cal/time.cal.ymwdlast/time.cal.ymwdlast.members/op_local_days.pass.cpp b/libcxx/test/std/utilities/time/time.cal/time.cal.ymwdlast/time.cal.ymwdlast.members/op_local_days.pass.cpp index c663406ee43..f6d1b5a2f80 100644 --- a/libcxx/test/std/utilities/time/time.cal/time.cal.ymwdlast/time.cal.ymwdlast.members/op_local_days.pass.cpp +++ b/libcxx/test/std/utilities/time/time.cal/time.cal.ymwdlast/time.cal.ymwdlast.members/op_local_days.pass.cpp @@ -33,7 +33,7 @@ int main(int, char**) { // Last day in Jan 1970 was the 31st constexpr year_month_day_last ymdl{year{1970}, month_day_last{std::chrono::January}}; constexpr local_days sd{ymdl}; - + static_assert(sd.time_since_epoch() == days{30}, ""); } diff --git a/libcxx/test/std/utilities/time/time.clock/time.clock.file/file_time.pass.cpp b/libcxx/test/std/utilities/time/time.clock/time.clock.file/file_time.pass.cpp index 61d92381fc8..46b81d5702a 100644 --- a/libcxx/test/std/utilities/time/time.clock/time.clock.file/file_time.pass.cpp +++ b/libcxx/test/std/utilities/time/time.clock/time.clock.file/file_time.pass.cpp @@ -27,4 +27,4 @@ int main(int, char**) { test<std::chrono::hours>(); return 0; -}
\ No newline at end of file +} diff --git a/libcxx/test/std/utilities/time/time.clock/time.clock.system/local_time.types.pass.cpp b/libcxx/test/std/utilities/time/time.clock/time.clock.system/local_time.types.pass.cpp index 5802166c876..e1ba2e3a410 100644 --- a/libcxx/test/std/utilities/time/time.clock/time.clock.system/local_time.types.pass.cpp +++ b/libcxx/test/std/utilities/time/time.clock/time.clock.system/local_time.types.pass.cpp @@ -15,8 +15,8 @@ // using local_seconds = sys_time<seconds>; // using local_days = sys_time<days>; -// [Example: -// sys_seconds{sys_days{1970y/January/1}}.time_since_epoch() is 0s. +// [Example: +// sys_seconds{sys_days{1970y/January/1}}.time_since_epoch() is 0s. // sys_seconds{sys_days{2000y/January/1}}.time_since_epoch() is 946’684’800s, which is 10’957 * 86’400s. // —end example] @@ -34,7 +34,7 @@ int main(int, char**) using seconds = std::chrono::seconds; using minutes = std::chrono::minutes; using days = std::chrono::days; - + using local_seconds = std::chrono::local_seconds; using local_minutes = std::chrono::local_time<minutes>; using local_days = std::chrono::local_days; @@ -48,7 +48,7 @@ int main(int, char**) ASSERT_SAME_TYPE(std::chrono::time_point<local_t, seconds>, local_seconds); ASSERT_SAME_TYPE(std::chrono::time_point<local_t, minutes>, local_minutes); ASSERT_SAME_TYPE(std::chrono::time_point<local_t, days>, local_days); - + // Test some well known values local_days d0 = local_days{year{1970}/January/1}; local_days d1 = local_days{year{2000}/January/1}; diff --git a/libcxx/test/std/utilities/time/time.clock/time.clock.system/sys.time.types.pass.cpp b/libcxx/test/std/utilities/time/time.clock/time.clock.system/sys.time.types.pass.cpp index 174fbe94144..94b94b23468 100644 --- a/libcxx/test/std/utilities/time/time.clock/time.clock.system/sys.time.types.pass.cpp +++ b/libcxx/test/std/utilities/time/time.clock/time.clock.system/sys.time.types.pass.cpp @@ -14,8 +14,8 @@ // using sys_seconds = sys_time<seconds>; // using sys_days = sys_time<days>; -// [Example: -// sys_seconds{sys_days{1970y/January/1}}.time_since_epoch() is 0s. +// [Example: +// sys_seconds{sys_days{1970y/January/1}}.time_since_epoch() is 0s. // sys_seconds{sys_days{2000y/January/1}}.time_since_epoch() is 946’684’800s, which is 10’957 * 86’400s. // —end example] @@ -33,7 +33,7 @@ int main(int, char**) using seconds = std::chrono::seconds; using minutes = std::chrono::minutes; using days = std::chrono::days; - + using sys_seconds = std::chrono::sys_seconds; using sys_minutes = std::chrono::sys_time<minutes>; using sys_days = std::chrono::sys_days; @@ -47,7 +47,7 @@ int main(int, char**) ASSERT_SAME_TYPE(std::chrono::time_point<system_clock, seconds>, sys_seconds); ASSERT_SAME_TYPE(std::chrono::time_point<system_clock, minutes>, sys_minutes); ASSERT_SAME_TYPE(std::chrono::time_point<system_clock, days>, sys_days); - + // Test some well known values sys_days d0 = sys_days{year{1970}/January/1}; sys_days d1 = sys_days{year{2000}/January/1}; diff --git a/libcxx/test/std/utilities/time/time.hms/time.12/is_pm.pass.cpp b/libcxx/test/std/utilities/time/time.hms/time.12/is_pm.pass.cpp index 7dcc768f8d0..973a8930c6c 100644 --- a/libcxx/test/std/utilities/time/time.hms/time.12/is_pm.pass.cpp +++ b/libcxx/test/std/utilities/time/time.hms/time.12/is_pm.pass.cpp @@ -26,7 +26,7 @@ int main(int, char**) static_assert(!std::chrono::is_pm(hours(11)), ""); static_assert( std::chrono::is_pm(hours(12)), ""); static_assert( std::chrono::is_pm(hours(23)), ""); - + for (int i = 0; i < 12; ++i) assert(!std::chrono::is_pm(hours(i))); for (int i = 12; i < 24; ++i) diff --git a/libcxx/test/std/utilities/time/time.hms/time.12/make12.pass.cpp b/libcxx/test/std/utilities/time/time.hms/time.12/make12.pass.cpp index bca956802f9..ddd18b02c21 100644 --- a/libcxx/test/std/utilities/time/time.hms/time.12/make12.pass.cpp +++ b/libcxx/test/std/utilities/time/time.hms/time.12/make12.pass.cpp @@ -27,7 +27,7 @@ int main(int, char**) static_assert( std::chrono::make12(hours(11)) == hours(11), ""); static_assert( std::chrono::make12(hours(12)) == hours(12), ""); static_assert( std::chrono::make12(hours(23)) == hours(11), ""); - + assert( std::chrono::make12(hours(0)) == hours(12)); for (int i = 1; i < 13; ++i) assert( std::chrono::make12(hours(i)) == hours(i)); diff --git a/libcxx/test/std/utilities/time/time.hms/time.12/make24.pass.cpp b/libcxx/test/std/utilities/time/time.hms/time.12/make24.pass.cpp index 46a5419076f..69926ebfd9e 100644 --- a/libcxx/test/std/utilities/time/time.hms/time.12/make24.pass.cpp +++ b/libcxx/test/std/utilities/time/time.hms/time.12/make24.pass.cpp @@ -9,10 +9,10 @@ // <chrono> // constexpr hours make24(const hours& h, bool is_pm) noexcept; -// Returns: If is_pm is false, returns the 24-hour equivalent of h in the range [0h, 11h], -// assuming h represents an ante meridiem hour. -// Else returns the 24-hour equivalent of h in the range [12h, 23h], -// assuming h represents a post meridiem hour. +// Returns: If is_pm is false, returns the 24-hour equivalent of h in the range [0h, 11h], +// assuming h represents an ante meridiem hour. +// Else returns the 24-hour equivalent of h in the range [12h, 23h], +// assuming h represents a post meridiem hour. // If h is not in the range [1h, 12h], the value returned is unspecified. #include <chrono> @@ -32,7 +32,7 @@ int main(int, char**) static_assert( std::chrono::make24(hours( 1), true) == hours(13), ""); static_assert( std::chrono::make24(hours(11), true) == hours(23), ""); static_assert( std::chrono::make24(hours(12), true) == hours(12), ""); - + for (int i = 1; i < 11; ++i) { assert((std::chrono::make24(hours(i), false)) == hours(i)); diff --git a/libcxx/test/std/utilities/time/time.hms/time.hms.members/hours.pass.cpp b/libcxx/test/std/utilities/time/time.hms/time.hms.members/hours.pass.cpp index 45eb67755a3..ac26f1792a6 100644 --- a/libcxx/test/std/utilities/time/time.hms/time.hms.members/hours.pass.cpp +++ b/libcxx/test/std/utilities/time/time.hms/time.hms.members/hours.pass.cpp @@ -10,9 +10,9 @@ // template <class Duration> // class hh_mm_ss -// +// // constexpr chrono::hours hours() const noexcept; - + // Test values // duration hours minutes seconds fractional // 5000s 1 23 20 0 @@ -41,10 +41,10 @@ constexpr long check_hours(Duration d) int main(int, char**) { using microfortnights = std::chrono::duration<int, std::ratio<756, 625>>; - + static_assert( check_hours(std::chrono::minutes( 1)) == 0, ""); static_assert( check_hours(std::chrono::minutes(-1)) == 0, ""); - + assert( check_hours(std::chrono::seconds( 5000)) == 1); assert( check_hours(std::chrono::seconds(-5000)) == 1); assert( check_hours(std::chrono::minutes( 5000)) == 83); diff --git a/libcxx/test/std/utilities/time/time.hms/time.hms.members/is_negative.pass.cpp b/libcxx/test/std/utilities/time/time.hms/time.hms.members/is_negative.pass.cpp index 6f82fbe6624..94eb8be337d 100644 --- a/libcxx/test/std/utilities/time/time.hms/time.hms.members/is_negative.pass.cpp +++ b/libcxx/test/std/utilities/time/time.hms/time.hms.members/is_negative.pass.cpp @@ -10,7 +10,7 @@ // template <class Duration> // class hh_mm_ss -// +// // constexpr bool is_negative() const noexcept; #include <chrono> diff --git a/libcxx/test/std/utilities/time/time.hms/time.hms.members/minutes.pass.cpp b/libcxx/test/std/utilities/time/time.hms/time.hms.members/minutes.pass.cpp index a3ecc814e35..0a1f336646c 100644 --- a/libcxx/test/std/utilities/time/time.hms/time.hms.members/minutes.pass.cpp +++ b/libcxx/test/std/utilities/time/time.hms/time.hms.members/minutes.pass.cpp @@ -10,7 +10,7 @@ // template <class Duration> // class hh_mm_ss -// +// // constexpr chrono::minutes minutes() const noexcept; // // See the table in hours.pass.cpp for correspondence between the magic values used below @@ -32,10 +32,10 @@ constexpr long check_minutes(Duration d) int main(int, char**) { using microfortnights = std::chrono::duration<int, std::ratio<756, 625>>; - + static_assert( check_minutes(std::chrono::minutes( 1)) == 1, ""); static_assert( check_minutes(std::chrono::minutes(-1)) == 1, ""); - + assert( check_minutes(std::chrono::seconds( 5000)) == 23); assert( check_minutes(std::chrono::seconds(-5000)) == 23); assert( check_minutes(std::chrono::minutes( 5000)) == 20); diff --git a/libcxx/test/std/utilities/time/time.hms/time.hms.members/precision.pass.cpp b/libcxx/test/std/utilities/time/time.hms/time.hms.members/precision.pass.cpp index 58e0484c908..e3dc30e75c6 100644 --- a/libcxx/test/std/utilities/time/time.hms/time.hms.members/precision.pass.cpp +++ b/libcxx/test/std/utilities/time/time.hms/time.hms.members/precision.pass.cpp @@ -15,9 +15,9 @@ // static unsigned constexpr fractional_width = see below; // using precision = see below; // -// precision is duration<common_type_t<Duration::rep, seconds::rep>, +// precision is duration<common_type_t<Duration::rep, seconds::rep>, // ratio<1, 10^^fractional_width>> - + #include <chrono> #include <cassert> diff --git a/libcxx/test/std/utilities/time/time.hms/time.hms.members/precision_type.pass.cpp b/libcxx/test/std/utilities/time/time.hms/time.hms.members/precision_type.pass.cpp index 58e0484c908..e3dc30e75c6 100644 --- a/libcxx/test/std/utilities/time/time.hms/time.hms.members/precision_type.pass.cpp +++ b/libcxx/test/std/utilities/time/time.hms/time.hms.members/precision_type.pass.cpp @@ -15,9 +15,9 @@ // static unsigned constexpr fractional_width = see below; // using precision = see below; // -// precision is duration<common_type_t<Duration::rep, seconds::rep>, +// precision is duration<common_type_t<Duration::rep, seconds::rep>, // ratio<1, 10^^fractional_width>> - + #include <chrono> #include <cassert> diff --git a/libcxx/test/std/utilities/time/time.hms/time.hms.members/seconds.pass.cpp b/libcxx/test/std/utilities/time/time.hms/time.hms.members/seconds.pass.cpp index 079f2b1cdca..5ef83a92023 100644 --- a/libcxx/test/std/utilities/time/time.hms/time.hms.members/seconds.pass.cpp +++ b/libcxx/test/std/utilities/time/time.hms/time.hms.members/seconds.pass.cpp @@ -10,7 +10,7 @@ // template <class Duration> // class hh_mm_ss -// +// // constexpr chrono::seconds seconds() const noexcept; // // See the table in hours.pass.cpp for correspondence between the magic values used below @@ -32,10 +32,10 @@ constexpr long check_seconds(Duration d) int main(int, char**) { using microfortnights = std::chrono::duration<int, std::ratio<756, 625>>; - + static_assert( check_seconds(std::chrono::seconds( 1)) == 1, ""); static_assert( check_seconds(std::chrono::seconds(-1)) == 1, ""); - + assert( check_seconds(std::chrono::seconds( 5000)) == 20); assert( check_seconds(std::chrono::seconds(-5000)) == 20); assert( check_seconds(std::chrono::minutes( 5000)) == 0); diff --git a/libcxx/test/std/utilities/time/time.hms/time.hms.members/subseconds.pass.cpp b/libcxx/test/std/utilities/time/time.hms/time.hms.members/subseconds.pass.cpp index 0245d8630fd..eb45461b817 100644 --- a/libcxx/test/std/utilities/time/time.hms/time.hms.members/subseconds.pass.cpp +++ b/libcxx/test/std/utilities/time/time.hms/time.hms.members/subseconds.pass.cpp @@ -10,7 +10,7 @@ // template <class Duration> // class hh_mm_ss -// +// // constexpr precision subseconds() const noexcept; // // See the table in hours.pass.cpp for correspondence between the magic values used below @@ -32,10 +32,10 @@ constexpr long check_subseconds(Duration d) int main(int, char**) { using microfortnights = std::chrono::duration<int, std::ratio<756, 625>>; - + static_assert( check_subseconds(std::chrono::seconds( 1)) == 0, ""); static_assert( check_subseconds(std::chrono::seconds(-1)) == 0, ""); - + assert( check_subseconds(std::chrono::seconds( 5000)) == 0); assert( check_subseconds(std::chrono::seconds(-5000)) == 0); assert( check_subseconds(std::chrono::minutes( 5000)) == 0); diff --git a/libcxx/test/std/utilities/time/time.hms/time.hms.members/to_duration.pass.cpp b/libcxx/test/std/utilities/time/time.hms/time.hms.members/to_duration.pass.cpp index 6bc62af6a29..55dfa8cc7a9 100644 --- a/libcxx/test/std/utilities/time/time.hms/time.hms.members/to_duration.pass.cpp +++ b/libcxx/test/std/utilities/time/time.hms/time.hms.members/to_duration.pass.cpp @@ -10,7 +10,7 @@ // template <class Duration> // class hh_mm_ss -// +// // constexpr precision to_duration() const noexcept; // // See the table in hours.pass.cpp for correspondence between the magic values used below @@ -26,14 +26,14 @@ constexpr long long check_duration(Duration d) using HMS = std::chrono::hh_mm_ss<Duration>; ASSERT_SAME_TYPE(typename HMS::precision, decltype(std::declval<HMS>().to_duration())); ASSERT_NOEXCEPT( std::declval<HMS>().to_duration()); - + return HMS(d).to_duration().count(); } int main(int, char**) { using microfortnights = std::chrono::duration<int, std::ratio<756, 625>>; - + static_assert( check_duration(std::chrono::minutes( 1)) == 60, ""); static_assert( check_duration(std::chrono::minutes(-1)) == -60, ""); diff --git a/libcxx/test/std/utilities/time/time.hms/time.hms.members/width.pass.cpp b/libcxx/test/std/utilities/time/time.hms/time.hms.members/width.pass.cpp index b18d6465c8c..31ff46830fc 100644 --- a/libcxx/test/std/utilities/time/time.hms/time.hms.members/width.pass.cpp +++ b/libcxx/test/std/utilities/time/time.hms/time.hms.members/width.pass.cpp @@ -15,12 +15,12 @@ // static unsigned constexpr fractional_width = see below; // using precision = see below; // -// fractional_width is the number of fractional decimal digits represented by precision. -// fractional_width has the value of the smallest possible integer in the range [0, 18] -// such that precision will exactly represent all values of Duration. +// fractional_width is the number of fractional decimal digits represented by precision. +// fractional_width has the value of the smallest possible integer in the range [0, 18] +// such that precision will exactly represent all values of Duration. // If no such value of fractional_width exists, then fractional_width is 6. - + #include <chrono> #include <cassert> |
