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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
|
// TR2 <bool_set> -*- C++ -*-
// Copyright (C) 2009-2015 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library 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.
// This library 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.
// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.
// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
// <http://www.gnu.org/licenses/>.
/** @file tr2/bool_set
* This is a TR2 C++ Library header.
*/
#ifndef _GLIBCXX_TR2_BOOL_SET
#define _GLIBCXX_TR2_BOOL_SET 1
#pragma GCC system_header
#include <typeinfo>
#include <iostream>
namespace std _GLIBCXX_VISIBILITY(default)
{
namespace tr2
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION
/**
* bool_set
*
* See N2136, Bool_set: multi-valued logic
* by Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion.
*
* The implicit conversion to bool is slippery! I may use the new
* explicit conversion. This has been specialized in the language
* so that in contexts requiring a bool the conversion happens
* implicitly. Thus most objections should be eliminated.
*/
class bool_set
{
public:
/// Default constructor.
constexpr bool_set() : _M_b(_S_false) { }
/// Constructor from bool.
constexpr bool_set(bool __t) : _M_b(_Bool_set_val(__t)) { }
// I'm not sure about this.
bool contains(bool_set __b) const
{ return this->is_singleton() && this->equals(__b); }
/// Return true if states are equal.
bool equals(bool_set __b) const
{ return __b._M_b == _M_b; }
/// Return true if this is empty.
bool is_emptyset() const
{ return _M_b == _S_empty; }
/// Return true if this is indeterminate.
bool is_indeterminate() const
{ return _M_b == _S_indet; }
/// Return true if this is false or true (normal boolean).
bool is_singleton() const
{ return _M_b == _S_false || _M_b == _S_true_; }
/// Conversion to bool.
//explicit
operator bool() const
{
if (! is_singleton())
throw std::bad_cast();
return _M_b;
}
///
static bool_set indeterminate()
{
bool_set __b;
__b._M_b = _S_indet;
return __b;
}
///
static bool_set emptyset()
{
bool_set __b;
__b._M_b = _S_empty;
return __b;
}
friend bool_set
operator!(bool_set __b)
{ return __b._M_not(); }
friend bool_set
operator^(bool_set __s, bool_set __t)
{ return __s._M_xor(__t); }
friend bool_set
operator|(bool_set __s, bool_set __t)
{ return __s._M_or(__t); }
friend bool_set
operator&(bool_set __s, bool_set __t)
{ return __s._M_and(__t); }
friend bool_set
operator==(bool_set __s, bool_set __t)
{ return __s._M_eq(__t); }
// These overloads replace the facet additions in the paper!
template<typename CharT, typename Traits>
friend std::basic_ostream<CharT, Traits>&
operator<<(std::basic_ostream<CharT, Traits>& __out, bool_set __b)
{
int __a = __b._M_b;
__out << __a;
}
template<typename CharT, typename Traits>
friend std::basic_istream<CharT, Traits>&
operator>>(std::basic_istream<CharT, Traits>& __in, bool_set& __b)
{
long __c;
__in >> __c;
if (__c >= _S_false && __c < _S_empty)
__b._M_b = static_cast<_Bool_set_val>(__c);
}
private:
///
enum _Bool_set_val: unsigned char
{
_S_false = 0,
_S_true_ = 1,
_S_indet = 2,
_S_empty = 3
};
/// Bool set state.
_Bool_set_val _M_b;
///
bool_set(_Bool_set_val __c) : _M_b(__c) { }
///
bool_set _M_not() const
{ return _S_not[this->_M_b]; }
///
bool_set _M_xor(bool_set __b) const
{ return _S_xor[this->_M_b][__b._M_b]; }
///
bool_set _M_or(bool_set __b) const
{ return _S_or[this->_M_b][__b._M_b]; }
///
bool_set _M_and(bool_set __b) const
{ return _S_and[this->_M_b][__b._M_b]; }
///
bool_set _M_eq(bool_set __b) const
{ return _S_eq[this->_M_b][__b._M_b]; }
///
static _Bool_set_val _S_not[4];
///
static _Bool_set_val _S_xor[4][4];
///
static _Bool_set_val _S_or[4][4];
///
static _Bool_set_val _S_and[4][4];
///
static _Bool_set_val _S_eq[4][4];
};
// 20.2.3.2 bool_set values
inline bool
contains(bool_set __s, bool_set __t)
{ return __s.contains(__t); }
inline bool
equals(bool_set __s, bool_set __t)
{ return __s.equals(__t); }
inline bool
is_emptyset(bool_set __b)
{ return __b.is_emptyset(); }
inline bool
is_indeterminate(bool_set __b)
{ return __b.is_indeterminate(); }
inline bool
is_singleton(bool_set __b)
{ return __b.is_singleton(); }
inline bool
certainly(bool_set __b)
{ return ! __b.contains(false); }
inline bool
possibly(bool_set __b)
{ return __b.contains(true); }
// 20.2.3.3 bool_set set operations
inline bool_set
set_union(bool __s, bool_set __t)
{ return bool_set(__s) | __t; }
inline bool_set
set_union(bool_set __s, bool __t)
{ return __s | bool_set(__t); }
inline bool_set
set_union(bool_set __s, bool_set __t)
{ return __s | __t; }
inline bool_set
set_intersection(bool __s, bool_set __t)
{ return bool_set(__s) & __t; }
inline bool_set
set_intersection(bool_set __s, bool __t)
{ return __s & bool_set(__t); }
inline bool_set
set_intersection(bool_set __s, bool_set __t)
{ return __s & __t; }
inline bool_set
set_complement(bool_set __b)
{ return ! __b; }
// 20.2.3.4 bool_set logical operators
inline bool_set
operator^(bool __s, bool_set __t)
{ return bool_set(__s) ^ __t; }
inline bool_set
operator^(bool_set __s, bool __t)
{ return __s ^ bool_set(__t); }
inline bool_set
operator|(bool __s, bool_set __t)
{ return bool_set(__s) | __t; }
inline bool_set
operator|(bool_set __s, bool __t)
{ return __s | bool_set(__t); }
inline bool_set
operator&(bool __s, bool_set __t)
{ return bool_set(__s) & __t; }
inline bool_set
operator&(bool_set __s, bool __t)
{ return __s & bool_set(__t); }
// 20.2.3.5 bool_set relational operators
inline bool_set
operator==(bool __s, bool_set __t)
{ return bool_set(__s) == __t; }
inline bool_set
operator==(bool_set __s, bool __t)
{ return __s == bool_set(__t); }
inline bool_set
operator!=(bool __s, bool_set __t)
{ return ! (__s == __t); }
inline bool_set
operator!=(bool_set __s, bool __t)
{ return ! (__s == __t); }
inline bool_set
operator!=(bool_set __s, bool_set __t)
{ return ! (__s == __t); }
_GLIBCXX_END_NAMESPACE_VERSION
}
}
#include <tr2/bool_set.tcc>
#endif // _GLIBCXX_TR2_BOOL_SET
|
