forked from hardcpp/EasyJSon
-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathEasyJSon.hpp
More file actions
312 lines (258 loc) · 9.44 KB
/
EasyJSon.hpp
File metadata and controls
312 lines (258 loc) · 9.44 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
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
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
////////////////////////////////////////////////////////////////////////////////
//
// MILLENIUM-STUDIO
// Copyright 2016 Millenium-studio SARL
// All Rights Reserved.
// https://github.com/hardcpp/EasyJSon
//
////////////////////////////////////////////////////////////////////////////////
#pragma once
#ifndef EASYJSON_HPP_INCLUDED
#define EASYJSON_HPP_INCLUDED
#include <sstream>
#include <string>
#include <map>
#include <type_traits>
namespace EasyJSon
{
/// JSon node element type
enum NodeType
{
NT_INDEXED_ARRAY,
NT_ARRAY,
NT_DATA,
NT_DATA_INT
};
/// JSon node
template <class StringAllocator> class Node
{
public:
/// @brief Get node type
/// @return Type of current node
const NodeType & Type()
{
return m_Type;
}
/// Sub node accessors
/// @param p_Name : Index name of child node
/// @return The node, or null filled node
Node<StringAllocator> & operator[](const StringAllocator & p_Name)
{
m_Type = NT_INDEXED_ARRAY;
if (m_ChildNodes.find(p_Name) == m_ChildNodes.end())
m_ChildNodes[p_Name] = Node();
return m_ChildNodes[p_Name];
}
/// Sub node accessors
/// @param p_ID : Index of child node
/// @return The node, or null filled node
Node<StringAllocator> & operator[](const size_t & p_ID);
/// Get sub node count if type == array || indexed_array
/// @return Child count
size_t Size()
{
return m_ChildNodes.size();
}
/// Get data
/// @return Data
const StringAllocator & GetData()
{
return m_Data;
}
/// Set data
/// @param p_Data : New data str
/// @param p_IsArithmetic : Is numeric value
inline void SetData(const StringAllocator & p_Data, bool p_IsArithmetic = false)
{
m_Type = p_IsArithmetic ? NT_DATA_INT : NT_DATA;
m_Data = p_Data;
}
/// Get child nodes
/// @return Map of childs
const std::map<StringAllocator, Node<StringAllocator>> & GetChilds()
{
return m_ChildNodes;
}
/// Serialize
/// @param p_Pretty : Pretty format
/// @param p_Level : Recursive level
/// @return String
template<class StringAllocatorStream> inline StringAllocator Serialize(bool p_Pretty, int p_Level = 0);
/// Data editor operator
template<typename T> inline Node & operator=(T p_Data);
private:
/// Node type
NodeType m_Type;
/// Node data
StringAllocator m_Data;
/// Child nodes
std::map<StringAllocator, Node<StringAllocator>> m_ChildNodes;
};
/// @brief Sub node accessors
/// @param p_ID : Index of child node
/// @return The node, or null filled node
template <> inline Node<std::string> & Node<std::string>::operator[](const size_t & p_ID)
{
m_Type = NT_ARRAY;
std::string l_KeyName = std::to_string((unsigned long)p_ID);
if (m_ChildNodes.find(l_KeyName) == m_ChildNodes.end())
m_ChildNodes[l_KeyName] = Node();
return m_ChildNodes[l_KeyName];
}
/// @brief Sub node accessors
/// @param p_ID : Index of child node
/// @return The node, or null filled node
template <> inline Node<std::wstring> & Node<std::wstring>::operator[](const size_t & p_ID)
{
m_Type = NT_ARRAY;
std::wstring l_KeyName = std::to_wstring((unsigned long)p_ID);
if (m_ChildNodes.find(l_KeyName) == m_ChildNodes.end())
m_ChildNodes[l_KeyName] = Node();
return m_ChildNodes[l_KeyName];
}
/// @brief Serialize
/// @param p_Pretty : Pretty format
/// @param p_Level : Recursive level
/// @return String
template <class StringAllocator>
template <class StringAllocatorStream> inline StringAllocator Node<StringAllocator>::Serialize(bool p_Pretty, int p_Level)
{
if (m_Type == NT_DATA)
{
return StringAllocator("\"" + m_Data + "\"");
}
else if (m_Type == NT_DATA_INT)
{
return StringAllocator(m_Data);
}
else if (m_Type == NT_ARRAY)
{
StringAllocatorStream l_Out;
if (p_Pretty && p_Level != 0)
l_Out << "\n";
l_Out << std::string(p_Level, '\t') << "[" << (p_Pretty ? "\n" : "");
for (typename std::map<StringAllocator, Node<StringAllocator>>::iterator l_It = m_ChildNodes.begin(); l_It != m_ChildNodes.end(); l_It++)
{
if (l_It != m_ChildNodes.begin())
l_Out << ",";
l_Out << l_It->second.template Serialize<StringAllocatorStream>(p_Pretty, p_Level + 1);
}
if (p_Pretty)
l_Out << "\n";
l_Out << std::string(p_Level, '\t') << "]";
return l_Out.str();
}
else
{
StringAllocatorStream l_Out;
if (p_Pretty && p_Level != 0)
l_Out << "\n";
l_Out << std::string(p_Level, '\t') << "{" << (p_Pretty ? "\n" : "");
for (typename std::map<StringAllocator, Node<StringAllocator>>::iterator l_It = m_ChildNodes.begin(); l_It != m_ChildNodes.end(); l_It++)
{
if (l_It != m_ChildNodes.begin())
l_Out << "," << (p_Pretty ? "\n" : "");
l_Out << (p_Pretty ? std::string(p_Level + 1, '\t') : "") << "\"" << l_It->first << "\": " << l_It->second.template Serialize<StringAllocatorStream>(p_Pretty, p_Level + 1);
}
if (p_Pretty)
l_Out << "\n";
l_Out << std::string(p_Level, '\t') << "}";
return l_Out.str();
}
return StringAllocator("");
}
/// @brief Serialize
/// @param p_Pretty : Pretty format
/// @param p_Level : Recursive level
/// @return String
template <>
template <class StringAllocatorStream> inline std::wstring Node<std::wstring>::Serialize(bool p_Pretty, int p_Level)
{
if (m_Type == NT_DATA)
{
return std::wstring(L"\"" + m_Data + L"\"");
}
else if (m_Type == NT_DATA_INT)
{
return std::wstring(m_Data);
}
else if (m_Type == NT_ARRAY)
{
StringAllocatorStream l_Out;
if (p_Pretty && p_Level != 0)
l_Out << L"\n";
l_Out << std::wstring(p_Level, L'\t') << L"[" << (p_Pretty ? L"\n" : L"");
for (std::map<std::wstring, Node<std::wstring>>::iterator l_It = m_ChildNodes.begin(); l_It != m_ChildNodes.end(); l_It++)
{
if (l_It != m_ChildNodes.begin())
l_Out << L",";
l_Out << l_It->second.Serialize<StringAllocatorStream>(p_Pretty, p_Level + 1);
}
if (p_Pretty)
l_Out << L"\n";
l_Out << std::wstring(p_Level, L'\t') << L"]";
return l_Out.str();
}
else
{
StringAllocatorStream l_Out;
if (p_Pretty && p_Level != 0)
l_Out << L"\n";
l_Out << std::wstring(p_Level, L'\t') << L"{" << (p_Pretty ? L"\n" : L"");
for (std::map<std::wstring, Node<std::wstring>>::iterator l_It = m_ChildNodes.begin(); l_It != m_ChildNodes.end(); l_It++)
{
if (l_It != m_ChildNodes.begin())
l_Out << L",\n";
l_Out << std::wstring(p_Level + 1, L'\t') << L"\"" << l_It->first << L"\": " << l_It->second.Serialize<StringAllocatorStream>(p_Pretty, p_Level + 1);
}
if (p_Pretty)
l_Out << L"\n";
l_Out << std::wstring(p_Level, L'\t') << L"}";
return l_Out.str();
}
return std::wstring(L"");
}
/// Data editor operator
template<>
template<typename T> inline Node<std::string> & Node<std::string>::operator=(T p_Data)
{
SetData(std::to_string(p_Data), std::is_arithmetic<T>::value);
return *this;
}
/// Data editor operator
template<>
template<typename T> inline Node<std::wstring> & Node<std::wstring>::operator=(T p_Data)
{
SetData(std::to_wstring(p_Data), std::is_arithmetic<T>::value);
return *this;
}
/// Data editor operator
template<>
template<> inline Node<std::string> & Node<std::string>::operator=(const char * p_Data)
{
SetData(p_Data);
return *this;
}
/// Data editor operator
template<>
template<> inline Node<std::string> & Node<std::string>::operator=(std::string p_Data)
{
SetData(p_Data);
return *this;
}
/// Data editor operator
template<>
template<> inline Node<std::wstring> & Node<std::wstring>::operator=(const wchar_t * p_Data)
{
SetData(p_Data);
return *this;
}
/// Data editor operator
template<>
template<> inline Node<std::wstring> & Node<std::wstring>::operator=(std::wstring p_Data)
{
SetData(p_Data);
return *this;
}
} ///< namespace EasyJSon
#endif ///< EASYJSON_HPP_INCLUDED