| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/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...] |
| 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...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/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...] |
| 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...] |
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/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...] |
| 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...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_algo.h | 102 /// Swaps the median value of *__a, *__b and *__c under __comp to *__result
107 _Compare __comp)
114 if (__comp(*__a, *__b))
116 if (__comp(*__b, *__c))
118 else if (__comp(*__a, *__c))
123 else if (__comp(*__a, *__c))
125 else if (__comp(*__b, *__c))
525 _BinaryPredicate __comp)
536 __last2, __comp);
592 _BinaryPredicate __comp)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_algo.h | 102 /// Swaps the median value of *__a, *__b and *__c under __comp to *__result
107 _Compare __comp)
114 if (__comp(*__a, *__b))
116 if (__comp(*__b, *__c))
118 else if (__comp(*__a, *__c))
123 else if (__comp(*__a, *__c))
125 else if (__comp(*__b, *__c))
525 _BinaryPredicate __comp)
536 __last2, __comp);
592 _BinaryPredicate __comp)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| stl_algo.h | 102 /// Swaps the median value of *__a, *__b and *__c under __comp to *__result
107 _Compare __comp)
114 if (__comp(*__a, *__b))
116 if (__comp(*__b, *__c))
118 else if (__comp(*__a, *__c))
123 else if (__comp(*__a, *__c))
125 else if (__comp(*__b, *__c))
525 _BinaryPredicate __comp)
536 __last2, __comp);
592 _BinaryPredicate __comp)
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _slist.c | 149 _StrictWeakOrdering __comp) {
154 if (__comp(__x.front(), __STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data)) {
155 _STLP_VERBOSE_ASSERT(!__comp(__STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data, __x.front()),
168 if (__comp(__STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data, *__i2)) {
169 _STLP_VERBOSE_ASSERT(!__comp(*__i2, __STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data),
183 void _Slist_sort(slist<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp) {
195 _STLP_PRIV _Slist_merge(__counter[__i], __carry, __comp);
210 _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...] |
| _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/current/sources/cxx-stl/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...] |
| _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);
|
| /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...] |
| /prebuilts/ndk/current/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...] |
| /external/libcxx/include/ |
| queue | 431 explicit priority_queue(const value_compare& __comp)
432 : c(), comp(__comp) {}
433 priority_queue(const value_compare& __comp, const container_type& __c);
435 explicit priority_queue(const value_compare& __comp, container_type&& __c);
439 const value_compare& __comp = value_compare());
442 const value_compare& __comp, const container_type& __c);
446 const value_compare& __comp, container_type&& __c);
453 priority_queue(const value_compare& __comp, const _Alloc& __a,
457 priority_queue(const value_compare& __comp, const container_type& __c,
467 priority_queue(const value_compare& __comp, container_type&& __c
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| queue | 431 explicit priority_queue(const value_compare& __comp)
432 : c(), comp(__comp) {}
433 priority_queue(const value_compare& __comp, const container_type& __c);
435 explicit priority_queue(const value_compare& __comp, container_type&& __c);
439 const value_compare& __comp = value_compare());
442 const value_compare& __comp, const container_type& __c);
446 const value_compare& __comp, container_type&& __c);
453 priority_queue(const value_compare& __comp, const _Alloc& __a,
457 priority_queue(const value_compare& __comp, const container_type& __c,
467 priority_queue(const value_compare& __comp, container_type&& __c
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| queue | 431 explicit priority_queue(const value_compare& __comp)
432 : c(), comp(__comp) {}
433 priority_queue(const value_compare& __comp, const container_type& __c);
435 explicit priority_queue(const value_compare& __comp, container_type&& __c);
439 const value_compare& __comp = value_compare());
442 const value_compare& __comp, const container_type& __c);
446 const value_compare& __comp, container_type&& __c);
453 priority_queue(const value_compare& __comp, const _Alloc& __a,
457 priority_queue(const value_compare& __comp, const container_type& __c,
467 priority_queue(const value_compare& __comp, container_type&& __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...] |
