S
Stephen Howe
Hi
Maybe I overlooking the obvious, but given that == operator or an
equality predicate exists,
is there an algorithm that find that first value that does not match
(or end if everything matches)?
This would be linear (rather that use lower_bound/upper_bound if
ordered)
Essentially
it = some_algorithm(ForwardIteratorStart, ForwardIteratorEnd, Value,
Predicate);
Thanks
Stephen Howe
Maybe I overlooking the obvious, but given that == operator or an
equality predicate exists,
is there an algorithm that find that first value that does not match
(or end if everything matches)?
This would be linear (rather that use lower_bound/upper_bound if
ordered)
Essentially
it = some_algorithm(ForwardIteratorStart, ForwardIteratorEnd, Value,
Predicate);
Thanks
Stephen Howe