25.3.6 only lists 4 operations, although it is obvious that
std::find_heap(first, last, value) may be implemented in a way
that is more efficient in average (still linear, though), than the basic
std::find(first, last, value), especially if comparison is non-trivial
and the probability of no match is substantial.

Any hope for having it standardized?

Thanks,
 Leo

---
[ comp.std.c++ is moderated.  To submit articles, try just posting with ]
[ your news-reader.  If that fails, use mailto:std-c++@ncar.ucar.edu    ]
[              --- Please see the FAQ before posting. ---               ]
[ FAQ: http://www.jamesd.demon.co.uk/csc/faq.html                       ]