Searched refs:_Distance (Results 1 - 18 of 18) sorted by relevance

/openbsd-current/gnu/llvm/libcxx/include/__algorithm/
H A Dsample.h32 class _PopulationIterator, class _PopulationSentinel, class _SampleIterator, class _Distance,
37 _Distance __n,
41 _Distance __k = 0;
44 _Distance __sz = __k;
46 _Distance __r = uniform_int_distribution<_Distance>(0, __k)(__g);
54 class _PopulationIterator, class _PopulationSentinel, class _SampleIterator, class _Distance,
59 _Distance __n,
62 _Distance __unsampled_sz = _IterOps<_AlgPolicy>::distance(__first, __last);
64 _Distance __
[all...]
H A Dstable_partition.h32 template <class _AlgPolicy, class _Predicate, class _ForwardIterator, class _Distance, class _Pair>
35 _Distance __len, _Pair __p, forward_iterator_tag __fit)
90 _Distance __len2 = __len / 2; // __len2 >= 2
102 _Distance __len_half = __len - __len2;
155 template <class _AlgPolicy, class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair>
158 _Distance __len, _Pair __p, bidirectional_iterator_tag __bit)
222 _Distance __len2 = __len / 2; // __len2 >= 2
229 _Distance __len_half = __len2;
H A Diterator_operations.h81 template <class _Iter, class _Distance>
83 static void advance(_Iter& __iter, _Distance __count) {
/openbsd-current/gnu/gcc/libstdc++-v3/include/bits/
H A Dstl_heap.h70 template<typename _RandomAccessIterator, typename _Distance>
72 __is_heap(_RandomAccessIterator __first, _Distance __n)
74 _Distance __parent = 0;
75 for (_Distance __child = 1; __child < __n; ++__child)
85 template<typename _RandomAccessIterator, typename _Distance,
89 _Distance __n)
91 _Distance __parent = 0;
92 for (_Distance __child = 1; __child < __n; ++__child)
115 template<typename _RandomAccessIterator, typename _Distance, typename _Tp>
118 _Distance __holeInde
236 _Distance; typedef
300 _Distance; typedef
[all...]
H A Dstl_iterator_base_funcs.h122 template<typename _InputIterator, typename _Distance>
124 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag)
132 template<typename _BidirectionalIterator, typename _Distance>
134 __advance(_BidirectionalIterator& __i, _Distance __n,
148 template<typename _RandomAccessIterator, typename _Distance>
150 __advance(_RandomAccessIterator& __i, _Distance __n,
171 template<typename _InputIterator, typename _Distance>
173 advance(_InputIterator& __i, _Distance __n)
H A Dstl_iterator_base_types.h104 template<typename _Category, typename _Tp, typename _Distance = ptrdiff_t,
113 typedef _Distance difference_type;
H A Dstl_algo.h1843 _Distance; typedef
1847 const _Distance __n = __last - __first;
1848 const _Distance __k = __middle - __first;
1849 const _Distance __l = __n - __k;
1857 const _Distance __d = __gcd(__n, __k);
1859 for (_Distance __i = 0; __i < __d; __i++)
1866 for (_Distance __j = 0; __j < __l / __d; __j++)
1880 for (_Distance __j = 0; __j < __k / __d - 1; __j ++)
2117 template<typename _ForwardIterator, typename _Predicate, typename _Distance>
2121 _Predicate __pred, _Distance __le
3416 _Distance; typedef
3440 _Distance; typedef
[all...]
H A Dstl_algobase.h280 typedef typename iterator_traits<_II>::difference_type _Distance; typedef
281 for(_Distance __n = __last - __first; __n > 0; --__n)
/openbsd-current/gnu/lib/libstdc++/libstdc++/include/bits/
H A Dstl_iterator_base_funcs.h117 template<typename _InputIter, typename _Distance>
119 __advance(_InputIter& __i, _Distance __n, input_iterator_tag)
126 template<typename _BidirectionalIterator, typename _Distance>
128 __advance(_BidirectionalIterator& __i, _Distance __n,
140 template<typename _RandomAccessIterator, typename _Distance>
142 __advance(_RandomAccessIterator& __i, _Distance __n,
162 template<typename _InputIterator, typename _Distance>
164 advance(_InputIterator& __i, _Distance __n)
H A Dstl_heap.h68 template<typename _RandomAccessIterator, typename _Distance, typename _Tp>
71 _Distance __holeIndex, _Distance __topIndex, _Tp __value)
73 _Distance __parent = (__holeIndex - 1) / 2;
100 template<typename _RandomAccessIterator, typename _Distance, typename _Tp,
103 __push_heap(_RandomAccessIterator __first, _Distance __holeIndex,
104 _Distance __topIndex, _Tp __value, _Compare __comp)
106 _Distance __parent = (__holeIndex - 1) / 2;
133 template<typename _RandomAccessIterator, typename _Distance, typename _Tp>
135 __adjust_heap(_RandomAccessIterator __first, _Distance __holeInde
159 typedef typename iterator_traits<_RandomAccessIterator>::difference_type _Distance; typedef
205 typedef typename iterator_traits<_RandomAccessIterator>::difference_type _Distance; typedef
[all...]
H A Dstl_iterator_base_types.h102 template<typename _Category, typename _Tp, typename _Distance = ptrdiff_t,
111 typedef _Distance difference_type;
H A Dstl_algo.h1498 typedef typename iterator_traits<_RandomAccessIter>::difference_type _Distance; typedef
1501 _Distance __n = __last - __first;
1502 _Distance __k = __middle - __first;
1503 _Distance __l = __n - __k;
1510 _Distance __d = __gcd(__n, __k);
1512 for (_Distance __i = 0; __i < __d; __i++) {
1517 for (_Distance __j = 0; __j < __l/__d; __j++) {
1529 for (_Distance __j = 0; __j < __k/__d - 1; __j ++) {
1614 template<typename _Distance>
1615 inline _Distance
2336 typedef typename iterator_traits<_RandomAccessIter>::difference_type _Distance; typedef
2357 typedef typename iterator_traits<_RandomAccessIter>::difference_type _Distance; typedef
[all...]
H A Dstl_algobase.h239 _Distance; typedef
240 for (_Distance __n = __last - __first; __n > 0; --__n) {
/openbsd-current/gnu/llvm/libcxx/include/__iterator/
H A Diterator.h22 template<class _Category, class _Tp, class _Distance = ptrdiff_t,
27 typedef _Distance difference_type;
H A Distream_iterator.h29 class _Traits = char_traits<_CharT>, class _Distance = ptrdiff_t>
32 : public iterator<input_iterator_tag, _Tp, _Distance, const _Tp*, const _Tp&>
39 typedef _Distance difference_type;
83 template <class _Tp, class _CharT, class _Traits, class _Distance>
86 operator==(const istream_iterator<_Tp, _CharT, _Traits, _Distance>& __x,
87 const istream_iterator<_Tp, _CharT, _Traits, _Distance>& __y)
93 template <class _Tp, class _CharT, class _Traits, class _Distance>
96 operator!=(const istream_iterator<_Tp, _CharT, _Traits, _Distance>& __x,
97 const istream_iterator<_Tp, _CharT, _Traits, _Distance>& __y)
H A Dadvance.h60 class _InputIter, class _Distance,
61 class _IntegralDistance = decltype(_VSTD::__convert_to_integral(std::declval<_Distance>())),
64 void advance(_InputIter& __i, _Distance __orig_n) {
/openbsd-current/gnu/gcc/libstdc++-v3/include/backward/
H A Diterator.h85 template<typename _Tp, typename _Distance>
89 typedef _Distance difference_type;
102 template<typename _Tp, typename _Distance>
106 typedef _Distance difference_type;
111 template<typename _Tp, typename _Distance>
115 typedef _Distance difference_type;
120 template<typename _Tp, typename _Distance>
124 typedef _Distance difference_type;
/openbsd-current/gnu/lib/libstdc++/libstdc++/include/backward/
H A Diterator.h85 template<typename _Tp, typename _Distance>
89 typedef _Distance difference_type;
102 template<typename _Tp, typename _Distance>
106 typedef _Distance difference_type;
111 template<typename _Tp, typename _Distance>
115 typedef _Distance difference_type;
120 template<typename _Tp, typename _Distance>
124 typedef _Distance difference_type;

Completed in 331 milliseconds