summaryrefslogtreecommitdiff
path: root/core/dictionary.cpp
blob: 62e5d6bc3cebb654c368b9c9d850d96d8bc6de7e (plain)
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
/*************************************************************************/
/*  dictionary.cpp                                                       */
/*************************************************************************/
/*                       This file is part of:                           */
/*                           GODOT ENGINE                                */
/*                    http://www.godotengine.org                         */
/*************************************************************************/
/* Copyright (c) 2007-2017 Juan Linietsky, Ariel Manzur.                 */
/*                                                                       */
/* Permission is hereby granted, free of charge, to any person obtaining */
/* a copy of this software and associated documentation files (the       */
/* "Software"), to deal in the Software without restriction, including   */
/* without limitation the rights to use, copy, modify, merge, publish,   */
/* distribute, sublicense, and/or sell copies of the Software, and to    */
/* permit persons to whom the Software is furnished to do so, subject to */
/* the following conditions:                                             */
/*                                                                       */
/* The above copyright notice and this permission notice shall be        */
/* included in all copies or substantial portions of the Software.       */
/*                                                                       */
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,       */
/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF    */
/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*/
/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY  */
/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,  */
/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE     */
/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.                */
/*************************************************************************/
#include "dictionary.h"
#include "safe_refcount.h"
#include "variant.h"
#include "io/json.h"

struct _DictionaryVariantHash {

	static _FORCE_INLINE_ uint32_t hash(const Variant &p_variant)  { return p_variant.hash(); }
};


struct DictionaryPrivate {

	SafeRefCount refcount;
	HashMap<Variant,Variant,_DictionaryVariantHash> variant_map;
	bool shared;

};


void Dictionary::get_key_list( List<Variant> *p_keys) const {

	_p->variant_map.get_key_list(p_keys);
}

void Dictionary::_copy_on_write() const {

	//make a copy of what we have
	if (_p->shared)
		return;

	DictionaryPrivate *p = memnew(DictionaryPrivate);
	p->shared=_p->shared;
	p->variant_map=_p->variant_map;
	p->refcount.init();
	_unref();
	_p=p;
}

Variant& Dictionary::operator[](const Variant& p_key) {

	_copy_on_write();

	return _p->variant_map[p_key];
}

const Variant& Dictionary::operator[](const Variant& p_key) const {

	return _p->variant_map[p_key];

}
const Variant* Dictionary::getptr(const Variant& p_key) const {

	return _p->variant_map.getptr(p_key);
}
Variant* Dictionary::getptr(const Variant& p_key) {

	_copy_on_write();
	return _p->variant_map.getptr(p_key);
}

Variant Dictionary::get_valid(const Variant& p_key) const {

	const Variant *v = getptr(p_key);
	if (!v)
		return Variant();
	return *v;
}


int Dictionary::size() const {

	return _p->variant_map.size();

}
bool Dictionary::empty() const {

	return !_p->variant_map.size();
}

bool Dictionary::has(const Variant& p_key) const {

	return _p->variant_map.has(p_key);
}

bool Dictionary::has_all(const Array& p_keys) const {
	for (int i=0;i<p_keys.size();i++) {
		if( !has(p_keys[i]) ) {
			return false;
		}
	}
	return true;
}

void Dictionary::erase(const Variant& p_key) {
	_copy_on_write();
	_p->variant_map.erase(p_key);
}

bool Dictionary::operator==(const Dictionary& p_dictionary) const {

	return _p==p_dictionary._p;
}

void Dictionary::_ref(const Dictionary& p_from) const {

	//make a copy first (thread safe)
	if (!p_from._p->refcount.ref())
		return; // couldn't copy

	//if this is the same, unreference the other one
	if (p_from._p==_p) {
		_p->refcount.unref();
		return;
	}
	if (_p)
		_unref();
	_p=p_from._p;

}

void Dictionary::clear() {

	_copy_on_write();
	_p->variant_map.clear();
}

bool Dictionary::is_shared() const {

    return _p->shared;
}


void Dictionary::_unref() const {

	ERR_FAIL_COND(!_p);
	if (_p->refcount.unref()) {
		memdelete(_p);
	}
	_p=NULL;

}
uint32_t Dictionary::hash() const {

	uint32_t h=hash_djb2_one_32(Variant::DICTIONARY);

	List<Variant> keys;
	get_key_list(&keys);

	for (List<Variant>::Element *E=keys.front();E;E=E->next()) {

		h = hash_djb2_one_32( E->get().hash(), h);
		h = hash_djb2_one_32( operator[](E->get()).hash(), h);

	}


	return h;
}

Array Dictionary::keys() const {

	Array karr;
	karr.resize(size());
	const Variant *K=NULL;
	int idx=0;
	while((K=next(K))) {
		karr[idx++]=(*K);
	}
	return karr;

}

Array Dictionary::values() const {

	Array varr;
	varr.resize(size());
	const Variant *key=NULL;
	int i=0;
	while((key=next(key))){
		varr[i++] = _p->variant_map[*key];
	}
	return varr;
}

const Variant* Dictionary::next(const Variant* p_key) const {

	return _p->variant_map.next(p_key);
}


Error Dictionary::parse_json(const String& p_json) {

	String errstr;
	int errline=0;
	if (p_json != ""){
	Error err = JSON::parse(p_json,*this,errstr,errline);
	if (err!=OK) {
		ERR_EXPLAIN("Error parsing JSON: "+errstr+" at line: "+itos(errline));
		ERR_FAIL_COND_V(err!=OK,err);
		}
	}

	return OK;
}

Dictionary Dictionary::copy() const {

	Dictionary n(is_shared());

	List<Variant> keys;
	get_key_list(&keys);

	for(List<Variant>::Element *E=keys.front();E;E=E->next()) {
		n[E->get()]=operator[](E->get());
	}

	return n;
}

String Dictionary::to_json() const {

	return JSON::print(*this);
}


void Dictionary::operator=(const Dictionary& p_dictionary) {

	_ref(p_dictionary);
}



Dictionary::Dictionary(const Dictionary& p_from) {
	_p=NULL;
	_ref(p_from);
}


Dictionary::Dictionary(bool p_shared) {

	_p=memnew( DictionaryPrivate );
	_p->refcount.init();
	_p->shared=p_shared;

}
Dictionary::~Dictionary() {

	_unref();
}