-/* see copyright notice in squirrel.h */
-#ifndef _SQARRAY_H_
-#define _SQARRAY_H_
-
-struct SQArray : public CHAINABLE_OBJ
-{
-private:
- SQArray(SQSharedState *ss,SQInteger nsize){_values.resize(nsize); INIT_CHAIN();ADD_TO_CHAIN(&_ss(this)->_gc_chain,this);}
- ~SQArray()
- {
- REMOVE_FROM_CHAIN(&_ss(this)->_gc_chain,this);
- }
-public:
- static SQArray* Create(SQSharedState *ss,SQInteger nInitialSize){
- SQArray *newarray=(SQArray*)SQ_MALLOC(sizeof(SQArray));
- new (newarray) SQArray(ss,nInitialSize);
- return newarray;
- }
-#ifndef NO_GARBAGE_COLLECTOR
- void Mark(SQCollectable **chain);
-#endif
- void Finalize(){
- _values.resize(0);
- }
- bool Get(const SQInteger nidx,SQObjectPtr &val)
- {
- if(nidx>=0 && nidx<(SQInteger)_values.size()){
- SQObjectPtr &o = _values[nidx];
- val = _realval(o);
- return true;
- }
- else return false;
- }
- bool Set(const SQInteger nidx,const SQObjectPtr &val)
- {
- if(nidx>=0 && nidx<(SQInteger)_values.size()){
- _values[nidx]=val;
- return true;
- }
- else return false;
- }
- SQInteger Next(const SQObjectPtr &refpos,SQObjectPtr &outkey,SQObjectPtr &outval)
- {
- SQUnsignedInteger idx=TranslateIndex(refpos);
- while(idx<_values.size()){
- //first found
- outkey=(SQInteger)idx;
- SQObjectPtr &o = _values[idx];
- outval = _realval(o);
- //return idx for the next iteration
- return ++idx;
- }
- //nothing to iterate anymore
- return -1;
- }
- SQArray *Clone(){SQArray *anew=Create(_opt_ss(this),Size()); anew->_values.copy(_values); return anew; }
- SQInteger Size() const {return _values.size();}
- void Resize(SQInteger size,SQObjectPtr &fill = _null_) { _values.resize(size,fill); ShrinkIfNeeded(); }
- void Reserve(SQInteger size) { _values.reserve(size); }
- void Append(const SQObject &o){_values.push_back(o);}
- void Extend(const SQArray *a);
- SQObjectPtr &Top(){return _values.top();}
- void Pop(){_values.pop_back(); ShrinkIfNeeded(); }
- bool Insert(SQInteger idx,const SQObject &val){
- if(idx < 0 || idx > (SQInteger)_values.size())
- return false;
- _values.insert(idx,val);
- return true;
- }
- void ShrinkIfNeeded() {
- if(_values.size() <= _values.capacity()>>2) //shrink the array
- _values.shrinktofit();
- }
- bool Remove(SQInteger idx){
- if(idx < 0 || idx >= (SQInteger)_values.size())
- return false;
- _values.remove(idx);
- ShrinkIfNeeded();
- return true;
- }
- void Release()
- {
- sq_delete(this,SQArray);
- }
- SQObjectPtrVec _values;
-};
-#endif //_SQARRAY_H_
+/* see copyright notice in squirrel.h */\r
+#ifndef _SQARRAY_H_\r
+#define _SQARRAY_H_\r
+\r
+struct SQArray : public CHAINABLE_OBJ\r
+{\r
+private:\r
+ SQArray(SQSharedState *ss,SQInteger nsize){_values.resize(nsize); INIT_CHAIN();ADD_TO_CHAIN(&_ss(this)->_gc_chain,this);}\r
+ ~SQArray()\r
+ {\r
+ REMOVE_FROM_CHAIN(&_ss(this)->_gc_chain,this);\r
+ }\r
+public:\r
+ static SQArray* Create(SQSharedState *ss,SQInteger nInitialSize){\r
+ SQArray *newarray=(SQArray*)SQ_MALLOC(sizeof(SQArray));\r
+ new (newarray) SQArray(ss,nInitialSize);\r
+ return newarray;\r
+ }\r
+#ifndef NO_GARBAGE_COLLECTOR\r
+ void Mark(SQCollectable **chain);\r
+#endif\r
+ void Finalize(){\r
+ _values.resize(0);\r
+ }\r
+ bool Get(const SQInteger nidx,SQObjectPtr &val)\r
+ {\r
+ if(nidx>=0 && nidx<(SQInteger)_values.size()){\r
+ SQObjectPtr &o = _values[nidx];\r
+ val = _realval(o);\r
+ return true;\r
+ }\r
+ else return false;\r
+ }\r
+ bool Set(const SQInteger nidx,const SQObjectPtr &val)\r
+ {\r
+ if(nidx>=0 && nidx<(SQInteger)_values.size()){\r
+ _values[nidx]=val;\r
+ return true;\r
+ }\r
+ else return false;\r
+ }\r
+ SQInteger Next(const SQObjectPtr &refpos,SQObjectPtr &outkey,SQObjectPtr &outval)\r
+ {\r
+ SQUnsignedInteger idx=TranslateIndex(refpos);\r
+ while(idx<_values.size()){\r
+ //first found\r
+ outkey=(SQInteger)idx;\r
+ SQObjectPtr &o = _values[idx];\r
+ outval = _realval(o);\r
+ //return idx for the next iteration\r
+ return ++idx;\r
+ }\r
+ //nothing to iterate anymore\r
+ return -1;\r
+ }\r
+ SQArray *Clone(){SQArray *anew=Create(_opt_ss(this),Size()); anew->_values.copy(_values); return anew; }\r
+ SQInteger Size() const {return _values.size();}\r
+ void Resize(SQInteger size,SQObjectPtr &fill = _null_) { _values.resize(size,fill); ShrinkIfNeeded(); }\r
+ void Reserve(SQInteger size) { _values.reserve(size); }\r
+ void Append(const SQObject &o){_values.push_back(o);}\r
+ void Extend(const SQArray *a);\r
+ SQObjectPtr &Top(){return _values.top();}\r
+ void Pop(){_values.pop_back(); ShrinkIfNeeded(); }\r
+ bool Insert(SQInteger idx,const SQObject &val){\r
+ if(idx < 0 || idx > (SQInteger)_values.size())\r
+ return false;\r
+ _values.insert(idx,val);\r
+ return true;\r
+ }\r
+ void ShrinkIfNeeded() {\r
+ if(_values.size() <= _values.capacity()>>2) //shrink the array\r
+ _values.shrinktofit();\r
+ }\r
+ bool Remove(SQInteger idx){\r
+ if(idx < 0 || idx >= (SQInteger)_values.size())\r
+ return false;\r
+ _values.remove(idx);\r
+ ShrinkIfNeeded();\r
+ return true;\r
+ }\r
+ void Release()\r
+ {\r
+ sq_delete(this,SQArray);\r
+ }\r
+ SQObjectPtrVec _values;\r
+};\r
+#endif //_SQARRAY_H_\r