| /freebsd/contrib/llvm-project/libcxx/include/__cxx03/__algorithm/ |
| H A D | search_n.h | 33 … _Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj) { in __search_n_forward_impl() argument
35 return std::make_pair(__first, __first); in __search_n_forward_impl()
39 if (__first == __last) { // return __last if no element matches __value in __search_n_forward_impl()
40 _IterOps<_AlgPolicy>::__advance_to(__first, __last); in __search_n_forward_impl()
41 return std::make_pair(__first, __first); in __search_n_forward_impl()
43 if (std::__invoke(__pred, std::__invoke(__proj, *__first), __value)) in __search_n_forward_impl()
45 ++__first; in __search_n_forward_impl()
48 _Iter __m = __first; in __search_n_forward_impl()
52 return std::make_pair(__first, ++__m); in __search_n_forward_impl()
54 _IterOps<_AlgPolicy>::__advance_to(__first, __last); in __search_n_forward_impl()
[all …]
|
| H A D | sort.h | 263 __selection_sort(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) {
265 for (--__lm1; __first != __lm1; ++__first) {
266 _BidirectionalIterator __i = std::__min_element<_Compare>(__first, __last, __comp);
267 if (__i != __first)
268 _IterOps<_AlgPolicy>::iter_swap(__first, __i);
276 __insertion_sort(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) {
280 if (__first == __last)
282 _BidirectionalIterator __i = __first;
293 } while (__j != __first && __comp(__t, *--__k));
306 __insertion_sort_unguarded(_RandomAccessIterator const __first, _RandomAccessIterator __last, _Comp…
[all …]
|
| H A D | rotate.h | 32 _LIBCPP_HIDE_FROM_ABI _ForwardIterator __rotate_left(_ForwardIterator __first, _ForwardIterator __l… in __rotate_left() argument
36 value_type __tmp = _Ops::__iter_move(__first); in __rotate_left()
37 _ForwardIterator __lm1 = std::__move<_AlgPolicy>(_Ops::next(__first), __last, __first).second; in __rotate_left()
44 __rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) { in __rotate_right() argument
50 …_BidirectionalIterator __fp1 = std::__move_backward<_AlgPolicy>(__first, __lm1, std::move(__last))… in __rotate_right()
51 *__first = std::move(__tmp); in __rotate_right()
57 __rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) { in __rotate_forward() argument
60 _IterOps<_AlgPolicy>::iter_swap(__first, __i); in __rotate_forward()
61 ++__first; in __rotate_forward()
64 if (__first == __middle) in __rotate_forward()
[all …]
|
| H A D | stable_partition.h | 36 _ForwardIterator __first, in __stable_partition_impl() argument
47 return __first; in __stable_partition_impl()
49 _ForwardIterator __m = __first; in __stable_partition_impl()
51 _Ops::iter_swap(__first, __m); in __stable_partition_impl()
54 return __first; in __stable_partition_impl()
63 ::new ((void*)__t) value_type(_Ops::__iter_move(__first)); in __stable_partition_impl()
66 _ForwardIterator __i = __first; in __stable_partition_impl()
69 *__first = _Ops::__iter_move(__i); in __stable_partition_impl()
70 ++__first; in __stable_partition_impl()
79 __i = __first; in __stable_partition_impl()
[all …]
|
| H A D | find.h | 44 _LIBCPP_HIDE_FROM_ABI _Iter __find(_Iter __first, _Sent __last, const _Tp& __value, _Proj& __proj) { in __find() argument
45 for (; __first != __last; ++__first) in __find()
46 if (std::__invoke(__proj, *__first) == __value) in __find()
48 return __first; in __find()
58 _LIBCPP_HIDE_FROM_ABI _Tp* __find(_Tp* __first, _Tp* __last, const _Up& __value, _Proj&) { in __find() argument
59 if (auto __ret = std::__constexpr_memchr(__first, __value, __last - __first)) in __find()
71 _LIBCPP_HIDE_FROM_ABI _Tp* __find(_Tp* __first, _Tp* __last, const _Up& __value, _Proj&) { in __find() argument
72 if (auto __ret = std::__constexpr_wmemchr(__first, __value, __last - __first)) in __find()
87 _LIBCPP_HIDE_FROM_ABI _Tp* __find(_Tp* __first, _Tp* __last, const _Up& __value, _Proj& __proj) { in __find() argument
90 return std::__find(__first, __last, _Tp(__value), __proj); in __find()
[all …]
|
| H A D | partition.h | 29 __partition_impl(_ForwardIterator __first, _Sentinel __last, _Predicate __pred, forward_iterator_ta… in __partition_impl() argument
31 if (__first == __last) in __partition_impl()
32 return std::make_pair(std::move(__first), std::move(__first)); in __partition_impl()
33 if (!__pred(*__first)) in __partition_impl()
35 ++__first; in __partition_impl()
38 _ForwardIterator __p = __first; in __partition_impl()
41 _IterOps<_AlgPolicy>::iter_swap(__first, __p); in __partition_impl()
42 ++__first; in __partition_impl()
45 return std::make_pair(std::move(__first), std::move(__p)); in __partition_impl()
50 __partition_impl(_BidirectionalIterator __first, _Sentinel __sentinel, _Predicate __pred, bidirecti… in __partition_impl() argument
[all …]
|
| H A D | fill_n.h | 31 inline _LIBCPP_HIDE_FROM_ABI _OutputIterator __fill_n(_OutputIterator __first, _Size __n, const _Tp…
34 _LIBCPP_HIDE_FROM_ABI void __fill_n_bool(__bit_iterator<_Cp, false> __first, typename _Cp::size_typ… in __fill_n_bool() argument
40 if (__first.__ctz_ != 0) { in __fill_n_bool()
41 __storage_type __clz_f = static_cast<__storage_type>(__bits_per_word - __first.__ctz_); in __fill_n_bool()
43 …__storage_type __m = (~__storage_type(0) << __first.__ctz_) & (~__storage_type(0) >> (__clz_f … in __fill_n_bool()
45 *__first.__seg_ |= __m; in __fill_n_bool()
47 *__first.__seg_ &= ~__m; in __fill_n_bool()
49 ++__first.__seg_; in __fill_n_bool()
53 …std::__fill_n(std::__to_address(__first.__seg_), __nw, _FillVal ? static_cast<__storage_type>(-1) … in __fill_n_bool()
57 __first.__seg_ += __nw; in __fill_n_bool()
[all …]
|
| H A D | unique_copy.h | 41 __unique_copy(_InputIterator __first, in __unique_copy() argument
46 if (__first != __last) { in __unique_copy()
47 typename _IterOps<_AlgPolicy>::template __value_type<_InputIterator> __t(*__first); in __unique_copy()
50 while (++__first != __last) { in __unique_copy()
51 if (!__pred(__t, *__first)) { in __unique_copy()
52 __t = *__first; in __unique_copy()
58 return pair<_InputIterator, _OutputIterator>(std::move(__first), std::move(__result)); in __unique_copy()
63 __unique_copy(_ForwardIterator __first, in __unique_copy() argument
68 if (__first != __last) { in __unique_copy()
69 _ForwardIterator __i = __first; in __unique_copy()
[all …]
|
| H A D | minmax_element.h | 42 __minmax_element_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __minmax_element_impl() argument
45 pair<_Iter, _Iter> __result(__first, __first); in __minmax_element_impl()
46 if (__first == __last || ++__first == __last) in __minmax_element_impl()
49 if (__less(__first, __result.first)) in __minmax_element_impl()
50 __result.first = __first; in __minmax_element_impl()
52 __result.second = __first; in __minmax_element_impl()
54 while (++__first != __last) { in __minmax_element_impl()
55 _Iter __i = __first; in __minmax_element_impl()
56 if (++__first == __last) { in __minmax_element_impl()
64 if (__less(__first, __i)) { in __minmax_element_impl()
[all …]
|
| /freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | search_n.h | 36 … _Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj) { in __search_n_forward_impl() argument
38 return std::make_pair(__first, __first); in __search_n_forward_impl()
42 if (__first == __last) { // return __last if no element matches __value in __search_n_forward_impl()
43 _IterOps<_AlgPolicy>::__advance_to(__first, __last); in __search_n_forward_impl()
44 return std::make_pair(__first, __first); in __search_n_forward_impl()
46 if (std::__invoke(__pred, std::__invoke(__proj, *__first), __value)) in __search_n_forward_impl()
48 ++__first; in __search_n_forward_impl()
51 _Iter __m = __first; in __search_n_forward_impl()
55 return std::make_pair(__first, ++__m); in __search_n_forward_impl()
57 _IterOps<_AlgPolicy>::__advance_to(__first, __last); in __search_n_forward_impl()
[all …]
|
| H A D | sort.h | 231 __selection_sort(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) { in __selection_sort() argument
233 for (--__lm1; __first != __lm1; ++__first) { in __selection_sort()
234 _BidirectionalIterator __i = std::__min_element<_Compare>(__first, __last, __comp); in __selection_sort()
235 if (__i != __first) in __selection_sort()
236 _IterOps<_AlgPolicy>::iter_swap(__first, __i); in __selection_sort()
244 __insertion_sort(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) { in __insertion_sort() argument
248 if (__first == __last) in __insertion_sort()
250 _BidirectionalIterator __i = __first; in __insertion_sort()
261 } while (__j != __first && __comp(__t, *--__k)); in __insertion_sort()
274 __insertion_sort_unguarded(_RandomAccessIterator const __first, _RandomAccessIterator __last, _Comp… in __insertion_sort_unguarded() argument
[all …]
|
| H A D | rotate.h | 40 __rotate_left(_ForwardIterator __first, _ForwardIterator __last) { in __rotate_left() argument
44 value_type __tmp = _Ops::__iter_move(__first); in __rotate_left()
45 _ForwardIterator __lm1 = std::__move<_AlgPolicy>(_Ops::next(__first), __last, __first).second; in __rotate_left()
52 __rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) { in __rotate_right() argument
58 …_BidirectionalIterator __fp1 = std::__move_backward<_AlgPolicy>(__first, __lm1, std::move(__last))… in __rotate_right()
59 *__first = std::move(__tmp); in __rotate_right()
65 __rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) { in __rotate_forward() argument
68 _IterOps<_AlgPolicy>::iter_swap(__first, __i); in __rotate_forward()
69 ++__first; in __rotate_forward()
72 if (__first == __middle) in __rotate_forward()
[all …]
|
| H A D | stable_partition.h | 38 _ForwardIterator __first, in __stable_partition_impl() argument
49 return __first; in __stable_partition_impl()
51 _ForwardIterator __m = __first; in __stable_partition_impl()
53 _Ops::iter_swap(__first, __m); in __stable_partition_impl()
56 return __first; in __stable_partition_impl()
65 std::__construct_at(__t, _Ops::__iter_move(__first)); in __stable_partition_impl()
68 _ForwardIterator __i = __first; in __stable_partition_impl()
71 *__first = _Ops::__iter_move(__i); in __stable_partition_impl()
72 ++__first; in __stable_partition_impl()
81 __i = __first; in __stable_partition_impl()
[all …]
|
| H A D | find.h | 47 __find(_Iter __first, _Sent __last, const _Tp& __value, _Proj& __proj) { in __find() argument
48 for (; __first != __last; ++__first) in __find()
49 if (std::__invoke(__proj, *__first) == __value) in __find()
51 return __first; in __find()
61 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp* __find(_Tp* __first, _Tp* __last, const _U… in __find() argument
62 if (auto __ret = std::__constexpr_memchr(__first, __value, __last - __first)) in __find()
74 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp* __find(_Tp* __first, _Tp* __last, const _U… in __find() argument
75 if (auto __ret = std::__constexpr_wmemchr(__first, __value, __last - __first)) in __find()
91 __find(_Tp* __first, _Tp* __last, const _Up& __value, _Proj& __proj) { in __find() argument
94 return std::__find(__first, __last, _Tp(__value), __proj); in __find()
[all …]
|
| H A D | partition.h | 30 __partition_impl(_ForwardIterator __first, _Sentinel __last, _Predicate __pred, forward_iterator_ta… in __partition_impl() argument
32 if (__first == __last) in __partition_impl()
33 return std::make_pair(__first, __first); in __partition_impl()
34 if (!__pred(*__first)) in __partition_impl()
36 ++__first; in __partition_impl()
39 _ForwardIterator __p = __first; in __partition_impl()
42 _IterOps<_AlgPolicy>::iter_swap(__first, __p); in __partition_impl()
43 ++__first; in __partition_impl()
46 return std::make_pair(std::move(__first), std::move(__p)); in __partition_impl()
51 __partition_impl(_BidirectionalIterator __first, _Sentinel __sentinel, _Predicate __pred, bidirecti… in __partition_impl() argument
[all …]
|
| H A D | copy.h | 36 copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result);
43 …__bit_iterator<_Cp, _IsConst> __first, __bit_iterator<_Cp, _IsConst> __last, __bit_iterator<_Cp, f… in __copy_aligned() argument
49 difference_type __n = __last - __first; in __copy_aligned()
52 if (__first.__ctz_ != 0) { in __copy_aligned()
53 unsigned __clz = __bits_per_word - __first.__ctz_; in __copy_aligned()
56 __storage_type __m = std::__middle_mask<__storage_type>(__clz - __dn, __first.__ctz_); in __copy_aligned()
57 __storage_type __b = *__first.__seg_ & __m; in __copy_aligned()
62 ++__first.__seg_; in __copy_aligned()
68 std::copy(std::__to_address(__first.__seg_), in __copy_aligned()
69 std::__to_address(__first.__seg_ + __nw), in __copy_aligned()
[all …]
|
| H A D | unique_copy.h | 41 __unique_copy(_InputIterator __first, in __unique_copy()
46 if (__first != __last) { in __unique_copy()
47 typename _IterOps<_AlgPolicy>::template __value_type<_InputIterator> __t(*__first); in __unique_copy()
50 while (++__first != __last) { in __unique_copy()
51 if (!__pred(__t, *__first)) { in __unique_copy()
52 __t = *__first; in __unique_copy()
58 return pair<_InputIterator, _OutputIterator>(std::move(__first), std::move(__result));
63 __unique_copy(_ForwardIterator __first, in __unique_copy()
68 if (__first != __last) { in __unique_copy()
69 _ForwardIterator __i = __first; in __unique_copy()
38 __unique_copy(_InputIterator __first,_Sent __last,_OutputIterator __result,_BinaryPredicate && __pred,__unique_copy_tags::__read_from_tmp_value_tag) __unique_copy() argument
60 __unique_copy(_ForwardIterator __first,_Sent __last,_OutputIterator __result,_BinaryPredicate && __pred,__unique_copy_tags::__reread_from_input_tag) __unique_copy() argument
82 __unique_copy(_InputIterator __first,_Sent __last,_InputAndOutputIterator __result,_BinaryPredicate && __pred,__unique_copy_tags::__reread_from_output_tag) __unique_copy() argument
99 unique_copy(_InputIterator __first,_InputIterator __last,_OutputIterator __result,_BinaryPredicate __pred) unique_copy() argument
116 unique_copy(_InputIterator __first,_InputIterator __last,_OutputIterator __result) unique_copy() argument
[all...] |
| /freebsd/contrib/llvm-project/libcxx/include/__random/ |
| H A D | seed_seq.h | 48 _LIBCPP_HIDE_FROM_ABI seed_seq(_InputIterator __first, _InputIterator __last) { in seed_seq() argument
51 __init(__first, __last); in seed_seq()
56 _LIBCPP_HIDE_FROM_ABI void generate(_RandomAccessIterator __first, _RandomAccessIterator __last);
72 _LIBCPP_HIDE_FROM_ABI void __init(_InputIterator __first, _InputIterator __last);
78 void seed_seq::__init(_InputIterator __first, _InputIterator __last) { in __init() argument
79 for (_InputIterator __s = __first; __s != __last; ++__s) in __init()
84 void seed_seq::generate(_RandomAccessIterator __first, _RandomAccessIterator __last) { in generate() argument
90 if (__first != __last) { in generate()
91 std::fill(__first, __last, 0x8b8b8b8b); in generate()
92 const size_t __n = static_cast<size_t>(__last - __first); in generate()
[all …]
|
| /freebsd/contrib/llvm-project/libcxx/include/__cxx03/__random/ |
| H A D | seed_seq.h | 39 _LIBCPP_HIDE_FROM_ABI seed_seq(_InputIterator __first, _InputIterator __last) { in seed_seq() argument
42 __init(__first, __last); in seed_seq()
47 _LIBCPP_HIDE_FROM_ABI void generate(_RandomAccessIterator __first, _RandomAccessIterator __last);
63 _LIBCPP_HIDE_FROM_ABI void __init(_InputIterator __first, _InputIterator __last);
69 void seed_seq::__init(_InputIterator __first, _InputIterator __last) { in __init() argument
70 for (_InputIterator __s = __first; __s != __last; ++__s) in __init()
75 void seed_seq::generate(_RandomAccessIterator __first, _RandomAccessIterator __last) { in generate() argument
81 if (__first != __last) { in generate()
82 std::fill(__first, __last, 0x8b8b8b8b); in generate()
83 const size_t __n = static_cast<size_t>(__last - __first); in generate()
[all …]
|
| /freebsd/contrib/llvm-project/libcxx/include/__charconv/ |
| H A D | to_chars_base_10.h | 31 _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI inline char* __append1(char* __first, uint32_t … in __append1() argument
32 *__first = '0' + static_cast<char>(__value); in __append1()
33 return __first + 1; in __append1()
36 _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI inline char* __append2(char* __first, uint32_t … in __append2() argument
37 return std::copy_n(&__digits_base_10[__value * 2], 2, __first); in __append2()
40 _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI inline char* __append3(char* __first, uint32_t … in __append3() argument
41 return __itoa::__append2(__itoa::__append1(__first, __value / 100), __value % 100); in __append3()
44 _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI inline char* __append4(char* __first, uint32_t … in __append4() argument
45 return __itoa::__append2(__itoa::__append2(__first, __value / 100), __value % 100); in __append4()
48 _LIBCPP_CONSTEXPR_SINCE_CXX23 _LIBCPP_HIDE_FROM_ABI inline char* __append5(char* __first, uint32_t … in __append5() argument
[all …]
|
| H A D | to_chars_integral.h | 44 __to_chars_itoa(char* __first, char* __last, _Tp __value, false_type);
48 __to_chars_itoa(char* __first, char* __last, _Tp __value, true_type) { in __to_chars_itoa() argument
50 if (__value < 0 && __first != __last) { in __to_chars_itoa()
51 *__first++ = '-'; in __to_chars_itoa()
55 return std::__to_chars_itoa(__first, __last, __x, false_type()); in __to_chars_itoa()
60 __to_chars_itoa(char* __first, char* __last, _Tp __value, false_type) { in __to_chars_itoa() argument
62 auto __diff = __last - __first; in __to_chars_itoa()
65 return {__tx::__convert(__first, __value), errc(0)}; in __to_chars_itoa()
73 __to_chars_itoa(char* __first, char* __last, __uint128_t __value, false_type) { in __to_chars_itoa() argument
79 return __to_chars_itoa(__first, __last, static_cast<uint64_t>(__value), false_type()); in __to_chars_itoa()
[all …]
|
| /freebsd/contrib/llvm-project/libcxx/src/ |
| H A D | charconv.cpp | 37 to_chars_result to_chars(char* __first, char* __last, float __value) { in to_chars() argument
38 …return _Floating_to_chars<_Floating_to_chars_overload::_Plain>(__first, __last, __value, chars_for… in to_chars()
41 to_chars_result to_chars(char* __first, char* __last, double __value) { in to_chars() argument
42 …return _Floating_to_chars<_Floating_to_chars_overload::_Plain>(__first, __last, __value, chars_for… in to_chars()
45 to_chars_result to_chars(char* __first, char* __last, long double __value) { in to_chars() argument
47 __first, __last, static_cast<double>(__value), chars_format{}, 0); in to_chars()
50 to_chars_result to_chars(char* __first, char* __last, float __value, chars_format __fmt) { in to_chars() argument
51 …return _Floating_to_chars<_Floating_to_chars_overload::_Format_only>(__first, __last, __value, __f… in to_chars()
54 to_chars_result to_chars(char* __first, char* __last, double __value, chars_format __fmt) { in to_chars() argument
55 …return _Floating_to_chars<_Floating_to_chars_overload::_Format_only>(__first, __last, __value, __f… in to_chars()
[all …]
|
| /freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/ |
| H A D | algorithm_impl.h | |
| H A D | numeric_impl.h | |
| H A D | unseq_backend_simd.h | |