list<int> L; ... list<int>::iterator in_range = find_if(L.begin(), L.end(), not1(compose2(logical_and<bool>(), bind2nd(greater_equal<int>(), 1), bind2nd(less_equal<int>(), 10)))); assert(in_range == L.end() || !(*in_range >= 1 && *in_range <= 10));Definition Defined in the standard header functional, and in the nonstandard backward-compatibility header function.h. Template parameters Parameter Description Default AdaptablePredicate The type of the function object that this unary_negate is the logical negation of. Model ofAdaptable Predicate Type requirementsAdaptablePredicate must be a model of Adaptable Predicate. Public base classesunary_function<AdaptablePredicate::argument_type, bool> Members New members These members are not defined in the Adaptable Predicate requirements, but are specific to unary_negate. Member Description
unary_negate(const AdaptablePredicate& pred)The constructor. Creates a unary_negate<AdaptablePredicate> whose underlying predicate is pred.
template <class AdaptablePredicate> unary_negate<AdaptablePredicate> not1(const AdaptablePredicate& pred);If p is of type AdaptablePredicate then not1(p) is equivalent to unary_negate<AdaptablePredicate>(p), but more convenient. This is a global function, not a member function. Notes
[1] Strictly speaking, unary_negate is redundant. It can be constructed using the function object logical_not and the adaptor unary_compose.
See also The function object overview, Adaptable Predicate, Predicate, binary_negate, unary_compose, binary_compose STL Main PageRetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4