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
|
/*
Miranda NG: the free IM client for Microsoft* Windows*
Copyright (c) 2012-17 Miranda NG project (https://miranda-ng.org),
Copyright (c) 2000-12 Miranda IM project,
all portions of this codebase are copyrighted to the people
listed in contributors.txt.
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 2
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, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#include "stdafx.h"
#include "JSONNode.h"
#include "JSONNode.inl"
#ifdef JSON_UNIT_TEST
int allocCount = 0;
int deallocCount = 0;
int internalAllocCount = 0;
int internalDeallocCount = 0;
int JSONNode::getNodeAllocationCount(void){ return allocCount; }
int JSONNode::getNodeDeallocationCount(void){ return deallocCount; }
int JSONNode::getInternalAllocationCount(void){ return internalAllocCount; }
int JSONNode::getInternalDeallocationCount(void){ return internalDeallocCount; }
void JSONNode::incAllocCount(void){ ++allocCount; }
void JSONNode::decAllocCount(void){ ++deallocCount; }
void JSONNode::incinternalAllocCount(void){ ++internalAllocCount; }
void JSONNode::decinternalAllocCount(void){ ++internalDeallocCount; }
#endif
JSONNode nullNode(JSON_NULL);
#define IMPLEMENT_CTOR(type)\
JSONNode::JSONNode(const json_string & name_t, type value_t) : internal(internalJSONNode::newInternal()) {\
internal -> Set(value_t);\
internal -> setname(name_t);\
incAllocCount();\
}
IMPLEMENT_FOR_ALL_TYPES(IMPLEMENT_CTOR)
#ifndef JSON_LIBRARY
JSONNode::JSONNode(const json_string & name_t, const json_char * value_t) : internal(internalJSONNode::newInternal()) {
internal -> Set(json_string(value_t));
internal -> setname(name_t);
incAllocCount();
}
#endif
JSONNode JSONNode::as_node(void) const {
JSON_CHECK_INTERNAL();
if (type() == JSON_NODE){
return *this;
} else if (type() == JSON_ARRAY){
JSONNode res = duplicate();
res.internal -> _type = JSON_NODE;
return res;
}
#ifdef JSON_MUTEX_CALLBACKS
if (internal -> mylock){
JSONNode res = JSONNode(JSON_NODE);
res.set_mutex(internal -> mylock);
return res;
}
#endif
return JSONNode(JSON_NODE);
}
JSONNode JSONNode::as_array(void) const {
JSON_CHECK_INTERNAL();
if (type() == JSON_ARRAY){
return *this;
} else if (type() == JSON_NODE){
JSONNode res = duplicate();
res.internal -> _type = JSON_ARRAY;
json_foreach(res.internal -> Children, runner){
(*runner) -> set_name(JSON_TEXT(""));
}
return res;
}
#ifdef JSON_MUTEX_CALLBACKS
if (internal -> mylock){
JSONNode res = JSONNode(JSON_ARRAY);
res.set_mutex(internal -> mylock);
return res;
}
#endif
return JSONNode(JSON_ARRAY);
}
void JSONNode::cast(char newtype){
JSON_CHECK_INTERNAL();
if (newtype == type()) return;
switch(newtype){
case JSON_NULL:
nullify();
return;
case JSON_STRING:
*this = as_string();
return;
case JSON_NUMBER:
*this = as_float();
return;
case JSON_BOOL:
*this = as_bool();
return;
case JSON_ARRAY:
*this = as_array();
return;
case JSON_NODE:
*this = as_node();
return;
}
JSON_FAIL(JSON_TEXT("cast to unknown type"));
}
//different just to supress the warning
#ifdef JSON_REF_COUNT
void JSONNode::merge(JSONNode & other){
#else
void JSONNode::merge(JSONNode &) {
#endif
JSON_CHECK_INTERNAL();
#ifdef JSON_REF_COUNT
if (internal == other.internal) return;
JSON_ASSERT(*this == other, JSON_TEXT("merging two nodes that aren't equal"));
if (internal -> refcount < other.internal -> refcount){
*this = other;
} else {
other = *this;
}
#endif
}
#ifdef JSON_REF_COUNT
void JSONNode::merge(JSONNode * other){
JSON_CHECK_INTERNAL();
if (internal == other -> internal) return;
*other = *this;
}
//different just to supress the warning
void JSONNode::merge(unsigned int num, ...) {
#else
void JSONNode::merge(unsigned int, ...) {
#endif
JSON_CHECK_INTERNAL();
#ifdef JSON_REF_COUNT
va_list args;
va_start(args, num);
for(unsigned int i=0; i < num; ++i){
merge(va_arg(args, JSONNode*));
}
va_end(args);
#endif
}
JSONNode JSONNode::duplicate(void) const {
JSON_CHECK_INTERNAL();
JSONNode mycopy(*this);
#ifdef JSON_REF_COUNT
JSON_ASSERT(internal == mycopy.internal, JSON_TEXT("copy ctor failed to ref count correctly"));
mycopy.makeUniqueInternal();
#endif
JSON_ASSERT(internal != mycopy.internal, JSON_TEXT("makeUniqueInternal failed"));
return mycopy;
}
JSONNode & JSONNode::at(json_index_t pos){
JSON_CHECK_INTERNAL();
if (pos >= internal -> size()) {
JSON_FAIL(JSON_TEXT("at() out of bounds"));
return nullNode;
}
return (*this)[pos];
}
const JSONNode & JSONNode::at(json_index_t pos) const {
JSON_CHECK_INTERNAL();
if (pos >= internal -> size()) {
JSON_FAIL(JSON_TEXT("at() const out of bounds"));
return nullNode;
}
return (*this)[pos];
}
JSONNode & JSONNode::operator[](json_index_t pos){
JSON_CHECK_INTERNAL();
JSON_ASSERT(pos < internal -> size(), JSON_TEXT("[] out of bounds"));
makeUniqueInternal();
return *(internal -> at(pos));
}
const JSONNode & JSONNode::operator[](json_index_t pos) const {
JSON_CHECK_INTERNAL();
JSON_ASSERT(pos < internal -> size(), JSON_TEXT("[] const out of bounds"));
return *(internal -> at(pos));
}
JSONNode & JSONNode::at(const json_char *name_t){
JSON_CHECK_INTERNAL();
JSON_ASSERT(type() == JSON_NODE, JSON_TEXT("at a non-iteratable node"));
makeUniqueInternal();
if (JSONNode ** res = internal -> at(name_t)) {
return *(*res);
}
JSON_FAIL(json_string(JSON_TEXT("at could not find child by name: ")) + name_t);
return nullNode;
}
const JSONNode & JSONNode::at(const json_char *name_t) const {
JSON_CHECK_INTERNAL();
JSON_ASSERT(type() == JSON_NODE, JSON_TEXT("at a non-iteratable node"));
if (JSONNode ** res = internal -> at(name_t)) {
return *(*res);
}
JSON_FAIL(json_string(JSON_TEXT("at const could not find child by name: ")) + name_t);
return nullNode;
}
#ifdef JSON_CASE_INSENSITIVE_FUNCTIONS
JSONNode & JSONNode::at_nocase(const json_string & name_t){
JSON_CHECK_INTERNAL();
JSON_ASSERT(type() == JSON_NODE, JSON_TEXT("at a non-iteratable node"));
makeUniqueInternal();
if (JSONNode ** res = internal -> at_nocase(name_t)) {
return *(*res);
}
JSON_FAIL(json_string(JSON_TEXT("at_nocase could not find child by name: ")) + name_t);
return nullNode;
}
const JSONNode & JSONNode::at_nocase(const json_string & name_t) const {
JSON_CHECK_INTERNAL();
JSON_ASSERT(type() == JSON_NODE, JSON_TEXT("at a non-iteratable node"));
if (JSONNode ** res = internal -> at_nocase(name_t)) {
return *(*res);
}
JSON_FAIL(json_string(JSON_TEXT("at_nocase const could not find child by name: ")) + name_t);
return nullNode;
}
#endif
JSONNode* JSON_PTR_LIB JSONNode::pop_back(json_index_t pos){
JSON_CHECK_INTERNAL();
if (pos >= internal -> size()) {
JSON_FAIL(JSON_TEXT("pop_back out of bounds"));
return &nullNode;
}
makeUniqueInternal();
return internal -> pop_back(pos);
}
JSONNode* JSON_PTR_LIB JSONNode::pop_back(const json_string & name_t){
JSON_CHECK_INTERNAL();
JSON_ASSERT(type() == JSON_NODE, JSON_TEXT("popping a non-iteratable node"));
if (JSONNode *res = internal -> pop_back(name_t))
return res;
JSON_FAIL(json_string(JSON_TEXT("pop_back const could not find child by name: ")) + name_t);
return &nullNode;
}
#ifdef JSON_CASE_INSENSITIVE_FUNCTIONS
JSONNode JSON_PTR_LIB JSONNode::pop_back_nocase(const json_string & name_t){
JSON_CHECK_INTERNAL();
JSON_ASSERT(type() == JSON_NODE, JSON_TEXT("popping a non-iteratable node"));
#ifdef JSON_LIBRARY
return internal -> pop_back_nocase(name_t);
#else
if (JSONNode * res = internal -> pop_back_nocase(name_t)) {
auto_delete temp(res);
return *(temp.mynode);
}
JSON_FAIL(json_string(JSON_TEXT("pop_back_nocase could not find child by name: ")) + name_t);
return nullNode;
#endif
}
#endif
|