find_first_not_of - 2 versions find_last_of - 2 versions find_last_not_of - 2 versions
but only 2 versions of find_first_of. May be I just missing the way how to implement them in terms of some other algorithms? If not I think it could be valuable to fill this gap.
set<int> s; something::iterator p = find(v.begin(), v.end(), not1(bind(&set<int>::count, &s)));However, the real question is whether generic find_first_not_of is usefull: it supposedly will take a pair of iterators to denote the set of symbols looked for, which is OK for
string::size_type n = s.find_first_not_of(" \t\r\n");but can be very inefficient in other situations. --People/Vladimir Prus
The _last_ algorithms can be implemented in terms of the _first_ algorithms with the added inefficiency of reverse_iterator.
find_first(a, b, not(one_of(" \t\r\n")));
Maybe a vector is a better way to think about the one_of() functor in this case?