Home
last modified time | relevance | path

Searched refs:__simd_first (Results 1 – 2 of 2) sorted by relevance

/llvm-project-15.0.7/pstl/include/pstl/internal/
H A Dunseq_backend_simd.h106 __simd_first(_Index __first, _DifferenceType __begin, _DifferenceType __end, _Compare __comp) noexc… in __simd_first() function
166 __simd_first(_Index1 __first1, _DifferenceType __n, _Index2 __first2, _Pred __pred) noexcept in __simd_first() function
815 const auto __result = __unseq_backend::__simd_first( in __simd_find_first_of()
833 auto __current = __unseq_backend::__simd_first( in __simd_remove_if()
H A Dalgorithm_impl.h433 …return __unseq_backend::__simd_first(__first1, __last1 - __first1, __first2, std::not_fn(__p)).fir… in __brick_equal()
486 …return __unseq_backend::__simd_first(__first1, __last1 - __first1, __first2, std::not_fn(__p)).fir… in __brick_equal()
532 return __unseq_backend::__simd_first( in __brick_find_if()
1790 _RandomAccessIterator __result = __unseq_backend::__simd_first( in __brick_is_partitioned()
3454 return __unseq_backend::__simd_first( in __brick_is_heap_until()
3488 return __unseq_backend::__simd_first( in __is_heap_until_local()
3671 return __unseq_backend::__simd_first(__first1, __n, __first2, std::not_fn(__pred)); in __brick_mismatch()
3740 …std::pair<_RandomAccessIterator1, _RandomAccessIterator2> __result = __unseq_backend::__simd_first( in __brick_lexicographical_compare()