1 | // This file is a part of Framsticks SDK. http://www.framsticks.com/ |
---|
2 | // Copyright (C) 1999-2015 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,11,"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 i=0;i<d.size;i++) Simulator.print(d.getKey(i)+\" is \"+d.get(i));", |
---|
68 | }, |
---|
69 | {"clear",0,PARAM_NOSTATIC,"Clear data","p()",PROCEDURE(p_clear),}, |
---|
70 | {"size",0,PARAM_NOSTATIC | PARAM_READONLY,"Element count","d",GETONLY(size),}, |
---|
71 | {"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)."}, |
---|
72 | {"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). null is returned for nonexistent keys.\nobject.get(key) can be shortened to 'object[key]'"}, |
---|
73 | {"getKey",0,PARAM_NOSTATIC,"Get a key","p s(d index)",PROCEDURE(p_getKey),"Returns the key of the indexed element (0 <= index < size)"}, |
---|
74 | {"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" |
---|
75 | "Returns the value previously associated with the given key (or index).\n" |
---|
76 | "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" |
---|
77 | "Note the difference in the returned value:\n" |
---|
78 | " var old_value=object.set(\"key\",new_value); //'old_value' gets the value previously associated with \"key\"\n" |
---|
79 | " 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."}, |
---|
80 | {"find",0,PARAM_NOSTATIC,"Find","p x(x value)",PROCEDURE(p_find),"Returns the element key or null if not found."}, |
---|
81 | {"new",0,0,"Create a Dictionary","p oDictionary()",STATICPROCEDURE(p_new),"Empty directory can be also created using the {} expression."}, |
---|
82 | {"toString",0,PARAM_READONLY | PARAM_NOSTATIC,"Textual form","s",GETONLY(toString),}, |
---|
83 | {"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));"}, |
---|
84 | {"assign",0,PARAM_NOSTATIC,"Assign from another object","p(x)",PROCEDURE(p_assign),"Replaces current dictionary with dictionary contents from another object."}, |
---|
85 | |
---|
86 | {0,0,0,}, |
---|
87 | }; |
---|
88 | #undef FIELDSTRUCT |
---|
89 | |
---|
90 | Param VectorObject::par(vector_paramtab); |
---|
91 | Param DictionaryObject::par(dictionary_paramtab); |
---|
92 | |
---|
93 | ///////////////////////////////////////// |
---|
94 | |
---|
95 | VectorObject::VectorObject(Pt3D &pt) |
---|
96 | :readonly(0),owndata(1) |
---|
97 | { |
---|
98 | set_or_insert(0,ExtValue(pt.x),false); |
---|
99 | set_or_insert(1,ExtValue(pt.y),false); |
---|
100 | set_or_insert(2,ExtValue(pt.z),false); |
---|
101 | } |
---|
102 | |
---|
103 | void VectorObject::clear() |
---|
104 | { |
---|
105 | if (owndata) |
---|
106 | for(int i=data.size()-1;i>=0;i--) |
---|
107 | { |
---|
108 | ExtValue *v=(ExtValue*)data.get(i); |
---|
109 | if (v) delete v; |
---|
110 | } |
---|
111 | data.clear(); |
---|
112 | } |
---|
113 | |
---|
114 | void VectorObject::p_remove(PARAMPROCARGS) |
---|
115 | { |
---|
116 | if (readonly) return; |
---|
117 | int i=args->getInt(); |
---|
118 | if (!listIndexCheck(&data,i,"VectorObject","remove")) return; |
---|
119 | ExtValue *v=(ExtValue*)data.get(i); |
---|
120 | if (v) delete v; |
---|
121 | data-=i; |
---|
122 | } |
---|
123 | |
---|
124 | void VectorObject::set_or_insert(int i,const ExtValue& val,bool insert) |
---|
125 | { |
---|
126 | if (i<0) return; |
---|
127 | int oldsize=data.size(); |
---|
128 | if (i>oldsize) |
---|
129 | { |
---|
130 | data.setSize(i); |
---|
131 | while(i>oldsize) |
---|
132 | data.set(oldsize++,0); |
---|
133 | } |
---|
134 | if (insert) |
---|
135 | data.insert(i,new ExtValue(val)); |
---|
136 | else |
---|
137 | { |
---|
138 | ExtValue *v=(ExtValue*)data.get(i); |
---|
139 | if (v) delete v; |
---|
140 | data.set(i,new ExtValue(val)); |
---|
141 | } |
---|
142 | } |
---|
143 | |
---|
144 | void VectorObject::p_get(PARAMPROCARGS) |
---|
145 | { |
---|
146 | int i=args->getInt(); |
---|
147 | if (listIndexCheck(&data,i,"VectorObject","get")) |
---|
148 | { |
---|
149 | ExtValue *v=get(i); |
---|
150 | if (v) |
---|
151 | { |
---|
152 | *ret=*v; |
---|
153 | return; |
---|
154 | } |
---|
155 | } |
---|
156 | *ret=ExtValue(); |
---|
157 | } |
---|
158 | |
---|
159 | void VectorObject::get_avg(ExtValue* ret) |
---|
160 | { |
---|
161 | if (!data.size()) {ret->setEmpty(); return;} |
---|
162 | double s=0.0; |
---|
163 | for(int i=data.size()-1;i>=0;i--) |
---|
164 | s+=((ExtValue*)data.get(i))->getDouble(); |
---|
165 | s/=data.size(); |
---|
166 | ret->setDouble(s); |
---|
167 | } |
---|
168 | |
---|
169 | SString VectorObject::serialize(SerializationFormat format) const |
---|
170 | { |
---|
171 | SString out="["; |
---|
172 | { |
---|
173 | for(int i=0;i<data.size();i++) |
---|
174 | { |
---|
175 | ExtValue* v=(ExtValue*)data.get(i); |
---|
176 | if (i) out+=","; |
---|
177 | if (v) |
---|
178 | out+=v->serialize(format); |
---|
179 | else |
---|
180 | out+="null"; |
---|
181 | } |
---|
182 | } |
---|
183 | out+="]"; |
---|
184 | //sprintf(out.directAppend(20),"<Vector@%p>",this);out.endAppend(); |
---|
185 | return out; |
---|
186 | } |
---|
187 | |
---|
188 | static THREAD_LOCAL_DEF(SList,VectorObject_tostring_trace); |
---|
189 | |
---|
190 | void VectorObject::get_toString(ExtValue* ret) |
---|
191 | { |
---|
192 | SString out="["; |
---|
193 | //static SListTempl<VectorObject*> trace; |
---|
194 | if (tlsGetRef(VectorObject_tostring_trace).find(this)>=0) |
---|
195 | out+="..."; |
---|
196 | else |
---|
197 | { |
---|
198 | tlsGetRef(VectorObject_tostring_trace)+=this; |
---|
199 | for(int i=0;i<data.size();i++) |
---|
200 | { |
---|
201 | ExtValue* v=(ExtValue*)data.get(i); |
---|
202 | if (i) out+=","; |
---|
203 | if (v) |
---|
204 | out+=v->getString(); |
---|
205 | else |
---|
206 | out+="null"; |
---|
207 | } |
---|
208 | tlsGetRef(VectorObject_tostring_trace)-=this; |
---|
209 | } |
---|
210 | out+="]"; |
---|
211 | ret->setString(out); |
---|
212 | } |
---|
213 | |
---|
214 | void VectorObject::get_stdev(ExtValue* ret) |
---|
215 | { |
---|
216 | if (!data.size()) {ret->setEmpty(); return;} |
---|
217 | get_avg(ret); |
---|
218 | double a=ret->getDouble(); |
---|
219 | double s=0.0; |
---|
220 | for(int i=data.size()-1;i>=0;i--) |
---|
221 | { |
---|
222 | double d=a-((ExtValue*)data.get(i))->getDouble(); |
---|
223 | s+=d*d; |
---|
224 | } |
---|
225 | ret->setDouble(sqrt(s/max(1,data.size()-1))); |
---|
226 | } |
---|
227 | |
---|
228 | void VectorObject::p_find(PARAMPROCARGS) |
---|
229 | { |
---|
230 | short i; |
---|
231 | for(i=0;i<data.size();i++) |
---|
232 | { |
---|
233 | if ((*args)==(*get(i))) |
---|
234 | {ret->setInt(i);return;} |
---|
235 | } |
---|
236 | ret->setInt(-1); |
---|
237 | } |
---|
238 | |
---|
239 | void VectorObject::p_clone(PARAMPROCARGS) |
---|
240 | { |
---|
241 | VectorObject *c=new VectorObject; |
---|
242 | c->data.setSize(data.size()); |
---|
243 | for(int i=0;i<data.size();i++) |
---|
244 | { |
---|
245 | ExtValue *v=(ExtValue*)get(i); |
---|
246 | if (v) |
---|
247 | c->data.set(i,new ExtValue(*v)); |
---|
248 | } |
---|
249 | ret->setObject(ExtObject(&par,c)); |
---|
250 | } |
---|
251 | |
---|
252 | class VEComparator |
---|
253 | { |
---|
254 | public: |
---|
255 | bool operator()(const ExtValue *a,const ExtValue *b) {return a->compare(*b)==ExtValue::ResultLower;} |
---|
256 | }; |
---|
257 | |
---|
258 | #ifndef NO_VMACHINE |
---|
259 | class VMVEComparator |
---|
260 | { |
---|
261 | public: |
---|
262 | VMachine::JumpTargetObject *jto; |
---|
263 | VMachine *vm; |
---|
264 | VMVEComparator(VMachine::JumpTargetObject *_jto):jto(_jto),vm(jto->vm) {} |
---|
265 | bool operator()(const ExtValue *a,const ExtValue *b); |
---|
266 | }; |
---|
267 | |
---|
268 | bool VMVEComparator::operator()(const ExtValue *a,const ExtValue *b) |
---|
269 | { |
---|
270 | if (!VMCode::prepareDynamicJumpTarget(jto->pc,jto->code)) |
---|
271 | return false; |
---|
272 | |
---|
273 | vm->push(*a); |
---|
274 | vm->push(*b); |
---|
275 | vm->pushNewCallState(); |
---|
276 | vm->jumpDynamicJumpTarget(jto->pc); |
---|
277 | vm->run(); |
---|
278 | vm->popCallState(); |
---|
279 | bool ret; |
---|
280 | ExtValue& retval=vm->getValue(); |
---|
281 | if (retval.type==TInvalid) |
---|
282 | { |
---|
283 | ret=false; |
---|
284 | logPrintf("VectorElementComparator","",LOG_ERROR,"Comparison function returned no value"); |
---|
285 | } |
---|
286 | else |
---|
287 | ret=(retval.getInt()!=0); |
---|
288 | vm->drop(2); |
---|
289 | return ret; |
---|
290 | } |
---|
291 | #endif |
---|
292 | |
---|
293 | void VectorObject::p_sort(PARAMPROCARGS) |
---|
294 | { |
---|
295 | #ifndef NO_VMACHINE |
---|
296 | VMachine::JumpTargetObject *jto=VMachine::JumpTargetObject::fromObject(args->getObject(),false); |
---|
297 | if (jto) |
---|
298 | { |
---|
299 | VMVEComparator cmp(jto); |
---|
300 | ExtValue **first=(ExtValue**)&data.getref(0); |
---|
301 | std::sort(first,first+data.size(),cmp); |
---|
302 | } |
---|
303 | else |
---|
304 | #endif |
---|
305 | { |
---|
306 | VEComparator cmp; |
---|
307 | ExtValue **first=(ExtValue**)&data.getref(0); |
---|
308 | std::sort(first,first+data.size(),cmp); |
---|
309 | } |
---|
310 | ret->setEmpty(); |
---|
311 | } |
---|
312 | |
---|
313 | void VectorObject::get_iterator(ExtValue* ret) |
---|
314 | { |
---|
315 | ret->setObject(VectorIterator::makeFrom(this)); |
---|
316 | } |
---|
317 | |
---|
318 | VectorObject* VectorObject::fromObject(const ExtObject& o, bool warn) |
---|
319 | { |
---|
320 | return (VectorObject*)o.getTarget(par.getName(),true,warn); |
---|
321 | } |
---|
322 | |
---|
323 | ///////////////////////////// |
---|
324 | |
---|
325 | void DictionaryObject::clear() |
---|
326 | { |
---|
327 | for(HashEntryIterator it(hash);it.isValid();) |
---|
328 | { |
---|
329 | ExtValue *v=(ExtValue*)hash.remove(it); |
---|
330 | if (v) delete v; |
---|
331 | } |
---|
332 | hash.clear(); |
---|
333 | hash.init(); |
---|
334 | } |
---|
335 | |
---|
336 | void DictionaryObject::p_find(PARAMPROCARGS) |
---|
337 | { |
---|
338 | for(HashEntryIterator it(hash);it.isValid();it++) |
---|
339 | { |
---|
340 | if ((*args)==(*((ExtValue*)it->value))) |
---|
341 | { |
---|
342 | ret->setString(it->key); |
---|
343 | return; |
---|
344 | } |
---|
345 | } |
---|
346 | ret->setEmpty(); |
---|
347 | } |
---|
348 | |
---|
349 | HashEntryIterator* DictionaryObject::getIndexIterator(int i) |
---|
350 | { |
---|
351 | if (i<0) return 0; |
---|
352 | if (i>=hash.getSize()) return 0; |
---|
353 | |
---|
354 | if ((!it.isValid())||(it_index>i)) |
---|
355 | { |
---|
356 | it=HashEntryIterator(hash); |
---|
357 | it_index=0; |
---|
358 | } |
---|
359 | while(it.isValid()) |
---|
360 | { |
---|
361 | if (it_index==i) |
---|
362 | return ⁢ |
---|
363 | it_index++; |
---|
364 | it++; |
---|
365 | } |
---|
366 | return 0; |
---|
367 | } |
---|
368 | |
---|
369 | void DictionaryObject::p_remove(PARAMPROCARGS) |
---|
370 | { |
---|
371 | if ((args->type==TInt)||(args->type==TDouble)) |
---|
372 | { |
---|
373 | HashEntryIterator* iter=getIndexIterator(args->getInt()); |
---|
374 | if (iter) |
---|
375 | { |
---|
376 | ExtValue *oldval=(ExtValue*)hash.remove(*iter); |
---|
377 | if (oldval) {*ret=*oldval; delete oldval;} else *ret=ExtValue(); |
---|
378 | } |
---|
379 | } |
---|
380 | else |
---|
381 | { |
---|
382 | ExtValue *oldval=(ExtValue*)hash.remove(args[0].getString()); |
---|
383 | if (oldval) {*ret=*oldval; delete oldval;} else *ret=ExtValue(); |
---|
384 | } |
---|
385 | } |
---|
386 | |
---|
387 | ExtValue DictionaryObject::get(SString key) |
---|
388 | { |
---|
389 | ExtValue *val=(ExtValue*)hash.get(key); |
---|
390 | if (val) |
---|
391 | return *val; |
---|
392 | return ExtValue::empty(); |
---|
393 | } |
---|
394 | |
---|
395 | ExtValue DictionaryObject::get(int index) |
---|
396 | { |
---|
397 | HashEntryIterator* iter=getIndexIterator(index); |
---|
398 | if (iter && (*iter)->value) |
---|
399 | return *((ExtValue*)(*iter)->value); |
---|
400 | return ExtValue::empty(); |
---|
401 | } |
---|
402 | |
---|
403 | void DictionaryObject::p_get(PARAMPROCARGS) |
---|
404 | { |
---|
405 | if ((args->type==TInt)||(args->type==TDouble)) |
---|
406 | *ret=get(args->getInt()); |
---|
407 | else |
---|
408 | *ret=get(args[0].getString()); |
---|
409 | } |
---|
410 | |
---|
411 | void DictionaryObject::p_getKey(PARAMPROCARGS) |
---|
412 | { |
---|
413 | HashEntryIterator* iter=getIndexIterator(args->getInt()); |
---|
414 | if (iter) |
---|
415 | { |
---|
416 | *ret=(*iter)->key; |
---|
417 | return; |
---|
418 | } |
---|
419 | *ret=ExtValue(); |
---|
420 | } |
---|
421 | |
---|
422 | ExtValue DictionaryObject::set(SString key,ExtValue new_value) |
---|
423 | { |
---|
424 | ExtValue ret; |
---|
425 | ExtValue *new_ext=(new_value.getType()==TUnknown) ? NULL : new ExtValue(new_value); |
---|
426 | ExtValue *old_ext=(ExtValue*)hash.put(key,new_ext); |
---|
427 | if (old_ext) { ret=*old_ext; delete old_ext;} |
---|
428 | return ret; |
---|
429 | } |
---|
430 | |
---|
431 | void DictionaryObject::p_set(PARAMPROCARGS) |
---|
432 | { |
---|
433 | *ret=set(args[1].getString(),args[0]); |
---|
434 | } |
---|
435 | |
---|
436 | SString DictionaryObject::serialize(SerializationFormat format) const |
---|
437 | { |
---|
438 | SString out="{"; |
---|
439 | { |
---|
440 | for(HashEntryIterator it(hash);it.isValid();) |
---|
441 | { |
---|
442 | out+="\""; |
---|
443 | SString q=it->key; sstringQuote(q); |
---|
444 | out+=q; |
---|
445 | out+="\":"; |
---|
446 | if (it->value!=NULL) |
---|
447 | out+=((ExtValue*)it->value)->serialize(format); |
---|
448 | else |
---|
449 | out+="null"; |
---|
450 | it++; |
---|
451 | if (it.isValid()) out+=","; |
---|
452 | } |
---|
453 | } |
---|
454 | out+="}"; |
---|
455 | return out; |
---|
456 | } |
---|
457 | |
---|
458 | void DictionaryObject::get_toString(ExtValue* ret) |
---|
459 | { |
---|
460 | SString out="{"; |
---|
461 | //static SListTempl<DictionaryObject*> trace; |
---|
462 | if (tlsGetRef(VectorObject_tostring_trace).find(this)>=0) |
---|
463 | out+="..."; |
---|
464 | else |
---|
465 | { |
---|
466 | tlsGetRef(VectorObject_tostring_trace)+=this; |
---|
467 | for(HashEntryIterator it(hash);it.isValid();) |
---|
468 | { |
---|
469 | out+=it->key; |
---|
470 | out+=":"; |
---|
471 | if (it->value!=NULL) |
---|
472 | out+=((ExtValue*)it->value)->getString(); |
---|
473 | else |
---|
474 | out+="null"; |
---|
475 | it++; |
---|
476 | if (it.isValid()) out+=","; |
---|
477 | } |
---|
478 | tlsGetRef(VectorObject_tostring_trace)-=this; |
---|
479 | } |
---|
480 | out+="}"; |
---|
481 | ret->setString(out); |
---|
482 | } |
---|
483 | |
---|
484 | void DictionaryObject::copyFrom(DictionaryObject *other) |
---|
485 | { |
---|
486 | for(HashEntryIterator it(other->hash);it.isValid();it++) |
---|
487 | { |
---|
488 | ExtValue *v=(ExtValue*)it->value; |
---|
489 | hash.put(it->key,v?new ExtValue(*v):NULL); |
---|
490 | } |
---|
491 | } |
---|
492 | |
---|
493 | void DictionaryObject::p_clone(PARAMPROCARGS) |
---|
494 | { |
---|
495 | DictionaryObject *c=new DictionaryObject; |
---|
496 | c->copyFrom(this); |
---|
497 | ret->setObject(ExtObject(&par,c)); |
---|
498 | } |
---|
499 | |
---|
500 | void DictionaryObject::p_assign(PARAMPROCARGS) |
---|
501 | { |
---|
502 | clear(); |
---|
503 | DictionaryObject *other=DictionaryObject::fromObject(args[0].getObject(),false); |
---|
504 | if (other) |
---|
505 | copyFrom(other); |
---|
506 | ret->setEmpty(); |
---|
507 | } |
---|
508 | |
---|
509 | DictionaryObject* DictionaryObject::fromObject(const ExtObject& o, bool warn) |
---|
510 | { |
---|
511 | return (DictionaryObject*)o.getTarget(par.getName(), true, warn); |
---|
512 | } |
---|
513 | |
---|
514 | //////////////// |
---|
515 | |
---|
516 | VectorIterator::VectorIterator(VectorObject* v) |
---|
517 | { |
---|
518 | vec=v; |
---|
519 | vec->incref(); |
---|
520 | pos=-1; |
---|
521 | } |
---|
522 | |
---|
523 | #define FIELDSTRUCT VectorIterator |
---|
524 | ParamEntry vectoriterator_paramtab[]= |
---|
525 | { |
---|
526 | {"VectorIterator",1,2,"VectorIterator","VectorIterator"}, |
---|
527 | {"next",0,PARAM_READONLY | PARAM_NOSTATIC,"next","d 0 1",GETONLY(next),}, |
---|
528 | {"value",0,PARAM_READONLY | PARAM_NOSTATIC,"value","x",GETONLY(value),}, |
---|
529 | {0,0,0,}, |
---|
530 | }; |
---|
531 | #undef FIELDSTRUCT |
---|
532 | |
---|
533 | ExtObject VectorIterator::makeFrom(VectorObject *v) |
---|
534 | { |
---|
535 | static Param par(vectoriterator_paramtab); |
---|
536 | return ExtObject(&par,new VectorIterator(v)); |
---|
537 | } |
---|
538 | |
---|
539 | VectorIterator::~VectorIterator() |
---|
540 | { |
---|
541 | vec->decref(); |
---|
542 | } |
---|
543 | |
---|
544 | void VectorIterator::get_next(ExtValue* ret) |
---|
545 | { |
---|
546 | pos++; |
---|
547 | ret->setInt((pos < vec->data.size()) ? 1 : 0); |
---|
548 | } |
---|
549 | |
---|
550 | void VectorIterator::get_value(ExtValue* ret) |
---|
551 | { |
---|
552 | ExtValue *v=(ExtValue*) (((pos>=0)&&(pos<vec->data.size())) ? vec->data(pos) : NULL ); |
---|
553 | if (v) |
---|
554 | *ret=*v; |
---|
555 | else |
---|
556 | ret->setEmpty(); |
---|
557 | } |
---|
558 | |
---|
559 | // not actually needed for deserialization (vector and dict are special cases) but findDeserializableClass can be also used in other contexts |
---|
560 | REGISTER_DESERIALIZABLE(VectorObject) |
---|
561 | REGISTER_DESERIALIZABLE(DictionaryObject) |
---|