| /freebsd/contrib/llvm-project/libcxx/include/__charconv/ |
| H A D | to_chars_integral.h | 47 __to_chars_itoa(char* __first, char* __last, _Tp __value, false_type);
51 __to_chars_itoa(char* __first, char* __last, _Tp __value, true_type) { in __to_chars_itoa() argument
53 if (__value < 0 && __first != __last) { in __to_chars_itoa()
58 return std::__to_chars_itoa(__first, __last, __x, false_type()); in __to_chars_itoa()
63 __to_chars_itoa(char* __first, char* __last, _Tp __value, false_type) { in __to_chars_itoa() argument
65 auto __diff = __last - __first; in __to_chars_itoa()
70 return {__last, errc::value_too_large}; in __to_chars_itoa()
76 __to_chars_itoa(char* __first, char* __last, __uint128_t __value, false_type) { in __to_chars_itoa() argument
82 return __to_chars_itoa(__first, __last, static_cast<uint64_t>(__value), false_type()); in __to_chars_itoa()
85 auto __diff = __last - __first; in __to_chars_itoa()
[all …]
|
| H A D | from_chars_integral.h | 42 __sign_combinator(_It __first, _It __last, _Tp& __value, _Fn __f, _Ts... __args) { in __sign_combinator() argument
46 bool __neg = (__first != __last && *__first == '-'); in __sign_combinator()
47 auto __r = __f(__neg ? __first + 1 : __first, __last, __x, __args...); in __sign_combinator()
99 __subject_seq_combinator(_It __first, _It __last, _Tp& __value, _Fn __f, _Ts... __args) { in __subject_seq_combinator() argument
107 auto __p = __find_non_zero(__first, __last); in __subject_seq_combinator()
108 if (__p == __last || !std::__in_pattern(*__p, __args...)) { in __subject_seq_combinator()
117 auto __r = __f(__p, __last, __value, __args...); in __subject_seq_combinator()
119 for (; __r.ptr != __last; ++__r.ptr) { in __subject_seq_combinator()
130 __from_chars_atoi(const char* __first, const char* __last, _Tp& __value) { in __from_chars_atoi() argument
135 … __first, __last, __value, [](const char* __f, const char* __l, _Tp& __val) -> from_chars_result { in __from_chars_atoi()
[all …]
|
| /freebsd/contrib/llvm-project/libcxx/include/__format/ |
| H A D | formatter_floating_point.h | 59 _LIBCPP_HIDE_FROM_ABI char* __to_buffer(char* __first, char* __last, _Tp __value) { in __to_buffer() argument
60 to_chars_result __r = std::to_chars(__first, __last, __value); in __to_buffer()
66 _LIBCPP_HIDE_FROM_ABI char* __to_buffer(char* __first, char* __last, _Tp __value, chars_format __fm… in __to_buffer() argument
67 to_chars_result __r = std::to_chars(__first, __last, __value, __fmt); in __to_buffer()
73 _LIBCPP_HIDE_FROM_ABI char* __to_buffer(char* __first, char* __last, _Tp __value, chars_format __fm… in __to_buffer() argument
74 to_chars_result __r = std::to_chars(__first, __last, __value, __fmt, __precision); in __to_buffer()
215 char* __last;
224 constexpr inline _LIBCPP_HIDE_FROM_ABI char* __find_exponent(char* __first, char* __last) {
225 ptrdiff_t __size = __last - __first;
227 __first = __last - std::min(__size, ptrdiff_t(6));
[all …]
|
| /freebsd/contrib/llvm-project/libcxx/src/ |
| H A D | charconv.cpp | 36 to_chars_result to_chars(char* __first, char* __last, float __value) {
37 return _Floating_to_chars<_Floating_to_chars_overload::_Plain>(__first, __last, __value, chars_format{}, 0);
40 to_chars_result to_chars(char* __first, char* __last, double __value) {
41 return _Floating_to_chars<_Floating_to_chars_overload::_Plain>(__first, __last, __value, chars_format{}, 0);
44 to_chars_result to_chars(char* __first, char* __last, long double __value) {
46 __first, __last, static_cast<double>(__value), chars_format{}, 0); in to_chars()
49 to_chars_result to_chars(char* __first, char* __last, float __value, chars_format __fmt) { in to_chars() argument
50 return _Floating_to_chars<_Floating_to_chars_overload::_Format_only>(__first, __last, __value, __fmt, 0); in to_chars()
53 to_chars_result to_chars(char* __first, char* __last, double __value, chars_format __fmt) { in to_chars() argument
54 return _Floating_to_chars<_Floating_to_chars_overload::_Format_only>(__first, __last, __valu in to_chars()
45 to_chars(char * __first,char * __last,float __value) to_chars() argument
58 to_chars(char * __first,char * __last,float __value,chars_format __fmt) to_chars() argument
62 to_chars(char * __first,char * __last,double __value,chars_format __fmt) to_chars() argument
66 to_chars(char * __first,char * __last,long double __value,chars_format __fmt) to_chars() argument
71 to_chars(char * __first,char * __last,float __value,chars_format __fmt,int __precision) to_chars() argument
76 to_chars(char * __first,char * __last,double __value,chars_format __fmt,int __precision) to_chars() argument
81 to_chars(char * __first,char * __last,long double __value,chars_format __fmt,int __precision) to_chars() argument
[all...] |
| /freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | sort.h | 271 __selection_sort(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) {
272 _BidirectionalIterator __lm1 = __last;
274 _BidirectionalIterator __i = std::__min_element<_Compare>(__first, __last, __comp);
284 __insertion_sort(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) {
288 if (__first == __last)
291 for (++__i; __i != __last; ++__i) {
314 __insertion_sort_unguarded(_RandomAccessIterator const __first, _RandomAccessIterator __last, _Comp…
318 if (__first == __last)
322 for (_RandomAccessIterator __i = __first + difference_type(1); __i != __last; ++__i) {
342 __insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Comp __co…
[all …]
|
| H A D | rotate.h | 33 __rotate_left(_ForwardIterator __first, _ForwardIterator __last) { in __rotate_left() argument
38 _ForwardIterator __lm1 = std::__move<_AlgPolicy>(_Ops::next(__first), __last, __first).second; in __rotate_left()
45 __rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) { in __rotate_right() argument
49 _BidirectionalIterator __lm1 = _Ops::prev(__last); in __rotate_right()
51 …_BidirectionalIterator __fp1 = std::__move_backward<_AlgPolicy>(__first, __lm1, std::move(__last))… in __rotate_right()
58 __rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) { in __rotate_forward() argument
63 if (++__i == __last) in __rotate_forward()
74 if (++__i == __last) { in __rotate_forward()
97 …_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) { in __rotate_gcd() argument
103 const difference_type __m2 = _Ops::distance(__middle, __last); in __rotate_gcd()
[all …]
|
| H A D | copy_backward.h | 33 __copy_backward(_InIter __first, _Sent __last, _OutIter __result);
39 operator()(_InIter __first, _Sent __last, _OutIter __result) const { in operator()
40 auto __last_iter = _IterOps<_AlgPolicy>::next(__first, __last); in operator()
52 operator()(_InIter __first, _InIter __last, _OutIter __result) const { in operator()
55 auto __slast = _Traits::__segment(__last); in operator()
58 …std::__copy_backward<_AlgPolicy>(_Traits::__local(__first), _Traits::__local(__last), std::move(__… in operator()
59 return std::make_pair(__last, __iters.second); in operator()
63 …std::__copy_backward<_AlgPolicy>(_Traits::__begin(__slast), _Traits::__local(__last), std::move(__… in operator()
74 return std::make_pair(__last, std::move(__result)); in operator()
83 operator()(_InIter __first, _InIter __last, _OutIter __result) const { in operator()
[all …]
|
| H A D | move_backward.h | 33 __move_backward(_BidirectionalIterator1 __first, _Sentinel __last, _BidirectionalIterator2 __result…
39 operator()(_InIter __first, _Sent __last, _OutIter __result) const { in operator()
40 auto __last_iter = _IterOps<_AlgPolicy>::next(__first, __last); in operator()
52 operator()(_InIter __first, _InIter __last, _OutIter __result) const { in operator()
55 auto __slast = _Traits::__segment(__last); in operator()
58 …std::__move_backward<_AlgPolicy>(_Traits::__local(__first), _Traits::__local(__last), std::move(__… in operator()
59 return std::make_pair(__last, __iters.second); in operator()
63 …std::__move_backward<_AlgPolicy>(_Traits::__begin(__slast), _Traits::__local(__last), std::move(__… in operator()
74 return std::make_pair(__last, std::move(__result)); in operator()
83 operator()(_InIter __first, _InIter __last, _OutIter __result) const { in operator()
[all …]
|
| H A D | nth_element.h | 49 _RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) { in __nth_element()
56 if (__nth == __last) in __nth_element()
58 difference_type __len = __last - __first; in __nth_element()
64 if (__comp(*--__last, *__first)) in __nth_element()
65 _Ops::iter_swap(__first, __last); in __nth_element()
69 std::__sort3<_AlgPolicy, _Compare>(__first, ++__m, --__last, __comp); in __nth_element()
74 std::__selection_sort<_AlgPolicy, _Compare>(__first, __last, __comp); in __nth_element()
79 _RandomAccessIterator __lm1 = __last; in __nth_element()
82 // partition [__first, __m) < *__m and *__m <= [__m, __last) in __nth_element()
97 // Partition instead into [__first, __i) == *__first and *__first < [__i, __last) in __nth_element()
45 __nth_element(_RandomAccessIterator __first,_RandomAccessIterator __nth,_RandomAccessIterator __last,_Compare __comp) __nth_element() argument
226 __nth_element_impl(_RandomAccessIterator __first,_RandomAccessIterator __nth,_RandomAccessIterator __last,_Compare & __comp) __nth_element_impl() argument
243 nth_element(_RandomAccessIterator __first,_RandomAccessIterator __nth,_RandomAccessIterator __last,_Compare __comp) nth_element() argument
250 nth_element(_RandomAccessIterator __first,_RandomAccessIterator __nth,_RandomAccessIterator __last) nth_element() argument
[all...] |
| H A D | stable_partition.h | 37 _ForwardIterator __last, in __stable_partition_impl()
67 while (++__i != __last) { in __stable_partition_impl()
97 // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true in __stable_partition_impl()
99 _ForwardIterator __second_false = __last; in __stable_partition_impl()
102 if (++__m1 == __last) in __stable_partition_impl()
108 __second_false = std::__stable_partition_impl<_AlgPolicy, _Predicate&>(__m1, __last, __pred, __len_half, __p, __fit); in __stable_partition_impl()
119 __stable_partition_impl(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) {
126 if (__first == __last) in __stable_partition_impl()
132 // We now have a reduced range [__first, __last) in __stable_partition_impl()
33 __stable_partition_impl(_ForwardIterator __first,_ForwardIterator __last,_Predicate __pred,_Distance __len,_Pair __p,forward_iterator_tag __fit) __stable_partition_impl() argument
122 __stable_partition_impl(_ForwardIterator __first,_ForwardIterator __last,_Predicate __pred,forward_iterator_tag) __stable_partition_impl() argument
157 __stable_partition_impl(_BidirectionalIterator __first,_BidirectionalIterator __last,_Predicate __pred,_Distance __len,_Pair __p,bidirectional_iterator_tag __bit) __stable_partition_impl() argument
268 __stable_partition_impl(_BidirectionalIterator __first,_BidirectionalIterator __last,_Predicate __pred,bidirectional_iterator_tag) __stable_partition_impl() argument
312 __stable_partition(_ForwardIterator __first,_ForwardIterator __last,_Predicate && __pred,_IterCategory __iter_category) __stable_partition() argument
320 stable_partition(_ForwardIterator __first,_ForwardIterator __last,_Predicate __pred) stable_partition() argument
[all...] |
| H A D | reverse.h | 29 __reverse_impl(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) { in __reverse_impl()
30 while (__first != __last) { in __reverse_impl()
31 if (__first == --__last) in __reverse_impl()
33 _IterOps<_AlgPolicy>::iter_swap(__first, __last); in __reverse_impl()
40 __reverse_impl(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) {
41 if (__first != __last) in __reverse_impl() argument
42 for (; __first < --__last; ++__first) in __reverse_impl()
43 _IterOps<_AlgPolicy>::iter_swap(__first, __last); in __reverse_impl()
47 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __reverse(_BidirectionalIterator __first, _Sentinel __last) {
49 std::__reverse_impl<_AlgPolicy>(std::move(__first), std::move(__last), _IterCategor
27 __reverse_impl(_BidirectionalIterator __first,_BidirectionalIterator __last,bidirectional_iterator_tag) __reverse_impl() argument
50 __reverse(_BidirectionalIterator __first,_Sentinel __last) __reverse() argument
58 reverse(_BidirectionalIterator __first,_BidirectionalIterator __last) reverse() argument
[all...] |
| H A D | push_heap.h | 33 _RandomAccessIterator __last, in __sift_up() argument
42 if (__comp(*__ptr, *--__last)) { in __sift_up()
43 value_type __t(_IterOps<_AlgPolicy>::__iter_move(__last)); in __sift_up()
45 *__last = _IterOps<_AlgPolicy>::__iter_move(__ptr); in __sift_up()
46 __last = __ptr; in __sift_up()
53 *__last = std::move(__t); in __sift_up()
60 __push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare& __comp) { in __push_heap() argument
61 typename iterator_traits<_RandomAccessIterator>::difference_type __len = __last - __first; in __push_heap()
62 …std::__sift_up<_AlgPolicy, __comp_ref_type<_Compare> >(std::move(__first), std::move(__last), __co… in __push_heap()
67 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { in push_heap() argument
[all …]
|
| H A D | shift_right.h | 33 _ForwardIterator __last, in shift_right()
40 decltype(__n) __d = __last - __first; in shift_right()
42 return __last; in shift_right()
45 return std::move_backward(__first, __m, __last); in shift_right()
47 _ForwardIterator __m = __last; in shift_right()
50 return __last; in shift_right()
54 return std::move_backward(__first, __m, __last); in shift_right()
58 if (__ret == __last) { in shift_right()
59 return __last; in shift_right()
67 // over and over; but once __lead reaches __last w in shift_right()
30 shift_right(_ForwardIterator __first,_ForwardIterator __last,typename iterator_traits<_ForwardIterator>::difference_type __n) shift_right() argument
[all...] |
| H A D | find.h | 46 __find(_Iter __first, _Sent __last, const _Tp& __value, _Proj& __proj) { in __find() argument
47 for (; __first != __last; ++__first) in __find()
60 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp* __find(_Tp* __first, _Tp* __last, const _U… in __find() argument
61 if (auto __ret = std::__constexpr_memchr(__first, __value, __last - __first)) in __find()
63 return __last; in __find()
73 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp* __find(_Tp* __first, _Tp* __last, const _U… in __find() argument
74 if (auto __ret = std::__constexpr_wmemchr(__first, __value, __last - __first)) in __find()
76 return __last; in __find()
90 __find(_Tp* __first, _Tp* __last, const _Up& __value, _Proj& __proj) { in __find() argument
92 return __last; in __find()
[all …]
|
| H A D | search_n.h | 35 … _Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj) { in __search_n_forward_impl() argument
41 if (__first == __last) { // return __last if no element matches __value in __search_n_forward_impl()
42 _IterOps<_AlgPolicy>::__advance_to(__first, __last); in __search_n_forward_impl()
55 if (++__m == __last) { // Otherwise if source exhaused, pattern not found in __search_n_forward_impl()
56 _IterOps<_AlgPolicy>::__advance_to(__first, __last); in __search_n_forward_impl()
72 …_Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj, _… in __search_n_random_access_impl() argument
77 _IterOps<_AlgPolicy>::__advance_to(__first, __last); in __search_n_random_access_impl()
86 _IterOps<_AlgPolicy>::__advance_to(__first, __last); in __search_n_random_access_impl()
119 __search_n_impl(_Iter __first, _Sent __last, _DiffT __count, const _Type& __value, _Pred& __pred, _… in __search_n_impl() argument
121 __first, __last, __count, __value, __pred, __proj, __last - __first); in __search_n_impl()
[all …]
|
| H A D | partition.h | 29 __partition_impl(_ForwardIterator __first, _Sentinel __last, _Predicate __pred, forward_iterator_tag) { in __partition_impl()
31 if (__first == __last) in __partition_impl()
39 while (++__p != __last) { in __partition_impl()
52 _BidirectionalIterator __last = __original_last; in __partition_impl()
56 if (__first == __last) in __partition_impl()
63 if (__first == --__last) in __partition_impl()
65 } while (!__pred(*__last)); in __partition_impl()
66 _IterOps<_AlgPolicy>::iter_swap(__first, __last); in __partition_impl()
73 __partition(_ForwardIterator __first, _Sentinel __last, _Predicate&& __pred, _IterCategory __iter_category) { in __partition_impl()
75 std::move(__first), std::move(__last), __pre in __partition_impl()
26 __partition_impl(_ForwardIterator __first,_Sentinel __last,_Predicate __pred,forward_iterator_tag) __partition_impl() argument
55 _BidirectionalIterator __last = __original_last; __partition_impl() local
80 __partition(_ForwardIterator __first,_Sentinel __last,_Predicate && __pred,_IterCategory __iter_category) __partition() argument
88 partition(_ForwardIterator __first,_ForwardIterator __last,_Predicate __pred) partition() argument
[all...] |
| H A D | partial_sort.h | 36 …_RandomAccessIterator __first, _RandomAccessIterator __middle, _Sentinel __last, _Compare&& __comp… in __partial_sort_impl() argument
38 return _IterOps<_AlgPolicy>::next(__middle, __last); in __partial_sort_impl()
45 for (; __i != __last; ++__i) { in __partial_sort_impl()
58 __partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _Sentinel __last, _Co… in __partial_sort() argument
60 return _IterOps<_AlgPolicy>::next(__middle, __last); in __partial_sort()
62 std::__debug_randomize_range<_AlgPolicy>(__first, __last); in __partial_sort()
65 …std::__partial_sort_impl<_AlgPolicy>(__first, __middle, __last, static_cast<__comp_ref_type<_Compa… in __partial_sort()
67 std::__debug_randomize_range<_AlgPolicy>(__middle, __last); in __partial_sort()
74 …_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Comp… in partial_sort() argument
78 …artial_sort<_ClassicAlgPolicy>(std::move(__first), std::move(__middle), std::move(__last), __comp); in partial_sort()
[all …]
|
| /freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/ |
| H A D | algorithm_impl.h | |
| H A D | glue_algorithm_impl.h | |
| H A D | glue_numeric_impl.h | |
| H A D | numeric_impl.h | |
| H A D | glue_algorithm_defs.h | |
| /freebsd/contrib/llvm-project/libcxx/include/__functional/ |
| H A D | boyer_moore_searcher.h | 105 _RandomAccessIterator1 __last,
109 __last_(__last),
111 __pattern_length_(__last - __first),
116 while (__first != __last) {
126 operator()(_RandomAccessIterator2 __first, _RandomAccessIterator2 __last) const { in __first_()
130 if (__first == __last) in __first_()
131 return std::make_pair(__last, __last); in __first_()
135 if (__pattern_length_ > (__last - __first)) in __first_()
136 return std::make_pair(__last, __las in __first_()
166 const _RandomAccessIterator2 __last = __l - __pattern_length_; __search() local
189 __compute_bm_prefix(_Iterator __first,_Iterator __last,_BinaryPredicate __pred,_Container & __prefix) __compute_bm_prefix() argument
206 __build_suffix_table(_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_BinaryPredicate __pred) __build_suffix_table() argument
297 const _RandomAccessIterator2 __last = __l - __pattern_length_; __search() local
[all...] |
| /freebsd/contrib/llvm-project/libcxx/include/__pstl/backends/ |
| H A D | default.h | 100 …operator()(_Policy&& __policy, _ForwardIterator __first, _ForwardIterator __last, const _Tp& __val…
103 …__policy, std::move(__first), std::move(__last), [&](__iter_reference<_ForwardIterator> __element)…
113 …operator()(_Policy&& __policy, _ForwardIterator __first, _ForwardIterator __last, _Pred&& __pred) …
115 return _FindIf()(__policy, __first, __last, std::not_fn(std::forward<_Pred>(__pred)));
123 …operator()(_Policy&& __policy, _ForwardIterator __first, _ForwardIterator __last, _Pred&& __pred) …
125 auto __res = _FindIf()(__policy, __first, __last, std::forward<_Pred>(__pred));
128 return *__res != __last;
136 …operator()(_Policy&& __policy, _ForwardIterator __first, _ForwardIterator __last, _Pred&& __pred) …
138 …auto __res = _AnyOf()(__policy, __first, __last, [&](__iter_reference<_ForwardIterator> __value)…
151 …operator()(_Policy&& __policy, _ForwardIterator __first, _ForwardIterator __last, _Pred&& __pred) …
[all …]
|
| /freebsd/contrib/llvm-project/libcxx/include/__iterator/ |
| H A D | distance.h | 31 __distance(_InputIter __first, _InputIter __last, input_iterator_tag) {
33 for (; __first != __last; ++__first) in __distance()
40 __distance(_RandIter __first, _RandIter __last, random_access_iterator_tag) {
41 return __last - __first;
46 distance(_InputIter __first, _InputIter __last) { in __distance()
47 return std::__distance(__first, __last, typename iterator_traits<_InputIter>::iterator_category());
60 _LIBCPP_HIDE_FROM_ABI constexpr iter_difference_t<_Ip> operator()(_Ip __first, _Sp __last) const {
62 while (__first != __last) {
70 _LIBCPP_HIDE_FROM_ABI constexpr iter_difference_t<_Ip> operator()(_Ip&& __first, _Sp __last) const { in operator()
72 return __last in operator()
32 __distance(_InputIter __first,_InputIter __last,input_iterator_tag) __distance() argument
43 __distance(_RandIter __first,_RandIter __last,random_access_iterator_tag) __distance() argument
51 distance(_InputIter __first,_InputIter __last) distance() argument
[all...] |