Home
last modified time | relevance | path

Searched refs:__pred (Results 1 – 22 of 22) sorted by relevance

/freebsd-12.1/contrib/libc++/include/
H A Dcondition_variable140 void wait(_Lock& __lock, _Predicate __pred);
153 _Predicate __pred);
166 _Predicate __pred);
210 condition_variable_any::wait(_Lock& __lock, _Predicate __pred)
212 while (!__pred())
234 _Predicate __pred)
236 while (!__pred())
238 return __pred();
256 _Predicate __pred)
259 _VSTD::move(__pred));
H A D__mutex_base316 void wait(unique_lock<mutex>& __lk, _Predicate __pred);
329 _Predicate __pred);
342 _Predicate __pred);
372 condition_variable::wait(unique_lock<mutex>& __lk, _Predicate __pred)
374 while (!__pred())
392 _Predicate __pred)
394 while (!__pred())
397 return __pred();
428 _Predicate __pred)
431 _VSTD::move(__pred));
H A Dalgorithm833 if (__pred(*__first))
846 if (__pred(*__first))
904 if (__pred(*__first))
1156 if (__pred(*__first))
3153 if (__pred(*__p))
3234 if (__pred(*__m))
3259 if (__pred(*++__m))
3316 while (__pred(*__m1))
3386 if (__pred(*++__m))
3443 while (!__pred(*--__m1))
[all …]
H A Dfunctional997 explicit unary_negate(const _Predicate& __pred)
998 : __pred_(__pred) {}
1007 not1(const _Predicate& __pred) {return unary_negate<_Predicate>(__pred);}
1018 binary_negate(const _Predicate& __pred) : __pred_(__pred) {}
1029 not2(const _Predicate& __pred) {return binary_negate<_Predicate>(__pred);}
2840 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred,
2852 if (__pred(*__first1, *__first2))
2898 if (__pred(*__first1, *__first2))
2910 if (!__pred(*__m1, *__m2))
2957 inline void __libcpp_erase_if_container( _Container& __c, _Predicate __pred)
[all …]
H A Dforward_list826 template <class _Predicate> void remove_if(_Predicate __pred);
1531 forward_list<_Tp, _Alloc>::remove_if(_Predicate __pred)
1536 if (__pred(__i.__get_begin()->__next_->__value_))
1539 for (; __j != __e && __pred(*__j); ++__j)
1755 void erase_if(forward_list<_Tp, _Allocator>& __c, _Predicate __pred)
1756 { __c.remove_if(__pred); }
H A Dset924 void erase_if(set<_Key, _Compare, _Allocator>& __c, _Predicate __pred)
925 { __libcpp_erase_if_container(__c, __pred); }
1411 void erase_if(multiset<_Key, _Compare, _Allocator>& __c, _Predicate __pred)
1412 { __libcpp_erase_if_container(__c, __pred); }
H A Dlist1075 template <class _Pred> void remove_if(_Pred __pred);
2163 list<_Tp, _Alloc>::remove_if(_Pred __pred)
2167 if (__pred(*__i))
2170 for (; __j != __e && __pred(*__j); ++__j)
2461 void erase_if(list<_Tp, _Allocator>& __c, _Predicate __pred)
2462 { __c.remove_if(__pred); }
H A Dunordered_set947 void erase_if(unordered_set<_Value, _Hash, _Pred, _Alloc>& __c, _Predicate __pred)
948 { __libcpp_erase_if_container(__c, __pred); }
1517 void erase_if(unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __c, _Predicate __pred)
1518 { __libcpp_erase_if_container(__c, __pred); }
H A Dmap1627 void erase_if(map<_Key, _Tp, _Compare, _Allocator>& __c, _Predicate __pred)
1628 { __libcpp_erase_if_container(__c, __pred); }
2172 void erase_if(multimap<_Key, _Tp, _Compare, _Allocator>& __c, _Predicate __pred)
2173 { __libcpp_erase_if_container(__c, __pred); }
H A Dunordered_map1638 void erase_if(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __c, _Predicate __pred)
1639 { __libcpp_erase_if_container(__c, __pred); }
2262 void erase_if(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __c, _Predicate __pred)
2263 { __libcpp_erase_if_container(__c, __pred); }
H A Ddeque2944 void erase_if(deque<_Tp, _Allocator>& __c, _Predicate __pred)
2945 { __c.erase(_VSTD::remove_if(__c.begin(), __c.end(), __pred), __c.end()); }
H A Dvector3424 void erase_if(vector<_Tp, _Allocator>& __c, _Predicate __pred)
3425 { __c.erase(_VSTD::remove_if(__c.begin(), __c.end(), __pred), __c.end()); }
H A Dstring4292 void erase_if(basic_string<_CharT, _Traits, _Allocator>& __str, _Predicate __pred)
4293 { __str.erase(_VSTD::remove_if(__str.begin(), __str.end(), __pred), __str.end()); }
/freebsd-12.1/contrib/libstdc++/include/debug/
H A Dfunctions.h229 _Predicate __pred, std::forward_iterator_tag) in __check_sorted_aux() argument
236 if (__pred(*__next, *__first)) in __check_sorted_aux()
256 _Predicate __pred) in __check_sorted() argument
260 return __check_sorted_aux(__first, __last, __pred, in __check_sorted()
283 const _Tp& __value, _Pred __pred) in __check_partitioned() argument
285 while (__first != __last && __pred(*__first, __value)) in __check_partitioned()
287 while (__first != __last && !__pred(*__first, __value)) in __check_partitioned()
H A Dsafe_sequence.h112 _M_invalidate_if(_Predicate __pred);
126 _M_invalidate_if(_Predicate __pred) in _M_invalidate_if() argument
138 if (__pred(__victim->base())) in _M_invalidate_if()
149 if (__pred(__victim->base())) in _M_invalidate_if()
H A Dlist402 remove_if(_Predicate __pred)
406 if (__pred(*__x))
483 sort(_StrictWeakOrdering __pred) { _Base::sort(__pred); }
/freebsd-12.1/contrib/libc++/include/experimental/
H A Dfunctional159 _BMSkipTable(std::size_t __sz, _Value __default, _Hash __hf, _BinaryPredicate __pred)
160 : __default_value_(__default), __table(__sz, __hf, __pred) {}
226 _Hash __hf = _Hash(), _BinaryPredicate __pred = _BinaryPredicate())
227 : __first_(__f), __last_(__l), __pred_(__pred),
311 while ( __k > 0 && !__pred ( __f[__k], __f[__i] ))
314 if ( __pred ( __f[__k], __f[__i] ))
321 _BinaryPredicate __pred)
329 __compute_bm_prefix(__f, __l, __pred, __scratch);
334 __compute_bm_prefix(_RevIter(__l), _RevIter(__f), __pred, __scratch);
378 _Hash __hf = _Hash(), _BinaryPredicate __pred = _BinaryPredicate())
[all …]
/freebsd-12.1/contrib/libstdc++/include/bits/
H A Dstl_algo.h260 if (__pred(*__first)) in __find_if()
264 if (__pred(*__first)) in __find_if()
268 if (__pred(*__first)) in __find_if()
272 if (__pred(*__first)) in __find_if()
341 _Predicate __pred) in find_if() argument
457 if (__pred(*__first)) in count_if()
2026 _Predicate __pred, in __partition() argument
2039 if (__pred(*__next)) in __partition()
2056 _Predicate __pred, in __partition() argument
2129 __pred, in __inplace_stable_partition()
[all …]
H A Dstl_function.h329 not1(const _Predicate& __pred) in not1() argument
330 { return unary_negate<_Predicate>(__pred); } in not1()
355 not2(const _Predicate& __pred) in not2() argument
356 { return binary_negate<_Predicate>(__pred); } in not2()
H A Dlist.tcc309 remove_if(_Predicate __pred) in remove_if() argument
317 if (__pred(*__first)) in remove_if()
/freebsd-12.1/contrib/libstdc++/include/ext/
H A Dslist714 remove_if(_Predicate __pred);
718 unique(_BinaryPredicate __pred);
944 void slist<_Tp, _Alloc>::remove_if(_Predicate __pred)
949 if (__pred(((_Node*) __cur->_M_next)->_M_data))
959 slist<_Tp, _Alloc>::unique(_BinaryPredicate __pred)
966 if (__pred(((_Node*)__cur)->_M_data,
H A Dalgorithm244 _Predicate __pred,
254 if (__pred(*__first))