STL.rar_stl queue

#include <iostream> #include <set> #include <string> #include <iterator> #include <algorithm> #include "TestSet.h" using namespace std; void TestSet() { double a[5]={4.4,2.2,5.5,3.3,16.6}; set<double,less<double>>doubleSet(a,a+5); cout<<"doubleSet contains: "; copy(doubleSet.begin(),doubleSet.end(),ostream_iterator<double>(cout," ")); cout<<endl; pair<set<double,less<double>>::const_iterator,bool>p; p=doubleSet.insert(13.8); cout<<(*p.first)<<(p.second?"was":"was not")<<"inserted"<<endl; cout<<"doubleSet contains: "; copy(doubleSet.begin(),doubleSet.end(),ostream_iterator<double>(cout," ")); cout<<endl; p=doubleSet.insert(5.5); cout<<(*p.first)<<(p.second?"was":"was not")<<"inserted"<<endl; cout<<"doubleSet contains: "; copy(doubleSet.begin(),doubleSet.end(),ostream_iterator<double>(cout," ")); cout<<endl; cout<<"lower_bound(3.5): "<<*doubleSet.lower_bound(3.5)<<endl; cout<<"upper_bound(3.5): "<<*doubleSet.upper_bound(3.5)<<endl; cout<<"equal_range(3.5): "<<*doubleSet.equal_range(3.5).first<<" "<<*doubleSet.equal_range(3.5).second<<endl; cout<<"lower_bound(9.5): "<<*doubleSet.lower_bound(9.5)<<endl; cout<<"upper_bound(9.5): "<<*doubleSet.upper_bound(9.5)<<endl; cout<<"equal_range(9.5): "<<*doubleSet.equal_range(9.5).first<<" "<<*doubleSet.equal_range(9.5).second<<endl; }