williamr@2
|
1 |
//=======================================================================
|
williamr@2
|
2 |
// Copyright 2002 Indiana University.
|
williamr@2
|
3 |
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
|
williamr@2
|
4 |
//
|
williamr@2
|
5 |
// Distributed under the Boost Software License, Version 1.0. (See
|
williamr@2
|
6 |
// accompanying file LICENSE_1_0.txt or copy at
|
williamr@2
|
7 |
// http://www.boost.org/LICENSE_1_0.txt)
|
williamr@2
|
8 |
//=======================================================================
|
williamr@2
|
9 |
|
williamr@2
|
10 |
#ifndef BOOST_BITSET_ADAPTOR_HPP
|
williamr@2
|
11 |
#define BOOST_BITSET_ADAPTOR_HPP
|
williamr@2
|
12 |
|
williamr@2
|
13 |
template <class T, class Derived>
|
williamr@2
|
14 |
struct bitset_adaptor {
|
williamr@2
|
15 |
Derived& derived() { return static_cast<Derived&>(*this); }
|
williamr@2
|
16 |
const Derived& derived() const {
|
williamr@2
|
17 |
return static_cast<const Derived&>(*this);
|
williamr@2
|
18 |
}
|
williamr@2
|
19 |
};
|
williamr@2
|
20 |
|
williamr@2
|
21 |
template <class T, class D, class V>
|
williamr@2
|
22 |
bool set_contains(const bitset_adaptor<T,D>& s, const V& x) {
|
williamr@2
|
23 |
return s.derived().test(x);
|
williamr@2
|
24 |
}
|
williamr@2
|
25 |
|
williamr@2
|
26 |
template <class T, class D>
|
williamr@2
|
27 |
bool set_equal(const bitset_adaptor<T,D>& x,
|
williamr@2
|
28 |
const bitset_adaptor<T,D>& y) {
|
williamr@2
|
29 |
return x.derived() == y.derived();
|
williamr@2
|
30 |
}
|
williamr@2
|
31 |
|
williamr@2
|
32 |
template <class T, class D>
|
williamr@2
|
33 |
int set_lex_order(const bitset_adaptor<T,D>& x,
|
williamr@2
|
34 |
const bitset_adaptor<T,D>& y) {
|
williamr@2
|
35 |
return compare_3way(x.derived(), y.derived());
|
williamr@2
|
36 |
}
|
williamr@2
|
37 |
|
williamr@2
|
38 |
template <class T, class D>
|
williamr@2
|
39 |
void set_clear(bitset_adaptor<T,D>& x) {
|
williamr@2
|
40 |
x.derived().reset();
|
williamr@2
|
41 |
}
|
williamr@2
|
42 |
|
williamr@2
|
43 |
template <class T, class D>
|
williamr@2
|
44 |
bool set_empty(const bitset_adaptor<T,D>& x) {
|
williamr@2
|
45 |
return x.derived().none();
|
williamr@2
|
46 |
}
|
williamr@2
|
47 |
|
williamr@2
|
48 |
template <class T, class D, class V>
|
williamr@2
|
49 |
void set_insert(bitset_adaptor<T,D>& x, const V& a) {
|
williamr@2
|
50 |
x.derived().set(a);
|
williamr@2
|
51 |
}
|
williamr@2
|
52 |
|
williamr@2
|
53 |
template <class T, class D, class V>
|
williamr@2
|
54 |
void set_remove(bitset_adaptor<T,D>& x, const V& a) {
|
williamr@2
|
55 |
x.derived().set(a, false);
|
williamr@2
|
56 |
}
|
williamr@2
|
57 |
|
williamr@2
|
58 |
template <class T, class D>
|
williamr@2
|
59 |
void set_intersect(const bitset_adaptor<T,D>& x,
|
williamr@2
|
60 |
const bitset_adaptor<T,D>& y,
|
williamr@2
|
61 |
bitset_adaptor<T,D>& z)
|
williamr@2
|
62 |
{
|
williamr@2
|
63 |
z.derived() = x.derived() & y.derived();
|
williamr@2
|
64 |
}
|
williamr@2
|
65 |
|
williamr@2
|
66 |
template <class T, class D>
|
williamr@2
|
67 |
void set_union(const bitset_adaptor<T,D>& x,
|
williamr@2
|
68 |
const bitset_adaptor<T,D>& y,
|
williamr@2
|
69 |
bitset_adaptor<T,D>& z)
|
williamr@2
|
70 |
{
|
williamr@2
|
71 |
z.derived() = x.derived() | y.derived();
|
williamr@2
|
72 |
}
|
williamr@2
|
73 |
|
williamr@2
|
74 |
template <class T, class D>
|
williamr@2
|
75 |
void set_difference(const bitset_adaptor<T,D>& x,
|
williamr@2
|
76 |
const bitset_adaptor<T,D>& y,
|
williamr@2
|
77 |
bitset_adaptor<T,D>& z)
|
williamr@2
|
78 |
{
|
williamr@2
|
79 |
z.derived() = x.derived() - y.derived();
|
williamr@2
|
80 |
}
|
williamr@2
|
81 |
|
williamr@2
|
82 |
template <class T, class D>
|
williamr@2
|
83 |
void set_compliment(const bitset_adaptor<T,D>& x,
|
williamr@2
|
84 |
bitset_adaptor<T,D>& z)
|
williamr@2
|
85 |
{
|
williamr@2
|
86 |
z.derived() = x.derived();
|
williamr@2
|
87 |
z.derived().flip();
|
williamr@2
|
88 |
}
|
williamr@2
|
89 |
|
williamr@2
|
90 |
#endif // BOOST_BITSET_ADAPTOR_HPP
|