1 | // This file is a part of Framsticks SDK. http://www.framsticks.com/ |
---|
2 | // Copyright (C) 1999-2020 Maciej Komosinski and Szymon Ulatowski. |
---|
3 | // See LICENSE.txt for details. |
---|
4 | |
---|
5 | #include "collectionobj.h" |
---|
6 | #include <common/nonstd_math.h> //sqrt in borland |
---|
7 | #include <frams/util/validitychecks.h> |
---|
8 | #include <common/nonstd_stl.h> |
---|
9 | #include <frams/util/sstringutils.h> |
---|
10 | #ifndef NO_VMACHINE |
---|
11 | #include <frams/vm/vmachine.h> |
---|
12 | #endif |
---|
13 | |
---|
14 | #define FIELDSTRUCT VectorObject |
---|
15 | ParamEntry vector_paramtab[] = |
---|
16 | { |
---|
17 | { "Vector", 1, 15, "Vector", "Vector is a 1-dimensional array indexed by an integer value (starting from 0). " |
---|
18 | "Multidimensional arrays can be simulated by putting other Vector objects into a Vector.\n" |
---|
19 | "Examples:\n" |
---|
20 | "\tvar v1=Vector.new();\n" |
---|
21 | "\tv1.add(123);\n" |
---|
22 | "\tv1.add(\"string\");\n" |
---|
23 | "A short way of doing the same (square brackets create a vector):\n" |
---|
24 | "\tvar v2=[123,\"string\"];\n" |
---|
25 | "Simulate a 2D array:\n" |
---|
26 | "\tvar v3=[[1,2,3],[4,5],[6]];\n" |
---|
27 | "You can iterate directly over values of a Vector using for(...in...) loops:\n" |
---|
28 | "\tfor(var element in v3) Simulator.print(element);" |
---|
29 | }, |
---|
30 | { "clear", 0, PARAM_NOSTATIC, "Clear data", "p()", PROCEDURE(p_clear), }, |
---|
31 | { "size", 0, PARAM_READONLY | PARAM_NOSTATIC, "Element count", "d", GETONLY(size), }, |
---|
32 | { "remove", 0, PARAM_NOSTATIC, "Remove at position", "p(d position)", PROCEDURE(p_remove), }, |
---|
33 | { "get", 0, PARAM_NOSTATIC, "Get value at position", "p x(d position)", PROCEDURE(p_get), "object[position] can be always used instead of object.get(position)" }, |
---|
34 | { "set", 0, PARAM_NOSTATIC, "Set value at position", "p(d position,x value)", PROCEDURE(p_set), "object[position]=value can be always used instead of object.set(position,value)" }, |
---|
35 | { "insert", 0, PARAM_NOSTATIC, "Insert value at position", "p(d position,x value)", PROCEDURE(p_insert), }, |
---|
36 | { "add", 0, PARAM_NOSTATIC, "Append at the end", "p(x value)", PROCEDURE(p_add), }, |
---|
37 | { "find", 0, PARAM_NOSTATIC, "Find", "p d(x value)", PROCEDURE(p_find), "returns the element index or -1 if not found" }, |
---|
38 | { "avg", 0, PARAM_READONLY | PARAM_NOSTATIC, "Average", "f", GETONLY(avg) }, |
---|
39 | { "stdev", 0, PARAM_READONLY | PARAM_NOSTATIC, "Standard deviation", "f", GETONLY(stdev), "=sqrt(sum((element[i]-avg)^2)/(size-1)) which is estimated population std.dev. from sample std.dev." }, |
---|
40 | { "toString", 0, PARAM_READONLY | PARAM_NOSTATIC, "Textual form", "s", GETONLY(toString), }, |
---|
41 | { "new", 0, 0, "Create new Vector", "p oVector()", STATICPROCEDURE(p_new), }, |
---|
42 | { "sort", 0, PARAM_NOSTATIC, "Sort elements (in place)", "p(oFunctionReference comparator)", PROCEDURE(p_sort), "comparator can be null, giving the \"natural\" sorting order (depending on element type), otherwise it must be a function reference obtained from the 'function' operator.\n\nExample:\nfunction compareLastDigit(a,b) {return (a%10)<(b%10);}\nvar v=[16,23,35,42,54,61];\nv.sort(function compareLastDigit);" }, |
---|
43 | { "iterator", 0, PARAM_NOSTATIC | PARAM_READONLY, "Iterator", "o", GETONLY(iterator), }, |
---|
44 | { "clone", 0, PARAM_NOSTATIC, "Create a clone", "p oVector()", PROCEDURE(p_clone), "The resulting clone is a shallow copy (contains the same object references as the original). A deep copy can be obtained through serialization: String.deserialize(String.serialize(object));" }, |
---|
45 | { 0, 0, 0, }, |
---|
46 | }; |
---|
47 | #undef FIELDSTRUCT |
---|
48 | |
---|
49 | #define FIELDSTRUCT DictionaryObject |
---|
50 | ParamEntry dictionary_paramtab[] = |
---|
51 | { |
---|
52 | { "Dictionary", 1, 14, "Dictionary", "Dictionary associates stored values with string keys " |
---|
53 | "(\"key\" is the first argument in get/set/remove functions). Integer key can be " |
---|
54 | "used to enumerate all elements (note that while iterating, the elements are returned in no particular order).\n" |
---|
55 | "Examples:\n" |
---|
56 | "\tvar d;\n" |
---|
57 | "\td=Dictionary.new();\n" |
---|
58 | "\td.set(\"name\",\"John\");\n" |
---|
59 | "\td.set(\"age\",44);\n" |
---|
60 | "Another way of doing the same:\n" |
---|
61 | "\td={};\n" |
---|
62 | "\td[\"name\"]=\"John\";\n" |
---|
63 | "\td[\"age\"]=44;\n" |
---|
64 | "And the most concise way:\n" |
---|
65 | "\td={ \"name\":\"John\", \"age\":44 };\n" |
---|
66 | "Iterating:\n" |
---|
67 | "\tfor(var v in d) Simulator.print(v); //values\n" |
---|
68 | "\tfor(var k in d.keys) Simulator.print(k+\" is \"+d[k]); //keys\n" |
---|
69 | "\tfor(var i=0;i<d.size;i++) Simulator.print(d.getKey(i)+\" is \"+d.get(i)); //by index", |
---|
70 | }, |
---|
71 | { "clear", 0, PARAM_NOSTATIC, "Clear data", "p()", PROCEDURE(p_clear), }, |
---|
72 | { "size", 0, PARAM_NOSTATIC | PARAM_READONLY, "Element count", "d", GETONLY(size), }, |
---|
73 | { "remove", 0, PARAM_NOSTATIC, "Remove", "p(x key)", PROCEDURE(p_remove), "Removes the named or indexed element (depending on the argument type: string or int)." }, |
---|
74 | { "get", 0, PARAM_NOSTATIC, "Get element", "p x(x key)", PROCEDURE(p_get), "Retrieves the named or indexed element (depending on the argument type: string or int). Accessing nonexistent keys is an error (use hasKey() if necessary).\nobject.get(key) can be shortened to object[key]." }, |
---|
75 | { "getKey", 0, PARAM_NOSTATIC, "Get a key", "p s(d index)", PROCEDURE(p_getKey), "Returns the key of the indexed element (0 <= index < size)." }, |
---|
76 | { "hasKey", 0, PARAM_NOSTATIC, "Check if key exists", "p d(s key)", PROCEDURE(p_hasKey), "Returns 1 (interpreted as true) if dictionary contains the supplied key, or 0 (false) otherwise.\nExample:\n if (obj.hasKey(\"a\"))\n x = obj->a;" }, |
---|
77 | { "set", 0, PARAM_NOSTATIC, "Set element", "p x(x key,x value)", PROCEDURE(p_set), "Set element value for the specified key or index (depending on the argument type: string or int).\n" |
---|
78 | "Returns the value previously associated with the given key (or index).\n" |
---|
79 | "object.set(key,value) can be shortened to object[key]=value. Literal string keys can use even shorter notation: object->key=value instead of object.set(\"key\",value)\n" |
---|
80 | "Note the difference in the returned value:\n" |
---|
81 | " var old_value=object.set(\"key\",new_value); //'old_value' gets the value previously associated with \"key\"\n" |
---|
82 | " var x=object[\"key\"]=new_value; //'x' becomes 'new_value', consistently with the semantics of the assignment operator. The value previously associated with \"key\" is lost." }, |
---|
83 | { "find", 0, PARAM_NOSTATIC, "Find", "p x(x value)", PROCEDURE(p_find), "Returns the element key or null if not found." }, |
---|
84 | { "new", 0, 0, "Create a Dictionary", "p oDictionary()", STATICPROCEDURE(p_new), "Empty directory can be also created using the {} expression." }, |
---|
85 | { "toString", 0, PARAM_READONLY | PARAM_NOSTATIC, "Textual form", "s", GETONLY(toString), }, |
---|
86 | { "clone", 0, PARAM_NOSTATIC, "Create a clone", "p oDictionary()", PROCEDURE(p_clone), "The resulting clone is a shallow copy (contains the same object references as the original). A deep copy can be obtained through serialization: String.deserialize(String.serialize(object));" }, |
---|
87 | { "assign", 0, PARAM_NOSTATIC, "Assign from another object", "p(x)", PROCEDURE(p_assign), "Replaces current dictionary with dictionary contents from another object." }, |
---|
88 | { "iterator", 0, PARAM_NOSTATIC | PARAM_READONLY, "Iterator", "o", GETONLY(iterator), }, |
---|
89 | { "keys", 0, PARAM_NOSTATIC | PARAM_READONLY, "Keys", "o", GETONLY(keys), "Iterate over this object to get all keys: for(k in dict.keys) ..." }, |
---|
90 | |
---|
91 | { 0, 0, 0, }, |
---|
92 | }; |
---|
93 | #undef FIELDSTRUCT |
---|
94 | |
---|
95 | Param VectorObject::par(vector_paramtab); |
---|
96 | Param DictionaryObject::par(dictionary_paramtab); |
---|
97 | |
---|
98 | ///////////////////////////////////////// |
---|
99 | |
---|
100 | VectorObject::VectorObject(Pt3D &pt) |
---|
101 | :readonly(0), owndata(1) |
---|
102 | { |
---|
103 | set_or_insert(0, ExtValue(pt.x), false); |
---|
104 | set_or_insert(1, ExtValue(pt.y), false); |
---|
105 | set_or_insert(2, ExtValue(pt.z), false); |
---|
106 | } |
---|
107 | |
---|
108 | void VectorObject::clear() |
---|
109 | { |
---|
110 | if (owndata) |
---|
111 | for (int i = data.size() - 1; i >= 0; i--) |
---|
112 | { |
---|
113 | ExtValue *v = (ExtValue*)data.get(i); |
---|
114 | if (v) delete v; |
---|
115 | } |
---|
116 | data.clear(); |
---|
117 | } |
---|
118 | |
---|
119 | void VectorObject::p_remove(PARAMPROCARGS) |
---|
120 | { |
---|
121 | if (readonly) return; |
---|
122 | int i = args->getInt(); |
---|
123 | if (!listIndexCheck(&data, i, "VectorObject", "remove")) return; |
---|
124 | ExtValue *v = (ExtValue*)data.get(i); |
---|
125 | if (v) delete v; |
---|
126 | data -= i; |
---|
127 | } |
---|
128 | |
---|
129 | void VectorObject::set_or_insert(int i, const ExtValue& val, bool insert) |
---|
130 | { |
---|
131 | if (i < 0) return; |
---|
132 | int oldsize = data.size(); |
---|
133 | if (i > oldsize) |
---|
134 | { |
---|
135 | data.setSize(i); |
---|
136 | while (i > oldsize) |
---|
137 | data.set(oldsize++, 0); |
---|
138 | } |
---|
139 | if (insert) |
---|
140 | data.insert(i, new ExtValue(val)); |
---|
141 | else |
---|
142 | { |
---|
143 | ExtValue *v = (ExtValue*)data.get(i); |
---|
144 | if (v) delete v; |
---|
145 | data.set(i, new ExtValue(val)); |
---|
146 | } |
---|
147 | } |
---|
148 | |
---|
149 | void VectorObject::p_get(PARAMPROCARGS) |
---|
150 | { |
---|
151 | int i = args->getInt(); |
---|
152 | if (listIndexCheck(&data, i, "VectorObject", "get")) |
---|
153 | { |
---|
154 | ExtValue *v = get(i); |
---|
155 | if (v) |
---|
156 | { |
---|
157 | *ret = *v; |
---|
158 | return; |
---|
159 | } |
---|
160 | } |
---|
161 | *ret = ExtValue(); |
---|
162 | } |
---|
163 | |
---|
164 | void VectorObject::get_avg(ExtValue* ret) |
---|
165 | { |
---|
166 | if (!data.size()) { ret->setEmpty(); return; } |
---|
167 | double s = 0.0; |
---|
168 | for (int i = data.size() - 1; i >= 0; i--) |
---|
169 | s += ((ExtValue*)data.get(i))->getDouble(); |
---|
170 | s /= data.size(); |
---|
171 | ret->setDouble(s); |
---|
172 | } |
---|
173 | |
---|
174 | SString VectorObject::serialize(SerializationFormat format) const |
---|
175 | { |
---|
176 | SString out = "["; |
---|
177 | { |
---|
178 | for (int i = 0; i < data.size(); i++) |
---|
179 | { |
---|
180 | ExtValue* v = (ExtValue*)data.get(i); |
---|
181 | if (i) out += ","; |
---|
182 | if (v) |
---|
183 | out += v->serialize(format); |
---|
184 | else |
---|
185 | out += "null"; |
---|
186 | } |
---|
187 | } |
---|
188 | out += "]"; |
---|
189 | //sprintf(out.directAppend(20),"<Vector@%p>",this);out.endAppend(); |
---|
190 | return out; |
---|
191 | } |
---|
192 | |
---|
193 | static THREAD_LOCAL_DEF(SList, VectorObject_tostring_trace); |
---|
194 | |
---|
195 | void VectorObject::get_toString(ExtValue* ret) |
---|
196 | { |
---|
197 | SString out = "["; |
---|
198 | //static SListTempl<VectorObject*> trace; |
---|
199 | if (tlsGetRef(VectorObject_tostring_trace).find(this) >= 0) |
---|
200 | out += "..."; |
---|
201 | else |
---|
202 | { |
---|
203 | tlsGetRef(VectorObject_tostring_trace) += this; |
---|
204 | for (int i = 0; i < data.size(); i++) |
---|
205 | { |
---|
206 | ExtValue* v = (ExtValue*)data.get(i); |
---|
207 | if (i) out += ","; |
---|
208 | if (v) |
---|
209 | out += v->getString(); |
---|
210 | else |
---|
211 | out += "null"; |
---|
212 | } |
---|
213 | tlsGetRef(VectorObject_tostring_trace) -= this; |
---|
214 | } |
---|
215 | out += "]"; |
---|
216 | ret->setString(out); |
---|
217 | } |
---|
218 | |
---|
219 | void VectorObject::get_stdev(ExtValue* ret) |
---|
220 | { |
---|
221 | if (!data.size()) { ret->setEmpty(); return; } |
---|
222 | get_avg(ret); |
---|
223 | double a = ret->getDouble(); |
---|
224 | double s = 0.0; |
---|
225 | for (int i = data.size() - 1; i >= 0; i--) |
---|
226 | { |
---|
227 | double d = a - ((ExtValue*)data.get(i))->getDouble(); |
---|
228 | s += d * d; |
---|
229 | } |
---|
230 | ret->setDouble(sqrt(s / max(1, data.size() - 1))); |
---|
231 | } |
---|
232 | |
---|
233 | void VectorObject::p_find(PARAMPROCARGS) |
---|
234 | { |
---|
235 | short i; |
---|
236 | for (i = 0; i < data.size(); i++) |
---|
237 | { |
---|
238 | if ((*args) == (*get(i))) |
---|
239 | { |
---|
240 | ret->setInt(i); return; |
---|
241 | } |
---|
242 | } |
---|
243 | ret->setInt(-1); |
---|
244 | } |
---|
245 | |
---|
246 | void VectorObject::p_clone(PARAMPROCARGS) |
---|
247 | { |
---|
248 | VectorObject *c = new VectorObject; |
---|
249 | c->data.setSize(data.size()); |
---|
250 | for (int i = 0; i < data.size(); i++) |
---|
251 | { |
---|
252 | ExtValue *v = (ExtValue*)get(i); |
---|
253 | if (v) |
---|
254 | c->data.set(i, new ExtValue(*v)); |
---|
255 | } |
---|
256 | ret->setObject(ExtObject(&par, c)); |
---|
257 | } |
---|
258 | |
---|
259 | class VEComparator |
---|
260 | { |
---|
261 | public: |
---|
262 | bool operator()(const ExtValue *a, const ExtValue *b) { return a->compare(*b) == ExtValue::ResultLower; } |
---|
263 | }; |
---|
264 | |
---|
265 | #ifndef NO_VMACHINE |
---|
266 | class VMVEComparator |
---|
267 | { |
---|
268 | public: |
---|
269 | VMachine::JumpTargetObject *jto; |
---|
270 | VMachine *vm; |
---|
271 | VMVEComparator(VMachine::JumpTargetObject *_jto) :jto(_jto), vm(jto->vm) {} |
---|
272 | #ifdef QSORT_R_USING_QSORT_S |
---|
273 | static int compare(void* _this, const void *a, const void *b); |
---|
274 | bool operator()(const ExtValue *a, const ExtValue *b) { return compare(this,&a,&b) == ExtValue::ResultLower; } |
---|
275 | #else |
---|
276 | static int compare(const void *a, const void *b, void* _this); |
---|
277 | bool operator()(const ExtValue *a, const ExtValue *b) { return compare(&a,&b,this) == ExtValue::ResultLower; } |
---|
278 | #endif |
---|
279 | }; |
---|
280 | |
---|
281 | #ifdef QSORT_R_USING_QSORT_S |
---|
282 | int VMVEComparator::compare(void* _this, const void *a, const void *b) |
---|
283 | #else |
---|
284 | int VMVEComparator::compare(const void *a, const void *b, void* _this) |
---|
285 | #endif |
---|
286 | { |
---|
287 | VMachine *vm = ((VMVEComparator*)_this)->vm; |
---|
288 | VMachine::JumpTargetObject *jto = ((VMVEComparator*)_this)->jto; |
---|
289 | if (!VMCode::prepareDynamicJumpTarget(jto->pc, jto->code)) |
---|
290 | return false; |
---|
291 | |
---|
292 | vm->push(**(const ExtValue **)a); |
---|
293 | vm->push(**(const ExtValue **)b); |
---|
294 | vm->pushNewCallState(); |
---|
295 | vm->jumpDynamicJumpTarget(jto->pc); |
---|
296 | vm->run(); |
---|
297 | vm->popCallState(); |
---|
298 | int ret; |
---|
299 | ExtValue& retval = vm->getValue(); |
---|
300 | if (retval.type == TInvalid) |
---|
301 | { |
---|
302 | ret = 0; |
---|
303 | logPrintf("VectorElementComparator", "", LOG_ERROR, "Comparison function returned no value"); |
---|
304 | } |
---|
305 | else |
---|
306 | ret = (retval.getInt() != 0) ? -1 : 1; |
---|
307 | vm->drop(2); |
---|
308 | return ret; |
---|
309 | } |
---|
310 | #endif |
---|
311 | |
---|
312 | void VectorObject::p_sort(PARAMPROCARGS) |
---|
313 | { |
---|
314 | #ifndef NO_VMACHINE |
---|
315 | VMachine::JumpTargetObject *jto = VMachine::JumpTargetObject::fromObject(args->getObject(), false); |
---|
316 | if (jto) |
---|
317 | { |
---|
318 | VMVEComparator cmp(jto); |
---|
319 | ExtValue **first = (ExtValue**)&data.getref(0); |
---|
320 | //Originally was the same as below: std::sort(first, first + data.size(), cmp); |
---|
321 | //However, std::sort() requires "strict weak ordering" and may crash (and indeed crashes, "undefined behavior") when given a non-compliant comparator. |
---|
322 | //We use qsort() instead because we can't control what kind of user script comparator function will be passed to Vector.sort(), and qsort() seems to behave safely for every function. |
---|
323 | #ifdef __ANDROID__ |
---|
324 | std::sort(first, first + data.size(), cmp); //no qsort_r() or equivalent on Android (yet) |
---|
325 | #else |
---|
326 | qsort_r(first, data.size(), sizeof(ExtValue*), cmp.compare, &cmp); |
---|
327 | #endif |
---|
328 | } |
---|
329 | else |
---|
330 | #endif |
---|
331 | { |
---|
332 | VEComparator cmp; |
---|
333 | ExtValue **first = (ExtValue**)&data.getref(0); |
---|
334 | std::sort(first, first + data.size(), cmp); |
---|
335 | } |
---|
336 | ret->setEmpty(); |
---|
337 | } |
---|
338 | |
---|
339 | void VectorObject::get_iterator(ExtValue* ret) |
---|
340 | { |
---|
341 | ret->setObject(VectorIterator::makeFrom(this)); |
---|
342 | } |
---|
343 | |
---|
344 | VectorObject* VectorObject::fromObject(const ExtObject& o, bool warn) |
---|
345 | { |
---|
346 | return (VectorObject*)o.getTarget(par.getName(), true, warn); |
---|
347 | } |
---|
348 | |
---|
349 | ///////////////////////////// |
---|
350 | |
---|
351 | void DictionaryObject::clear() |
---|
352 | { |
---|
353 | for (HashEntryIterator it(hash); it.isValid();) |
---|
354 | { |
---|
355 | ExtValue *v = (ExtValue*)hash.remove(it); |
---|
356 | if (v) delete v; |
---|
357 | } |
---|
358 | hash.clear(); |
---|
359 | hash.init(); |
---|
360 | } |
---|
361 | |
---|
362 | void DictionaryObject::p_find(PARAMPROCARGS) |
---|
363 | { |
---|
364 | for (HashEntryIterator it(hash); it.isValid(); it++) |
---|
365 | { |
---|
366 | if (((ExtValue*)it->value) == NULL) |
---|
367 | { |
---|
368 | if (args->getType() != TUnknown) continue; |
---|
369 | ret->setString(it->key); |
---|
370 | return; |
---|
371 | } |
---|
372 | if ((*args) == (*((ExtValue*)it->value))) |
---|
373 | { |
---|
374 | ret->setString(it->key); |
---|
375 | return; |
---|
376 | } |
---|
377 | } |
---|
378 | ret->setEmpty(); |
---|
379 | } |
---|
380 | |
---|
381 | HashEntryIterator* DictionaryObject::getIndexIterator(int i) |
---|
382 | { |
---|
383 | if (i < 0) return 0; |
---|
384 | if (i >= hash.getSize()) return 0; |
---|
385 | |
---|
386 | if ((!it.isValid()) || (it_index > i)) |
---|
387 | { |
---|
388 | it = HashEntryIterator(hash); |
---|
389 | it_index = 0; |
---|
390 | } |
---|
391 | while (it.isValid()) |
---|
392 | { |
---|
393 | if (it_index == i) |
---|
394 | return ⁢ |
---|
395 | it_index++; |
---|
396 | it++; |
---|
397 | } |
---|
398 | return 0; |
---|
399 | } |
---|
400 | |
---|
401 | void DictionaryObject::p_remove(PARAMPROCARGS) |
---|
402 | { |
---|
403 | if ((args->type == TInt) || (args->type == TDouble)) |
---|
404 | { |
---|
405 | HashEntryIterator* iter = getIndexIterator(args->getInt()); |
---|
406 | if (iter) |
---|
407 | { |
---|
408 | ExtValue *oldval = (ExtValue*)hash.remove(*iter); |
---|
409 | if (oldval) { *ret = *oldval; delete oldval; } |
---|
410 | else *ret = ExtValue(); |
---|
411 | } |
---|
412 | } |
---|
413 | else |
---|
414 | { |
---|
415 | ExtValue *oldval = (ExtValue*)hash.remove(args[0].getString()); |
---|
416 | if (oldval) { *ret = *oldval; delete oldval; } |
---|
417 | else *ret = ExtValue(); |
---|
418 | } |
---|
419 | } |
---|
420 | |
---|
421 | ExtValue DictionaryObject::get(SString key) |
---|
422 | { |
---|
423 | int found = 0; |
---|
424 | ExtValue *val = (ExtValue*)hash.get(key, &found); |
---|
425 | if (found == 0) |
---|
426 | { |
---|
427 | logPrintf("Dictionary", "get", LOG_ERROR, "Key '%s' not found", key.c_str()); |
---|
428 | return ExtValue::invalid(); |
---|
429 | } |
---|
430 | else |
---|
431 | { |
---|
432 | if (val) |
---|
433 | return *val; |
---|
434 | return ExtValue::empty(); |
---|
435 | } |
---|
436 | } |
---|
437 | |
---|
438 | ExtValue DictionaryObject::get(int index) |
---|
439 | { |
---|
440 | HashEntryIterator* iter = getIndexIterator(index); |
---|
441 | if (iter && (*iter)->value) |
---|
442 | return *((ExtValue*)(*iter)->value); |
---|
443 | return ExtValue::empty(); |
---|
444 | } |
---|
445 | |
---|
446 | void DictionaryObject::p_get(PARAMPROCARGS) |
---|
447 | { |
---|
448 | if ((args->type == TInt) || (args->type == TDouble)) |
---|
449 | *ret = get(args->getInt()); |
---|
450 | else |
---|
451 | *ret = get(args[0].getString()); |
---|
452 | } |
---|
453 | |
---|
454 | void DictionaryObject::p_getKey(PARAMPROCARGS) |
---|
455 | { |
---|
456 | HashEntryIterator* iter = getIndexIterator(args->getInt()); |
---|
457 | if (iter) |
---|
458 | { |
---|
459 | *ret = (*iter)->key; |
---|
460 | return; |
---|
461 | } |
---|
462 | *ret = ExtValue(); |
---|
463 | } |
---|
464 | |
---|
465 | void DictionaryObject::p_hasKey(PARAMPROCARGS) |
---|
466 | { |
---|
467 | int found = 0; |
---|
468 | hash.get(args->getString(), &found); |
---|
469 | ret->setInt(found); |
---|
470 | } |
---|
471 | |
---|
472 | ExtValue DictionaryObject::set(SString key, ExtValue new_value) |
---|
473 | { |
---|
474 | ExtValue ret; |
---|
475 | ExtValue *new_ext = (new_value.getType() == TUnknown) ? NULL : new ExtValue(new_value); |
---|
476 | ExtValue *old_ext = (ExtValue*)hash.put(key, new_ext); |
---|
477 | if (old_ext) { ret = *old_ext; delete old_ext; } |
---|
478 | return ret; |
---|
479 | } |
---|
480 | |
---|
481 | void DictionaryObject::p_set(PARAMPROCARGS) |
---|
482 | { |
---|
483 | *ret = set(args[1].getString(), args[0]); |
---|
484 | } |
---|
485 | |
---|
486 | SString DictionaryObject::serialize(SerializationFormat format) const |
---|
487 | { |
---|
488 | SString out = "{"; |
---|
489 | { |
---|
490 | for (HashEntryIterator it(hash); it.isValid();) |
---|
491 | { |
---|
492 | out += "\""; |
---|
493 | SString q = it->key; sstringQuote(q); |
---|
494 | out += q; |
---|
495 | out += "\":"; |
---|
496 | if (it->value != NULL) |
---|
497 | out += ((ExtValue*)it->value)->serialize(format); |
---|
498 | else |
---|
499 | out += "null"; |
---|
500 | it++; |
---|
501 | if (it.isValid()) out += ","; |
---|
502 | } |
---|
503 | } |
---|
504 | out += "}"; |
---|
505 | return out; |
---|
506 | } |
---|
507 | |
---|
508 | void DictionaryObject::get_toString(ExtValue* ret) |
---|
509 | { |
---|
510 | SString out = "{"; |
---|
511 | //static SListTempl<DictionaryObject*> trace; |
---|
512 | if (tlsGetRef(VectorObject_tostring_trace).find(this) >= 0) |
---|
513 | out += "..."; |
---|
514 | else |
---|
515 | { |
---|
516 | tlsGetRef(VectorObject_tostring_trace) += this; |
---|
517 | for (HashEntryIterator it(hash); it.isValid();) |
---|
518 | { |
---|
519 | out += it->key; |
---|
520 | out += ":"; |
---|
521 | if (it->value != NULL) |
---|
522 | out += ((ExtValue*)it->value)->getString(); |
---|
523 | else |
---|
524 | out += "null"; |
---|
525 | it++; |
---|
526 | if (it.isValid()) out += ","; |
---|
527 | } |
---|
528 | tlsGetRef(VectorObject_tostring_trace) -= this; |
---|
529 | } |
---|
530 | out += "}"; |
---|
531 | ret->setString(out); |
---|
532 | } |
---|
533 | |
---|
534 | void DictionaryObject::copyFrom(DictionaryObject *other) |
---|
535 | { |
---|
536 | for (HashEntryIterator it(other->hash); it.isValid(); it++) |
---|
537 | { |
---|
538 | ExtValue *v = (ExtValue*)it->value; |
---|
539 | hash.put(it->key, v ? new ExtValue(*v) : NULL); |
---|
540 | } |
---|
541 | } |
---|
542 | |
---|
543 | void DictionaryObject::p_clone(PARAMPROCARGS) |
---|
544 | { |
---|
545 | DictionaryObject *c = new DictionaryObject; |
---|
546 | c->copyFrom(this); |
---|
547 | ret->setObject(ExtObject(&par, c)); |
---|
548 | } |
---|
549 | |
---|
550 | void DictionaryObject::p_assign(PARAMPROCARGS) |
---|
551 | { |
---|
552 | clear(); |
---|
553 | DictionaryObject *other = DictionaryObject::fromObject(args[0].getObject(), false); |
---|
554 | if (other) |
---|
555 | copyFrom(other); |
---|
556 | ret->setEmpty(); |
---|
557 | } |
---|
558 | |
---|
559 | DictionaryObject* DictionaryObject::fromObject(const ExtObject& o, bool warn) |
---|
560 | { |
---|
561 | return (DictionaryObject*)o.getTarget(par.getName(), true, warn); |
---|
562 | } |
---|
563 | |
---|
564 | void DictionaryObject::get_iterator(ExtValue* ret) |
---|
565 | { |
---|
566 | ret->setObject(DictionaryIterator::makeFrom(this)); |
---|
567 | } |
---|
568 | |
---|
569 | void DictionaryObject::get_keys(ExtValue* ret) |
---|
570 | { |
---|
571 | ret->setObject(DictionaryIterator::makeFrom(this)); |
---|
572 | } |
---|
573 | |
---|
574 | //////////////// |
---|
575 | |
---|
576 | VectorIterator::VectorIterator(VectorObject* v) |
---|
577 | { |
---|
578 | vec = v; |
---|
579 | vec->incref(); |
---|
580 | pos = -1; |
---|
581 | } |
---|
582 | |
---|
583 | #define FIELDSTRUCT VectorIterator |
---|
584 | ParamEntry vectoriterator_paramtab[] = |
---|
585 | { |
---|
586 | { "VectorIterator", 1, 2, "VectorIterator", "VectorIterator" }, |
---|
587 | { "next", 0, PARAM_READONLY | PARAM_NOSTATIC, "next", "d 0 1", GETONLY(next), }, |
---|
588 | { "value", 0, PARAM_READONLY | PARAM_NOSTATIC, "value", "x", GETONLY(value), }, |
---|
589 | { 0, 0, 0, }, |
---|
590 | }; |
---|
591 | #undef FIELDSTRUCT |
---|
592 | |
---|
593 | ExtObject VectorIterator::makeFrom(VectorObject *v) |
---|
594 | { |
---|
595 | static Param par(vectoriterator_paramtab); |
---|
596 | return ExtObject(&par, new VectorIterator(v)); |
---|
597 | } |
---|
598 | |
---|
599 | VectorIterator::~VectorIterator() |
---|
600 | { |
---|
601 | vec->decref(); |
---|
602 | } |
---|
603 | |
---|
604 | void VectorIterator::get_next(ExtValue* ret) |
---|
605 | { |
---|
606 | pos++; |
---|
607 | ret->setInt((pos < vec->data.size()) ? 1 : 0); |
---|
608 | } |
---|
609 | |
---|
610 | void VectorIterator::get_value(ExtValue* ret) |
---|
611 | { |
---|
612 | ExtValue *v = (ExtValue*)(((pos >= 0) && (pos < vec->data.size())) ? vec->data(pos) : NULL); |
---|
613 | if (v) |
---|
614 | *ret = *v; |
---|
615 | else |
---|
616 | ret->setEmpty(); |
---|
617 | } |
---|
618 | |
---|
619 | ///////////////// |
---|
620 | |
---|
621 | #define FIELDSTRUCT DictionaryIterator |
---|
622 | ParamEntry dictionaryiterator_paramtab[] = |
---|
623 | { |
---|
624 | { "DictionaryIterator", 1, 3, "DictionaryIterator", "DictionaryIterator" }, |
---|
625 | { "next", 0, PARAM_READONLY | PARAM_NOSTATIC, "next", "d 0 1", GETONLY(next), }, |
---|
626 | { "value", 0, PARAM_READONLY | PARAM_NOSTATIC, "value", "x", GETONLY(value), }, |
---|
627 | { "iterator", 0, PARAM_READONLY | PARAM_NOSTATIC, "keys iterator", "x", GETONLY(iterator), }, |
---|
628 | { 0, 0, 0, }, |
---|
629 | }; |
---|
630 | #undef FIELDSTRUCT |
---|
631 | |
---|
632 | DictionaryIterator::DictionaryIterator(DictionaryObject* d, bool _keys) |
---|
633 | :it(d->hash) |
---|
634 | { |
---|
635 | dic = d; |
---|
636 | dic->incref(); |
---|
637 | initial = true; |
---|
638 | keys = _keys; |
---|
639 | } |
---|
640 | |
---|
641 | ExtObject DictionaryIterator::makeFrom(DictionaryObject *d, bool _keys) |
---|
642 | { |
---|
643 | static Param par(dictionaryiterator_paramtab); |
---|
644 | return ExtObject(&par, new DictionaryIterator(d, _keys)); |
---|
645 | } |
---|
646 | |
---|
647 | DictionaryIterator::~DictionaryIterator() |
---|
648 | { |
---|
649 | dic->decref(); |
---|
650 | } |
---|
651 | |
---|
652 | void DictionaryIterator::get_next(ExtValue* ret) |
---|
653 | { |
---|
654 | if (initial) |
---|
655 | initial = false; |
---|
656 | else |
---|
657 | it++; |
---|
658 | ret->setInt(it.isValid()); |
---|
659 | } |
---|
660 | |
---|
661 | void DictionaryIterator::get_value(ExtValue* ret) |
---|
662 | { |
---|
663 | if ((!initial) && it.isValid()) |
---|
664 | { |
---|
665 | if (keys) |
---|
666 | { |
---|
667 | ret->setString(it->key); |
---|
668 | } |
---|
669 | else |
---|
670 | { |
---|
671 | ExtValue *v = (ExtValue*)it->value; |
---|
672 | if (v == NULL) |
---|
673 | ret->setEmpty(); |
---|
674 | else |
---|
675 | *ret = *v; |
---|
676 | } |
---|
677 | } |
---|
678 | else |
---|
679 | ret->setEmpty(); |
---|
680 | } |
---|
681 | |
---|
682 | void DictionaryIterator::get_iterator(ExtValue* ret) |
---|
683 | { |
---|
684 | ret->setObject(makeFrom(dic, true)); |
---|
685 | } |
---|
686 | |
---|
687 | ////////////// |
---|
688 | |
---|
689 | // not actually needed for deserialization (vector and dict are special cases) but findDeserializableClass can be also used in other contexts |
---|
690 | REGISTER_DESERIALIZABLE(VectorObject) |
---|
691 | REGISTER_DESERIALIZABLE(DictionaryObject) |
---|