kjs/array_object.cpp

   1 // -*- c-basic-offset: 2 -*-
   2 /*
   3  *  This file is part of the KDE libraries
   4  *  Copyright (C) 1999-2000 Harri Porten (porten@kde.org)
   5  *  Copyright (C) 2003, 2007 Apple Inc. All rights reserved.
   6  *  Copyright (C) 2003 Peter Kelly (pmk@post.com)
   7  *  Copyright (C) 2006 Alexey Proskuryakov (ap@nypop.com)
   8  *
   9  *  This library is free software; you can redistribute it and/or
  10  *  modify it under the terms of the GNU Lesser General Public
  11  *  License as published by the Free Software Foundation; either
  12  *  version 2 of the License, or (at your option) any later version.
  13  *
  14  *  This library is distributed in the hope that it will be useful,
  15  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
  16  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  17  *  Lesser General Public License for more details.
  18  *
  19  *  You should have received a copy of the GNU Lesser General Public
  20  *  License along with this library; if not, write to the Free Software
  21  *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  22  *
  23  */
  24
  25 #include "array_object.h"
  26 #include <config.h>
  27 #include "array_object.lut.h"
  28
  29 #include "error_object.h"
  30 #include "lookup.h"
  31 #include "operations.h"
  32 #include "PropertyNameArray.h"
  33 #include <wtf/HashSet.h>
  34 #include <stdio.h>
  35
  36 // GCC cstring uses these automatically, but not all implementations do.
  37 using std::strlen;
  38 using std::strcpy;
  39 using std::strncpy;
  40 using std::memset;
  41 using std::memcpy;
  42
  43 namespace KJS {
  44
  45 // ------------------------------ ArrayPrototype ----------------------------
  46
  47 const ClassInfo ArrayPrototype::info = {"Array", &ArrayInstance::info, &arrayTable, 0};
  48
  49 /* Source for array_object.lut.h
  50 @begin arrayTable 16
  51   toString       ArrayProtoFunc::ToString       DontEnum|Function 0
  52   toLocaleString ArrayProtoFunc::ToLocaleString DontEnum|Function 0
  53   concat         ArrayProtoFunc::Concat         DontEnum|Function 1
  54   join           ArrayProtoFunc::Join           DontEnum|Function 1
  55   pop            ArrayProtoFunc::Pop            DontEnum|Function 0
  56   push           ArrayProtoFunc::Push           DontEnum|Function 1
  57   reverse        ArrayProtoFunc::Reverse        DontEnum|Function 0
  58   shift          ArrayProtoFunc::Shift          DontEnum|Function 0
  59   slice          ArrayProtoFunc::Slice          DontEnum|Function 2
  60   sort           ArrayProtoFunc::Sort           DontEnum|Function 1
  61   splice         ArrayProtoFunc::Splice         DontEnum|Function 2
  62   unshift        ArrayProtoFunc::UnShift        DontEnum|Function 1
  63   every          ArrayProtoFunc::Every          DontEnum|Function 1
  64   forEach        ArrayProtoFunc::ForEach        DontEnum|Function 1
  65   some           ArrayProtoFunc::Some           DontEnum|Function 1
  66   indexOf        ArrayProtoFunc::IndexOf        DontEnum|Function 1
  67   lastIndexOf    ArrayProtoFunc::LastIndexOf    DontEnum|Function 1
  68   filter         ArrayProtoFunc::Filter         DontEnum|Function 1
  69   map            ArrayProtoFunc::Map            DontEnum|Function 1
  70 @end
  71 */
  72
  73 // ECMA 15.4.4
  74 ArrayPrototype::ArrayPrototype(ExecState*, ObjectPrototype* objProto)
  75   : ArrayInstance(objProto, 0)
  76 {
  77 }
  78
  79 bool ArrayPrototype::getOwnPropertySlot(ExecState* exec, const Identifier& propertyName, PropertySlot& slot)
  80 {
  81   return getStaticFunctionSlot<ArrayProtoFunc, ArrayInstance>(exec, &arrayTable, this, propertyName, slot);
  82 }
  83
  84 // ------------------------------ ArrayProtoFunc ----------------------------
  85
  86 ArrayProtoFunc::ArrayProtoFunc(ExecState* exec, int i, int len, const Identifier& name)
  87   : InternalFunctionImp(static_cast<FunctionPrototype*>
  88                         (exec->lexicalInterpreter()->builtinFunctionPrototype()), name)
  89   , id(i)
  90 {
  91   put(exec, exec->propertyNames().length, jsNumber(len), DontDelete | ReadOnly | DontEnum);
  92 }
  93
  94 static JSValue *getProperty(ExecState *exec, JSObject *obj, unsigned index)
  95 {
  96     PropertySlot slot;
  97     if (!obj->getPropertySlot(exec, index, slot))
  98         return NULL;
  99     return slot.getValue(exec, obj, index);
 100 }
 101
 102 // ECMA 15.4.4
 103 JSValue* ArrayProtoFunc::callAsFunction(ExecState* exec, JSObject* thisObj, const List& args)
 104 {
 105   unsigned length = thisObj->get(exec, exec->propertyNames().length)->toUInt32(exec);
 106
 107   JSValue *result = 0; // work around gcc 4.0 bug in uninitialized variable warning
 108
 109   switch (id) {
 110   case ToLocaleString:
 111   case ToString:
 112
 113     if (!thisObj->inherits(&ArrayInstance::info))
 114       return throwError(exec, TypeError);
 115
 116     // fall through
 117   case Join: {
 118     static HashSet<JSObject*> visitedElems;
 119     static const UString* empty = new UString("");
 120     static const UString* comma = new UString(",");
 121     bool alreadyVisited = !visitedElems.add(thisObj).second;
 122     if (alreadyVisited)
 123         return jsString(*empty);
 124     UString separator = *comma;
 125     UString str = *empty;
 126
 127     if (id == Join && !args[0]->isUndefined())
 128         separator = args[0]->toString(exec);
 129     for (unsigned int k = 0; k < length; k++) {
 130         if (k >= 1)
 131             str += separator;
 132         if (str.isNull()) {
 133             JSObject *error = Error::create(exec, GeneralError, "Out of memory");
 134             exec->setException(error);
 135             break;
 136         }
 137
 138         JSValue* element = thisObj->get(exec, k);
 139         if (element->isUndefinedOrNull())
 140             continue;
 141
 142         bool fallback = false;
 143         if (id == ToLocaleString) {
 144             JSObject* o = element->toObject(exec);
 145             JSValue* conversionFunction = o->get(exec, exec->propertyNames().toLocaleString);
 146             if (conversionFunction->isObject() && static_cast<JSObject*>(conversionFunction)->implementsCall())
 147                 str += static_cast<JSObject*>(conversionFunction)->call(exec, o, List())->toString(exec);
 148             else
 149                 // try toString() fallback
 150                 fallback = true;
 151         }
 152
 153         if (id == ToString || id == Join || fallback) {
 154             if (element->isObject()) {
 155                 JSObject *o = static_cast<JSObject *>(element);
 156                 JSValue *conversionFunction = o->get(exec, exec->propertyNames().toString);
 157                 if (conversionFunction->isObject() && static_cast<JSObject *>(conversionFunction)->implementsCall()) {
 158                     str += static_cast<JSObject *>(conversionFunction)->call(exec, o, List())->toString(exec);
 159                 } else {
 160                     visitedElems.remove(thisObj);
 161                     return throwError(exec, RangeError, "Cannot convert " + o->className() + " object to string");
 162                 }
 163             } else {
 164                 str += element->toString(exec);
 165             }
 166             if (str.isNull()) {
 167                 JSObject* error = Error::create(exec, GeneralError, "Out of memory");
 168                 exec->setException(error);
 169             }
 170         }
 171
 172         if (exec->hadException())
 173             break;
 174     }
 175     visitedElems.remove(thisObj);
 176     result = jsString(str);
 177     break;
 178   }
 179   case Concat: {
 180     JSObject *arr = static_cast<JSObject *>(exec->lexicalInterpreter()->builtinArray()->construct(exec,List::empty()));
 181     int n = 0;
 182     JSValue *curArg = thisObj;
 183     JSObject *curObj = static_cast<JSObject *>(thisObj);
 184     ListIterator it = args.begin();
 185     for (;;) {
 186       if (curArg->isObject() &&
 187           curObj->inherits(&ArrayInstance::info)) {
 188         unsigned int k = 0;
 189         // Older versions tried to optimize out getting the length of thisObj
 190         // by checking for n != 0, but that doesn't work if thisObj is an empty array.
 191         length = curObj->get(exec, exec->propertyNames().length)->toUInt32(exec);
 192         while (k < length) {
 193           if (JSValue *v = getProperty(exec, curObj, k))
 194             arr->put(exec, n, v);
 195           n++;
 196           k++;
 197         }
 198       } else {
 199         arr->put(exec, n, curArg);
 200         n++;
 201       }
 202       if (it == args.end())
 203         break;
 204       curArg = *it;
 205       curObj = static_cast<JSObject *>(it++); // may be 0
 206     }
 207     arr->put(exec, exec->propertyNames().length, jsNumber(n), DontEnum | DontDelete);
 208
 209     result = arr;
 210     break;
 211   }
 212   case Pop:{
 213     if (length == 0) {
 214       thisObj->put(exec, exec->propertyNames().length, jsNumber(length), DontEnum | DontDelete);
 215       result = jsUndefined();
 216     } else {
 217       result = thisObj->get(exec, length - 1);
 218       thisObj->put(exec, exec->propertyNames().length, jsNumber(length - 1), DontEnum | DontDelete);
 219     }
 220     break;
 221   }
 222   case Push: {
 223     for (int n = 0; n < args.size(); n++)
 224       thisObj->put(exec, length + n, args[n]);
 225     length += args.size();
 226     thisObj->put(exec, exec->propertyNames().length, jsNumber(length), DontEnum | DontDelete);
 227     result = jsNumber(length);
 228     break;
 229   }
 230   case Reverse: {
 231
 232     unsigned int middle = length / 2;
 233
 234     for (unsigned int k = 0; k < middle; k++) {
 235       unsigned lk1 = length - k - 1;
 236       JSValue *obj2 = getProperty(exec, thisObj, lk1);
 237       JSValue *obj = getProperty(exec, thisObj, k);
 238
 239       if (obj2)
 240         thisObj->put(exec, k, obj2);
 241       else
 242         thisObj->deleteProperty(exec, k);
 243
 244       if (obj)
 245         thisObj->put(exec, lk1, obj);
 246       else
 247         thisObj->deleteProperty(exec, lk1);
 248     }
 249     result = thisObj;
 250     break;
 251   }
 252   case Shift: {
 253     if (length == 0) {
 254       thisObj->put(exec, exec->propertyNames().length, jsNumber(length), DontEnum | DontDelete);
 255       result = jsUndefined();
 256     } else {
 257       result = thisObj->get(exec, 0);
 258       for(unsigned int k = 1; k < length; k++) {
 259         if (JSValue *obj = getProperty(exec, thisObj, k))
 260           thisObj->put(exec, k-1, obj);
 261         else
 262           thisObj->deleteProperty(exec, k-1);
 263       }
 264       thisObj->deleteProperty(exec, length - 1);
 265       thisObj->put(exec, exec->propertyNames().length, jsNumber(length - 1), DontEnum | DontDelete);
 266     }
 267     break;
 268   }
 269   case Slice: {
 270     // http://developer.netscape.com/docs/manuals/js/client/jsref/array.htm#1193713 or 15.4.4.10
 271
 272     // We return a new array
 273     JSObject *resObj = static_cast<JSObject *>(exec->lexicalInterpreter()->builtinArray()->construct(exec,List::empty()));
 274     result = resObj;
 275     double begin = 0;
 276     if (!args[0]->isUndefined()) {
 277         begin = args[0]->toInteger(exec);
 278         if (begin >= 0) { // false for NaN
 279             if (begin > length)
 280                 begin = length;
 281         } else {
 282             begin += length;
 283             if (!(begin >= 0)) // true for NaN
 284                 begin = 0;
 285         }
 286     }
 287     double end = length;
 288     if (!args[1]->isUndefined()) {
 289       end = args[1]->toInteger(exec);
 290       if (end < 0) { // false for NaN
 291         end += length;
 292         if (end < 0)
 293           end = 0;
 294       } else {
 295         if (!(end <= length)) // true for NaN
 296           end = length;
 297       }
 298     }
 299
 300     //printf( "Slicing from %d to %d \n", begin, end );
 301     int n = 0;
 302     int b = static_cast<int>(begin);
 303     int e = static_cast<int>(end);
 304     for(int k = b; k < e; k++, n++) {
 305       if (JSValue *v = getProperty(exec, thisObj, k))
 306         resObj->put(exec, n, v);
 307     }
 308     resObj->put(exec, exec->propertyNames().length, jsNumber(n), DontEnum | DontDelete);
 309     break;
 310   }
 311   case Sort:{
 312 #if 0
 313     printf("KJS Array::Sort length=%d\n", length);
 314     for ( unsigned int i = 0 ; i<length ; ++i )
 315       printf("KJS Array::Sort: %d: %s\n", i, thisObj->get(exec, i)->toString(exec).ascii() );
 316 #endif
 317     JSObject *sortFunction = NULL;
 318     if (!args[0]->isUndefined())
 319       {
 320         sortFunction = args[0]->toObject(exec);
 321         if (!sortFunction->implementsCall())
 322           sortFunction = NULL;
 323       }
 324
 325     if (thisObj->classInfo() == &ArrayInstance::info) {
 326       if (sortFunction)
 327         ((ArrayInstance *)thisObj)->sort(exec, sortFunction);
 328       else
 329         ((ArrayInstance *)thisObj)->sort(exec);
 330       result = thisObj;
 331       break;
 332     }
 333
 334     if (length == 0) {
 335       thisObj->put(exec, exec->propertyNames().length, jsNumber(0), DontEnum | DontDelete);
 336       result = thisObj;
 337       break;
 338     }
 339
 340     // "Min" sort. Not the fastest, but definitely less code than heapsort
 341     // or quicksort, and much less swapping than bubblesort/insertionsort.
 342     for ( unsigned int i = 0 ; i<length-1 ; ++i )
 343       {
 344         JSValue *iObj = thisObj->get(exec,i);
 345         unsigned int themin = i;
 346         JSValue *minObj = iObj;
 347         for ( unsigned int j = i+1 ; j<length ; ++j )
 348           {
 349             JSValue *jObj = thisObj->get(exec,j);
 350             double cmp;
 351             if (jObj->isUndefined()) {
 352               cmp = 1; // don't check minObj because there's no need to differentiate == (0) from > (1)
 353             } else if (minObj->isUndefined()) {
 354               cmp = -1;
 355             } else if (sortFunction) {
 356                 List l;
 357                 l.append(jObj);
 358                 l.append(minObj);
 359                 cmp = sortFunction->call(exec, exec->dynamicInterpreter()->globalObject(), l)->toNumber(exec);
 360             } else {
 361               cmp = (jObj->toString(exec) < minObj->toString(exec)) ? -1 : 1;
 362             }
 363             if ( cmp < 0 )
 364               {
 365                 themin = j;
 366                 minObj = jObj;
 367               }
 368           }
 369         // Swap themin and i
 370         if ( themin > i )
 371           {
 372             //printf("KJS Array::Sort: swapping %d and %d\n", i, themin );
 373             thisObj->put( exec, i, minObj );
 374             thisObj->put( exec, themin, iObj );
 375           }
 376       }
 377 #if 0
 378     printf("KJS Array::Sort -- Resulting array:\n");
 379     for ( unsigned int i = 0 ; i<length ; ++i )
 380       printf("KJS Array::Sort: %d: %s\n", i, thisObj->get(exec, i)->toString(exec).ascii() );
 381 #endif
 382     result = thisObj;
 383     break;
 384   }
 385   case Splice: {
 386     // 15.4.4.12 - oh boy this is huge
 387     JSObject *resObj = static_cast<JSObject *>(exec->lexicalInterpreter()->builtinArray()->construct(exec,List::empty()));
 388     result = resObj;
 389     int begin = args[0]->toUInt32(exec);
 390     if ( begin < 0 )
 391       begin = maxInt( begin + length, 0 );
 392     else
 393       begin = minInt( begin, length );
 394     unsigned int deleteCount = minInt( maxInt( args[1]->toUInt32(exec), 0 ), length - begin );
 395
 396     //printf( "Splicing from %d, deleteCount=%d \n", begin, deleteCount );
 397     for(unsigned int k = 0; k < deleteCount; k++) {
 398       if (JSValue *v = getProperty(exec, thisObj, k+begin))
 399         resObj->put(exec, k, v);
 400     }
 401     resObj->put(exec, exec->propertyNames().length, jsNumber(deleteCount), DontEnum | DontDelete);
 402
 403     unsigned int additionalArgs = maxInt( args.size() - 2, 0 );
 404     if ( additionalArgs != deleteCount )
 405     {
 406       if ( additionalArgs < deleteCount )
 407       {
 408         for ( unsigned int k = begin; k < length - deleteCount; ++k )
 409         {
 410           if (JSValue *v = getProperty(exec, thisObj, k+deleteCount))
 411             thisObj->put(exec, k+additionalArgs, v);
 412           else
 413             thisObj->deleteProperty(exec, k+additionalArgs);
 414         }
 415         for ( unsigned int k = length ; k > length - deleteCount + additionalArgs; --k )
 416           thisObj->deleteProperty(exec, k-1);
 417       }
 418       else
 419       {
 420         for ( unsigned int k = length - deleteCount; (int)k > begin; --k )
 421         {
 422           if (JSValue *obj = getProperty(exec, thisObj, k + deleteCount - 1))
 423             thisObj->put(exec, k + additionalArgs - 1, obj);
 424           else
 425             thisObj->deleteProperty(exec, k+additionalArgs-1);
 426         }
 427       }
 428     }
 429     for ( unsigned int k = 0; k < additionalArgs; ++k )
 430     {
 431       thisObj->put(exec, k+begin, args[k+2]);
 432     }
 433     thisObj->put(exec, exec->propertyNames().length, jsNumber(length - deleteCount + additionalArgs), DontEnum | DontDelete);
 434     break;
 435   }
 436   case UnShift: { // 15.4.4.13
 437     unsigned int nrArgs = args.size();
 438     for ( unsigned int k = length; k > 0; --k )
 439     {
 440       if (JSValue *v = getProperty(exec, thisObj, k - 1))
 441         thisObj->put(exec, k+nrArgs-1, v);
 442       else
 443         thisObj->deleteProperty(exec, k+nrArgs-1);
 444     }
 445     for ( unsigned int k = 0; k < nrArgs; ++k )
 446       thisObj->put(exec, k, args[k]);
 447     result = jsNumber(length + nrArgs);
 448     thisObj->put(exec, exec->propertyNames().length, result, DontEnum | DontDelete);
 449     break;
 450   }
 451   case Filter:
 452   case Map: {
 453     JSObject *eachFunction = args[0]->toObject(exec);
 454
 455     if (!eachFunction->implementsCall())
 456       return throwError(exec, TypeError);
 457
 458     JSObject *applyThis = args[1]->isUndefinedOrNull() ? exec->dynamicInterpreter()->globalObject() :  args[1]->toObject(exec);
 459     JSObject *resultArray;
 460
 461     if (id == Filter)
 462       resultArray = static_cast<JSObject *>(exec->lexicalInterpreter()->builtinArray()->construct(exec, List::empty()));
 463     else {
 464       List args;
 465       args.append(jsNumber(length));
 466       resultArray = static_cast<JSObject *>(exec->lexicalInterpreter()->builtinArray()->construct(exec, args));
 467     }
 468
 469     unsigned filterIndex = 0;
 470     for (unsigned k = 0; k < length && !exec->hadException(); ++k) {
 471       PropertySlot slot;
 472
 473       if (!thisObj->getPropertySlot(exec, k, slot))
 474          continue;
 475
 476       JSValue *v = slot.getValue(exec, thisObj, k);
 477
 478       List eachArguments;
 479
 480       eachArguments.append(v);
 481       eachArguments.append(jsNumber(k));
 482       eachArguments.append(thisObj);
 483
 484       JSValue *result = eachFunction->call(exec, applyThis, eachArguments);
 485
 486       if (id == Map)
 487         resultArray->put(exec, k, result);
 488       else if (result->toBoolean(exec))
 489         resultArray->put(exec, filterIndex++, v);
 490     }
 491
 492     return resultArray;
 493   }
 494   case Every:
 495   case ForEach:
 496   case Some: {
 497     //Documentation for these three is available at:
 498     //http://developer-test.mozilla.org/en/docs/Core_JavaScript_1.5_Reference:Objects:Array:every
 499     //http://developer-test.mozilla.org/en/docs/Core_JavaScript_1.5_Reference:Objects:Array:forEach
 500     //http://developer-test.mozilla.org/en/docs/Core_JavaScript_1.5_Reference:Objects:Array:some
 501
 502     JSObject *eachFunction = args[0]->toObject(exec);
 503
 504     if (!eachFunction->implementsCall())
 505       return throwError(exec, TypeError);
 506
 507     JSObject *applyThis = args[1]->isUndefinedOrNull() ? exec->dynamicInterpreter()->globalObject() :  args[1]->toObject(exec);
 508
 509     if (id == Some || id == Every)
 510       result = jsBoolean(id == Every);
 511     else
 512       result = jsUndefined();
 513
 514     for (unsigned k = 0; k < length && !exec->hadException(); ++k) {
 515       PropertySlot slot;
 516
 517       if (!thisObj->getPropertySlot(exec, k, slot))
 518         continue;
 519
 520       List eachArguments;
 521
 522       eachArguments.append(slot.getValue(exec, thisObj, k));
 523       eachArguments.append(jsNumber(k));
 524       eachArguments.append(thisObj);
 525
 526       bool predicateResult = eachFunction->call(exec, applyThis, eachArguments)->toBoolean(exec);
 527
 528       if (id == Every && !predicateResult) {
 529         result = jsBoolean(false);
 530         break;
 531       }
 532       if (id == Some && predicateResult) {
 533         result = jsBoolean(true);
 534         break;
 535       }
 536     }
 537     break;
 538   }
 539
 540   case IndexOf: {
 541     // JavaScript 1.5 Extension by Mozilla
 542     // Documentation: http://developer.mozilla.org/en/docs/Core_JavaScript_1.5_Reference:Global_Objects:Array:indexOf
 543
 544     unsigned index = 0;
 545     double d = args[1]->toInteger(exec);
 546     if (d < 0)
 547         d += length;
 548     if (d > 0) {
 549         if (d > length)
 550             index = length;
 551         else
 552             index = static_cast<unsigned>(d);
 553     }
 554
 555     JSValue* searchElement = args[0];
 556     for (; index < length; ++index) {
 557         JSValue* e = getProperty(exec, thisObj, index);
 558         if (!e)
 559             continue;
 560         if (strictEqual(exec, searchElement, e))
 561             return jsNumber(index);
 562     }
 563
 564     return jsNumber(-1);
 565   }
 566   case LastIndexOf: {
 567        // JavaScript 1.6 Extension by Mozilla
 568       // Documentation: http://developer.mozilla.org/en/docs/Core_JavaScript_1.5_Reference:Global_Objects:Array:lastIndexOf
 569
 570     int index = length - 1;
 571     double d = args[1]->toIntegerPreserveNaN(exec);
 572
 573     if (d < 0) {
 574         d += length;
 575         if (d < 0)
 576             return jsNumber(-1);
 577     }
 578     if (d < length)
 579         index = static_cast<int>(d);
 580
 581     JSValue* searchElement = args[0];
 582     for (; index >= 0; --index) {
 583         JSValue* e = getProperty(exec, thisObj, index);
 584         if (!e)
 585             continue;
 586         if (strictEqual(exec, searchElement, e))
 587             return jsNumber(index);
 588     }
 589
 590     return jsNumber(-1);
 591 }
 592   default:
 593     assert(0);
 594     result = 0;
 595     break;
 596   }
 597   return result;
 598 }
 599
 600 // ------------------------------ ArrayObjectImp -------------------------------
 601
 602 ArrayObjectImp::ArrayObjectImp(ExecState *exec,
 603                                FunctionPrototype *funcProto,
 604                                ArrayPrototype *arrayProto)
 605   : InternalFunctionImp(funcProto)
 606 {
 607   // ECMA 15.4.3.1 Array.prototype
 608   put(exec, exec->propertyNames().prototype, arrayProto, DontEnum|DontDelete|ReadOnly);
 609
 610   // no. of arguments for constructor
 611   put(exec, exec->propertyNames().length, jsNumber(1), ReadOnly|DontDelete|DontEnum);
 612 }
 613
 614 bool ArrayObjectImp::implementsConstruct() const
 615 {
 616   return true;
 617 }
 618
 619 // ECMA 15.4.2
 620 JSObject *ArrayObjectImp::construct(ExecState *exec, const List &args)
 621 {
 622   // a single numeric argument denotes the array size (!)
 623   if (args.size() == 1 && args[0]->isNumber()) {
 624     uint32_t n = args[0]->toUInt32(exec);
 625     if (n != args[0]->toNumber(exec))
 626       return throwError(exec, RangeError, "Array size is not a small enough positive integer.");
 627     return new ArrayInstance(exec->lexicalInterpreter()->builtinArrayPrototype(), n);
 628   }
 629
 630   // otherwise the array is constructed with the arguments in it
 631   return new ArrayInstance(exec->lexicalInterpreter()->builtinArrayPrototype(), args);
 632 }
 633
 634 // ECMA 15.6.1
 635 JSValue *ArrayObjectImp::callAsFunction(ExecState *exec, JSObject * /*thisObj*/, const List &args)
 636 {
 637   // equivalent to 'new Array(....)'
 638   return construct(exec,args);
 639 }
 640
 641 }
 642
 643
 644 // kate: indent-width 4; replace-tabs on; tab-width 4; space-indent on; hl c++;