| /external/stlport/stlport/stl/ |
| _slist.c | 149 _StrictWeakOrdering __comp) {
155 if (__comp(__x.front(), __STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data)) {
156 _STLP_VERBOSE_ASSERT(!__comp(__STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data, __x.front()),
169 if (__comp(__STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data, *__i2)) {
170 _STLP_VERBOSE_ASSERT(!__comp(*__i2, __STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data),
184 void _Slist_sort(slist<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp) {
196 _STLP_PRIV _Slist_merge(__counter[__i], __carry, __comp);
211 _STLP_PRIV _Slist_merge(__counter[__i], __counter[__i - 1], __comp);
|
| _algobase.c | 58 _Compare __comp) {
63 if (__comp(*__first1, *__first2)) {
64 _STLP_VERBOSE_ASSERT(!__comp(*__first2, *__first1),
68 if (__comp(*__first2, *__first1))
350 _BinaryPredicate __comp) {
353 if (__comp(*__first1, *__iter)) {
372 _BinaryPredicate __comp) {
378 _ForwardIter1 __new_result = _STLP_STD::search(__first1, __last1, __first2, __last2, __comp);
409 _BinaryPredicate __comp) {
417 __comp);
[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);
|
| _slist.c | 149 _StrictWeakOrdering __comp) {
155 if (__comp(__x.front(), __STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data)) {
156 _STLP_VERBOSE_ASSERT(!__comp(__STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data, __x.front()),
169 if (__comp(__STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data, *__i2)) {
170 _STLP_VERBOSE_ASSERT(!__comp(*__i2, __STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data),
184 void _Slist_sort(slist<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp) {
196 _STLP_PRIV _Slist_merge(__counter[__i], __carry, __comp);
211 _STLP_PRIV _Slist_merge(__counter[__i], __counter[__i - 1], __comp);
|
| _algobase.c | 58 _Compare __comp) {
63 if (__comp(*__first1, *__first2)) {
64 _STLP_VERBOSE_ASSERT(!__comp(*__first2, *__first1),
68 if (__comp(*__first2, *__first1))
350 _BinaryPredicate __comp) {
353 if (__comp(*__first1, *__iter)) {
372 _BinaryPredicate __comp) {
378 _ForwardIter1 __new_result = _STLP_STD::search(__first1, __last1, __first2, __last2, __comp);
409 _BinaryPredicate __comp) {
417 __comp);
[all...] |
| /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);
|
| _slist.c | 149 _StrictWeakOrdering __comp) {
155 if (__comp(__x.front(), __STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data)) {
156 _STLP_VERBOSE_ASSERT(!__comp(__STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data, __x.front()),
169 if (__comp(__STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data, *__i2)) {
170 _STLP_VERBOSE_ASSERT(!__comp(*__i2, __STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data),
184 void _Slist_sort(slist<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp) {
196 _STLP_PRIV _Slist_merge(__counter[__i], __carry, __comp);
211 _STLP_PRIV _Slist_merge(__counter[__i], __counter[__i - 1], __comp);
|
| _algobase.c | 58 _Compare __comp) {
63 if (__comp(*__first1, *__first2)) {
64 _STLP_VERBOSE_ASSERT(!__comp(*__first2, *__first1),
68 if (__comp(*__first2, *__first1))
350 _BinaryPredicate __comp) {
353 if (__comp(*__first1, *__iter)) {
372 _BinaryPredicate __comp) {
378 _ForwardIter1 __new_result = _STLP_STD::search(__first1, __last1, __first2, __last2, __comp);
409 _BinaryPredicate __comp) {
417 __comp);
[all...] |
| /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);
|
| _slist.c | 149 _StrictWeakOrdering __comp) {
155 if (__comp(__x.front(), __STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data)) {
156 _STLP_VERBOSE_ASSERT(!__comp(__STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data, __x.front()),
169 if (__comp(__STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data, *__i2)) {
170 _STLP_VERBOSE_ASSERT(!__comp(*__i2, __STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data),
184 void _Slist_sort(slist<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp) {
196 _STLP_PRIV _Slist_merge(__counter[__i], __carry, __comp);
211 _STLP_PRIV _Slist_merge(__counter[__i], __counter[__i - 1], __comp);
|
| _algobase.c | 58 _Compare __comp) {
63 if (__comp(*__first1, *__first2)) {
64 _STLP_VERBOSE_ASSERT(!__comp(*__first2, *__first1),
68 if (__comp(*__first2, *__first1))
350 _BinaryPredicate __comp) {
353 if (__comp(*__first1, *__iter)) {
372 _BinaryPredicate __comp) {
378 _ForwardIter1 __new_result = _STLP_STD::search(__first1, __last1, __first2, __last2, __comp);
409 _BinaryPredicate __comp) {
417 __comp);
[all...] |
| /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);
|
| _slist.c | 149 _StrictWeakOrdering __comp) {
155 if (__comp(__x.front(), __STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data)) {
156 _STLP_VERBOSE_ASSERT(!__comp(__STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data, __x.front()),
169 if (__comp(__STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data, *__i2)) {
170 _STLP_VERBOSE_ASSERT(!__comp(*__i2, __STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data),
184 void _Slist_sort(slist<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp) {
196 _STLP_PRIV _Slist_merge(__counter[__i], __carry, __comp);
211 _STLP_PRIV _Slist_merge(__counter[__i], __counter[__i - 1], __comp);
|
| _algobase.c | 58 _Compare __comp) {
63 if (__comp(*__first1, *__first2)) {
64 _STLP_VERBOSE_ASSERT(!__comp(*__first2, *__first1),
68 if (__comp(*__first2, *__first1))
350 _BinaryPredicate __comp) {
353 if (__comp(*__first1, *__iter)) {
372 _BinaryPredicate __comp) {
378 _ForwardIter1 __new_result = _STLP_STD::search(__first1, __last1, __first2, __last2, __comp);
409 _BinaryPredicate __comp) {
417 __comp);
[all...] |
| /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);
|
| _slist.c | 149 _StrictWeakOrdering __comp) {
155 if (__comp(__x.front(), __STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data)) {
156 _STLP_VERBOSE_ASSERT(!__comp(__STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data, __x.front()),
169 if (__comp(__STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data, *__i2)) {
170 _STLP_VERBOSE_ASSERT(!__comp(*__i2, __STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data),
184 void _Slist_sort(slist<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp) {
196 _STLP_PRIV _Slist_merge(__counter[__i], __carry, __comp);
211 _STLP_PRIV _Slist_merge(__counter[__i], __counter[__i - 1], __comp);
|
| _algobase.c | 58 _Compare __comp) {
63 if (__comp(*__first1, *__first2)) {
64 _STLP_VERBOSE_ASSERT(!__comp(*__first2, *__first1),
68 if (__comp(*__first2, *__first1))
350 _BinaryPredicate __comp) {
353 if (__comp(*__first1, *__iter)) {
372 _BinaryPredicate __comp) {
378 _ForwardIter1 __new_result = _STLP_STD::search(__first1, __last1, __first2, __last2, __comp);
409 _BinaryPredicate __comp) {
417 __comp);
[all...] |
| /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);
|
| _slist.c | 149 _StrictWeakOrdering __comp) {
155 if (__comp(__x.front(), __STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data)) {
156 _STLP_VERBOSE_ASSERT(!__comp(__STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data, __x.front()),
169 if (__comp(__STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data, *__i2)) {
170 _STLP_VERBOSE_ASSERT(!__comp(*__i2, __STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data),
184 void _Slist_sort(slist<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp) {
196 _STLP_PRIV _Slist_merge(__counter[__i], __carry, __comp);
211 _STLP_PRIV _Slist_merge(__counter[__i], __counter[__i - 1], __comp);
|
| _algobase.c | 58 _Compare __comp) {
63 if (__comp(*__first1, *__first2)) {
64 _STLP_VERBOSE_ASSERT(!__comp(*__first2, *__first1),
68 if (__comp(*__first2, *__first1))
350 _BinaryPredicate __comp) {
353 if (__comp(*__first1, *__iter)) {
372 _BinaryPredicate __comp) {
378 _ForwardIter1 __new_result = _STLP_STD::search(__first1, __last1, __first2, __last2, __comp);
409 _BinaryPredicate __comp) {
417 __comp);
[all...] |
| /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...] |
| 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; }
|
| 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...] |
| 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);
|
