| /freebsd-13.1/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | shuffle.h | 63 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in random_shuffle() typedef 66 difference_type __d = __last - __first; in random_shuffle() 73 difference_type __i = __uid(__g, _Pp(0, __d)); in random_shuffle() 74 if (__i != difference_type(0)) in random_shuffle() 89 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in random_shuffle() typedef 90 difference_type __d = __last - __first; in random_shuffle() 95 difference_type __i = __rand(__d); in random_shuffle() 96 if (__i != difference_type(0)) in random_shuffle() 107 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in shuffle() typedef 110 difference_type __d = __last - __first; in shuffle() [all …]
|
| H A D | inplace_merge.h | 84 … _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, in __buffered_inplace_merge() 85 … typename iterator_traits<_BidirectionalIterator>::difference_type __len2, in __buffered_inplace_merge() 119 typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; in __inplace_merge() typedef 146 difference_type __len11; // distance(__first, __m1) in __inplace_merge() 147 difference_type __len21; // distance(__middle, __m2) in __inplace_merge() 172 difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) in __inplace_merge() 173 difference_type __len22 = __len2 - __len21; // distance(__m2, __last) in __inplace_merge() 207 typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; in inplace_merge() typedef 208 difference_type __len1 = _VSTD::distance(__first, __middle); in inplace_merge() 209 difference_type __len2 = _VSTD::distance(__middle, __last); in inplace_merge() [all …]
|
| H A D | is_heap_until.h | 29 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in is_heap_until() typedef 30 difference_type __len = __last - __first; in is_heap_until() 31 difference_type __p = 0; in is_heap_until() 32 difference_type __c = 1; in is_heap_until()
|
| H A D | stable_sort.h | 103 typename iterator_traits<_RandomAccessIterator>::difference_type __len, 109 typename iterator_traits<_RandomAccessIterator>::difference_type __len, in __stable_sort_move() 145 typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; in __stable_sort_move() 161 typename iterator_traits<_RandomAccessIterator>::difference_type __len, in __stable_sort() 165 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in __stable_sort() typedef 176 if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) in __stable_sort() 181 typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; in __stable_sort() 210 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in stable_sort() typedef 211 difference_type __len = __last - __first; in stable_sort() 214 if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) in stable_sort()
|
| H A D | partition_point.h | 29 typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; in partition_point() typedef 30 difference_type __len = _VSTD::distance(__first, __last); in partition_point() 33 difference_type __l2 = _VSTD::__half_positive(__len); in partition_point()
|
| H A D | make_heap.h | 31 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in __make_heap() typedef 32 difference_type __n = __last - __first; in __make_heap() 36 for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) in __make_heap()
|
| H A D | sift_down.h | 29 typename iterator_traits<_RandomAccessIterator>::difference_type __len, in __sift_down() 32 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in __sift_down() typedef 36 difference_type __child = __start - __first; in __sift_down()
|
| H A D | lower_bound.h | 30 typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; in __lower_bound() typedef 31 difference_type __len = _VSTD::distance(__first, __last); in __lower_bound() 34 difference_type __l2 = _VSTD::__half_positive(__len); in __lower_bound()
|
| H A D | upper_bound.h | 30 typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; in __upper_bound() typedef 31 difference_type __len = _VSTD::distance(__first, __last); in __upper_bound() 34 difference_type __l2 = _VSTD::__half_positive(__len); in __upper_bound()
|
| H A D | equal_range.h | 33 typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; in __equal_range() typedef 34 difference_type __len = _VSTD::distance(__first, __last); in __equal_range() 37 difference_type __l2 = _VSTD::__half_positive(__len); in __equal_range()
|
| H A D | rotate.h | 107 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in __rotate_gcd() typedef 110 const difference_type __m1 = __middle - __first; in __rotate_gcd() 111 const difference_type __m2 = __last - __middle; in __rotate_gcd() 117 const difference_type __g = _VSTD::__algo_gcd(__m1, __m2); in __rotate_gcd() 127 const difference_type __d = __last - __p2; in __rotate_gcd()
|
| H A D | sort_heap.h | 32 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in __sort_heap() typedef 33 for (difference_type __n = __last - __first; __n > 1; --__last, (void) --__n) in __sort_heap()
|
| H A D | stable_partition.h | 130 typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; in __stable_partition() typedef 132 difference_type __len = _VSTD::distance(__first, __last); in __stable_partition() 257 typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; in __stable_partition() typedef 259 …const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignm… in __stable_partition() 280 difference_type __len = _VSTD::distance(__first, __last) + 1; in __stable_partition()
|
| H A D | nth_element.h | 49 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; in __nth_element() typedef 50 const difference_type __limit = 7; in __nth_element() 55 difference_type __len = __last - __first; in __nth_element()
|
| /freebsd-13.1/contrib/llvm-project/libcxx/include/__iterator/ |
| H A D | incrementable_traits.h | 34 using difference_type = ptrdiff_t; 41 concept __has_member_difference_type = requires { typename _Tp::difference_type; }; 45 using difference_type = typename _Tp::difference_type; 57 using difference_type = make_signed_t<decltype(declval<_Tp>() - declval<_Tp>())>; 69 … iterator_traits<remove_cvref_t<_Ip> > >::difference_type;
|
| H A D | move_iterator.h | 34 typedef typename iterator_traits<iterator_type>::difference_type difference_type; typedef 91 move_iterator operator+ (difference_type __n) const {return move_iterator(__i + __n);} 93 move_iterator& operator+=(difference_type __n) {__i += __n; return *this;} 95 move_iterator operator- (difference_type __n) const {return move_iterator(__i - __n);} 97 move_iterator& operator-=(difference_type __n) {__i -= __n; return *this;} 99 reference operator[](difference_type __n) const { return static_cast<reference>(__i[__n]); } 162 typename move_iterator<_Iter1>::difference_type 172 operator+(typename move_iterator<_Iter>::difference_type __n, const move_iterator<_Iter>& __x)
|
| H A D | reverse_iterator.h | 41 typename iterator_traits<_Iter>::difference_type, 60 typedef typename iterator_traits<_Iter>::difference_type difference_type; 140 … reverse_iterator operator+ (difference_type __n) const {return reverse_iterator(current - __n);} 142 reverse_iterator& operator+=(difference_type __n) {current -= __n; return *this;} 144 … reverse_iterator operator- (difference_type __n) const {return reverse_iterator(current + __n);} 146 reverse_iterator& operator-=(difference_type __n) {current += __n; return *this;} 148 reference operator[](difference_type __n) const {return *(*this + __n);} 211 typename reverse_iterator<_Iter1>::difference_type 221 operator+(typename reverse_iterator<_Iter>::difference_type __n, const reverse_iterator<_Iter>& __x)
|
| H A D | distance.h | 27 typename iterator_traits<_InputIter>::difference_type 30 typename iterator_traits<_InputIter>::difference_type __r(0); in __distance() 38 typename iterator_traits<_RandIter>::difference_type 46 typename iterator_traits<_InputIter>::difference_type
|
| H A D | iterator_traits.h | 164 typename incrementable_traits<_Ip>::difference_type; in requires() 170 requires signed_integral<typename incrementable_traits<_Ip>::difference_type>; in requires() 198 requires(_Ip __i, typename incrementable_traits<_Ip>::difference_type __n) { in requires() 221 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; 377 typedef typename _Iter::difference_type difference_type; [all …]
|
| H A D | wrap_iter.h | 34 typedef typename iterator_traits<iterator_type>::difference_type difference_type; typedef 125 …_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG __wrap_iter operator+ (difference_type __n… 127 …_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG __wrap_iter& operator+=(difference_type __n… 136 …_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG __wrap_iter operator- (difference_type __n… 138 …_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG __wrap_iter& operator-=(difference_type __n… 140 …_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG reference operator[](difference_type __n… 265 typename __wrap_iter<_Iter1>::difference_type 278 __wrap_iter<_Iter1> operator+(typename __wrap_iter<_Iter1>::difference_type __n, __wrap_iter<_Iter1…
|
| /freebsd-13.1/contrib/llvm-project/libcxx/include/ |
| H A D | __bit_reference | 254 typedef typename _It::difference_type difference_type; 285 typedef typename _It::difference_type difference_type; 414 typedef typename _In::difference_type difference_type; 463 typedef typename _In::difference_type difference_type; 553 typedef typename _In::difference_type difference_type; 602 typedef typename _In::difference_type difference_type; 720 typedef typename _I1::difference_type difference_type; 770 typedef typename _I1::difference_type difference_type; 880 typedef typename _Cp::difference_type difference_type; 909 typedef typename _I1::difference_type difference_type; [all …]
|
| H A D | iterator | 152 typedef Distance difference_type; 174 typename iterator_traits<InputIterator>::difference_type n = 1); 203 typedef typename iterator_traits<Iterator>::difference_type difference_type; 219 constexpr reverse_iterator& operator+=(difference_type n); 221 constexpr reverse_iterator& operator-=(difference_type n); 337 typedef typename iterator_traits<Iterator>::difference_type difference_type; 357 constexpr move_iterator& operator+=(difference_type n); 359 constexpr move_iterator& operator-=(difference_type n); 360 constexpr unspecified operator[](difference_type n) const; 420 typedef Distance difference_type; [all …]
|
| H A D | deque | 32 typedef typename allocator_type::difference_type difference_type; 569 … typedef typename __deque_iterator<_V2, _P2, _R2, _M2, _D2, _B2>::difference_type difference_type; 598 … typedef typename __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1>::difference_type difference_type; 626 … typedef typename __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1>::difference_type difference_type; 657 … typedef typename __deque_iterator<_V2, _P2, _R2, _M2, _D2, _B2>::difference_type difference_type; 686 … typedef typename __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1>::difference_type difference_type; 714 … typedef typename __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1>::difference_type difference_type; 745 … typedef typename __deque_iterator<_V2, _P2, _R2, _M2, _D2, _B2>::difference_type difference_type; 774 … typedef typename __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1>::difference_type difference_type; 947 typedef typename __alloc_traits::difference_type difference_type; [all …]
|
| /freebsd-13.1/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
|
| /freebsd-13.1/contrib/llvm-project/libcxx/include/experimental/ |
| H A D | functional | 213 typedef typename std::iterator_traits<_RandomAccessIterator1>::difference_type difference_type; 262 difference_type __pattern_length_; 264 shared_ptr<vector<difference_type>> __suffix_; 273 const vector<difference_type> & __suffix = *__suffix_.get(); 279 difference_type __j = __pattern_length_; 288 difference_type __k = __skip[__cur [ __j - 1 ]]; 289 difference_type __m = __j - __k - 1; 322 vector<difference_type> & __suffix = *__suffix_.get(); 364 typedef typename std::iterator_traits<_RandomAccessIterator1>::difference_type difference_type; 414 difference_type __pattern_length_; [all …]
|