The following code example is taken from the book
The C++ Standard Library - A Tutorial and Reference, 2nd Edition
by Nicolai M. Josuttis, Addison Wesley Longman, 2012
Copyright © 2012 by Pearson Education, Inc. and Nicolai M. Josuttis
#include "algostuff.hpp"
using namespace std;
int main()
{
list<int> coll;
INSERT_ELEMENTS(coll,1,9);
INSERT_ELEMENTS(coll,1,9);
coll.sort ();
PRINT_ELEMENTS(coll);
// print first and last position 5 could get inserted
pair<list<int>::const_iterator,list<int>::const_iterator> range;
range = equal_range (coll.cbegin(), coll.cend(),
5);
cout << "5 could get position "
<< distance(coll.cbegin(),range.first) + 1
<< " up to "
<< distance(coll.cbegin(),range.second) + 1
<< " without breaking the sorting" << endl;
}