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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
|
#include <tut/tut.hpp>
#include <set>
#include <algorithm>
using std::set;
namespace tut
{
struct set_basic
{
set<int> s;
};
typedef test_group<set_basic> factory;
typedef factory::object object;
}
namespace
{
tut::factory tf("std::set basic operations");
}
namespace tut
{
/**
* Checks insert operation
*/
template<>
template<>
void object::test<1>()
{
s.insert(s.end(), 100);
ensure(s.find(100) != s.end());
}
/**
* Checks clear operation
*/
template<>
template<>
void object::test<2>()
{
s.clear();
ensure_equals("size is 0", s.size(), 0U);
ensure("empty", s.empty());
// imitate failure of container implementation
ensure("s.end() == s.begin()", s.end() != s.begin());
}
}
|
