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

1 23 4 5 6 7 8 91011>>

  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/
_map.h 101 explicit map(const _Compare& __comp,
104 explicit map(const _Compare& __comp)
105 : _M_t(__comp, allocator_type()) {}
106 explicit map(const _Compare& __comp, const allocator_type& __a)
108 : _M_t(__comp, __a) {}
117 map(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
119 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
123 map(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
124 : _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); }
133 const value_type* __last, const _Compare& __comp,
    [all...]
_algo.h 146 _ForwardIter __first2, _ForwardIter __last2, _BinaryPredicate __comp) {
149 return _STLP_PRIV __find_first_of(__first1, __last1, __first2, __last2, __comp);
420 void sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp);
429 _RandomAccessIter __last, _Compare __comp);
439 _RandomAccessIter __last, _Compare __comp);
450 _RandomAccessIter __result_last, _Compare __comp);
459 _RandomAccessIter __last, _Compare __comp);
492 const _Tp& __val, _Compare __comp) {
494 return _STLP_PRIV __lower_bound(__first, __last, __val, __comp, __comp,
    [all...]
_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);
  /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/
_map.h 101 explicit map(const _Compare& __comp,
104 explicit map(const _Compare& __comp)
105 : _M_t(__comp, allocator_type()) {}
106 explicit map(const _Compare& __comp, const allocator_type& __a)
108 : _M_t(__comp, __a) {}
117 map(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
119 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
123 map(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
124 : _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); }
133 const value_type* __last, const _Compare& __comp,
    [all...]
_algo.h 146 _ForwardIter __first2, _ForwardIter __last2, _BinaryPredicate __comp) {
149 return _STLP_PRIV __find_first_of(__first1, __last1, __first2, __last2, __comp);
420 void sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp);
429 _RandomAccessIter __last, _Compare __comp);
439 _RandomAccessIter __last, _Compare __comp);
450 _RandomAccessIter __result_last, _Compare __comp);
459 _RandomAccessIter __last, _Compare __comp);
492 const _Tp& __val, _Compare __comp) {
494 return _STLP_PRIV __lower_bound(__first, __last, __val, __comp, __comp,
    [all...]
_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);
  /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/
_map.h 101 explicit map(const _Compare& __comp,
104 explicit map(const _Compare& __comp)
105 : _M_t(__comp, allocator_type()) {}
106 explicit map(const _Compare& __comp, const allocator_type& __a)
108 : _M_t(__comp, __a) {}
117 map(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
119 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
123 map(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
124 : _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); }
133 const value_type* __last, const _Compare& __comp,
    [all...]
_algo.h 146 _ForwardIter __first2, _ForwardIter __last2, _BinaryPredicate __comp) {
149 return _STLP_PRIV __find_first_of(__first1, __last1, __first2, __last2, __comp);
420 void sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp);
429 _RandomAccessIter __last, _Compare __comp);
439 _RandomAccessIter __last, _Compare __comp);
450 _RandomAccessIter __result_last, _Compare __comp);
459 _RandomAccessIter __last, _Compare __comp);
492 const _Tp& __val, _Compare __comp) {
494 return _STLP_PRIV __lower_bound(__first, __last, __val, __comp, __comp,
    [all...]
_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);
  /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/
_map.h 101 explicit map(const _Compare& __comp,
104 explicit map(const _Compare& __comp)
105 : _M_t(__comp, allocator_type()) {}
106 explicit map(const _Compare& __comp, const allocator_type& __a)
108 : _M_t(__comp, __a) {}
117 map(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
119 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
123 map(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
124 : _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); }
133 const value_type* __last, const _Compare& __comp,
    [all...]
_algo.h 146 _ForwardIter __first2, _ForwardIter __last2, _BinaryPredicate __comp) {
149 return _STLP_PRIV __find_first_of(__first1, __last1, __first2, __last2, __comp);
420 void sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp);
429 _RandomAccessIter __last, _Compare __comp);
439 _RandomAccessIter __last, _Compare __comp);
450 _RandomAccessIter __result_last, _Compare __comp);
459 _RandomAccessIter __last, _Compare __comp);
492 const _Tp& __val, _Compare __comp) {
494 return _STLP_PRIV __lower_bound(__first, __last, __val, __comp, __comp,
    [all...]
_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);
  /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/
_map.h 101 explicit map(const _Compare& __comp,
104 explicit map(const _Compare& __comp)
105 : _M_t(__comp, allocator_type()) {}
106 explicit map(const _Compare& __comp, const allocator_type& __a)
108 : _M_t(__comp, __a) {}
117 map(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
119 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
123 map(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
124 : _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); }
133 const value_type* __last, const _Compare& __comp,
    [all...]
_algo.h 146 _ForwardIter __first2, _ForwardIter __last2, _BinaryPredicate __comp) {
149 return _STLP_PRIV __find_first_of(__first1, __last1, __first2, __last2, __comp);
420 void sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp);
429 _RandomAccessIter __last, _Compare __comp);
439 _RandomAccessIter __last, _Compare __comp);
450 _RandomAccessIter __result_last, _Compare __comp);
459 _RandomAccessIter __last, _Compare __comp);
492 const _Tp& __val, _Compare __comp) {
494 return _STLP_PRIV __lower_bound(__first, __last, __val, __comp, __comp,
    [all...]
_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);
  /external/stlport/stlport/stl/
_algo.h 146 _ForwardIter __first2, _ForwardIter __last2, _BinaryPredicate __comp) {
149 return _STLP_PRIV __find_first_of(__first1, __last1, __first2, __last2, __comp);
420 void sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp);
429 _RandomAccessIter __last, _Compare __comp);
439 _RandomAccessIter __last, _Compare __comp);
450 _RandomAccessIter __result_last, _Compare __comp);
459 _RandomAccessIter __last, _Compare __comp);
492 const _Tp& __val, _Compare __comp) {
494 return _STLP_PRIV __lower_bound(__first, __last, __val, __comp, __comp,
    [all...]
_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);
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_algo.h 146 _ForwardIter __first2, _ForwardIter __last2, _BinaryPredicate __comp) {
149 return _STLP_PRIV __find_first_of(__first1, __last1, __first2, __last2, __comp);
420 void sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp);
429 _RandomAccessIter __last, _Compare __comp);
439 _RandomAccessIter __last, _Compare __comp);
450 _RandomAccessIter __result_last, _Compare __comp);
459 _RandomAccessIter __last, _Compare __comp);
492 const _Tp& __val, _Compare __comp) {
494 return _STLP_PRIV __lower_bound(__first, __last, __val, __comp, __comp,
    [all...]
_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);
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/
multiway_mergesort.h 133 _Compare& __comp,
155 __comp);
192 _Compare& __comp,
209 __comp);
223 __comp)
237 __comp)
255 const _RAIter& __end, _Compare& __comp) const
256 { __gnu_sequential::stable_sort(__begin, __end, __comp); }
263 const _RAIter __end, _Compare& __comp) const
264 { __gnu_sequential::sort(__begin, __end, __comp); }
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
stl_algo.h 101 /// Swaps the median value of *__a, *__b and *__c under __comp to *__a
105 _Compare __comp)
112 if (__comp(*__a, *__b))
114 if (__comp(*__b, *__c))
116 else if (__comp(*__a, *__c))
119 else if (__comp(*__a, *__c))
121 else if (__comp(*__b, *__c))
551 _BinaryPredicate __comp)
562 __last2, __comp);
618 _BinaryPredicate __comp)
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
stl_algo.h 101 /// Swaps the median value of *__a, *__b and *__c under __comp to *__a
105 _Compare __comp)
112 if (__comp(*__a, *__b))
114 if (__comp(*__b, *__c))
116 else if (__comp(*__a, *__c))
119 else if (__comp(*__a, *__c))
121 else if (__comp(*__b, *__c))
551 _BinaryPredicate __comp)
562 __last2, __comp);
618 _BinaryPredicate __comp)
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/
stl_algo.h 99 /// Swaps the median value of *__a, *__b and *__c under __comp to *__a
103 _Compare __comp)
110 if (__comp(*__a, *__b))
112 if (__comp(*__b, *__c))
114 else if (__comp(*__a, *__c))
117 else if (__comp(*__a, *__c))
119 else if (__comp(*__b, *__c))
549 _BinaryPredicate __comp)
560 __last2, __comp);
616 _BinaryPredicate __comp)
    [all...]
  /external/stlport/stlport/stl/pointers/
_set.h 130 explicit set(const _Compare& __comp,
132 : _M_t(__comp, _STLP_CONVERT_ALLOCATOR(__a, _KeyStorageType)) {}
148 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
149 : _M_t(__comp, _StorageTypeAlloc()) {
159 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
161 : _M_t(__comp, _STLP_CONVERT_ALLOCATOR(__a, _KeyStorageType)) {
177 const _Compare& __comp, const allocator_type& __a = allocator_type())
178 : _M_t(__comp, _STLP_CONVERT_ALLOCATOR(__a, _KeyStorageType)) {
188 const _Compare& __comp, const allocator_type& __a = allocator_type())
189 : _M_t(__comp, _STLP_CONVERT_ALLOCATOR(__a, _KeyStorageType)
    [all...]
  /ndk/sources/cxx-stl/stlport/stlport/stl/pointers/
_set.h 130 explicit set(const _Compare& __comp,
132 : _M_t(__comp, _STLP_CONVERT_ALLOCATOR(__a, _KeyStorageType)) {}
148 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
149 : _M_t(__comp, _StorageTypeAlloc()) {
159 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
161 : _M_t(__comp, _STLP_CONVERT_ALLOCATOR(__a, _KeyStorageType)) {
177 const _Compare& __comp, const allocator_type& __a = allocator_type())
178 : _M_t(__comp, _STLP_CONVERT_ALLOCATOR(__a, _KeyStorageType)) {
188 const _Compare& __comp, const allocator_type& __a = allocator_type())
189 : _M_t(__comp, _STLP_CONVERT_ALLOCATOR(__a, _KeyStorageType)
    [all...]

Completed in 640 milliseconds

1 23 4 5 6 7 8 91011>>