forked from MxUI/MUI
-
Notifications
You must be signed in to change notification settings - Fork 0
/
stream.h
273 lines (234 loc) · 6.81 KB
/
stream.h
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
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
/*
Multiscale Universal Interface Code Coupling Library
Copyright (C) 2017 Y. H. Tang, S. Kudo, X. Bian, Z. Li, G. E. Karniadakis
This software is jointly licensed under the Apache License, Version 2.0
and the GNU General Public License version 3, you may use it according
to either.
** Apache License, version 2.0 **
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
** GNU General Public License, version 3 **
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
** File Details **
Filename: stream.h
Created: Mar 18, 2014
Author: S. Kudo
Description:
*/
#ifndef MUI_STREAM_H_
#define MUI_STREAM_H_
#include <memory>
#include <algorithm>
namespace mui {
class istream {
public:
virtual ~istream() {}
virtual void read( char* ptr, std::size_t size ) = 0;
};
class ostream {
public:
virtual ~ostream() {}
virtual void write( const char* ptr, std::size_t size ) = 0;
};
class iostream : public istream, public ostream {
public:
virtual ~iostream() {}
};
/*
* container_steram is something like std::stringstream.
* Its functionality is serialize & deserialize data to
* container<char>.
*/
template<template<typename T, typename =std::allocator<T> > class Seq,
typename Alloc=std::allocator<char> >
class container_stream: public iostream {
public:
~container_stream() {}
void read( char* ptr, std::size_t size ){
if( content.size() < size ) throw("");
std::copy_n(content.begin(),size,ptr);
content.erase(content.begin(),content.begin()+size);
}
void write( const char* ptr, std::size_t size ){
content.insert(content.end(),ptr,ptr+size);
}
Seq<char,Alloc>& data() { return content; }
const Seq<char,Alloc>& data() const { return content; }
private:
Seq<char,Alloc> content;
};
/*
* inputiterator_stream is a istream from InputIterator
*/
template<typename ConstInputIterator>
class iitr_stream: public istream {
public:
iitr_stream( const iitr_stream& ) = default;
iitr_stream( ConstInputIterator cur_ )
: cur(cur_) {}
~iitr_stream() {}
void read( char* ptr, std::size_t sz ) {
std::copy_n(cur,sz,ptr);
std::advance(cur,sz);
}
ConstInputIterator current() const { return cur; }
private:
ConstInputIterator cur;
};
template<typename ConstInputIterator>
iitr_stream<ConstInputIterator> make_istream(ConstInputIterator begin)
{
return iitr_stream<ConstInputIterator>(begin);
}
/*
* outputiterator_stream is a ouput_stream to OutputIterator
*/
template<typename OutputIterator>
class oitr_stream: public ostream {
public:
oitr_stream( const oitr_stream& ) = default;
oitr_stream( OutputIterator begin ) : cur(begin) {}
~oitr_stream() {}
void write( const char* ptr, std::size_t sz ) {
cur = std::copy_n(ptr,sz,cur);
}
OutputIterator current() const { return cur; }
private:
OutputIterator cur;
};
template<typename OutputIterator>
oitr_stream<OutputIterator> make_ostream(OutputIterator cur)
{
return oitr_stream<OutputIterator>(cur);
}
/*
* ocount_stream can be used for calculate the size of serialized data.
*/
class ocount_stream : public ostream {
public:
ocount_stream(std::size_t off=0u) : sum(off) {}
~ocount_stream() {}
std::size_t size() const { return sum; }
void write( const char*, std::size_t size ) { sum += size; }
private:
std::size_t sum;
};
inline std::size_t streamed_size() { return 0u; }
template<typename T, typename... Args>
std::size_t streamed_size( const T& a, const Args&... args )
{
ocount_stream stream;
stream << a;
return stream.size() + streamed_size(args...);
}
#define Makeopsh(TYPE,T) \
inline istream& operator>> ( istream& stream, TYPE& t ) \
{ \
stream.read(reinterpret_cast<char*>(&t),sizeof(t)); \
return stream; \
} \
inline ostream& operator<< ( ostream& stream, TYPE t ) \
{ \
stream.write(reinterpret_cast<char*>(&t),sizeof(t)); \
return stream; \
}
// use network-byte-order(big-endian)
#define Makeopshs(TYPE,SZ) \
inline istream& operator>> ( istream& stream, TYPE& t ) \
{ \
int##SZ##_t be; \
stream.read(reinterpret_cast<char*>(&be),sizeof(be)); \
be = be##SZ##toh (be); \
std::memcpy(reinterpret_cast<char*>(&t), \
reinterpret_cast<char*>(&be), sizeof(be)); \
return stream; \
} \
inline ostream& operator<< ( ostream& stream, TYPE t ) \
{ \
int##SZ##_t be; \
std::memcpy(reinterpret_cast<char*>(&be), \
reinterpret_cast<char*>(&t), sizeof(be)); \
be = htobe##SZ (be); \
stream.write(reinterpret_cast<char*>(&be),sizeof(be)); \
return stream; \
}
Makeopsh(char,8);
Makeopsh(signed char,8);
Makeopsh(unsigned char,8);
#ifndef MUI_IGNORE_ENDIAN
#if __BYTE_ORDER == __BIG_ENDIAN
# define Makeopshi Makeopsh
# if __FLOAT_WORD_ORDER == __BYTE_ORDER
# define Makeopshf Makeopsh
# else
# define Makeopshf Makeopshs
# endif
#else
# define Makeopshi Makeopshs
# if __FLOAT_WORD_ORDER == __BYTE_ORDER
# define Makeopshf Makeopshs
# else
# define Makeopshf Makeopsh
# endif
#endif
#else
#define Makeopshi Makeopsh
#define Makeopshf Makeopsh
#endif
Makeopshi(int16_t,16);
Makeopshi(uint16_t,16);
Makeopshi(int32_t,32);
Makeopshi(uint32_t,32);
Makeopshi(int64_t,64);
Makeopshi(uint64_t,64);
Makeopshf(float,32);
Makeopshf(double,64);
#undef Makeopshf
#undef Makeopshi
#undef Makeopshs
#undef Makeopsh
template<typename F, typename S>
istream& operator>> ( istream& stream, std::pair<F,S>& pair )
{
stream >> pair.first >> pair.second;
return stream;
}
template<typename F, typename S>
ostream& operator<< ( ostream& stream, const std::pair<F,S>& pair )
{
stream << pair.first << pair.second;
return stream;
}
template<typename T>
istream& operator>> ( istream& stream, std::complex<T>& cx )
{
T r, i;
stream >> r >> i;
cx.real(r);
cx.imag(i);
return stream;
}
template<typename T>
ostream& operator<< ( ostream& stream, const std::complex<T>& cx )
{
stream << cx.real() << cx.imag();
return stream;
}
}
#endif