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
|
#ifndef _SERIALIZE_H_
#define _SERIALIZE_H_
#include <iostream>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <tuple>
// our "interface" for encoding
// template<class T>
// void encode(std::streambuf& os, T t);
// our "interface" for decoding
// template<class T>
// void decode(std::streambuf& os, T& t);
// helpers to encode pointers to arrays of data
// also works for single elements
template<class T>
void encode(std::streambuf& os, T* t, size_t size = 1) {
os.sputn((char*)t, sizeof(T)*size);
}
template<class T>
void decode(std::streambuf& os, T* t, size_t size = 1) {
os.sgetn((char*)t, sizeof(T)*size);
}
// This is a macro to allow easy construction of encode and decode for
// trivial to serialize types.
// Trivially serializable types are any type that can be copied by
// copying its memory.
// As a rule of thumb, anything with a pointer is not trivially serializable
#define TRIVIALLY_SERIALIZABLE(T) \
void encode(std::streambuf& os, const T& t) { \
encode(os, &t); \
} \
void decode(std::streambuf& os, T& t) { \
decode(os, &t); \
}
// integral types serialization methods
TRIVIALLY_SERIALIZABLE(char);
TRIVIALLY_SERIALIZABLE(unsigned char);
TRIVIALLY_SERIALIZABLE(short int);
TRIVIALLY_SERIALIZABLE(unsigned short int);
TRIVIALLY_SERIALIZABLE(int);
TRIVIALLY_SERIALIZABLE(unsigned int);
TRIVIALLY_SERIALIZABLE(long int);
TRIVIALLY_SERIALIZABLE(unsigned long int);
TRIVIALLY_SERIALIZABLE(long long int);
TRIVIALLY_SERIALIZABLE(unsigned long long int);
// STL container serializers
// Some of these functions have template specializations to increase performance when
// the entire structure exists as a contiguous piece of memory
// we need some prototypes TODO: clean up order of functions
template<class T>
void decode(std::streambuf& os, std::set<T>& v);
// std::pair
// we pray that std::pair is contiguous memory
// TODO: is it?
template<class T, class S>
inline
typename std::enable_if<std::is_pod<T>::value && std::is_pod<S>::value, void>::type
encode(std::streambuf& os, const std::pair<T, S>& p) {
encode(os, &p);
}
// specialization for non-contiguous mem
template<class T, class S>
inline
typename std::enable_if<!(std::is_pod<T>::value && std::is_pod<S>::value), void>::type
encode(std::streambuf& os, const std::pair<T, S>& p) {
encode(os, p.first);
encode(os, p.second);
}
template<class T, class S>
inline
typename std::enable_if<std::is_pod<T>::value && std::is_pod<S>::value, void>::type
decode(std::streambuf& os, std::pair<T, S>& p) {
decode(os, &p);
}
template<class T, class S>
inline
typename std::enable_if<!(std::is_pod<T>::value && std::is_pod<S>::value), void>::type
decode(std::streambuf& os, std::pair<T, S>& p) {
decode(os, p.first);
decode(os, p.second);
}
// helper to encode a size plus an interator
template<class Iter>
inline
void encode_iter(std::streambuf& os, size_t size, Iter begin, Iter end);
// std::vector
// specialized for contiguous memory
template<class T>
inline
typename std::enable_if<std::is_pod<T>::value, void>::type
encode(std::streambuf& os, const std::vector<T>& v) {
encode(os, v.size());
encode(os, v.data(), v.size());
}
template<class T>
inline
typename std::enable_if<!std::is_pod<T>::value, void>::type
encode(std::streambuf& os, const std::vector<T>& v) {
encode_iter(os, v.size(), v.begin(), v.end());
}
template<class T>
inline
typename std::enable_if<std::is_pod<T>::value, void>::type
decode(std::streambuf& os, std::vector<T>& v) {
// read size of the vector
size_t size;
decode(os, size);
v.resize(size); // we know the size, so we reserve space
decode(os, v.data(), size);
}
template<class T>
inline
typename std::enable_if<!std::is_pod<T>::value, void>::type
decode(std::streambuf& os, std::vector<T>& v) {
v.clear();
size_t size;
decode(os, size);
v.reserve(size);
for(size_t i = 0; i < size; i++) {
typename std::remove_reference<decltype(v)>::type::value_type t;
decode(os, t);
v.emplace_back(std::move(t));
}
}
// std::set
template<class T>
inline
void encode(std::streambuf& os, const std::set<T>& v) {
encode_iter(os, v.size(), v.begin(), v.end());
}
template<class T>
inline
void decode_thing(std::streambuf& os, T& v) {
v.clear();
size_t size;
decode(os, size);
auto hint = v.end();
for(size_t i = 0; i < size; i++) {
typename std::remove_reference<decltype(v)>::type::value_type t;
decode(os, t);
hint = v.emplace_hint(hint, std::move(t));
}
}
template<class T>
inline
void decode(std::streambuf& os, std::set<T>& v) {
decode_thing(os, v);
}
// std::map
template<class T, class S>
inline
void encode(std::streambuf& os, const std::map<T, S>& v) {
encode_iter(os, v.size(), v.begin(), v.end());
}
template<class T, class S>
inline
void decode(std::streambuf& os, std::map<T, S>& v) {
decode_thing(os, v);
}
// std::multimap
template<class T, class S>
inline
void encode(std::streambuf& os, const std::multimap<T, S>& v) {
encode_iter(os, v.size(), v.begin(), v.end());
}
template<class T, class S>
inline
void decode(std::streambuf& os, std::multimap<T, S>& v) {
decode_thing(os, v);
}
template<class Iter>
inline
void encode_iter(std::streambuf& os, size_t size, Iter begin, Iter end) {
encode(os, size);
for (; begin != end; ++begin) {
encode(os, *begin);
}
}
#endif
|
