BinaryPredicate

unique

removes consecutive duplicate elements (public member function of std::list)

find_end

finds the last sequence of elements in a certain range (function template)

find_first_of

searches for any one of a set of elements (function template)

adjacent_find

finds the first two adjacent items that are equal (or satisfy a given predicate) (function template)

mismatch

finds the first position where two ranges differ (function template)

equal

determines if two sets of elements are the same (function template)

is_permutation (C++11)

determines if a sequence is a permutation of another sequence (function template)

search

searches for a range of elements (function template)

search_n

searches for a number consecutive copies of an element in a range (function template)

unique

removes consecutive duplicate elements in a range (function template)

unique_copy

creates a copy of some range of elements that contains no consecutive duplicates (function template)

not2 (deprecated)

constructs custom std::binary_negate object (function template)

unordered_set (since C++11)

collection of unique keys, hashed by keys (class template)

unordered_map (since C++11)

collection of key-value pairs, hashed by keys, keys are unique (class template)

unordered_multiset (since C++11)

collection of keys, hashed by keys (class template)

unordered_multimap (since C++11)

collection of key-value pairs, hashed by keys (class template)