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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
|
/*
* test-myset.cc: Part of GNU CSSC.
*
*
* Copyright (C) 2010 Free Software Foundation, Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* Unit tests for template myset.
*
*/
#include "myset.h"
#include "mylist.h"
#include <gtest/gtest.h>
class NoCopyConstructor
{
int value_;
public:
NoCopyConstructor(int val = 1) // default constructor
: value_(val)
{
}
NoCopyConstructor &operator =(NoCopyConstructor const &other)
{
value_ = other.value_;
}
private:
// The copy constructor is private.
NoCopyConstructor(const NoCopyConstructor& other)
: value_(other.value_)
{
}
};
TEST(MysetTest, Empty) {
myset<int> empty;
const myset<int>::my_size_type len = empty.count();
EXPECT_EQ(0u, len);
}
TEST(MysetTest, Add) {
myset<int> a;
a.add(42);
EXPECT_EQ(1u, a.count());
EXPECT_TRUE(a.is_member(42));
}
TEST(MysetTest, List) {
myset<int> a;
mylist<int> items;
a.add(42);
a.add(41);
items = a.list();
if (items[0] == 42)
{
EXPECT_EQ(42, items[0]);
EXPECT_EQ(41, items[1]);
}
else
{
EXPECT_EQ(41, items[0]);
EXPECT_EQ(42, items[1]);
}
EXPECT_EQ(2u, a.count());
}
|
