HomeSort by relevance Sort by last modified time
    Searched full:__comp (Results 101 - 125 of 474) sorted by null

1 2 3 45 6 7 8 91011>>

  /ndk/sources/cxx-stl/stlport/stlport/stl/
_list.c 169 _StrictWeakOrdering __comp) {
177 if (__comp(*__first2, *__first1)) {
178 _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
191 if (__comp(*__first2, *__first1)) {
192 _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
206 void _S_sort(list<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp) {
220 _S_merge(__counter[__i], __carry, __comp);
234 _S_merge(__counter[__i], __counter[__i - 1], __comp);
  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/
_list.c 169 _StrictWeakOrdering __comp) {
177 if (__comp(*__first2, *__first1)) {
178 _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
191 if (__comp(*__first2, *__first1)) {
192 _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
206 void _S_sort(list<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp) {
220 _S_merge(__counter[__i], __carry, __comp);
234 _S_merge(__counter[__i], __counter[__i - 1], __comp);
  /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/
_list.c 169 _StrictWeakOrdering __comp) {
177 if (__comp(*__first2, *__first1)) {
178 _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
191 if (__comp(*__first2, *__first1)) {
192 _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
206 void _S_sort(list<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp) {
220 _S_merge(__counter[__i], __carry, __comp);
234 _S_merge(__counter[__i], __counter[__i - 1], __comp);
  /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/
_list.c 169 _StrictWeakOrdering __comp) {
177 if (__comp(*__first2, *__first1)) {
178 _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
191 if (__comp(*__first2, *__first1)) {
192 _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
206 void _S_sort(list<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp) {
220 _S_merge(__counter[__i], __carry, __comp);
234 _S_merge(__counter[__i], __counter[__i - 1], __comp);
  /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/
_list.c 169 _StrictWeakOrdering __comp) {
177 if (__comp(*__first2, *__first1)) {
178 _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
191 if (__comp(*__first2, *__first1)) {
192 _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
206 void _S_sort(list<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp) {
220 _S_merge(__counter[__i], __carry, __comp);
234 _S_merge(__counter[__i], __counter[__i - 1], __comp);
  /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/
_list.c 169 _StrictWeakOrdering __comp) {
177 if (__comp(*__first2, *__first1)) {
178 _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
191 if (__comp(*__first2, *__first1)) {
192 _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
206 void _S_sort(list<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp) {
220 _S_merge(__counter[__i], __carry, __comp);
234 _S_merge(__counter[__i], __counter[__i - 1], __comp);
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/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; }
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
set 379 explicit set(const value_compare& __comp = value_compare())
384 : __tree_(__comp) {}
386 set(const value_compare& __comp, const allocator_type& __a)
387 : __tree_(__comp, __a) {}
391 const value_compare& __comp = value_compare())
392 : __tree_(__comp)
399 set(_InputIterator __f, _InputIterator __l, const value_compare& __comp,
401 : __tree_(__comp, __a)
444 set(initializer_list<value_type> __il, const value_compare& __comp = value_compare())
445 : __tree_(__comp)
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/profile/
multiset.h 67 explicit multiset(const _Compare& __comp = _Compare(),
69 : _Base(__comp, __a) { }
73 const _Compare& __comp = _Compare(),
75 : _Base(__first, __last, __comp, __a) { }
89 const _Compare& __comp = _Compare(),
91 : _Base(__l, __comp, __a) { }
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/profile/
multiset.h 67 explicit multiset(const _Compare& __comp = _Compare(),
69 : _Base(__comp, __a) { }
73 const _Compare& __comp = _Compare(),
75 : _Base(__first, __last, __comp, __a) { }
89 const _Compare& __comp = _Compare(),
91 : _Base(__l, __comp, __a) { }
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/profile/
multiset.h 67 explicit multiset(const _Compare& __comp = _Compare(),
69 : _Base(__comp, __a) { }
73 const _Compare& __comp = _Compare(),
75 : _Base(__first, __last, __comp, __a) { }
89 const _Compare& __comp = _Compare(),
91 : _Base(__l, __comp, __a) { }
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/profile/
multiset.h 67 explicit multiset(const _Compare& __comp = _Compare(),
69 : _Base(__comp, __a) { }
73 const _Compare& __comp = _Compare(),
75 : _Base(__first, __last, __comp, __a) { }
89 const _Compare& __comp = _Compare(),
91 : _Base(__l, __comp, __a) { }
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/
algorithm 460 _StrictWeakOrdering __comp)
470 return std::__is_heap(__first, __comp, __last - __first);
514 _StrictWeakOrdering __comp)
528 if (__comp(*__next, *__first))
572 * @param __comp A binary predicate.
582 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp)
587 if (__comp(__a, __b))
588 if (__comp(__b, __c))
590 else if (__comp(__a, __c))
594 else if (__comp(__a, __c)
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/
algorithm 460 _StrictWeakOrdering __comp)
470 return std::__is_heap(__first, __comp, __last - __first);
514 _StrictWeakOrdering __comp)
528 if (__comp(*__next, *__first))
572 * @param __comp A binary predicate.
582 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp)
587 if (__comp(__a, __b))
588 if (__comp(__b, __c))
590 else if (__comp(__a, __c))
594 else if (__comp(__a, __c)
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/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/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/
algorithm 460 _StrictWeakOrdering __comp)
470 return std::__is_heap(__first, __comp, __last - __first);
514 _StrictWeakOrdering __comp)
528 if (__comp(*__next, *__first))
582 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp)
587 if (__comp(__a, __b))
588 if (__comp(__b, __c))
590 else if (__comp(__a, __c))
594 else if (__comp(__a, __c))
596 else if (__comp(__b, __c)
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/
algorithm 460 _StrictWeakOrdering __comp)
470 return std::__is_heap(__first, __comp, __last - __first);
514 _StrictWeakOrdering __comp)
528 if (__comp(*__next, *__first))
582 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp)
587 if (__comp(__a, __b))
588 if (__comp(__b, __c))
590 else if (__comp(__a, __c))
594 else if (__comp(__a, __c))
596 else if (__comp(__b, __c)
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/
algorithm 460 _StrictWeakOrdering __comp)
470 return std::__is_heap(__first, __comp, __last - __first);
514 _StrictWeakOrdering __comp)
528 if (__comp(*__next, *__first))
582 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp)
587 if (__comp(__a, __b))
588 if (__comp(__b, __c))
590 else if (__comp(__a, __c))
594 else if (__comp(__a, __c))
596 else if (__comp(__b, __c)
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/
algorithm 460 _StrictWeakOrdering __comp)
470 return std::__is_heap(__first, __comp, __last - __first);
514 _StrictWeakOrdering __comp)
528 if (__comp(*__next, *__first))
582 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp)
587 if (__comp(__a, __b))
588 if (__comp(__b, __c))
590 else if (__comp(__a, __c))
594 else if (__comp(__a, __c))
596 else if (__comp(__b, __c)
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/
list.tcc 270 merge(list&& __x, _StrictWeakOrdering __comp)
272 merge(list& __x, _StrictWeakOrdering __comp)
286 if (__comp(*__first2, *__first1))
379 sort(_StrictWeakOrdering __comp)
398 __counter->merge(__carry, __comp);
408 __counter->merge(*(__counter - 1), __comp);
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/debug/
multiset.h 73 explicit multiset(const _Compare& __comp = _Compare(),
75 : _Base(__comp, __a) { }
79 const _Compare& __comp = _Compare(),
82 __comp, __a) { }
96 const _Compare& __comp = _Compare(),
98 : _Base(__l, __comp, __a), _Safe_base() { }
set.h 73 explicit set(const _Compare& __comp = _Compare(),
75 : _Base(__comp, __a) { }
79 const _Compare& __comp = _Compare(),
82 __comp, __a) { }
96 const _Compare& __comp = _Compare(),
98 : _Base(__l, __comp, __a), _Safe_base() { }

Completed in 1325 milliseconds

1 2 3 45 6 7 8 91011>>