Home
last modified time | relevance | path

Searched refs:__f2 (Results 1 – 10 of 10) sorted by relevance

/external/llvm-project/pstl/include/pstl/internal/
Dutils.h74 __invoke_if_else(std::false_type, _F1, _F2 __f2) in __invoke_if_else() argument
76 return __f2(); in __invoke_if_else()
Dparallel_backend_serial.h125 __parallel_invoke(_ExecutionPolicy&&, _F1&& __f1, _F2&& __f2) in __parallel_invoke() argument
128 std::forward<_F2>(__f2)(); in __parallel_invoke() local
Dparallel_backend_tbb.h1285 __parallel_invoke(_ExecutionPolicy&&, _F1&& __f1, _F2&& __f2) in __parallel_invoke() argument
1288 …_arena::isolate([&]() { tbb::parallel_invoke(std::forward<_F1>(__f1), std::forward<_F2>(__f2)); }); in __parallel_invoke()
Dalgorithm_impl.h2648 …__is_vector](_RandomAccessIterator1 __f1, _RandomAccessIterator1 __l1, _RandomAccessIterator2 __f2, in __pattern_merge()
2650 return __internal::__brick_merge(__f1, __l1, __f2, __l2, __f3, __comp, __is_vector); in __pattern_merge()
2711 … _BidirectionalIterator __f2, _BidirectionalIterator __l2, _Tp* __f3, in __pattern_inplace_merge()
2713 …(__utils::__serial_move_merge(__n))(__f1, __l1, __f2, __l2, __f3, __comp, __move_values, __move_va… in __pattern_inplace_merge()
2715 return __f3 + (__l1 - __f1) + (__l2 - __f2); in __pattern_inplace_merge()
/external/libcxx/include/
Dforward_list857 __merge(__node_pointer __f1, __node_pointer __f2, _Compare& __comp);
1584 forward_list<_Tp, _Alloc>::__merge(__node_pointer __f1, __node_pointer __f2,
1588 return __f2;
1589 if (__f2 == nullptr)
1592 if (__comp(__f2->__value_, __f1->__value_))
1594 __node_pointer __t = __f2;
1598 __r = __f2;
1599 __f2 = __t->__next_;
1606 while (__f1 != nullptr && __f2 != nullptr)
1608 if (__comp(__f2->__value_, __f1->__value_))
[all …]
Dlist2221 iterator __f2 = __c.begin();
2223 while (__f1 != __e1 && __f2 != __e2)
2225 if (__comp(*__f2, *__f1))
2228 iterator __m2 = _VSTD::next(__f2);
2233 __link_pointer __f = __f2.__ptr_;
2235 __f2 = __m2;
2306 iterator __f2 = __e1 = __sort(__e1, __e2, __n - __n2, __comp);
2307 if (__comp(*__f2, *__f1))
2309 iterator __m2 = _VSTD::next(__f2);
2312 __link_pointer __f = __f2.__ptr_;
[all …]
D__string762 _CharT __f2 = *__first2;
769 // Find __f2 the first byte matching in __first1.
770 __first1 = _Traits::find(__first1, __len1 - __len2 + 1, __f2);
/external/llvm-project/libcxx/include/
Dforward_list863 __merge(__node_pointer __f1, __node_pointer __f2, _Compare& __comp);
1599 forward_list<_Tp, _Alloc>::__merge(__node_pointer __f1, __node_pointer __f2,
1603 return __f2;
1604 if (__f2 == nullptr)
1607 if (__comp(__f2->__value_, __f1->__value_))
1609 __node_pointer __t = __f2;
1613 __r = __f2;
1614 __f2 = __t->__next_;
1621 while (__f1 != nullptr && __f2 != nullptr)
1623 if (__comp(__f2->__value_, __f1->__value_))
[all …]
Dlist2237 iterator __f2 = __c.begin();
2239 while (__f1 != __e1 && __f2 != __e2)
2241 if (__comp(*__f2, *__f1))
2244 iterator __m2 = _VSTD::next(__f2);
2249 __link_pointer __f = __f2.__ptr_;
2251 __f2 = __m2;
2322 iterator __f2 = __e1 = __sort(__e1, __e2, __n - __n2, __comp);
2323 if (__comp(*__f2, *__f1))
2325 iterator __m2 = _VSTD::next(__f2);
2328 __link_pointer __f = __f2.__ptr_;
[all …]
D__string966 _CharT __f2 = *__first2;
973 // Find __f2 the first byte matching in __first1.
974 __first1 = _Traits::find(__first1, __len1 - __len2 + 1, __f2);