1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
|
// This file is part of the uSTL library, an STL implementation.
//
// Copyright (c) 2005 by Mike Sharov <msharov@users.sourceforge.net>
// This file is free software, distributed under the MIT License.
#include "stdtest.h"
void PrintVector (const int* first, const int* last)
{
cout << "{";
while (first < last)
cout << ' ' << *first++;
cout << " }" << endl;
}
void TestSetAndMultiset (void)
{
const int vv[] = { 1, 8, 9, 2, 3, 1, 1, 4, 6, 1, 3, 4 };
set<int> v (VectorRange (vv));
multiset<int> mv (VectorRange (vv));
cout << "set:\t\t";
PrintVector (v.begin(), v.end());
cout << "erase(3):\t";
v.erase (3);
PrintVector (v.begin(), v.end());
cout << "multiset:\t";
PrintVector (mv.begin(), mv.end());
cout << "count(1) = " << mv.count(1) << endl;
cout << "find(4) = " << lower_bound (mv, 4) - mv.begin() << endl;
cout << "find(5) = " << binary_search (mv, 5) << endl;
cout << "erase(3):\t";
mv.erase (3);
PrintVector (mv.begin(), mv.end());
}
StdBvtMain (TestSetAndMultiset)
|