/freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
H A D | sort.h | 316 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 320 const _RandomAccessIterator __leftmost = __first - difference_type(1); 322 for (_RandomAccessIterator __i = __first + difference_type(1); __i != __last; ++__i) { 323 _RandomAccessIterator __j = __i - difference_type(1); 345 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 355 …std::__sort3_maybe_branchless<_AlgPolicy, _Comp>(__first, __first + difference_type(1), --__last, … 359 __first, __first + difference_type(1), __first + difference_type(2), --__last, __comp); 364 __first + difference_type(1), 365 __first + difference_type(2), 366 __first + difference_type(3), [all …]
|
H A D | sift_down.h | 31 typename iterator_traits<_RandomAccessIterator>::difference_type __len, in __sift_down() 35 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in __sift_down() typedef 39 difference_type __child = __start - __first; in __sift_down() 47 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + difference_type(1)))) { in __sift_down() 71 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + difference_type(1)))) { in __sift_down() 86 typename iterator_traits<_RandomAccessIterator>::difference_type __len) { in __floyd_sift_down() 87 using difference_type = typename iterator_traits<_RandomAccessIterator>::difference_type; in __floyd_sift_down() 92 difference_type __chil in __floyd_sift_down() 88 using difference_type = typename iterator_traits<_RandomAccessIterator>::difference_type; __floyd_sift_down() local [all...] |
H A D | shuffle.h | 97 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in random_shuffle() 100 difference_type __d = __last - __first; in random_shuffle() 105 difference_type __i = __uid(__g, _Pp(0, __d)); in random_shuffle() 106 if (__i != difference_type(0)) in random_shuffle() 122 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in random_shuffle() 123 difference_type __d = __last - __first; in random_shuffle() 126 difference_type __i = __rand(__d); in random_shuffle() 127 if (__i != difference_type( in random_shuffle() 99 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; random_shuffle() typedef 125 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; random_shuffle() typedef 142 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; __shuffle() typedef [all...] |
H A D | inplace_merge.h | 100 typename iterator_traits<_BidirectionalIterator>::difference_type __len1, in __buffered_inplace_merge() 101 typename iterator_traits<_BidirectionalIterator>::difference_type __len2, in __buffered_inplace_merge() 131 typename iterator_traits<_BidirectionalIterator>::difference_type __len1, in __inplace_merge() 132 typename iterator_traits<_BidirectionalIterator>::difference_type __len2, in __inplace_merge() 137 typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; in __inplace_merge() typedef 161 difference_type __len11; // distance(__first, __m1) in __inplace_merge() 162 difference_type __len21; // distance(__middle, __m2) in __inplace_merge() 183 difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) in __inplace_merge() 184 difference_type __len22 = __len2 - __len21; // distance(__m2, __last) in __inplace_merge() 210 typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; in __inplace_merge() typedef [all …]
|
H A D | is_heap_until.h | 26 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in __is_heap_until() typedef 27 difference_type __len = __last - __first; in __is_heap_until() 28 difference_type __p = 0; in __is_heap_until() 29 difference_type __c = 1; in __is_heap_until()
|
H A D | stable_sort.h | 140 typename iterator_traits<_RandomAccessIterator>::difference_type __len, 148 typename iterator_traits<_RandomAccessIterator>::difference_type __len, in __stable_sort_move() 180 typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; in __stable_sort_move() 196 typename iterator_traits<_RandomAccessIterator>::difference_type __len, in __stable_sort() 200 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in __stable_sort() typedef 210 if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) { in __stable_sort() 214 typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; in __stable_sort() 241 using difference_type = typename iterator_traits<_RandomAccessIterator>::difference_type; in __stable_sort_impl() local 243 difference_type __len = __last - __first; in __stable_sort_impl() 246 if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) { in __stable_sort_impl()
|
H A D | partition_point.h | 27 typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; in partition_point() 28 difference_type __len = std::distance(__first, __last); in partition_point() typedef 30 difference_type __l2 = std::__half_positive(__len); in partition_point()
|
H A D | make_heap.h | 34 using difference_type = typename iterator_traits<_RandomAccessIterator>::difference_type; in __make_heap() local 35 difference_type __n = __last - __first; in __make_heap() 38 for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) { in __make_heap()
|
H A D | stable_partition.h | 120 typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 123 const difference_type __alloc_limit = 3; // might want to make this a function of trivial assignment in __stable_partition_impl() 134 difference_type __len = _IterOps<_AlgPolicy>::distance(__first, __last); in __stable_partition_impl() 253 typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; in __stable_partition_impl() 255 const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment in __stable_partition_impl() 274 difference_type __len = _IterOps<_AlgPolicy>::distance(__first, __last) + 1; in __stable_partition_impl() 125 typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; __stable_partition_impl() typedef 271 typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; __stable_partition_impl() typedef
|
H A D | copy_n.h | 52 typedef typename iterator_traits<_InputIterator>::difference_type difference_type; 55 return std::copy(__first, __first + difference_type(__n), __result); 59 typedef typename iterator_traits<_InputIterator>::difference_type difference_type; copy_n() typedef
|
H A D | sort_heap.h | 38 using difference_type = typename iterator_traits<_RandomAccessIterator>::difference_type; in __sort_heap() local 39 for (difference_type __n = __last - __first; __n > 1; --__last, (void)--__n) in __sort_heap()
|
/freebsd/contrib/llvm-project/libcxx/include/__functional/ |
H A D | boyer_moore_searcher.h | 92 using difference_type = typename std::iterator_traits<_RandomAccessIterator1>::difference_type; in insert() 96 difference_type, 113 __suffix_(std::__allocate_shared_unbounded_array<difference_type[]>( 114 allocator<difference_type>(), __pattern_length_ + 1)) { 115 difference_type __i = 0; 144 difference_type __pattern_length_; in operator() 146 shared_ptr<difference_type[]> __suffix_; in operator() 156 difference_type __j = __pattern_length_; 163 difference_type __ [all...] |
/freebsd/contrib/llvm-project/libcxx/include/ |
H A D | __bit_reference | 180 using difference_type = typename _In::difference_type; 184 difference_type __n = __last - __first; 189 difference_type __dn = std::min(static_cast<difference_type>(__clz), __n); 223 using difference_type = typename _In::difference_type; 227 difference_type __n = __last - __first; 232 difference_type __dn = std::min(static_cast<difference_type>(__clz_f), __n); 272 __storage_type __dn = std::min(__n, static_cast<difference_type>(__clz_r)); 304 using difference_type = typename _In::difference_type; 308 difference_type __n = __last - __first; 312 difference_type __dn = std::min(static_cast<difference_type>(__last.__ctz_), __n); [all …]
|
H A D | iterator | 177 typedef Distance difference_type; 195 constexpr typename iterator_traits<InputIterator>::difference_type 200 typename iterator_traits<InputIterator>::difference_type n = 1); 204 typename iterator_traits<BidirectionalIterator>::difference_type n = 1); 221 typename iterator_traits<Iterator>::difference_type, 234 using difference_type = typename iterator_traits<Iterator>::difference_type; // until C++20 235 using difference_type = iter_difference_t<Iterator>; // since C++20 252 constexpr reverse_iterator operator+ (difference_type n) const; 253 constexpr reverse_iterator& operator+=(difference_type n); 254 constexpr reverse_iterator operator- (difference_type n) const; [all …]
|
/freebsd/contrib/llvm-project/libcxx/include/__iterator/ |
H A D | incrementable_traits.h | 38 using difference_type = ptrdiff_t; 45 concept __has_member_difference_type = requires { typename _Tp::difference_type; }; 49 using difference_type = typename _Tp::difference_type; 60 using difference_type = make_signed_t<decltype(std::declval<_Tp>() - std::declval<_Tp>())>; 67 // `incrementable_traits<RI>::difference_type` if `iterator_traits<RI>` names a specialization 68 // generated from the primary template, and `iterator_traits<RI>::difference_type` otherwise. 73 iterator_traits<remove_cvref_t<_Ip> > >::difference_type;
|
H A D | aliasing_iterator.h | 43 using difference_type = ptrdiff_t; member 75 …_LIBCPP_HIDE_FROM_ABI friend __iterator operator+(__iterator __iter, difference_type __n) _NOEXCEP… 79 …_LIBCPP_HIDE_FROM_ABI friend __iterator operator+(difference_type __n, __iterator __iter) _NOEXCEP… 83 _LIBCPP_HIDE_FROM_ABI __iterator& operator+=(difference_type __n) _NOEXCEPT { 88 …_LIBCPP_HIDE_FROM_ABI friend __iterator operator-(__iterator __iter, difference_type __n) _NOEXCEP… 92 …_LIBCPP_HIDE_FROM_ABI friend difference_type operator-(__iterator __lhs, __iterator __rhs) _NOEXCE… 96 _LIBCPP_HIDE_FROM_ABI __iterator& operator-=(difference_type __n) _NOEXCEPT { 109 …_LIBCPP_HIDE_FROM_ABI value_type operator[](difference_type __n) const _NOEXCEPT { return *(*this …
|
H A D | bounded_iter.h | 53 using difference_type = typename iterator_traits<_Iterator>::difference_type; member 121 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 reference operator[](difference_type __n) cons… 156 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __bounded_iter& operator+=(difference_type __n… 165 operator+(__bounded_iter const& __self, difference_type __n) _NOEXCEPT { 171 operator+(difference_type __n, __bounded_iter const& __self) _NOEXCEPT { 177 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __bounded_iter& operator-=(difference_type __n… 186 operator-(__bounded_iter const& __self, difference_type __n) _NOEXCEPT { 191 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 friend difference_type 272 using difference_type = typename pointer_traits<_Iterator>::difference_type;
|
H A D | wrap_iter.h | 34 typedef typename iterator_traits<iterator_type>::difference_type difference_type; typedef 73 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __wrap_iter operator+(difference_type __n) con… 78 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __wrap_iter& operator+=(difference_type __n) _… 82 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __wrap_iter operator-(difference_type __n) con… 85 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 __wrap_iter& operator-=(difference_type __n) _… 89 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 reference operator[](difference_type __n) cons… 212 typename __wrap_iter<_Iter1>::difference_type 221 operator+(typename __wrap_iter<_Iter1>::difference_type __n, __wrap_iter<_Iter1> __x) _NOEXCEPT { 235 typedef typename pointer_traits<_It>::difference_type difference_type;
|
H A D | iterator_traits.h | 117 __void_t<typename _Up::difference_type>* = nullptr, 165 typename incrementable_traits<_Ip>::difference_type; in requires() 169 requires signed_integral<typename incrementable_traits<_Ip>::difference_type>; in requires() 191 requires(_Ip __i, typename incrementable_traits<_Ip>::difference_type __n) { in requires() 214 typename _Ip::difference_type; 318 requires requires { typename incrementable_traits<_Ip>::difference_type; } 320 using type = typename incrementable_traits<_Ip>::difference_type; 335 using difference_type = typename _Ip::difference_type; 347 using difference_type = typename incrementable_traits<_Ip>::difference_type; 358 using difference_type = typename __iterator_traits_difference_type<_Ip>::type; [all …]
|
H A D | reverse_iterator.h | 55 typename iterator_traits<_Iter>::difference_type, 86 using difference_type = iter_difference_t<_Iter>; variable 90 using difference_type = typename iterator_traits<_Iter>::difference_type; variable 167 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 reverse_iterator operator+(difference_type __n… 170 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 reverse_iterator& operator+=(difference_type _… 174 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 reverse_iterator operator-(difference_type __n… 177 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 reverse_iterator& operator-=(difference_type _… 181 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 reference operator[](difference_type __n) cons… 293 inline _LIBCPP_HIDE_FROM_ABI typename reverse_iterator<_Iter1>::difference_type 301 operator+(typename reverse_iterator<_Iter>::difference_type __n, const reverse_iterator<_Iter>& __x…
|
H A D | move_iterator.h | 94 using difference_type = iter_difference_t<_Iter>; 104 typedef typename iterator_traits<iterator_type>::difference_type difference_type; 143 _LIBCPP_HIDE_FROM_ABI constexpr reference operator[](difference_type __n) const { 177 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 reference operator[](difference_type __n) cons… 197 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 move_iterator operator+(difference_type __n) c… 200 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 move_iterator& operator+=(difference_type __n)… 204 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 move_iterator operator-(difference_type __n) c… 207 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 move_iterator& operator-=(difference_type __n)… 308 inline _LIBCPP_HIDE_FROM_ABI typename move_iterator<_Iter1>::difference_type 327 operator+(typename move_iterator<_Iter>::difference_type __n, const move_iterator<_Iter>& __x) {
|
H A D | distance.h | 30 inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 typename iterator_traits<_InputIter>::difference_type 32 typename iterator_traits<_InputIter>::difference_type __r(0); in __distance() 39 inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 typename iterator_traits<_RandIter>::difference_type 45 inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 typename iterator_traits<_InputIter>::difference_type in __distance()
|
/freebsd/contrib/llvm-project/libcxx/include/__ranges/ |
H A D | iota_view.h | 118 using difference_type = _IotaDiffT<_Start>; 162 _LIBCPP_HIDE_FROM_ABI constexpr __iterator& operator+=(difference_type __n) 166 if (__n >= difference_type(0)) { 177 _LIBCPP_HIDE_FROM_ABI constexpr __iterator& operator-=(difference_type __n) 181 if (__n >= difference_type(0)) { 192 _LIBCPP_HIDE_FROM_ABI constexpr _Start operator[](difference_type __n) const 234 _LIBCPP_HIDE_FROM_ABI friend constexpr __iterator operator+(__iterator __i, difference_type __n) 241 _LIBCPP_HIDE_FROM_ABI friend constexpr __iterator operator+(difference_type __n, __iterator __i) 247 _LIBCPP_HIDE_FROM_ABI friend constexpr __iterator operator-(__iterator __i, difference_type __n) 254 …_LIBCPP_HIDE_FROM_ABI friend constexpr difference_type operator-(const __iterator& __x, const __it… [all …]
|
H A D | repeat_view.h | 150 using difference_type = __repeat_view_iterator_difference_t<_IndexT>; 180 _LIBCPP_HIDE_FROM_ABI constexpr __iterator& operator+=(difference_type __n) { 187 _LIBCPP_HIDE_FROM_ABI constexpr __iterator& operator-=(difference_type __n) { 194 …_LIBCPP_HIDE_FROM_ABI constexpr const _Tp& operator[](difference_type __n) const noexcept { return… 204 _LIBCPP_HIDE_FROM_ABI friend constexpr __iterator operator+(__iterator __i, difference_type __n) { 209 _LIBCPP_HIDE_FROM_ABI friend constexpr __iterator operator+(difference_type __n, __iterator __i) { 214 _LIBCPP_HIDE_FROM_ABI friend constexpr __iterator operator-(__iterator __i, difference_type __n) { 219 …_LIBCPP_HIDE_FROM_ABI friend constexpr difference_type operator-(const __iterator& __x, const __it… 220 …return static_cast<difference_type>(__x.__current_) - static_cast<difference_type>(__y.__current_);
|
/freebsd/contrib/llvm-project/lldb/include/lldb/Utility/ |
H A D | Iterable.h | 64 E operator[](typename BackingIterator::difference_type offset) { 82 operator+=(typename BackingIterator::difference_type offset) { 88 operator-=(typename BackingIterator::difference_type offset) { 95 operator+(typename BackingIterator::difference_type offset) { 100 operator-(typename BackingIterator::difference_type offset) { 115 operator+(typename C1::const_iterator::difference_type, 119 friend typename C1::const_iterator::difference_type 133 typename AdaptedConstIterator<C, E, A>::BackingIterator::difference_type 140 typename AdaptedConstIterator<C, E, A>::BackingIterator::difference_type
|