operator == - necessary for which STL algorithms?

[Stephen Howe]

Hi

operator < is necessary to use std::sort(), std::stable_sort(),
std:artial_sort(), std::inplace_merge(), std::equal_range(),
std::lower_bound(), std::upper_bound(), std::merge() (as well as set/
map/multiset/multimap, std::list.sort(), std::list.merge())

But which algorithms requires == operator?

I can think of adjacent_find(), find(), unique() - are there any more?

Is there any URL which lists them all?

Cheers and thanks

Stephen Howe

 

[Victor Bazarov]

operator< is necessary to use std::sort(), std::stable_sort(),
std:artial_sort(), std::inplace_merge(), std::equal_range(),
std::lower_bound(), std::upper_bound(), std::merge() (as well as set/
map/multiset/multimap, std::list.sort(), std::list.merge())

But which algorithms requires == operator?

I can think of adjacent_find(), find(), unique() - are there any more?

Is there any URL which lists them all?

Search for 'EqualityComparable'. You should find 'find', 'search_n',
'count', 'replace', 'replace_copy', 'remove'. Not sure what else.

V