| /freebsd/contrib/llvm-project/libcxx/include/__functional/ |
| H A D | boyer_moore_searcher.h | 36 template <class _Key, class _Value, class _Hash, class _BinaryPredicate, bool /*useArray*/> 40 template <class _Key, class _Value, class _Hash, class _BinaryPredicate> 41 class _BMSkipTable<_Key, _Value, _Hash, _BinaryPredicate, false> { 47 unordered_map<_Key, _Value, _Hash, _BinaryPredicate> __table_; 51 size_t __sz, value_type __default_value, _Hash __hash, _BinaryPredicate __pred) 63 template <class _Key, class _Value, class _Hash, class _BinaryPredicate> in insert() 64 class _BMSkipTable<_Key, _Value, _Hash, _BinaryPredicate, true> { in insert() 74 _LIBCPP_HIDE_FROM_ABI explicit _BMSkipTable(size_t, value_type __default_value, _Hash, _BinaryPredicate) { 89 class _BinaryPredicate = equal_to<>> in _BMSkipTable() 98 _BinaryPredicate, 87 _BMSkipTable(size_t,value_type __default_value,_Hash,_BinaryPredicate) _BMSkipTable() argument [all...] |
| H A D | default_searcher.h | 29 template <class _ForwardIterator, class _BinaryPredicate = equal_to<>> 33 default_searcher(_ForwardIterator __f, _ForwardIterator __l, _BinaryPredicate __p = _BinaryPredicate()) 46 _BinaryPredicate __pred_;
|
| /freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/ |
| H A D | algorithm_fwd.h | |
| H A D | glue_algorithm_defs.h | |
| H A D | algorithm_impl.h | |
| H A D | glue_algorithm_impl.h | |
| H A D | unseq_backend_simd.h | |
| /freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | equal.h | 37 template <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 39 …_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate& __p… in __equal_iter_impl() 48 class _BinaryPredicate, 49 …__enable_if_t<__desugars_to_v<__equal_tag, _BinaryPredicate, _Tp, _Up> && !is_volatile<_Tp>::value… 53 __equal_iter_impl(_Tp* __first1, _Tp* __last1, _Up* __first2, _BinaryPredicate&) { in __equal_iter_impl() argument 57 template <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 59 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate… in equal() 98 template <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 104 _BinaryPredicate __pred) { in equal()
|
| H A D | unique_copy.h | 39 template <class _AlgPolicy, class _BinaryPredicate, class _InputIterator, class _Sent, class _OutputIterator> in __unique_copy() 44 _BinaryPredicate&& __pred, in __unique_copy() 61 template <class _AlgPolicy, class _BinaryPredicate, class _ForwardIterator, class _Sent, class _OutputIterator> in __unique_copy() 66 _BinaryPredicate&& __pred, in __unique_copy() 83 template <class _AlgPolicy, class _BinaryPredicate, class _InputIterator, class _Sent, class _InputAndOutputIterator> in __unique_copy() 88 _BinaryPredicate&& __pred, in __unique_copy() 100 template <class _InputIterator, class _OutputIterator, class _BinaryPredicate> in unique_copy() 102 unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) { in unique_copy()
|
| H A D | adjacent_find.h | 28 template <class _Iter, class _Sent, class _BinaryPredicate> 30 __adjacent_find(_Iter __first, _Sent __last, _BinaryPredicate&& __pred) { in __adjacent_find() 42 template <class _ForwardIterator, class _BinaryPredicate> 44 adjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) { in adjacent_find()
|
| H A D | find_first_of.h | 23 template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 29 _BinaryPredicate&& __pred) { in __find_first_of_ce() 37 template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 43 _BinaryPredicate __pred) { in find_first_of()
|
| H A D | unique.h | 31 template <class _AlgPolicy, class _Iter, class _Sent, class _BinaryPredicate> 33 __unique(_Iter __first, _Sent __last, _BinaryPredicate&& __pred) { in __unique() 48 template <class _ForwardIterator, class _BinaryPredicate> 50 unique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) { in unique()
|
| H A D | is_permutation.h | 115 …Policy, class _ForwardIterator1, class _Sentinel1, class _ForwardIterator2, class _BinaryPredicate> 117 …_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2, _BinaryPredicate&& __p… 249 template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 251 …erator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _BinaryPredicate __pred) { 252 static_assert(__is_callable<_BinaryPredicate, decltype(*__first1), decltype(*__first2)>::value, 282 template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 288 _BinaryPredicate __pred) { 289 static_assert(__is_callable<_BinaryPredicate, decltype(*__first1), decltype(*__first2)>::value,
|
| H A D | find_end.h | 186 template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 192 _BinaryPredicate& __pred) { in __find_end_classic() 207 template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 213 _BinaryPredicate __pred) { in find_end()
|
| H A D | search_n.h | 138 template <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 140 …tor __first, _ForwardIterator __last, _Size __count, const _Tp& __value, _BinaryPredicate __pred) { in search_n() 142 …__is_callable<_BinaryPredicate, decltype(*__first), const _Tp&>::value, "BinaryPredicate has to be… in search_n()
|
| H A D | search.h | 162 template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 168 _BinaryPredicate __pred) { in search() 169 static_assert(__is_callable<_BinaryPredicate, decltype(*__first1), decltype(*__first2)>::value, in search()
|
| H A D | mismatch.h | 152 template <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 154 …utIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) { in mismatch() 187 template <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 193 _BinaryPredicate __pred) { in mismatch()
|
| /freebsd/contrib/llvm-project/libcxx/include/ |
| H A D | forward_list | 843 template <class _BinaryPredicate> 844 _LIBCPP_HIDE_FROM_ABI __remove_return_type unique(_BinaryPredicate __binary_pred); 1360 template <class _BinaryPredicate> 1362 forward_list<_Tp, _Alloc>::unique(_BinaryPredicate __binary_pred) {
|