-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstd_bitset.hpp
More file actions
161 lines (138 loc) · 4.76 KB
/
Copy pathstd_bitset.hpp
File metadata and controls
161 lines (138 loc) · 4.76 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
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
/*! \file bitset.hpp
\brief Support for types found in \<bitset\>
\ingroup STLSupport */
/*
Copyright (c) 2013-2022, Randolph Voorhies, Shane Grant
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the copyright holder nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#pragma once
#include <vide/binary_data.hpp>
#include <vide/exception.hpp>
#include <vide/macros.hpp>
#include <vide/types/std_string.hpp>
#include <bitset>
namespace vide { // --------------------------------------------------------------------------------
namespace bitset_detail {
//! The type the bitset is encoded with
/*! @internal */
enum class type : uint8_t {
ulong = 0,
ullong = 1,
string = 2,
bits = 3,
serialize_max_value = bits,
};
} // namespace bitset_detail -----------------------------------------------------------------------
//! Serializing (save) for std::bitset
template <class Archive, size_t N>
inline void VIDE_FUNCTION_NAME_SAVE(Archive& ar, const std::bitset<N>& bits) {
if constexpr (Archive::template supports_binary<std::uint32_t>) {
// when BinaryData optimization supported
ar.nvp("type", bitset_detail::type::bits);
// Serialize 8 bit chunks
std::uint8_t chunk = 0;
std::uint8_t mask = 0x80;
// Set each chunk using a rotating mask for the current bit
for (std::size_t i = 0; i < N; ++i) {
if (bits[i])
chunk |= mask;
mask = static_cast<std::uint8_t>(mask >> 1);
// output current chunk when mask is empty (8 bits)
if (mask == 0) {
ar(chunk);
chunk = 0;
mask = 0x80;
}
}
// serialize remainder, if it exists
if (mask != 0x80)
ar(chunk);
} else {
// when BinaryData is not supported
try {
auto const b = bits.to_ulong();
ar.nvp("type", bitset_detail::type::ulong);
ar.nvp("data", b);
} catch (const std::overflow_error&) {
try {
auto const b = bits.to_ullong();
ar.nvp("type", bitset_detail::type::ullong);
ar.nvp("data", b);
} catch (const std::overflow_error&) {
ar.nvp("type", bitset_detail::type::string);
ar.nvp("data", bits.to_string());
}
}
}
}
//! Serializing (load) for std::bitset
template <class Archive, size_t N>
inline void VIDE_FUNCTION_NAME_LOAD(Archive& ar, std::bitset<N>& bits) {
bitset_detail::type t;
ar.nvp("type", t);
switch (t) {
case bitset_detail::type::ulong: {
unsigned long b;
ar.nvp("data", b);
bits = std::bitset<N>(b);
break;
}
case bitset_detail::type::ullong: {
unsigned long long b;
ar.nvp("data", b);
bits = std::bitset<N>(b);
break;
}
case bitset_detail::type::string: {
std::string b;
ar.nvp("data", b);
try {
bits = std::bitset<N>(b);
} catch (const std::invalid_argument&) {
throw Exception("Invalid bitset data string");
}
break;
}
case bitset_detail::type::bits: {
// Normally we would use BinaryData to route this at compile time,
// but doing this at runtime doesn't break any old serialization
std::uint8_t chunk = 0;
std::uint8_t mask = 0;
bits.reset();
// Load one chunk at a time, rotating through the chunk
// to set bits in the bitset
for (std::size_t i = 0; i < N; ++i) {
if (mask == 0) {
ar(chunk);
mask = 0x80;
}
if (chunk & mask)
bits[i] = 1;
mask = static_cast<std::uint8_t>(mask >> 1);
}
break;
// default: branch is not needed, serialize_end_value takes care of it
}
}
}
} // namespace vide --------------------------------------------------------------------------------