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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
|
/* Unit tests for hash-set.h.
Copyright (C) 2015-2019 Free Software Foundation, Inc.
This file is part of GCC.
GCC 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, or (at your option) any later
version.
GCC 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 GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "tm.h"
#include "opts.h"
#include "hash-set.h"
#include "selftest.h"
#if CHECKING_P
namespace selftest {
/* Construct a hash_set <const char *> and verify that various operations
work correctly. */
static void
test_set_of_strings ()
{
hash_set <const char *> s;
ASSERT_EQ (0, s.elements ());
const char *red = "red";
const char *green = "green";
const char *blue = "blue";
ASSERT_EQ (false, s.contains (red));
for (hash_set<const char *>::iterator it = s.begin (); it != s.end (); ++it)
ASSERT_EQ (true, false);
/* Populate the hash_set. */
ASSERT_EQ (false, s.add (red));
ASSERT_EQ (false, s.add (green));
ASSERT_EQ (false, s.add (blue));
ASSERT_EQ (true, s.add (green));
/* Verify that the values are now within the set. */
ASSERT_EQ (true, s.contains (red));
ASSERT_EQ (true, s.contains (green));
ASSERT_EQ (true, s.contains (blue));
ASSERT_EQ (3, s.elements ());
/* Test removal. */
s.remove (red);
ASSERT_EQ (false, s.contains (red));
ASSERT_EQ (true, s.contains (green));
ASSERT_EQ (true, s.contains (blue));
ASSERT_EQ (2, s.elements ());
s.remove (red);
ASSERT_EQ (false, s.contains (red));
ASSERT_EQ (true, s.contains (green));
ASSERT_EQ (true, s.contains (blue));
ASSERT_EQ (2, s.elements ());
int seen = 0;
for (hash_set<const char *>::iterator it = s.begin (); it != s.end (); ++it)
{
int n = *it == green;
if (n == 0)
ASSERT_EQ (*it, blue);
ASSERT_EQ (seen & (1 << n), 0);
seen |= 1 << n;
}
ASSERT_EQ (seen, 3);
hash_set <const char *, true> t;
ASSERT_EQ (0, t.elements ());
ASSERT_EQ (false, t.contains (red));
for (hash_set<const char *, true>::iterator it = t.begin ();
it != t.end (); ++it)
ASSERT_EQ (true, false);
/* Populate the hash_set. */
ASSERT_EQ (false, t.add (red));
ASSERT_EQ (false, t.add (green));
ASSERT_EQ (false, t.add (blue));
ASSERT_EQ (true, t.add (green));
/* Verify that the values are now within the set. */
ASSERT_EQ (true, t.contains (red));
ASSERT_EQ (true, t.contains (green));
ASSERT_EQ (true, t.contains (blue));
ASSERT_EQ (3, t.elements ());
seen = 0;
for (hash_set<const char *, true>::iterator it = t.begin ();
it != t.end (); ++it)
{
int n = 2;
if (*it == green)
n = 0;
else if (*it == blue)
n = 1;
else
ASSERT_EQ (*it, red);
ASSERT_EQ (seen & (1 << n), 0);
seen |= 1 << n;
}
ASSERT_EQ (seen, 7);
/* Test removal. */
t.remove (red);
ASSERT_EQ (false, t.contains (red));
ASSERT_EQ (true, t.contains (green));
ASSERT_EQ (true, t.contains (blue));
ASSERT_EQ (2, t.elements ());
t.remove (red);
ASSERT_EQ (false, t.contains (red));
ASSERT_EQ (true, t.contains (green));
ASSERT_EQ (true, t.contains (blue));
ASSERT_EQ (2, t.elements ());
}
/* Run all of the selftests within this file. */
void
hash_set_tests_c_tests ()
{
test_set_of_strings ();
}
} // namespace selftest
#endif /* #if CHECKING_P */
|
