| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| base.h | 163 _EqualFromLess(_Compare& __comp) : _M_comp(__comp) { }
390 according to @c __comp.
394 * @param __comp Comparator.
399 _RAIter __c, _Compare __comp)
401 if (__comp(*__a, *__b))
402 if (__comp(*__b, *__c))
405 if (__comp(*__a, *__c))
412 if (__comp(*__a, *__c))
415 if (__comp(*__b, *__c)
[all...] |
| multiseq_selection.h | 61 _Lexicographic(_Compare& __comp) : _M_comp(__comp) { }
86 _LexicographicReverse(_Compare& __comp) : _M_comp(__comp) { }
117 * @param __comp The ordering functor, defaults to std::less<_Tp>.
125 _Compare __comp = std::less<
140 _Lexicographic<_ValueType, _SeqNumber, _Compare> __lcomp(__comp);
141 _LexicographicReverse<_ValueType, _SeqNumber, _Compare> __lrcomp(__comp);
244 if (!__comp(__S(__i)[__a[__i] - 1], *__lmax))
344 if (!__comp(__S(__i)[__a[__i] - 1], *__maxleft)
[all...] |
| partition.h | 328 * @param __comp Comparator.
333 _RAIter __end, _Compare __comp)
367 __pred(__comp, *__pivot_pos);
392 _ValueType, bool>(__comp, *__pivot_pos));
412 __gnu_sequential::nth_element(__begin, __nth, __end, __comp);
419 * @param __comp Comparator. */
424 _RAIter __end, _Compare __comp)
426 __parallel_nth_element(__begin, __middle, __end, __comp);
427 std::sort(__begin, __middle, __comp);
|
| for_each_selectors.h | 309 _Compare& __comp; member in struct:__gnu_parallel::__min_element_reduct
312 __min_element_reduct(_Compare &__c) : __comp(__c) { }
316 { return (__comp(*__x, *__y)) ? __x : __y; }
323 _Compare& __comp; member in struct:__gnu_parallel::__max_element_reduct
326 __max_element_reduct(_Compare& __c) : __comp(__c) { }
330 { return (__comp(*__x, *__y)) ? __y : __x; }
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| base.h | 163 _EqualFromLess(_Compare& __comp) : _M_comp(__comp) { }
390 according to @c __comp.
394 * @param __comp Comparator.
399 _RAIter __c, _Compare __comp)
401 if (__comp(*__a, *__b))
402 if (__comp(*__b, *__c))
405 if (__comp(*__a, *__c))
412 if (__comp(*__a, *__c))
415 if (__comp(*__b, *__c)
[all...] |
| multiseq_selection.h | 61 _Lexicographic(_Compare& __comp) : _M_comp(__comp) { }
86 _LexicographicReverse(_Compare& __comp) : _M_comp(__comp) { }
117 * @param __comp The ordering functor, defaults to std::less<_Tp>.
125 _Compare __comp = std::less<
140 _Lexicographic<_ValueType, _SeqNumber, _Compare> __lcomp(__comp);
141 _LexicographicReverse<_ValueType, _SeqNumber, _Compare> __lrcomp(__comp);
244 if (!__comp(__S(__i)[__a[__i] - 1], *__lmax))
344 if (!__comp(__S(__i)[__a[__i] - 1], *__maxleft)
[all...] |
| partition.h | 328 * @param __comp Comparator.
333 _RAIter __end, _Compare __comp)
367 __pred(__comp, *__pivot_pos);
392 _ValueType, bool>(__comp, *__pivot_pos));
412 __gnu_sequential::nth_element(__begin, __nth, __end, __comp);
419 * @param __comp Comparator. */
424 _RAIter __end, _Compare __comp)
426 __parallel_nth_element(__begin, __middle, __end, __comp);
427 std::sort(__begin, __middle, __comp);
|
| for_each_selectors.h | 309 _Compare& __comp; member in struct:__gnu_parallel::__min_element_reduct
312 __min_element_reduct(_Compare &__c) : __comp(__c) { }
316 { return (__comp(*__x, *__y)) ? __x : __y; }
323 _Compare& __comp; member in struct:__gnu_parallel::__max_element_reduct
326 __max_element_reduct(_Compare& __c) : __comp(__c) { }
330 { return (__comp(*__x, *__y)) ? __y : __x; }
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/ |
| base.h | 163 _EqualFromLess(_Compare& __comp) : _M_comp(__comp) { }
390 according to @c __comp.
394 * @param __comp Comparator.
399 _RAIter __c, _Compare __comp)
401 if (__comp(*__a, *__b))
402 if (__comp(*__b, *__c))
405 if (__comp(*__a, *__c))
412 if (__comp(*__a, *__c))
415 if (__comp(*__b, *__c)
[all...] |
| multiseq_selection.h | 61 _Lexicographic(_Compare& __comp) : _M_comp(__comp) { }
86 _LexicographicReverse(_Compare& __comp) : _M_comp(__comp) { }
117 * @param __comp The ordering functor, defaults to std::less<_Tp>.
125 _Compare __comp = std::less<
140 _Lexicographic<_ValueType, _SeqNumber, _Compare> __lcomp(__comp);
141 _LexicographicReverse<_ValueType, _SeqNumber, _Compare> __lrcomp(__comp);
244 if (!__comp(__S(__i)[__a[__i] - 1], *__lmax))
344 if (!__comp(__S(__i)[__a[__i] - 1], *__maxleft)
[all...] |
| partition.h | 328 * @param __comp Comparator.
333 _RAIter __end, _Compare __comp)
367 __pred(__comp, *__pivot_pos);
392 _ValueType, bool>(__comp, *__pivot_pos));
412 __gnu_sequential::nth_element(__begin, __nth, __end, __comp);
419 * @param __comp Comparator. */
424 _RAIter __end, _Compare __comp)
426 __parallel_nth_element(__begin, __middle, __end, __comp);
427 std::sort(__begin, __middle, __comp);
|
| for_each_selectors.h | 309 _Compare& __comp; member in struct:__gnu_parallel::__min_element_reduct
312 __min_element_reduct(_Compare &__c) : __comp(__c) { }
316 { return (__comp(*__x, *__y)) ? __x : __y; }
323 _Compare& __comp; member in struct:__gnu_parallel::__max_element_reduct
326 __max_element_reduct(_Compare& __c) : __comp(__c) { }
330 { return (__comp(*__x, *__y)) ? __y : __x; }
|
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/ |
| base.h | 163 _EqualFromLess(_Compare& __comp) : _M_comp(__comp) { }
390 according to @c __comp.
394 * @param __comp Comparator.
399 _RAIter __c, _Compare __comp)
401 if (__comp(*__a, *__b))
402 if (__comp(*__b, *__c))
405 if (__comp(*__a, *__c))
412 if (__comp(*__a, *__c))
415 if (__comp(*__b, *__c)
[all...] |
| multiseq_selection.h | 61 _Lexicographic(_Compare& __comp) : _M_comp(__comp) { }
86 _LexicographicReverse(_Compare& __comp) : _M_comp(__comp) { }
117 * @param __comp The ordering functor, defaults to std::less<_Tp>.
125 _Compare __comp = std::less<
140 _Lexicographic<_ValueType, _SeqNumber, _Compare> __lcomp(__comp);
141 _LexicographicReverse<_ValueType, _SeqNumber, _Compare> __lrcomp(__comp);
244 if (!__comp(__S(__i)[__a[__i] - 1], *__lmax))
344 if (!__comp(__S(__i)[__a[__i] - 1], *__maxleft)
[all...] |
| partition.h | 328 * @param __comp Comparator.
333 _RAIter __end, _Compare __comp)
367 __pred(__comp, *__pivot_pos);
392 _ValueType, bool>(__comp, *__pivot_pos));
412 __gnu_sequential::nth_element(__begin, __nth, __end, __comp);
419 * @param __comp Comparator. */
424 _RAIter __end, _Compare __comp)
426 __parallel_nth_element(__begin, __middle, __end, __comp);
427 std::sort(__begin, __middle, __comp);
|
| for_each_selectors.h | 309 _Compare& __comp; member in struct:__gnu_parallel::__min_element_reduct
312 __min_element_reduct(_Compare &__c) : __comp(__c) { }
316 { return (__comp(*__x, *__y)) ? __x : __y; }
323 _Compare& __comp; member in struct:__gnu_parallel::__max_element_reduct
326 __max_element_reduct(_Compare& __c) : __comp(__c) { }
330 { return (__comp(*__x, *__y)) ? __y : __x; }
|
| /external/libcxx/include/ |
| set | 438 explicit set(const value_compare& __comp)
442 : __tree_(__comp) {}
445 explicit set(const value_compare& __comp, const allocator_type& __a)
446 : __tree_(__comp, __a) {}
450 const value_compare& __comp = value_compare())
451 : __tree_(__comp)
458 set(_InputIterator __f, _InputIterator __l, const value_compare& __comp,
460 : __tree_(__comp, __a)
510 set(initializer_list<value_type> __il, const value_compare& __comp = value_compare())
511 : __tree_(__comp)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| set | 436 explicit set(const value_compare& __comp)
440 : __tree_(__comp) {}
443 explicit set(const value_compare& __comp, const allocator_type& __a)
444 : __tree_(__comp, __a) {}
448 const value_compare& __comp = value_compare())
449 : __tree_(__comp)
456 set(_InputIterator __f, _InputIterator __l, const value_compare& __comp,
458 : __tree_(__comp, __a)
508 set(initializer_list<value_type> __il, const value_compare& __comp = value_compare())
509 : __tree_(__comp)
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| set | 436 explicit set(const value_compare& __comp)
440 : __tree_(__comp) {}
443 explicit set(const value_compare& __comp, const allocator_type& __a)
444 : __tree_(__comp, __a) {}
448 const value_compare& __comp = value_compare())
449 : __tree_(__comp)
456 set(_InputIterator __f, _InputIterator __l, const value_compare& __comp,
458 : __tree_(__comp, __a)
508 set(initializer_list<value_type> __il, const value_compare& __comp = value_compare())
509 : __tree_(__comp)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/ |
| algorithm | 458 _StrictWeakOrdering __comp)
468 return std::__is_heap(__first, __comp, __last - __first);
512 _StrictWeakOrdering __comp)
526 if (__comp(*__next, *__first))
570 * @param __comp A binary predicate.
580 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp)
585 if (__comp(__a, __b))
586 if (__comp(__b, __c))
588 else if (__comp(__a, __c))
592 else if (__comp(__a, __c)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/ |
| algorithm | 458 _StrictWeakOrdering __comp)
468 return std::__is_heap(__first, __comp, __last - __first);
512 _StrictWeakOrdering __comp)
526 if (__comp(*__next, *__first))
570 * @param __comp A binary predicate.
580 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp)
585 if (__comp(__a, __b))
586 if (__comp(__b, __c))
588 else if (__comp(__a, __c))
592 else if (__comp(__a, __c)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/ |
| algorithm | 458 _StrictWeakOrdering __comp)
468 return std::__is_heap(__first, __comp, __last - __first);
512 _StrictWeakOrdering __comp)
526 if (__comp(*__next, *__first))
570 * @param __comp A binary predicate.
580 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp)
585 if (__comp(__a, __b))
586 if (__comp(__b, __c))
588 else if (__comp(__a, __c))
592 else if (__comp(__a, __c)
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/ |
| algorithm | 458 _StrictWeakOrdering __comp)
468 return std::__is_heap(__first, __comp, __last - __first);
512 _StrictWeakOrdering __comp)
526 if (__comp(*__next, *__first))
570 * @param __comp A binary predicate.
580 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp)
585 if (__comp(__a, __b))
586 if (__comp(__b, __c))
588 else if (__comp(__a, __c))
592 else if (__comp(__a, __c)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| list.tcc | 322 merge(list&& __x, _StrictWeakOrdering __comp)
324 merge(list& __x, _StrictWeakOrdering __comp)
338 if (__comp(*__first2, *__first1))
431 sort(_StrictWeakOrdering __comp)
450 __counter->merge(__carry, __comp);
460 __counter->merge(*(__counter - 1), __comp);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/debug/ |
| multiset.h | 75 explicit multiset(const _Compare& __comp = _Compare(),
77 : _Base(__comp, __a) { }
81 const _Compare& __comp = _Compare(),
86 __comp, __a) { }
101 const _Compare& __comp = _Compare(),
103 : _Base(__l, __comp, __a) { }
|
