/ndk/sources/cxx-stl/stlport/stlport/stl/ |
H A D | _heap.h | 45 _Compare __comp); 69 _Distance __len, _Tp __val, _Compare __comp); 75 _RandomAccessIterator __result, _Tp __val, _Compare __comp, 80 __val, __comp); 86 _RandomAccessIterator __last, _Compare __comp); 95 _RandomAccessIterator __last, _Compare __comp); 109 _RandomAccessIterator __last, _Compare __comp) 112 pop_heap(__first, __last--, __comp); 74 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Tp __val, _Compare __comp, _Distance*) argument 108 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
|
H A D | _heap.c | 77 _Distance __topIndex, _Tp __val, _Compare __comp) 80 while (__holeIndex > __topIndex && __comp(*(__first + __parent), __val)) { 81 _STLP_VERBOSE_ASSERT(!__comp(__val, *(__first + __parent)), _StlMsg_INVALID_STRICT_WEAK_PREDICATE) 93 _RandomAccessIterator __last, _Compare __comp, 97 _Tp(*(__last - 1)), __comp); 103 _Compare __comp) 105 __push_heap_aux(__first, __last, __comp, 147 _Distance __len, _Tp __val, _Compare __comp) 152 if (__comp(*(__first + __secondChild), *(__first + (__secondChild - 1)))) { 153 _STLP_VERBOSE_ASSERT(!__comp(*(__firs 76 __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __val, _Compare __comp) argument 92 __push_heap_aux(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, _Distance*, _Tp*) argument 102 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument 146 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __val, _Compare __comp) argument 171 __pop_heap_aux(_RandomAccessIterator __first, _RandomAccessIterator __last, _Tp*, _Compare __comp) argument 181 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument 216 __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, _Tp*, _Distance*) argument 233 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument [all...] |
H A D | _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) { argument 220 _S_merge(__counter[__i], __carry, __comp); 234 _S_merge(__counter[__i], __counter[__i - 1], __comp); 168 _S_merge(list<_Tp, _Alloc>& __that, list<_Tp, _Alloc>& __x, _StrictWeakOrdering __comp) argument
|
H A D | _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) { argument 196 _STLP_PRIV _Slist_merge(__counter[__i], __carry, __comp); 211 _STLP_PRIV _Slist_merge(__counter[__i], __counter[__i - 1], __comp); 148 _Slist_merge(slist<_Tp, _Alloc>& __that, slist<_Tp, _Alloc>& __x, _StrictWeakOrdering __comp) argument
|
H A D | _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, 145 find_first_of(_InputIter __first1, _InputIter __last1, _ForwardIter __first2, _ForwardIter __last2, _BinaryPredicate __comp) argument 491 lower_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument 517 upper_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument 545 equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument 564 binary_search(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument 728 is_sorted(_ForwardIter __first, _ForwardIter __last, _StrictWeakOrdering __comp) argument [all...] |
H A D | _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); 56 lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _Compare __comp) argument 348 __find_first_of(_InputIter __first1, _InputIter __last1, _ForwardIter __first2, _ForwardIter __last2, _BinaryPredicate __comp) argument 369 __find_end(_ForwardIter1 __first1, _ForwardIter1 __last1, _ForwardIter2 __first2, _ForwardIter2 __last2, const forward_iterator_tag &, const forward_iterator_tag &, _BinaryPredicate __comp) argument 406 __find_end(_BidirectionalIter1 __first1, _BidirectionalIter1 __last1, _BidirectionalIter2 __first2, _BidirectionalIter2 __last2, const bidirectional_iterator_tag &, const bidirectional_iterator_tag &, _BinaryPredicate __comp) argument 434 find_end(_ForwardIter1 __first1, _ForwardIter1 __last1, _ForwardIter2 __first2, _ForwardIter2 __last2, _BinaryPredicate __comp) argument [all...] |
H A D | _algobase.h | 152 inline const _Tp& (min)(const _Tp& __a, const _Tp& __b, _Compare __comp) { argument 153 return __comp(__b, __a) ? __b : __a; 157 inline const _Tp& (max)(const _Tp& __a, const _Tp& __b, _Compare __comp) { argument 158 return __comp(__a, __b) ? __b : __a; 162 inline const _Tp (min)(const _Tp __a, const _Tp __b, _Compare __comp) { argument 163 return __comp(__b, __a) ? __b : __a; 167 inline const _Tp (max)(const _Tp __a, const _Tp __b, _Compare __comp) { argument 168 return __comp(__a, __b) ? __b : __a; 584 _Compare __comp); 687 _BinaryPredicate __comp); [all...] |
H A D | _map.h | 101 explicit map(const _Compare& __comp, argument 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, argument 119 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); } 123 map(_InputIterator __first, _InputIterator __last, const _Compare& __comp) argument 124 : _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); } 133 const value_type* __last, const _Compare& __comp, 132 map(const value_type* __first, const value_type* __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument 141 map(const_iterator __first, const_iterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument 293 multimap(const _Compare& __comp, const allocator_type& __a = allocator_type()) argument 304 multimap(_InputIterator __first, _InputIterator __last, const _Compare& __comp) argument 309 multimap(_InputIterator __first, _InputIterator __last, const _Compare& __comp, const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL) argument 317 multimap(const value_type* __first, const value_type* __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument 325 multimap(const_iterator __first, const_iterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument [all...] |
H A D | _set.h | 89 explicit set(const _Compare& __comp = _Compare(), 94 explicit set(const _Compare& __comp) 95 : _M_t(__comp, allocator_type()) {} 96 set(const _Compare& __comp, const allocator_type& __a) 98 : _M_t(__comp, __a) {} 108 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp) argument 109 : _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); } 112 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp, argument 114 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); } 121 const value_type* __last, const _Compare& __comp, 120 set(const value_type* __first, const value_type* __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument 129 set(const_iterator __first, const_iterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument 276 multiset(_InputIterator __first, _InputIterator __last, const _Compare& __comp, const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL) argument 282 multiset(_InputIterator __first, _InputIterator __last, const _Compare& __comp) argument 291 multiset(const value_type* __first, const value_type* __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument 300 multiset(const_iterator __first, const_iterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument [all...] |
H A D | _tree.c | 408 bool __comp = true; local 411 __comp = _M_key_compare(_KeyOfValue()(__val), _S_key(__x)); 412 __x = __comp ? _S_left(__x) : _S_right(__x); 415 if (__comp) {
|
H A D | _list.h | 243 _StrictWeakOrdering __comp); 246 void _S_sort(list<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp); 673 _StrictWeakOrdering __comp) { 674 _STLP_PRIV _S_merge(*this, __x, __comp); 678 void sort(_StrictWeakOrdering __comp) argument 679 { _STLP_PRIV _S_sort(*this, __comp); } 672 merge(_Self& __x, _StrictWeakOrdering __comp) argument
|
H A D | _slist.h | 210 _StrictWeakOrdering __comp); 213 void _Slist_sort(slist<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp); 809 void merge(_Self& __x, _StrictWeakOrdering __comp) argument 810 { _STLP_PRIV _Slist_merge(*this, __x, __comp); } 813 void sort(_StrictWeakOrdering __comp) argument 814 { _STLP_PRIV _Slist_sort(*this, __comp); }
|
H A D | _tree.h | 386 _Rb_tree(const _Compare& __comp) argument 387 : _Rb_tree_base<_Value, _Alloc>(allocator_type()), _M_node_count(0), _M_key_compare(__comp) 390 _Rb_tree(const _Compare& __comp, const allocator_type& __a) argument 391 : _Rb_tree_base<_Value, _Alloc>(__a), _M_node_count(0), _M_key_compare(__comp)
|
H A D | _algo.c | 46 _Compare __comp); 56 _Compare __comp); 83 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) { argument 84 if (__comp(__a, __b)) { 85 _STLP_VERBOSE_ASSERT(!__comp(__b, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE) 86 if (__comp(__b, __c)) { 87 _STLP_VERBOSE_ASSERT(!__comp(__c, __b), _StlMsg_INVALID_STRICT_WEAK_PREDICATE) 90 else if (__comp(__a, __c)) { 91 _STLP_VERBOSE_ASSERT(!__comp(__c, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE) 97 else if (__comp(__ 883 __unguarded_partition(_RandomAccessIter __first, _RandomAccessIter __last, _Tp __pivot, _Compare __comp) argument 907 __unguarded_linear_insert(_RandomAccessIter __last, _Tp __val, _Compare __comp) argument 921 __linear_insert(_RandomAccessIter __first, _RandomAccessIter __last, _Tp __val, _Compare __comp) argument 935 __insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last, _Tp *, _Compare __comp) argument 944 __unguarded_insertion_sort_aux(_RandomAccessIter __first, _RandomAccessIter __last, _Tp*, _Compare __comp) argument 952 __unguarded_insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp) argument 959 __final_insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp) argument 970 __introsort_loop(_RandomAccessIter __first, _RandomAccessIter __last, _Tp*, _Size __depth_limit, _Compare __comp) argument 1006 sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp) argument 1020 __inplace_stable_sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp) argument 1037 __merge_sort_loop(_RandomAccessIter1 __first, _RandomAccessIter1 __last, _RandomAccessIter2 __result, _Distance __step_size, _Compare __comp) argument 1061 __chunk_insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last, _Distance __chunk_size, _Compare __comp) argument 1074 __merge_sort_with_buffer(_RandomAccessIter __first, _RandomAccessIter __last, _Pointer __buffer, _Distance*, _Compare __comp) argument 1115 __merge_adaptive(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) argument 1159 __stable_sort_adaptive(_RandomAccessIter __first, _RandomAccessIter __last, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) argument 1182 __stable_sort_aux(_RandomAccessIter __first, _RandomAccessIter __last, _Tp*, _Distance*, _Compare __comp) argument 1207 stable_sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp) argument 1220 __partial_sort(_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last, _Tp*, _Compare __comp) argument 1245 partial_sort(_RandomAccessIter __first,_RandomAccessIter __middle, _RandomAccessIter __last, _Compare __comp) argument 1256 __partial_sort_copy(_InputIter __first, _InputIter __last, _RandomAccessIter __result_first, _RandomAccessIter __result_last, _Compare __comp, _Distance*, _Tp*) argument 1299 partial_sort_copy(_InputIter __first, _InputIter __last, _RandomAccessIter __result_first, _RandomAccessIter __result_last, _Compare __comp) argument 1314 __nth_element(_RandomAccessIter __first, _RandomAccessIter __nth, _RandomAccessIter __last, _Tp*, _Compare __comp) argument 1344 nth_element(_RandomAccessIter __first, _RandomAccessIter __nth, _RandomAccessIter __last, _Compare __comp) argument 1440 merge(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument 1463 __merge_without_buffer(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance __len1, _Distance __len2, _Compare __comp) argument 1503 __merge_backward(_BidirectionalIter1 __first1, _BidirectionalIter1 __last1, _BidirectionalIter2 __first2, _BidirectionalIter2 __last2, _BidirectionalIter3 __result, _Compare __comp) argument 1534 __inplace_merge_aux(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Tp*, _Distance*, _Compare __comp) argument 1566 inplace_merge(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Compare __comp) argument 1581 __includes(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _Compare __comp) argument 1601 includes(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _Compare __comp) argument 1617 __set_union(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument 1655 set_union(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument 1665 __set_intersection(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument 1698 set_intersection(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument 1708 __set_difference(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument 1741 set_difference(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument 1751 __set_symmetric_difference(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument 1789 set_symmetric_difference(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument 1813 max_element(_ForwardIter __first, _ForwardIter __last, _Compare __comp) argument 1841 min_element(_ForwardIter __first, _ForwardIter __last, _Compare __comp) argument 1860 __next_permutation(_BidirectionalIter __first, _BidirectionalIter __last, _Compare __comp) argument 1903 next_permutation(_BidirectionalIter __first, _BidirectionalIter __last, _Compare __comp) argument 1912 __prev_permutation(_BidirectionalIter __first, _BidirectionalIter __last, _Compare __comp) argument 1954 prev_permutation(_BidirectionalIter __first, _BidirectionalIter __last, _Compare __comp) argument 1968 __is_heap(_RandomAccessIter __first, _StrictWeakOrdering __comp, _Distance __n) argument 1991 is_heap(_RandomAccessIter __first, _RandomAccessIter __last, _StrictWeakOrdering __comp) argument 2001 __is_sorted(_ForwardIter __first, _ForwardIter __last, _StrictWeakOrdering __comp) argument [all...] |
/ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
H A D | _list.h | 465 void merge(_Self& __x, _StrictWeakOrdering __comp) { argument 467 _STLP_DEBUG_CHECK(_STLP_STD::is_sorted(_M_non_dbg_impl.begin(), _M_non_dbg_impl.end(), __comp)) 468 _STLP_DEBUG_CHECK(_STLP_STD::is_sorted(__x.begin()._M_iterator, __x.end()._M_iterator, __comp)) 470 _M_non_dbg_impl.merge(__x._M_non_dbg_impl, __comp); 480 void sort(_StrictWeakOrdering __comp) { argument 481 _M_non_dbg_impl.sort(__comp);
|
H A D | _tree.h | 123 _Rb_tree(const _Compare& __comp) argument 124 : _M_non_dbg_impl(__comp), _M_iter_list(&_M_non_dbg_impl) {} 125 _Rb_tree(const _Compare& __comp, const allocator_type& __a) argument 126 : _M_non_dbg_impl(__comp, __a), _M_iter_list(&_M_non_dbg_impl) {}
|
H A D | _slist.h | 600 void sort(_StrictWeakOrdering __comp) argument 601 { _M_non_dbg_impl.sort(__comp); }
|
/ndk/sources/cxx-stl/stlport/stlport/stl/pointers/ |
H A D | _list.h | 317 void merge(_Self &__x, _StrictWeakOrdering __comp) argument 318 { _M_impl.merge(__x._M_impl, _STLP_PRIV _BinaryPredWrapper<_StorageType, _Tp, _StrictWeakOrdering>(__comp)); } 321 void sort(_StrictWeakOrdering __comp) argument 322 { _M_impl.sort(_STLP_PRIV _BinaryPredWrapper<_StorageType, _Tp, _StrictWeakOrdering>(__comp)); }
|
H A D | _set.h | 130 explicit set(const _Compare& __comp, argument 132 : _M_t(__comp, _STLP_CONVERT_ALLOCATOR(__a, _KeyStorageType)) {} 148 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp) argument 149 : _M_t(__comp, _StorageTypeAlloc()) { 159 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp, argument 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_ALLOCATO 176 set(const value_type* __first, const value_type* __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument 187 set(const_iterator __first, const_iterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument 377 multiset(const _Compare& __comp, const allocator_type& __a = allocator_type()) argument 395 multiset(_InputIterator __first, _InputIterator __last, const _Compare& __comp) argument 407 multiset(_InputIterator __first, _InputIterator __last, const _Compare& __comp, const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL) argument 426 multiset(const value_type* __first, const value_type* __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument 438 multiset(const_iterator __first, const_iterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument [all...] |
H A D | _slist.h | 398 void merge(_Self& __x, _StrictWeakOrdering __comp) argument 399 { _M_impl.merge(__x._M_impl, _STLP_PRIV _BinaryPredWrapper<_StorageType, _Tp, _StrictWeakOrdering>(__comp)); } 402 void sort(_StrictWeakOrdering __comp) argument 403 { _M_impl.sort(_STLP_PRIV _BinaryPredWrapper<_StorageType, _Tp, _StrictWeakOrdering>(__comp)); }
|