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
|
#pragma once
#include "base/base.hpp"
#include "std/map.hpp"
#include "std/set.hpp"
#include "std/unordered_map.hpp"
#include "std/vector.hpp"
#include "std/array.hpp"
#include "std/utility.hpp"
/// @name std containers serialization
/// TArchive should be an archive class in global namespace.
//@{
template <class TArchive, class T1, class T2>
TArchive & operator << (TArchive & ar, pair<T1, T2> const & t)
{
ar << t.first << t.second;
return ar;
}
template <class TArchive, class T1, class T2>
TArchive & operator >> (TArchive & ar, pair<T1, T2> & t)
{
ar >> t.first >> t.second;
return ar;
}
template <class TArchive, class TCont> void save_like_map(TArchive & ar, TCont const & rMap)
{
uint32_t const count = static_cast<uint32_t>(rMap.size());
ar << count;
for (typename TCont::const_iterator i = rMap.begin(); i != rMap.end(); ++i)
ar << i->first << i->second;
}
template <class TArchive, class TCont> void load_like_map(TArchive & ar, TCont & rMap)
{
rMap.clear();
uint32_t count;
ar >> count;
while (count > 0)
{
typename TCont::key_type t1;
typename TCont::mapped_type t2;
ar >> t1 >> t2;
rMap.insert(make_pair(t1, t2));
--count;
}
}
template <class TArchive, class TCont> void save_like_vector(TArchive & ar, TCont const & rCont)
{
uint32_t const count = static_cast<uint32_t>(rCont.size());
ar << count;
for (uint32_t i = 0; i < count; ++i)
ar << rCont[i];
}
template <class TArchive, class TCont> void load_like_vector(TArchive & ar, TCont & rCont)
{
rCont.clear();
uint32_t count;
ar >> count;
rCont.resize(count);
for (uint32_t i = 0; i < count; ++i)
ar >> rCont[i];
}
template <class TArchive, class TCont> void save_like_set(TArchive & ar, TCont const & rSet)
{
uint32_t const count = static_cast<uint32_t>(rSet.size());
ar << count;
for (typename TCont::const_iterator it = rSet.begin(); it != rSet.end(); ++it)
ar << *it;
}
template <class TArchive, class TCont> void load_like_set(TArchive & ar, TCont & rSet)
{
rSet.clear();
uint32_t count;
ar >> count;
for (uint32_t i = 0; i < count; ++i)
{
typename TCont::value_type val;
ar >> val;
rSet.insert(val);
}
}
template <class TArchive, class T1, class T2> TArchive & operator << (TArchive & ar, map<T1, T2> const & rMap)
{
save_like_map(ar, rMap);
return ar;
}
template <class TArchive, class T1, class T2> TArchive & operator >> (TArchive & ar, map<T1, T2> & rMap)
{
load_like_map(ar, rMap);
return ar;
}
template <class TArchive, class T1, class T2> TArchive & operator << (TArchive & ar, multimap<T1, T2> const & rMap)
{
save_like_map(ar, rMap);
return ar;
}
template <class TArchive, class T1, class T2> TArchive & operator >> (TArchive & ar, multimap<T1, T2> & rMap)
{
load_like_map(ar, rMap);
return ar;
}
template <class TArchive, class T1, class T2> TArchive & operator << (TArchive & ar, unordered_map<T1, T2> const & rMap)
{
save_like_map(ar, rMap);
return ar;
}
template <class TArchive, class T1, class T2> TArchive & operator >> (TArchive & ar, unordered_map<T1, T2> & rMap)
{
load_like_map(ar, rMap);
return ar;
}
template <class TArchive, class T> TArchive & operator << (TArchive & ar, vector<T> const & rVector)
{
save_like_vector(ar, rVector);
return ar;
}
template <class TArchive, class T> TArchive & operator >> (TArchive & ar, vector<T> & rVector)
{
load_like_vector(ar, rVector);
return ar;
}
template <class TArchive, class T> TArchive & operator << (TArchive & ar, set<T> const & rSet)
{
save_like_set(ar, rSet);
return ar;
}
template <class TArchive, class T> TArchive & operator >> (TArchive & ar, set<T> & rSet)
{
load_like_set(ar, rSet);
return ar;
}
template <class TArchive, class T, size_t N> TArchive & operator << (TArchive & ar, array<T, N> const & rArray)
{
for (size_t i = 0; i < N; ++i)
ar << rArray[i];
return ar;
}
template <class TArchive, class T, size_t N> TArchive & operator >> (TArchive & ar, array<T, N> & rArray)
{
for (size_t i = 0; i < N; ++i)
ar >> rArray[i];
return ar;
}
//@}
namespace serial
{
/// @name This functions invokes overriten do_load for type T with index in array.
//@{
template <class TArchive, class T> void do_load(TArchive & ar, size_t ind, vector<T> & rVector)
{
uint32_t count;
ar >> count;
rVector.resize(count);
for (uint32_t i = 0; i < count; ++i)
do_load(ar, ind, rVector[i]);
}
template <class TArchive, class T, size_t N> void do_load(TArchive & ar, array<T, N> & rArray)
{
for (size_t i = 0; i < N; ++i)
do_load(ar, i, rArray[i]);
}
//@}
namespace detail
{
template <class TArchive> class save_element
{
TArchive & m_ar;
public:
save_element(TArchive & ar) : m_ar(ar) {}
template <class T> void operator() (T const & t, int)
{
m_ar << t;
}
};
template <class TArchive> class load_element
{
TArchive & m_ar;
public:
load_element(TArchive & ar) : m_ar(ar) {}
template <class T> void operator() (T & t, int)
{
m_ar >> t;
}
};
}
template <class TArchive, class TTuple>
void save_tuple(TArchive & ar, TTuple const & t)
{
detail::save_element<TArchive> doSave(ar);
for_each_tuple(t, doSave);
}
template <class TArchive, class TTuple>
void load_tuple(TArchive & ar, TTuple & t)
{
detail::load_element<TArchive> doLoad(ar);
for_each_tuple(t, doLoad);
}
}
|
