...
| Code Block | ||||
|---|---|---|---|---|
| ||||
typedef set<int, less_equal<int > > IntSetLE;
IntSetLE::const_iterator sleIter;
IntSetLE sle;
sle.insert(5);
sle.insert(10);
sle.insert(20);
pair<IntSetLE::const_iterator, IntSetLE::const_iterator> psle;
psle = sle.equal_range(10);
for (sleIter = psle.first; sleIter != psle.second; ++sleIter){
cout << "Set contains: " << *sleIter << endl;
}
|
...
| Code Block | ||||
|---|---|---|---|---|
| ||||
typedef set<int, less<int> > IntSetLess;
IntSetLess::const_iterator islIter;
IntSetLess isl;
isl.insert(5);
isl.insert(10);
isl.insert(20);
pair<IntSetLess::const_iterator, IntSetLess::const_iterator> pisl;
pisl = isl.equal_range(10);
for (islIter = pisl.first; islIter \!= pisl.second; \++islIter) {
cout << "Set contains: " << \*islIter << endl;
}
|
...
| Code Block | ||||
|---|---|---|---|---|
| ||||
typedef set<int*> IntPtrSet;
IntPtrSet::const_iterator sIter;
IntPtrSet s;
int i[3] = {10, 20, 5};
s.insert(&i[2]);
s.insert(&i[1]);
s.insert(&i[0]);
cout << "Set contains ";
for (sIter = s.begin(); sIter != s.end(); ++sIter) cout << **sIter << ' ';
cout << endl;
|
TRhis This code outputs:
Set contains 10 20 5
...
| Code Block | ||||
|---|---|---|---|---|
| ||||
struct DereferenceLess {
template <typename PtrType>
bool operator()(PtrType pl1, PtrType pl2) const {
return *pl1 < *pl2;
}
};
|
...
| Code Block | ||||
|---|---|---|---|---|
| ||||
typedef set<int*, DereferenceLess> IntPtrSet;
|
...