| /freebsd-14.2/contrib/llvm-project/libcxx/include/__functional/ |
| H A D | boyer_moore_searcher.h | 41 class _BMSkipTable<_Key, _Value, _Hash, _BinaryPredicate, false> { 47 unordered_map<_Key, _Value, _Hash, _BinaryPredicate> __table_; 64 class _BMSkipTable<_Key, _Value, _Hash, _BinaryPredicate, true> { 89 class _BinaryPredicate = equal_to<>> 98 _BinaryPredicate, 107 _BinaryPredicate __pred = _BinaryPredicate()) 143 _BinaryPredicate __pred_; 220 class _BinaryPredicate = equal_to<>> 229 _BinaryPredicate, 238 _BinaryPredicate __pred = _BinaryPredicate()) [all …]
|
| H A D | default_searcher.h | 29 template <class _ForwardIterator, class _BinaryPredicate = equal_to<>> 33 …ult_searcher(_ForwardIterator __f, _ForwardIterator __l, _BinaryPredicate __p = _BinaryPredicate()) 46 _BinaryPredicate __pred_;
|
| /freebsd-14.2/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | equal.h | 38 template <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 49 class _BinaryPredicate, 54 __equal_iter_impl(_Tp* __first1, _Tp* __last1, _Up* __first2, _BinaryPredicate&) { in __equal_iter_impl() argument 58 template <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 72 template <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 78 _BinaryPredicate __pred, in __equal() 113 template <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 119 _BinaryPredicate __pred, in __equal() 135 template <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 141 _BinaryPredicate __pred) { in equal() [all …]
|
| H A D | unique_copy.h | 39 template <class _AlgPolicy, class _BinaryPredicate, class _InputIterator, class _Sent, class _Outpu… 44 _BinaryPredicate&& __pred, in __unique_copy() 61 template <class _AlgPolicy, class _BinaryPredicate, class _ForwardIterator, class _Sent, class _Out… 66 _BinaryPredicate&& __pred, in __unique_copy() 83 template <class _AlgPolicy, class _BinaryPredicate, class _InputIterator, class _Sent, class _Input… 88 _BinaryPredicate&& __pred, in __unique_copy() 100 template <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 102 …_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 | mismatch.h | 24 template <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 26 …utIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) { in mismatch() 40 template <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 46 _BinaryPredicate __pred) { in mismatch()
|
| 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 | 137 template <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 139 …tor __first, _ForwardIterator __last, _Size __count, const _Tp& __value, _BinaryPredicate __pred) { in search_n() 141 …__is_callable<_BinaryPredicate, decltype(*__first), const _Tp&>::value, "BinaryPredicate has to be… in search_n()
|
| H A D | search.h | 159 template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 165 _BinaryPredicate __pred) { in search() 166 static_assert(__is_callable<_BinaryPredicate, decltype(*__first1), decltype(*__first2)>::value, in search()
|
| /freebsd-14.2/contrib/llvm-project/libcxx/include/ |
| H A D | forward_list | 856 template <class _BinaryPredicate> 857 _LIBCPP_HIDE_FROM_ABI __remove_return_type unique(_BinaryPredicate __binary_pred); 1379 template <class _BinaryPredicate> 1381 forward_list<_Tp, _Alloc>::unique(_BinaryPredicate __binary_pred) {
|