| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_algo.h | 79 _CheckedCompare(const _Compare & __comp): _M_compare(__comp) { }
102 # define __CheckedCompare(__comp) _CheckedCompare<__typeof__(__comp)>(__comp)
104 # define __CheckedCompare(__comp) __comp
155 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp)
160 if (__comp(__a, __b))
161 if (__comp(__b, __c)
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
| stl_algo.h | 79 _CheckedCompare(const _Compare & __comp): _M_compare(__comp) { }
102 # define __CheckedCompare(__comp) _CheckedCompare<__typeof__(__comp)>(__comp)
104 # define __CheckedCompare(__comp) __comp
155 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp)
160 if (__comp(__a, __b))
161 if (__comp(__b, __c)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| algo.h | 154 __comp(__gnu_parallel::_EqualTo<_ValueType, const _Tp&>(), __val);
156 __begin, __end, __begin, __comp,
226 _BinaryPredicate __comp, __gnu_parallel::sequential_tag)
228 __begin1, __end1, __begin2, __end2, __comp); }
247 _BinaryPredicate __comp, random_access_iterator_tag,
251 __find_template(__begin1, __end1, __begin1, __comp,
263 _BinaryPredicate __comp, _IteratorTag1, _IteratorTag2)
264 { return find_first_of(__begin1, __end1, __begin2, __end2, __comp,
273 _BinaryPredicate __comp)
280 return __find_first_of_switch(__begin1, __end1, __begin2, __end2, __comp,
[all...] |
| losertree.h | 92 * @param __comp The comparator to use.
94 _LoserTreeBase(unsigned int __k, _Compare __comp)
95 : _M_comp(__comp)
179 _LoserTree(unsigned int __k, _Compare __comp)
180 : _Base::_LoserTreeBase(__k, __comp)
272 _LoserTree(unsigned int __k, _Compare __comp)
273 : _Base::_LoserTreeBase(__k, __comp)
374 _Compare __comp = std::less<_Tp>())
375 : _M_comp(__comp)
418 _LoserTreePointer(unsigned int __k, _Compare __comp = std::less<_Tp>()
[all...] |
| 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...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| algo.h | 154 __comp(__gnu_parallel::_EqualTo<_ValueType, const _Tp&>(), __val);
156 __begin, __end, __begin, __comp,
226 _BinaryPredicate __comp, __gnu_parallel::sequential_tag)
228 __begin1, __end1, __begin2, __end2, __comp); }
247 _BinaryPredicate __comp, random_access_iterator_tag,
251 __find_template(__begin1, __end1, __begin1, __comp,
263 _BinaryPredicate __comp, _IteratorTag1, _IteratorTag2)
264 { return find_first_of(__begin1, __end1, __begin2, __end2, __comp,
273 _BinaryPredicate __comp)
280 return __find_first_of_switch(__begin1, __end1, __begin2, __end2, __comp,
[all...] |
| losertree.h | 92 * @param __comp The comparator to use.
94 _LoserTreeBase(unsigned int __k, _Compare __comp)
95 : _M_comp(__comp)
179 _LoserTree(unsigned int __k, _Compare __comp)
180 : _Base::_LoserTreeBase(__k, __comp)
272 _LoserTree(unsigned int __k, _Compare __comp)
273 : _Base::_LoserTreeBase(__k, __comp)
374 _Compare __comp = std::less<_Tp>())
375 : _M_comp(__comp)
418 _LoserTreePointer(unsigned int __k, _Compare __comp = std::less<_Tp>()
[all...] |
| 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...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/ |
| algo.h | 154 __comp(__gnu_parallel::_EqualTo<_ValueType, const _Tp&>(), __val);
156 __begin, __end, __begin, __comp,
226 _BinaryPredicate __comp, __gnu_parallel::sequential_tag)
228 __begin1, __end1, __begin2, __end2, __comp); }
247 _BinaryPredicate __comp, random_access_iterator_tag,
251 __find_template(__begin1, __end1, __begin1, __comp,
263 _BinaryPredicate __comp, _IteratorTag1, _IteratorTag2)
264 { return find_first_of(__begin1, __end1, __begin2, __end2, __comp,
273 _BinaryPredicate __comp)
280 return __find_first_of_switch(__begin1, __end1, __begin2, __end2, __comp,
[all...] |
| losertree.h | 92 * @param __comp The comparator to use.
94 _LoserTreeBase(unsigned int __k, _Compare __comp)
95 : _M_comp(__comp)
179 _LoserTree(unsigned int __k, _Compare __comp)
180 : _Base::_LoserTreeBase(__k, __comp)
272 _LoserTree(unsigned int __k, _Compare __comp)
273 : _Base::_LoserTreeBase(__k, __comp)
374 _Compare __comp = std::less<_Tp>())
375 : _M_comp(__comp)
418 _LoserTreePointer(unsigned int __k, _Compare __comp = std::less<_Tp>()
[all...] |
| 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...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/ |
| algo.h | 154 __comp(__gnu_parallel::_EqualTo<_ValueType, const _Tp&>(), __val);
156 __begin, __end, __begin, __comp,
226 _BinaryPredicate __comp, __gnu_parallel::sequential_tag)
228 __begin1, __end1, __begin2, __end2, __comp); }
247 _BinaryPredicate __comp, random_access_iterator_tag,
251 __find_template(__begin1, __end1, __begin1, __comp,
263 _BinaryPredicate __comp, _IteratorTag1, _IteratorTag2)
264 { return find_first_of(__begin1, __end1, __begin2, __end2, __comp,
273 _BinaryPredicate __comp)
280 return __find_first_of_switch(__begin1, __end1, __begin2, __end2, __comp,
[all...] |
| losertree.h | 92 * @param __comp The comparator to use.
94 _LoserTreeBase(unsigned int __k, _Compare __comp)
95 : _M_comp(__comp)
179 _LoserTree(unsigned int __k, _Compare __comp)
180 : _Base::_LoserTreeBase(__k, __comp)
272 _LoserTree(unsigned int __k, _Compare __comp)
273 : _Base::_LoserTreeBase(__k, __comp)
374 _Compare __comp = std::less<_Tp>())
375 : _M_comp(__comp)
418 _LoserTreePointer(unsigned int __k, _Compare __comp = std::less<_Tp>()
[all...] |
| 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...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/ |
| algo.h | 156 __comp(__gnu_parallel::_EqualTo<_ValueType, const _Tp&>(), __val);
158 __begin, __end, __begin, __comp,
228 _BinaryPredicate __comp, __gnu_parallel::sequential_tag)
230 __begin1, __end1, __begin2, __end2, __comp); }
249 _BinaryPredicate __comp, random_access_iterator_tag,
253 __find_template(__begin1, __end1, __begin1, __comp,
265 _BinaryPredicate __comp, _IteratorTag1, _IteratorTag2)
266 { return find_first_of(__begin1, __end1, __begin2, __end2, __comp,
275 _BinaryPredicate __comp)
282 return __find_first_of_switch(__begin1, __end1, __begin2, __end2, __comp,
[all...] |
| losertree.h | 92 * @param __comp The comparator to use.
94 _LoserTreeBase(unsigned int __k, _Compare __comp)
95 : _M_comp(__comp)
179 _LoserTree(unsigned int __k, _Compare __comp)
180 : _Base::_LoserTreeBase(__k, __comp)
272 _LoserTree(unsigned int __k, _Compare __comp)
273 : _Base::_LoserTreeBase(__k, __comp)
374 _Compare __comp = std::less<_Tp>())
375 : _M_comp(__comp)
418 _LoserTreePointer(unsigned int __k, _Compare __comp = std::less<_Tp>()
[all...] |
| 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...] |
| /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);
|
