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
|
#ifndef SERIALIZE_H_
#define SERIALIZE_H_
#include <Eigen/Core>
#include <fstream>
#include <map>
#include <set>
#include <vector>
#include "adjacent-matrix.hpp"
namespace qflow {
template <typename T, int A, int B>
inline void Save(FILE* fp, const Eigen::Matrix<T, A, B>& m) {
int r = m.rows(), c = m.cols();
fwrite(&r, sizeof(int), 1, fp);
fwrite(&c, sizeof(int), 1, fp);
std::vector<T> buffer(r * c);
for (int i = 0; i < r; ++i) {
for (int j = 0; j < c; ++j) {
buffer[i * c + j] = m(i, j);
}
}
fwrite(buffer.data(), sizeof(T), r * c, fp);
}
template <typename T, int A, int B>
inline void Read(FILE* fp, Eigen::Matrix<T, A, B>& m) {
int r, c;
fread(&r, sizeof(int), 1, fp);
fread(&c, sizeof(int), 1, fp);
std::vector<T> buffer(r * c);
fread(buffer.data(), sizeof(T), r * c, fp);
m.resize(r, c);
for (int i = 0; i < r; ++i) {
for (int j = 0; j < c; ++j) {
m(i, j) = buffer[i * c + j];
}
}
}
inline void Save(FILE* fp, const Link& p) { fwrite(&p, sizeof(Link), 1, fp); }
inline void Read(FILE* fp, Link& p) { fread(&p, sizeof(Link), 1, fp); }
inline void Save(FILE* fp, const TaggedLink& p) { fwrite(&p, sizeof(TaggedLink), 1, fp); }
inline void Read(FILE* fp, TaggedLink& p) { fread(&p, sizeof(TaggedLink), 1, fp); }
inline void Save(FILE* fp, double p) { fwrite(&p, sizeof(double), 1, fp); }
inline void Read(FILE* fp, double& p) { fread(&p, sizeof(double), 1, fp); }
inline void Save(FILE* fp, int p) { fwrite(&p, sizeof(int), 1, fp); }
inline void Read(FILE* fp, int& p) { fread(&p, sizeof(int), 1, fp); }
template <class T, class F>
inline void Save(FILE* fp, const std::pair<T, F>& p) {
fwrite(&p.first, sizeof(T), 1, fp);
fwrite(&p.second, sizeof(F), 1, fp);
}
template <class T, class F>
inline void Read(FILE* fp, std::pair<T, F>& p) {
fread(&p.first, sizeof(T), 1, fp);
fread(&p.second, sizeof(F), 1, fp);
}
template <class T, class F>
inline void Save(FILE* fp, const std::map<T, F>& p) {
int num = p.size();
fwrite(&num, sizeof(int), 1, fp);
for (auto& s : p) {
fwrite(&s, sizeof(s), 1, fp);
}
}
template <class T, class F>
inline void Read(FILE* fp, std::map<T, F>& p) {
int num;
p.clear();
fread(&num, sizeof(int), 1, fp);
for (int i = 0; i < num; ++i) {
std::pair<T, F> m;
fread(&m, sizeof(m), 1, fp);
p.insert(m);
}
}
template <class T>
void Save(FILE* fp, const std::vector<T>& p) {
int num = p.size();
fwrite(&num, sizeof(int), 1, fp);
for (auto& q : p) {
Save(fp, q);
}
}
template <class T>
void Read(FILE* fp, std::vector<T>& p) {
int num;
fread(&num, sizeof(int), 1, fp);
p.resize(num);
for (auto& q : p) {
Read(fp, q);
}
}
template <class T>
void Save(FILE* fp, const std::set<T>& p) {
std::vector<T> buffer;
buffer.insert(buffer.end(), p.begin(), p.end());
Save(fp, buffer);
}
template <class T>
void Read(FILE* fp, std::set<T>& p) {
std::vector<T> buffer;
Read(fp, buffer);
p.clear();
for (auto& q : buffer) p.insert(q);
}
} // namespace qflow
#endif
|