Home
last modified time | relevance | path

Searched refs:_Compare (Results 1 – 25 of 35) sorted by relevance

12

/external/llvm-project/pstl/include/pstl/internal/
Dalgorithm_fwd.h764 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector,
767 __pattern_sort(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Compare, _IsVecto…
770 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
772 __pattern_sort(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Compare, _IsVecto…
780 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
782 __pattern_stable_sort(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Compare,
786 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
788 __pattern_stable_sort(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Compare,
796 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
799 _Compare, _IsVector,
[all …]
Dglue_algorithm_defs.h294 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
296 …tionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp);
304 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
306 …tionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp);
361 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
364 _RandomAccessIterator __last, _Compare __comp);
373 …plate <class _ExecutionPolicy, class _ForwardIterator, class _RandomAccessIterator, class _Compare>
376 _RandomAccessIterator __d_first, _RandomAccessIterator __d_last, _Compare __comp);
384 template <class _ExecutionPolicy, class _ForwardIterator, class _Compare>
386 …til(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Compare __comp);
[all …]
Dparallel_backend_utils.h49 …_RandomAccessIterator1, class _RandomAccessIterator2, class _RandomAccessIterator3, class _Compare,
53 …_RandomAccessIterator2 __ye, _RandomAccessIterator3 __zs, _Compare __comp, _MoveValueX __move_valu… in operator()
140 …ypename _ForwardIterator1, typename _ForwardIterator2, typename _OutputIterator, typename _Compare,
144 _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp, in __set_union_construct()
169 …ypename _ForwardIterator1, typename _ForwardIterator2, typename _OutputIterator, typename _Compare>
172 _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp) in __set_intersection_construct()
194 …ypename _ForwardIterator1, typename _ForwardIterator2, typename _OutputIterator, typename _Compare,
198 _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp, in __set_difference_construct()
223 …ypename _ForwardIterator1, typename _ForwardIterator2, typename _OutputIterator, typename _Compare,
227 … _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp, in __set_symmetric_difference_construct()
Dalgorithm_impl.h2106 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector,
2109 …t(_ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, in __pattern_sort()
2115 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
2117 …utionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, in __pattern_sort()
2123 … _Compare __comp) { std::sort(__first, __last, __comp); }); in __pattern_sort()
2131 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
2133 …t(_ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, in __pattern_stable_sort()
2139 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
2142 _Compare __comp, _IsVector /*is_vector*/, /*is_parallel=*/std::true_type) in __pattern_stable_sort()
2147 … _Compare __comp) { std::stable_sort(__first, __last, __comp); }); in __pattern_stable_sort()
[all …]
Dglue_algorithm_impl.h634 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
636 …utionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in sort()
656 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
658 …utionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in stable_sort()
775 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
778 _RandomAccessIterator __last, _Compare __comp) in partial_sort()
797 …plate <class _ExecutionPolicy, class _ForwardIterator, class _RandomAccessIterator, class _Compare>
800 _RandomAccessIterator __d_first, _RandomAccessIterator __d_last, _Compare __comp) in partial_sort_copy()
820 template <class _ExecutionPolicy, class _ForwardIterator, class _Compare>
822 …ntil(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Compare __comp) in is_sorted_until()
[all …]
Dparallel_backend_serial.h105 template <class _ExecutionPolicy, typename _RandomAccessIterator, typename _Compare, typename _Leaf…
107 …t(_ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
114 typename _RandomAccessIterator3, typename _Compare, typename _LeafMerge>
118 _Compare __comp, _LeafMerge __leaf_merge) in __parallel_merge()
Dparallel_backend_tbb.h713 template <typename _RandomAccessIterator1, typename _RandomAccessIterator2, typename _Compare, type…
728 _Compare _M_comp;
827 …nc(_SizeType __xs, _SizeType __xe, _SizeType __ys, _SizeType __ye, _SizeType __zs, _Compare __comp, in __merge_func()
1090 template <typename _RandomAccessIterator1, typename _RandomAccessIterator2, typename _Compare, type…
1101 _Compare _M_comp;
1108 bool __root, _Compare __comp, _LeafSort __leaf_sort, _SizeType __nsort, in __stable_sort_func()
1121 template <typename _RandomAccessIterator1, typename _RandomAccessIterator2, typename _Compare, type…
1123 __stable_sort_func<_RandomAccessIterator1, _RandomAccessIterator2, _Compare, _LeafSort>::operator()… in operator()
1125 …typedef __merge_func<_RandomAccessIterator1, _RandomAccessIterator2, _Compare, __utils::__serial_d… in operator()
1158 template <class _ExecutionPolicy, typename _RandomAccessIterator, typename _Compare, typename _Leaf…
[all …]
Dunseq_backend_simd.h104 template <class _Index, class _DifferenceType, class _Compare>
106 __simd_first(_Index __first, _DifferenceType __begin, _DifferenceType __end, _Compare __comp) noexc… in __simd_first()
614 template <typename _ForwardIterator, typename _Size, typename _Compare>
616 __simd_min_element(_ForwardIterator __first, _Size __n, _Compare __comp) noexcept in __simd_min_element()
628 _Compare* __min_comp; in __simd_min_element()
631 _ComplexType(const _ValueType& val, const _Compare* comp) in __simd_min_element()
632 : __min_val(val), __min_ind(0), __min_comp(const_cast<_Compare*>(comp)) in __simd_min_element()
673 template <typename _ForwardIterator, typename _Size, typename _Compare>
675 __simd_minmax_element(_ForwardIterator __first, _Size __n, _Compare __comp) noexcept in __simd_minmax_element()
689 _Compare* __minmax_comp; in __simd_minmax_element()
[all …]
Dparallel_impl.h31 template <class _ExecutionPolicy, class _Index, class _Brick, class _Compare>
33 __parallel_find(_ExecutionPolicy&& __exec, _Index __first, _Index __last, _Brick __f, _Compare __co… in __parallel_find()
/external/libcxx/include/
D__tree30 template <class _Tp, class _Compare, class _Allocator> class __tree;
965 template<class _Tp, class _Compare>
967 _LIBCPP_DIAGNOSE_WARNING(!std::__invokable<_Compare const&, _Tp const&, _Tp const&>::value,
972 template <class _Tp, class _Compare, class _Allocator>
977 typedef _Compare value_compare;
1519 template <class _Tp, class _Compare, class _Allocator>
1520 __tree<_Tp, _Compare, _Allocator>::__tree(const value_compare& __comp)
1529 template <class _Tp, class _Compare, class _Allocator>
1530 __tree<_Tp, _Compare, _Allocator>::__tree(const allocator_type& __a)
1538 template <class _Tp, class _Compare, class _Allocator>
[all …]
Dqueue427 class _Compare = less<typename _Container::value_type> >
432 typedef _Compare value_compare;
555 template <class _Compare,
557 class = typename enable_if<!__is_allocator<_Compare>::value, nullptr_t>::type,
560 priority_queue(_Compare, _Container)
561 -> priority_queue<typename _Container::value_type, _Container, _Compare>;
564 class _Compare = less<typename iterator_traits<_InputIterator>::value_type>,
567 class = typename enable_if<!__is_allocator<_Compare>::value, nullptr_t>::type,
570 priority_queue(_InputIterator, _InputIterator, _Compare = _Compare(), _Container = _Container())
571 -> priority_queue<typename iterator_traits<_InputIterator>::value_type, _Container, _Compare>;
[all …]
Dmap496 template <class _Key, class _CP, class _Compare,
497 bool = is_empty<_Compare>::value && !__libcpp_is_final<_Compare>::value>
499 : private _Compare
504 _NOEXCEPT_(is_nothrow_default_constructible<_Compare>::value)
505 : _Compare() {}
507 __map_value_compare(_Compare c)
508 _NOEXCEPT_(is_nothrow_copy_constructible<_Compare>::value)
509 : _Compare(c) {}
511 const _Compare& key_comp() const _NOEXCEPT {return *this;}
514 … {return static_cast<const _Compare&>(*this)(__x.__get_value().first, __y.__get_value().first);}
[all …]
Dset437 template <class _Key, class _Compare, class _Allocator>
440 template <class _Key, class _Compare = less<_Key>,
448 typedef _Compare key_compare;
454 static_assert(sizeof(__diagnose_non_const_comparator<_Key, _Compare>()), "");
770 typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type
774 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
784 typename enable_if<__is_transparent<_Compare, _K2>::value,size_type>::type
796 typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type
801 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
814 typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type
[all …]
Dalgorithm781 template <class _Compare>
784 _Compare __comp_;
785 __debug_less(_Compare& __c) : __comp_(__c) {}
798 decltype((void)_VSTD::declval<_Compare&>()(
2423 template <class _ForwardIterator, class _Compare>
2426 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2451 template <class _Tp, class _Compare>
2454 min(const _Tp& __a, const _Tp& __b, _Compare __comp)
2469 template<class _Tp, class _Compare>
2472 min(initializer_list<_Tp> __t, _Compare __comp)
[all …]
/external/llvm-project/libcxx/include/
Dqueue426 class _Compare = less<typename _Container::value_type> >
431 typedef _Compare value_compare;
554 template <class _Compare,
556 class = typename enable_if<!__is_allocator<_Compare>::value, nullptr_t>::type,
559 priority_queue(_Compare, _Container)
560 -> priority_queue<typename _Container::value_type, _Container, _Compare>;
563 class _Compare = less<typename iterator_traits<_InputIterator>::value_type>,
566 class = typename enable_if<!__is_allocator<_Compare>::value, nullptr_t>::type,
569 priority_queue(_InputIterator, _InputIterator, _Compare = _Compare(), _Container = _Container())
570 -> priority_queue<typename iterator_traits<_InputIterator>::value_type, _Container, _Compare>;
[all …]
D__tree36 template <class _Tp, class _Compare, class _Allocator> class __tree;
968 template<class _Tp, class _Compare>
970 _LIBCPP_DIAGNOSE_WARNING(!__invokable<_Compare const&, _Tp const&, _Tp const&>::value,
975 template <class _Tp, class _Compare, class _Allocator>
980 typedef _Compare value_compare;
1536 template <class _Tp, class _Compare, class _Allocator>
1537 __tree<_Tp, _Compare, _Allocator>::__tree(const value_compare& __comp)
1546 template <class _Tp, class _Compare, class _Allocator>
1547 __tree<_Tp, _Compare, _Allocator>::__tree(const allocator_type& __a)
1555 template <class _Tp, class _Compare, class _Allocator>
[all …]
Dset440 template <class _Key, class _Compare, class _Allocator>
443 template <class _Key, class _Compare = less<_Key>,
451 typedef _Compare key_compare;
604 static_assert(sizeof(__diagnose_non_const_comparator<_Key, _Compare>()), "");
777 typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type
781 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
791 typename enable_if<__is_transparent<_Compare, _K2>::value,size_type>::type
809 typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type
814 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
827 typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type
[all …]
Dmap497 template <class _Key, class _CP, class _Compare,
498 bool = is_empty<_Compare>::value && !__libcpp_is_final<_Compare>::value>
500 : private _Compare
505 _NOEXCEPT_(is_nothrow_default_constructible<_Compare>::value)
506 : _Compare() {}
508 __map_value_compare(_Compare c)
509 _NOEXCEPT_(is_nothrow_copy_constructible<_Compare>::value)
510 : _Compare(c) {}
512 const _Compare& key_comp() const _NOEXCEPT {return *this;}
515 … {return static_cast<const _Compare&>(*this)(__x.__get_value().first, __y.__get_value().first);}
[all …]
Dalgorithm780 template <class _Compare>
783 _Compare &__comp_;
785 __debug_less(_Compare& __c) : __comp_(__c) {}
810 decltype((void)_VSTD::declval<_Compare&>()(
2541 template <class _ForwardIterator, class _Compare>
2545 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2571 template <class _Tp, class _Compare>
2575 min(const _Tp& __a, const _Tp& __b, _Compare __comp)
2591 template<class _Tp, class _Compare>
2595 min(initializer_list<_Tp> __t, _Compare __comp)
[all …]
/external/clang/test/CXX/except/except.spec/
Dcanonical.cpp28 template <class, class, class _Compare>
33 noexcept(_is_nothrow_constructible<_Compare>::value);
50 template <class T, class Value, class _Compare>
51 __map_value_compare<T, Value, _Compare>::__map_value_compare() in __map_value_compare()
52 noexcept(_is_nothrow_constructible<_Compare>::value) {} in __map_value_compare()
/external/llvm-project/clang/test/CXX/except/except.spec/
Dcanonical.cpp28 template <class, class, class _Compare>
33 noexcept(_is_nothrow_constructible<_Compare>::value);
50 template <class T, class Value, class _Compare>
51 __map_value_compare<T, Value, _Compare>::__map_value_compare() in __map_value_compare()
52 noexcept(_is_nothrow_constructible<_Compare>::value) {} in __map_value_compare()
/external/libcxx/include/experimental/
Dset47 template <class _Value, class _Compare = less<_Value>>
48 using set = _VSTD::set<_Value, _Compare,
51 template <class _Value, class _Compare = less<_Value>>
52 using multiset = _VSTD::multiset<_Value, _Compare,
Dmap47 template <class _Key, class _Value, class _Compare = less<_Key>>
48 using map = _VSTD::map<_Key, _Value, _Compare,
51 template <class _Key, class _Value, class _Compare = less<_Key>>
52 using multimap = _VSTD::multimap<_Key, _Value, _Compare,
/external/llvm-project/libcxx/include/experimental/
Dset46 template <class _Value, class _Compare = less<_Value>>
47 using set = _VSTD::set<_Value, _Compare,
50 template <class _Value, class _Compare = less<_Value>>
51 using multiset = _VSTD::multiset<_Value, _Compare,
Dmap46 template <class _Key, class _Value, class _Compare = less<_Key>>
47 using map = _VSTD::map<_Key, _Value, _Compare,
50 template <class _Key, class _Value, class _Compare = less<_Key>>
51 using multimap = _VSTD::multimap<_Key, _Value, _Compare,

12