| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| sort.h | 62 _Compare __comp, _Parallelism __parallelism);
69 * @param __comp Comparator.
76 _Compare __comp, multiway_mergesort_tag __parallelism)
82 (__begin, __end, __comp, __parallelism.__get_num_threads());
85 (__begin, __end, __comp, __parallelism.__get_num_threads());
93 * @param __comp Comparator.
100 _Compare __comp,
106 (__begin, __end, __comp, __parallelism.__get_num_threads());
114 * @param __comp Comparator.
121 _Compare __comp,
[all...] |
| quicksort.h | 43 * @param __comp Comparator.
52 _Compare __comp, typename std::iterator_traits
76 __gnu_sequential::sort(__samples, __samples + __num_samples, __comp);
81 __pred(__comp, __pivot);
95 * @param __comp Comparator.
102 _Compare __comp,
111 __gnu_sequential::sort(__begin, __end, __comp);
130 (__begin, __end, __comp, __pivot_rank,
137 __comp, __num_threads_left);
140 __comp, __num_threads - __num_threads_left)
[all...] |
| balanced_quicksort.h | 94 * @param __comp Comparator.
101 _Compare __comp, _ThreadIndex __num_threads)
111 __end - 1, __comp);
117 _GLIBCXX_PARALLEL_ASSERT((!__comp(*__pivot_pos, *__begin)
118 && !__comp(*(__begin + __n / 2),
120 || (!__comp(*__pivot_pos, *__begin)
121 && !__comp(*(__end - 1), *__pivot_pos))
122 || (!__comp(*__pivot_pos, *(__begin + __n / 2))
123 && !__comp(*__begin, *__pivot_pos))
124 || (!__comp(*__pivot_pos, *(__begin + __n / 2)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| sort.h | 62 _Compare __comp, _Parallelism __parallelism);
69 * @param __comp Comparator.
76 _Compare __comp, multiway_mergesort_tag __parallelism)
82 (__begin, __end, __comp, __parallelism.__get_num_threads());
85 (__begin, __end, __comp, __parallelism.__get_num_threads());
93 * @param __comp Comparator.
100 _Compare __comp,
106 (__begin, __end, __comp, __parallelism.__get_num_threads());
114 * @param __comp Comparator.
121 _Compare __comp,
[all...] |
| quicksort.h | 43 * @param __comp Comparator.
52 _Compare __comp, typename std::iterator_traits
76 __gnu_sequential::sort(__samples, __samples + __num_samples, __comp);
81 __pred(__comp, __pivot);
95 * @param __comp Comparator.
102 _Compare __comp,
111 __gnu_sequential::sort(__begin, __end, __comp);
130 (__begin, __end, __comp, __pivot_rank,
137 __comp, __num_threads_left);
140 __comp, __num_threads - __num_threads_left)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/ |
| sort.h | 62 _Compare __comp, _Parallelism __parallelism);
69 * @param __comp Comparator.
76 _Compare __comp, multiway_mergesort_tag __parallelism)
82 (__begin, __end, __comp, __parallelism.__get_num_threads());
85 (__begin, __end, __comp, __parallelism.__get_num_threads());
93 * @param __comp Comparator.
100 _Compare __comp,
106 (__begin, __end, __comp, __parallelism.__get_num_threads());
114 * @param __comp Comparator.
121 _Compare __comp,
[all...] |
| quicksort.h | 43 * @param __comp Comparator.
52 _Compare __comp, typename std::iterator_traits
76 __gnu_sequential::sort(__samples, __samples + __num_samples, __comp);
81 __pred(__comp, __pivot);
95 * @param __comp Comparator.
102 _Compare __comp,
111 __gnu_sequential::sort(__begin, __end, __comp);
130 (__begin, __end, __comp, __pivot_rank,
137 __comp, __num_threads_left);
140 __comp, __num_threads - __num_threads_left)
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/ |
| sort.h | 62 _Compare __comp, _Parallelism __parallelism);
69 * @param __comp Comparator.
76 _Compare __comp, multiway_mergesort_tag __parallelism)
82 (__begin, __end, __comp, __parallelism.__get_num_threads());
85 (__begin, __end, __comp, __parallelism.__get_num_threads());
93 * @param __comp Comparator.
100 _Compare __comp,
106 (__begin, __end, __comp, __parallelism.__get_num_threads());
114 * @param __comp Comparator.
121 _Compare __comp,
[all...] |
| quicksort.h | 43 * @param __comp Comparator.
52 _Compare __comp, typename std::iterator_traits
76 __gnu_sequential::sort(__samples, __samples + __num_samples, __comp);
81 __pred(__comp, __pivot);
95 * @param __comp Comparator.
102 _Compare __comp,
111 __gnu_sequential::sort(__begin, __end, __comp);
130 (__begin, __end, __comp, __pivot_rank,
137 __comp, __num_threads_left);
140 __comp, __num_threads - __num_threads_left)
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 46 _Compare __comp);
56 _Compare __comp);
83 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) {
84 if (__comp(__a, __b)) {
85 _STLP_VERBOSE_ASSERT(!__comp(__b, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
86 if (__comp(__b, __c)) {
87 _STLP_VERBOSE_ASSERT(!__comp(__c, __b), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
90 else if (__comp(__a, __c)) {
91 _STLP_VERBOSE_ASSERT(!__comp(__c, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
97 else if (__comp(__a, __c))
[all...] |
| _heap.c | 77 _Distance __topIndex, _Tp __val, _Compare __comp)
80 while (__holeIndex > __topIndex && __comp(*(__first + __parent), __val)) {
81 _STLP_VERBOSE_ASSERT(!__comp(__val, *(__first + __parent)), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
93 _RandomAccessIterator __last, _Compare __comp,
97 _Tp(*(__last - 1)), __comp);
103 _Compare __comp)
105 __push_heap_aux(__first, __last, __comp,
147 _Distance __len, _Tp __val, _Compare __comp)
152 if (__comp(*(__first + __secondChild), *(__first + (__secondChild - 1)))) {
153 _STLP_VERBOSE_ASSERT(!__comp(*(__first + (__secondChild - 1)), *(__first + __secondChild))
[all...] |
| _heap.h | 45 _Compare __comp);
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp,
80 __val, __comp);
86 _RandomAccessIterator __last, _Compare __comp);
95 _RandomAccessIterator __last, _Compare __comp);
109 _RandomAccessIterator __last, _Compare __comp)
112 pop_heap(__first, __last--, __comp);
|
| _set.h | 89 explicit set(const _Compare& __comp = _Compare(),
94 explicit set(const _Compare& __comp)
95 : _M_t(__comp, allocator_type()) {}
96 set(const _Compare& __comp, const allocator_type& __a)
98 : _M_t(__comp, __a) {}
108 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
109 : _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); }
112 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
114 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
121 const value_type* __last, const _Compare& __comp,
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 46 _Compare __comp);
56 _Compare __comp);
83 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) {
84 if (__comp(__a, __b)) {
85 _STLP_VERBOSE_ASSERT(!__comp(__b, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
86 if (__comp(__b, __c)) {
87 _STLP_VERBOSE_ASSERT(!__comp(__c, __b), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
90 else if (__comp(__a, __c)) {
91 _STLP_VERBOSE_ASSERT(!__comp(__c, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
97 else if (__comp(__a, __c))
[all...] |
| _heap.c | 77 _Distance __topIndex, _Tp __val, _Compare __comp)
80 while (__holeIndex > __topIndex && __comp(*(__first + __parent), __val)) {
81 _STLP_VERBOSE_ASSERT(!__comp(__val, *(__first + __parent)), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
93 _RandomAccessIterator __last, _Compare __comp,
97 _Tp(*(__last - 1)), __comp);
103 _Compare __comp)
105 __push_heap_aux(__first, __last, __comp,
147 _Distance __len, _Tp __val, _Compare __comp)
152 if (__comp(*(__first + __secondChild), *(__first + (__secondChild - 1)))) {
153 _STLP_VERBOSE_ASSERT(!__comp(*(__first + (__secondChild - 1)), *(__first + __secondChild))
[all...] |
| _heap.h | 45 _Compare __comp);
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp,
80 __val, __comp);
86 _RandomAccessIterator __last, _Compare __comp);
95 _RandomAccessIterator __last, _Compare __comp);
109 _RandomAccessIterator __last, _Compare __comp)
112 pop_heap(__first, __last--, __comp);
|
| _set.h | 89 explicit set(const _Compare& __comp = _Compare(),
94 explicit set(const _Compare& __comp)
95 : _M_t(__comp, allocator_type()) {}
96 set(const _Compare& __comp, const allocator_type& __a)
98 : _M_t(__comp, __a) {}
108 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
109 : _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); }
112 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
114 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
121 const value_type* __last, const _Compare& __comp,
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| predefined_ops.h | 114 _Iter_comp_iter(_Compare __comp)
115 : _M_comp(__comp)
126 __iter_comp_iter(_Compare __comp)
127 { return _Iter_comp_iter<_Compare>(__comp); }
134 _Iter_comp_val(_Compare __comp)
135 : _M_comp(__comp)
146 __iter_comp_val(_Compare __comp)
147 { return _Iter_comp_val<_Compare>(__comp); }
151 __iter_comp_val(_Iter_comp_iter<_Compare> __comp)
152 { return _Iter_comp_val<_Compare>(__comp._M_comp);
[all...] |
| stl_heap.h | 75 _Compare __comp)
80 if (__comp(__first + __parent, __first + __child))
101 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
104 __gnu_cxx::__ops::__iter_comp_iter(__comp)) == __n;
115 _Compare __comp)
116 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
126 _Compare __comp)
129 while (__holeIndex > __topIndex && __comp(__first + __parent, __value))
174 * @param __comp Comparison functor.
185 _Compare __comp)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_heap.h | 89 _Compare __comp)
94 if (__comp(__first[__parent], __first[__child]))
112 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
113 { return std::__is_heap_until(__first, __n, __comp) == __n; }
123 _Compare __comp)
124 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
179 _Distance __topIndex, _Tp __value, _Compare __comp)
183 && __comp(*(__first + __parent), __value))
196 * @param __comp Comparison functor.
207 _Compare __comp)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_heap.h | 89 _Compare __comp)
94 if (__comp(__first[__parent], __first[__child]))
112 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
113 { return std::__is_heap_until(__first, __n, __comp) == __n; }
123 _Compare __comp)
124 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
179 _Distance __topIndex, _Tp __value, _Compare __comp)
183 && __comp(*(__first + __parent), __value))
196 * @param __comp Comparison functor.
207 _Compare __comp)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| stl_heap.h | 89 _Compare __comp)
94 if (__comp(__first[__parent], __first[__child]))
112 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
113 { return std::__is_heap_until(__first, __n, __comp) == __n; }
123 _Compare __comp)
124 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
179 _Distance __topIndex, _Tp __value, _Compare __comp)
183 && __comp(*(__first + __parent), __value))
196 * @param __comp Comparison functor.
207 _Compare __comp)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| algorithm | [all...] |
| /prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| algorithm | [all...] |
| /external/libcxx/include/ |
| algorithm | [all...] |
