Repository navigation
Expand file tree
/
Copy pathdata_buffer_deserialiser.h
More file actions
171 lines (145 loc) · 3.96 KB
/
Copy pathdata_buffer_deserialiser.h
File metadata and controls
171 lines (145 loc) · 3.96 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
162
163
164
165
166
167
168
169
170
171
////////////////////////////////////////////////////////////////////////////////
// Distributed under the Boost Software License, Version 1.0. //
// (See accompanying file LICENSE or copy at //
// https://www.boost.org/LICENSE_1_0.txt) //
////////////////////////////////////////////////////////////////////////////////
#pragma once
#include <cstdint>
#include <cstring>
#include <iterator>
#include <memory>
#include <type_traits>
#include "core/data_buffer.h"
#include "core/exception.h"
#include "core/quaternion.h"
#include "core/vector3.h"
namespace iris
{
/**
* Class for deserialising types stored in a DataBuffer. This is the inverse
* operation to DataBufferSerialiser.
*/
class DataBufferDeserialiser
{
public:
/**
* Construct a new DataBufferDeserialiser.
*
* @param buffer
* DataBuffer of serialised data.
*/
explicit DataBufferDeserialiser(DataBuffer buffer)
: buffer_(std::move(buffer))
, cursor_(std::cbegin(buffer_))
{
}
/**
* Pop integral type.
*
* @returns
* Next element in buffer as supplied type.
*/
template <class T, std::enable_if_t<std::is_arithmetic_v<T>> * = nullptr>
T pop()
{
const auto size = static_cast<std::ptrdiff_t>(sizeof(T));
if (size > std::distance(cursor_, std::cend(buffer_)))
{
throw Exception("not enough data left");
}
T value{};
std::memcpy(&value, std::addressof(*cursor_), size);
cursor_ += size;
return value;
}
/**
* Pop enum.
*
* @returns
* Next element in buffer as supplied type.
*/
template <class T, std::enable_if_t<std::is_enum_v<T>> * = nullptr>
T pop()
{
using type = std::underlying_type_t<T>;
const auto value = pop<type>();
return static_cast<T>(value);
}
/**
* Pop Vector3.
*
* @returns
* Next element in buffer as supplied type.
*/
template <class T, std::enable_if_t<std::is_same_v<T, Vector3>> * = nullptr>
T pop()
{
return T{pop<float>(), pop<float>(), pop<float>()};
}
/**
* Pop Quaternion.
*
* @returns
* Next element in buffer as supplied type.
*/
template <class T, std::enable_if_t<std::is_same_v<T, Quaternion>> * = nullptr>
T pop()
{
return T{pop<float>(), pop<float>(), pop<float>(), pop<float>()};
}
/**
* Pop DataBuffer.
*
* @returns
* Next element in buffer as supplied type.
*/
template <class T, std::enable_if_t<std::is_same_v<T, DataBuffer>> * = nullptr>
T pop()
{
const auto size = pop<std::uint32_t>();
DataBuffer value(cursor_, cursor_ + size);
cursor_ += size;
return value;
}
/**
* Pop tuple of supplied types.
*
* @returns
* std::tuple of requested types from buffer.
*/
template <class... Types>
std::tuple<Types...> pop_tuple()
{
std::tuple<Types...> values;
pop_tuple_impl<0u, std::tuple<Types...>, Types...>(values);
return values;
}
private:
/**
* Helper recursive template method. Sets the next requested tuple
* element.
*
* @param values
* Tuple of elements to append to.
*/
template <std::size_t Index, class T, class Head, class... Tail>
void pop_tuple_impl(T &values)
{
// set next tuple element
std::get<Index>(values) = pop<Head>();
// recurse to set next element
pop_tuple_impl<Index + 1u, T, Tail...>(values);
}
/**
* Base method for template recursion.
*/
template <std::size_t Index, class T>
void pop_tuple_impl(T &)
{
}
/** Buffer of serialised data. */
DataBuffer buffer_;
/** Iterator into buffer, where next element will be popped from. */
DataBuffer::const_iterator cursor_;
};
}