-
Notifications
You must be signed in to change notification settings - Fork 14
Expand file tree
/
Copy pathtrit_tests.cpp
More file actions
128 lines (108 loc) · 2.84 KB
/
Copy pathtrit_tests.cpp
File metadata and controls
128 lines (108 loc) · 2.84 KB
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
// Copyright (c) 2019 The Unit-e developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <trit.h>
#include <test/test_unite.h>
#include <boost/test/unit_test.hpp>
BOOST_AUTO_TEST_SUITE(trit_tests)
BOOST_AUTO_TEST_CASE(trit_unknown)
{
// default initialization is unknown
Trit trit;
BOOST_CHECK(trit.IsUnknown());
BOOST_CHECK(!trit.IsTrue());
BOOST_CHECK(!trit.IsFalse());
}
BOOST_AUTO_TEST_CASE(trit_true)
{
Trit trit = Trit(true);
BOOST_CHECK(!trit.IsUnknown());
BOOST_CHECK(trit.IsTrue());
BOOST_CHECK(!trit.IsFalse());
}
BOOST_AUTO_TEST_CASE(trit_false)
{
Trit trit = Trit(false);
BOOST_CHECK(!trit.IsUnknown());
BOOST_CHECK(!trit.IsTrue());
BOOST_CHECK(trit.IsFalse());
}
BOOST_AUTO_TEST_CASE(trit_multi_and)
{
{
// All true yields true
Trit t1 = Trit(true);
Trit t2 = Trit(true);
Trit t3 = Trit(true);
Trit t4 = Trit(true);
Trit t5 = Trit(true);
BOOST_CHECK(Trit::And(t1, t2, t3, t4, t5).IsTrue());
}
{
// A single false (among only trues) makes the result false
Trit t1 = Trit(true);
Trit t2 = Trit(true);
Trit t3 = Trit(false);
Trit t4 = Trit(true);
Trit t5 = Trit(true);
BOOST_CHECK(Trit::And(t1, t2, t3, t4, t5).IsFalse());
}
{
// A single false (also among only unknowns) makes the result false
Trit t1 = Trit();
Trit t2 = Trit();
Trit t3 = Trit(false);
Trit t4 = Trit();
Trit t5 = Trit();
BOOST_CHECK(Trit::And(t1, t2, t3, t4, t5).IsFalse());
}
{
// A single true (among only unknowns) leaves the result unknown
Trit t1 = Trit();
Trit t2 = Trit();
Trit t3 = Trit(true);
Trit t4 = Trit();
Trit t5 = Trit();
BOOST_CHECK(Trit::And(t1, t2, t3, t4, t5).IsUnknown());
}
}
BOOST_AUTO_TEST_CASE(trit_multi_or)
{
{
// All true yields true
Trit t1 = Trit(true);
Trit t2 = Trit(true);
Trit t3 = Trit(true);
Trit t4 = Trit(true);
Trit t5 = Trit(true);
BOOST_CHECK(Trit::Or(t1, t2, t3, t4, t5).IsTrue());
}
{
// A single false (among only trues) leaves the result still true
Trit t1 = Trit(true);
Trit t2 = Trit(true);
Trit t3 = Trit(false);
Trit t4 = Trit(true);
Trit t5 = Trit(true);
BOOST_CHECK(Trit::Or(t1, t2, t3, t4, t5).IsTrue());
}
{
// A single false (also among only unknowns) makes the result unknown
Trit t1 = Trit();
Trit t2 = Trit();
Trit t3 = Trit(false);
Trit t4 = Trit();
Trit t5 = Trit();
BOOST_CHECK(Trit::Or(t1, t2, t3, t4, t5).IsUnknown());
}
{
// A single true (among only unknowns) leaves the result true
Trit t1 = Trit();
Trit t2 = Trit();
Trit t3 = Trit(true);
Trit t4 = Trit();
Trit t5 = Trit();
BOOST_CHECK(Trit::Or(t1, t2, t3, t4, t5).IsTrue());
}
}
BOOST_AUTO_TEST_SUITE_END()