source: cpp/frams/vm/classes/collectionobj.cpp @ 930

Last change on this file since 930 was 930, checked in by Maciej Komosinski, 4 years ago

Replaced std::sort() with qsort() in Vector.sort(). std::sort() requires "strict weak ordering" and may (and does) crash when given a non-compliant comparator, and we can't control what kind of user script comparator function will be passed to Vector.sort().

  • Property svn:eol-style set to native
File size: 19.3 KB
RevLine 
[286]1// This file is a part of Framsticks SDK.  http://www.framsticks.com/
[930]2// Copyright (C) 1999-2020  Maciej Komosinski and Szymon Ulatowski.
[286]3// See LICENSE.txt for details.
[109]4
5#include "collectionobj.h"
6#include <common/nonstd_math.h> //sqrt in borland
[375]7#include <frams/util/validitychecks.h>
[109]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
[746]15ParamEntry vector_paramtab[] =
[109]16{
[746]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, },
[109]46};
47#undef FIELDSTRUCT
48
49#define FIELDSTRUCT DictionaryObject
[746]50ParamEntry dictionary_paramtab[] =
[109]51{
[868]52        { "Dictionary", 1, 14, "Dictionary", "Dictionary associates stored values with string keys "
[746]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"
[868]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",
[746]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)." },
[858]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)." },
[849]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;" },
[746]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." },
[868]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) ..." },
[478]90
[746]91        { 0, 0, 0, },
[109]92};
93#undef FIELDSTRUCT
94
95Param VectorObject::par(vector_paramtab);
96Param DictionaryObject::par(dictionary_paramtab);
97
98/////////////////////////////////////////
99
100VectorObject::VectorObject(Pt3D &pt)
[746]101        :readonly(0), owndata(1)
[109]102{
[746]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);
[109]106}
107
108void VectorObject::clear()
109{
[746]110        if (owndata)
111                for (int i = data.size() - 1; i >= 0; i--)
112                {
[849]113                        ExtValue *v = (ExtValue*)data.get(i);
114                        if (v) delete v;
[746]115                }
116        data.clear();
[109]117}
118
119void VectorObject::p_remove(PARAMPROCARGS)
120{
[746]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;
[109]127}
128
[746]129void VectorObject::set_or_insert(int i, const ExtValue& val, bool insert)
[109]130{
[746]131        if (i < 0) return;
132        int oldsize = data.size();
133        if (i > oldsize)
[109]134        {
[746]135                data.setSize(i);
136                while (i > oldsize)
137                        data.set(oldsize++, 0);
[109]138        }
[746]139        if (insert)
140                data.insert(i, new ExtValue(val));
141        else
[642]142        {
[746]143                ExtValue *v = (ExtValue*)data.get(i);
144                if (v) delete v;
145                data.set(i, new ExtValue(val));
[642]146        }
[109]147}
148
149void VectorObject::p_get(PARAMPROCARGS)
150{
[746]151        int i = args->getInt();
152        if (listIndexCheck(&data, i, "VectorObject", "get"))
[109]153        {
[746]154                ExtValue *v = get(i);
155                if (v)
[109]156                {
[746]157                        *ret = *v;
158                        return;
[109]159                }
160        }
[746]161        *ret = ExtValue();
[109]162}
163
164void VectorObject::get_avg(ExtValue* ret)
165{
[746]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);
[109]172}
173
[464]174SString VectorObject::serialize(SerializationFormat format) const
[109]175{
[746]176        SString out = "[";
[109]177        {
[746]178                for (int i = 0; i < data.size(); i++)
[109]179                {
[746]180                        ExtValue* v = (ExtValue*)data.get(i);
181                        if (i) out += ",";
182                        if (v)
183                                out += v->serialize(format);
184                        else
185                                out += "null";
[109]186                }
187        }
[746]188        out += "]";
189        //sprintf(out.directAppend(20),"<Vector@%p>",this);out.endAppend();
190        return out;
[109]191}
192
[746]193static THREAD_LOCAL_DEF(SList, VectorObject_tostring_trace);
[109]194
195void VectorObject::get_toString(ExtValue* ret)
196{
[746]197        SString out = "[";
198        //static SListTempl<VectorObject*> trace;
199        if (tlsGetRef(VectorObject_tostring_trace).find(this) >= 0)
200                out += "...";
201        else
[109]202        {
[746]203                tlsGetRef(VectorObject_tostring_trace) += this;
204                for (int i = 0; i < data.size(); i++)
[109]205                {
[746]206                        ExtValue* v = (ExtValue*)data.get(i);
207                        if (i) out += ",";
208                        if (v)
209                                out += v->getString();
210                        else
211                                out += "null";
[109]212                }
[746]213                tlsGetRef(VectorObject_tostring_trace) -= this;
[109]214        }
[746]215        out += "]";
216        ret->setString(out);
[109]217}
218
219void VectorObject::get_stdev(ExtValue* ret)
220{
[746]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--)
[109]226        {
[746]227                double d = a - ((ExtValue*)data.get(i))->getDouble();
[849]228                s += d * d;
[109]229        }
[746]230        ret->setDouble(sqrt(s / max(1, data.size() - 1)));
[109]231}
232
233void VectorObject::p_find(PARAMPROCARGS)
234{
[746]235        short i;
236        for (i = 0; i < data.size(); i++)
[109]237        {
[746]238                if ((*args) == (*get(i)))
239                {
240                        ret->setInt(i); return;
241                }
[109]242        }
[746]243        ret->setInt(-1);
[109]244}
245
[453]246void VectorObject::p_clone(PARAMPROCARGS)
247{
[746]248        VectorObject *c = new VectorObject;
249        c->data.setSize(data.size());
250        for (int i = 0; i < data.size(); i++)
[453]251        {
[746]252                ExtValue *v = (ExtValue*)get(i);
253                if (v)
254                        c->data.set(i, new ExtValue(*v));
[453]255        }
[746]256        ret->setObject(ExtObject(&par, c));
[453]257}
258
[109]259class VEComparator
260{
261public:
[746]262        bool operator()(const ExtValue *a, const ExtValue *b) { return a->compare(*b) == ExtValue::ResultLower; }
[109]263};
264
265#ifndef NO_VMACHINE
266class VMVEComparator
267{
268public:
[746]269        VMachine::JumpTargetObject *jto;
270        VMachine *vm;
271        VMVEComparator(VMachine::JumpTargetObject *_jto) :jto(_jto), vm(jto->vm) {}
[930]272        static int compare(const void *a, const void *b, void* _this);
[109]273};
274
[930]275int VMVEComparator::compare(const void *a, const void *b, void* _this)
[109]276{
[930]277        VMachine *vm = ((VMVEComparator*)_this)->vm;
278        VMachine::JumpTargetObject *jto = ((VMVEComparator*)_this)->jto;
[746]279        if (!VMCode::prepareDynamicJumpTarget(jto->pc, jto->code))
280                return false;
[109]281
[930]282        vm->push(**(const ExtValue **)a);
283        vm->push(**(const ExtValue **)b);
[746]284        vm->pushNewCallState();
285        vm->jumpDynamicJumpTarget(jto->pc);
286        vm->run();
287        vm->popCallState();
[930]288        int ret;
[746]289        ExtValue& retval = vm->getValue();
290        if (retval.type == TInvalid)
[109]291        {
[930]292                ret = 0;
[746]293                logPrintf("VectorElementComparator", "", LOG_ERROR, "Comparison function returned no value");
[109]294        }
[746]295        else
[930]296                ret = (retval.getInt() != 0) ? -1 : 1;
[746]297        vm->drop(2);
298        return ret;
[109]299}
300#endif
301
302void VectorObject::p_sort(PARAMPROCARGS)
303{
304#ifndef NO_VMACHINE
[746]305        VMachine::JumpTargetObject *jto = VMachine::JumpTargetObject::fromObject(args->getObject(), false);
306        if (jto)
[109]307        {
[746]308                VMVEComparator cmp(jto);
309                ExtValue **first = (ExtValue**)&data.getref(0);
[930]310                //Originally was the same as below: std::sort(first, first + data.size(), cmp);
311                //However, std::sort() requires "strict weak ordering" and may crash (and indeed crashes, "undefined behavior") when given a non-compliant comparator.
312                //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.
313                qsort_r(first, data.size(), sizeof(ExtValue*), cmp.compare, &cmp);
[109]314        }
[746]315        else
[109]316#endif
317        {
[746]318                VEComparator cmp;
319                ExtValue **first = (ExtValue**)&data.getref(0);
320                std::sort(first, first + data.size(), cmp);
[109]321        }
[746]322        ret->setEmpty();
[109]323}
324
325void VectorObject::get_iterator(ExtValue* ret)
326{
[746]327        ret->setObject(VectorIterator::makeFrom(this));
[109]328}
329
[171]330VectorObject* VectorObject::fromObject(const ExtObject& o, bool warn)
[109]331{
[746]332        return (VectorObject*)o.getTarget(par.getName(), true, warn);
[109]333}
334
335/////////////////////////////
336
337void DictionaryObject::clear()
338{
[746]339        for (HashEntryIterator it(hash); it.isValid();)
[109]340        {
[746]341                ExtValue *v = (ExtValue*)hash.remove(it);
342                if (v) delete v;
[109]343        }
[746]344        hash.clear();
345        hash.init();
[109]346}
347
348void DictionaryObject::p_find(PARAMPROCARGS)
349{
[746]350        for (HashEntryIterator it(hash); it.isValid(); it++)
[109]351        {
[852]352                if (((ExtValue*)it->value) == NULL)
353                {
354                        if (args->getType() != TUnknown) continue;
355                        ret->setString(it->key);
356                        return;
357                }
[746]358                if ((*args) == (*((ExtValue*)it->value)))
[109]359                {
[746]360                        ret->setString(it->key);
361                        return;
[109]362                }
363        }
[746]364        ret->setEmpty();
[109]365}
366
367HashEntryIterator* DictionaryObject::getIndexIterator(int i)
368{
[746]369        if (i < 0) return 0;
370        if (i >= hash.getSize()) return 0;
[109]371
[746]372        if ((!it.isValid()) || (it_index > i))
[109]373        {
[746]374                it = HashEntryIterator(hash);
375                it_index = 0;
[109]376        }
[746]377        while (it.isValid())
[109]378        {
[746]379                if (it_index == i)
380                        return &it;
381                it_index++;
382                it++;
[109]383        }
[746]384        return 0;
[109]385}
386
387void DictionaryObject::p_remove(PARAMPROCARGS)
388{
[746]389        if ((args->type == TInt) || (args->type == TDouble))
[109]390        {
[746]391                HashEntryIterator* iter = getIndexIterator(args->getInt());
392                if (iter)
[109]393                {
[746]394                        ExtValue *oldval = (ExtValue*)hash.remove(*iter);
395                        if (oldval) { *ret = *oldval; delete oldval; }
396                        else *ret = ExtValue();
[109]397                }
398        }
[746]399        else
[109]400        {
[746]401                ExtValue *oldval = (ExtValue*)hash.remove(args[0].getString());
402                if (oldval) { *ret = *oldval; delete oldval; }
403                else *ret = ExtValue();
[109]404        }
405}
406
[478]407ExtValue DictionaryObject::get(SString key)
408{
[849]409        int found = 0;
410        ExtValue *val = (ExtValue*)hash.get(key, &found);
411        if (found == 0)
412        {
413                logPrintf("Dictionary", "get", LOG_ERROR, "Key '%s' not found", key.c_str());
414                return ExtValue::invalid();
415        }
416        else
417        {
418                if (val)
419                        return *val;
420                return ExtValue::empty();
421        }
[478]422}
423
424ExtValue DictionaryObject::get(int index)
425{
[746]426        HashEntryIterator* iter = getIndexIterator(index);
427        if (iter && (*iter)->value)
428                return *((ExtValue*)(*iter)->value);
429        return ExtValue::empty();
[478]430}
431
[109]432void DictionaryObject::p_get(PARAMPROCARGS)
433{
[746]434        if ((args->type == TInt) || (args->type == TDouble))
435                *ret = get(args->getInt());
436        else
437                *ret = get(args[0].getString());
[109]438}
439
440void DictionaryObject::p_getKey(PARAMPROCARGS)
441{
[746]442        HashEntryIterator* iter = getIndexIterator(args->getInt());
443        if (iter)
[109]444        {
[746]445                *ret = (*iter)->key;
446                return;
[109]447        }
[746]448        *ret = ExtValue();
[109]449}
450
[849]451void DictionaryObject::p_hasKey(PARAMPROCARGS)
452{
453        int found = 0;
454        hash.get(args->getString(), &found);
455        ret->setInt(found);
456}
457
[746]458ExtValue DictionaryObject::set(SString key, ExtValue new_value)
[478]459{
[746]460        ExtValue ret;
461        ExtValue *new_ext = (new_value.getType() == TUnknown) ? NULL : new ExtValue(new_value);
462        ExtValue *old_ext = (ExtValue*)hash.put(key, new_ext);
463        if (old_ext) { ret = *old_ext; delete old_ext; }
464        return ret;
[478]465}
466
[109]467void DictionaryObject::p_set(PARAMPROCARGS)
468{
[746]469        *ret = set(args[1].getString(), args[0]);
[109]470}
471
[464]472SString DictionaryObject::serialize(SerializationFormat format) const
[109]473{
[746]474        SString out = "{";
[109]475        {
[746]476                for (HashEntryIterator it(hash); it.isValid();)
[109]477                {
[746]478                        out += "\"";
479                        SString q = it->key; sstringQuote(q);
480                        out += q;
481                        out += "\":";
482                        if (it->value != NULL)
483                                out += ((ExtValue*)it->value)->serialize(format);
484                        else
485                                out += "null";
486                        it++;
487                        if (it.isValid()) out += ",";
[109]488                }
489        }
[746]490        out += "}";
491        return out;
[109]492}
493
494void DictionaryObject::get_toString(ExtValue* ret)
495{
[746]496        SString out = "{";
497        //static SListTempl<DictionaryObject*> trace;
498        if (tlsGetRef(VectorObject_tostring_trace).find(this) >= 0)
499                out += "...";
500        else
[109]501        {
[746]502                tlsGetRef(VectorObject_tostring_trace) += this;
503                for (HashEntryIterator it(hash); it.isValid();)
[109]504                {
[746]505                        out += it->key;
506                        out += ":";
507                        if (it->value != NULL)
508                                out += ((ExtValue*)it->value)->getString();
509                        else
510                                out += "null";
511                        it++;
512                        if (it.isValid()) out += ",";
[109]513                }
[746]514                tlsGetRef(VectorObject_tostring_trace) -= this;
[109]515        }
[746]516        out += "}";
517        ret->setString(out);
[109]518}
519
[478]520void DictionaryObject::copyFrom(DictionaryObject *other)
[453]521{
[746]522        for (HashEntryIterator it(other->hash); it.isValid(); it++)
[453]523        {
[746]524                ExtValue *v = (ExtValue*)it->value;
525                hash.put(it->key, v ? new ExtValue(*v) : NULL);
[453]526        }
[478]527}
528
529void DictionaryObject::p_clone(PARAMPROCARGS)
530{
[746]531        DictionaryObject *c = new DictionaryObject;
532        c->copyFrom(this);
533        ret->setObject(ExtObject(&par, c));
[453]534}
535
[478]536void DictionaryObject::p_assign(PARAMPROCARGS)
537{
[746]538        clear();
539        DictionaryObject *other = DictionaryObject::fromObject(args[0].getObject(), false);
540        if (other)
[478]541                copyFrom(other);
[746]542        ret->setEmpty();
[478]543}
544
[171]545DictionaryObject* DictionaryObject::fromObject(const ExtObject& o, bool warn)
[109]546{
[746]547        return (DictionaryObject*)o.getTarget(par.getName(), true, warn);
[109]548}
549
[868]550void DictionaryObject::get_iterator(ExtValue* ret)
551{
552        ret->setObject(DictionaryIterator::makeFrom(this));
553}
554
555void DictionaryObject::get_keys(ExtValue* ret)
556{
557        ret->setObject(DictionaryIterator::makeFrom(this));
558}
559
[109]560////////////////
561
562VectorIterator::VectorIterator(VectorObject* v)
563{
[746]564        vec = v;
565        vec->incref();
566        pos = -1;
[109]567}
568
569#define FIELDSTRUCT VectorIterator
[746]570ParamEntry vectoriterator_paramtab[] =
[109]571{
[746]572        { "VectorIterator", 1, 2, "VectorIterator", "VectorIterator" },
573        { "next", 0, PARAM_READONLY | PARAM_NOSTATIC, "next", "d 0 1", GETONLY(next), },
574        { "value", 0, PARAM_READONLY | PARAM_NOSTATIC, "value", "x", GETONLY(value), },
575        { 0, 0, 0, },
[109]576};
577#undef FIELDSTRUCT
578
579ExtObject VectorIterator::makeFrom(VectorObject *v)
580{
[746]581        static Param par(vectoriterator_paramtab);
582        return ExtObject(&par, new VectorIterator(v));
[109]583}
584
585VectorIterator::~VectorIterator()
586{
[746]587        vec->decref();
[109]588}
589
590void VectorIterator::get_next(ExtValue* ret)
591{
[746]592        pos++;
593        ret->setInt((pos < vec->data.size()) ? 1 : 0);
[109]594}
595
596void VectorIterator::get_value(ExtValue* ret)
597{
[746]598        ExtValue *v = (ExtValue*)(((pos >= 0) && (pos < vec->data.size())) ? vec->data(pos) : NULL);
599        if (v)
600                *ret = *v;
601        else
602                ret->setEmpty();
[109]603}
[490]604
[868]605/////////////////
606
607#define FIELDSTRUCT DictionaryIterator
608ParamEntry dictionaryiterator_paramtab[] =
609{
610        { "DictionaryIterator", 1, 3, "DictionaryIterator", "DictionaryIterator" },
611        { "next", 0, PARAM_READONLY | PARAM_NOSTATIC, "next", "d 0 1", GETONLY(next), },
612        { "value", 0, PARAM_READONLY | PARAM_NOSTATIC, "value", "x", GETONLY(value), },
613        { "iterator", 0, PARAM_READONLY | PARAM_NOSTATIC, "keys iterator", "x", GETONLY(iterator), },
614        { 0, 0, 0, },
615};
616#undef FIELDSTRUCT
617
618DictionaryIterator::DictionaryIterator(DictionaryObject* d, bool _keys)
619        :it(d->hash)
620{
621        dic = d;
622        dic->incref();
623        initial = true;
624        keys = _keys;
625}
626
627ExtObject DictionaryIterator::makeFrom(DictionaryObject *d, bool _keys)
628{
629        static Param par(dictionaryiterator_paramtab);
630        return ExtObject(&par, new DictionaryIterator(d, _keys));
631}
632
633DictionaryIterator::~DictionaryIterator()
634{
635        dic->decref();
636}
637
638void DictionaryIterator::get_next(ExtValue* ret)
639{
640        if (initial)
641                initial = false;
642        else
643                it++;
644        ret->setInt(it.isValid());
645}
646
647void DictionaryIterator::get_value(ExtValue* ret)
648{
649        if ((!initial) && it.isValid())
650        {
651                if (keys)
652                {
653                        ret->setString(it->key);
654                }
655                else
656                {
657                        ExtValue *v = (ExtValue*)it->value;
658                        if (v == NULL)
659                                ret->setEmpty();
660                        else
661                                *ret = *v;
662                }
663        }
664        else
665                ret->setEmpty();
666}
667
668void DictionaryIterator::get_iterator(ExtValue* ret)
669{
670        ret->setObject(makeFrom(dic, true));
671}
672
673//////////////
674
[490]675// not actually needed for deserialization (vector and dict are special cases) but findDeserializableClass can be also used in other contexts
676REGISTER_DESERIALIZABLE(VectorObject)
677REGISTER_DESERIALIZABLE(DictionaryObject)
Note: See TracBrowser for help on using the repository browser.