array.js 37.4 KB
Newer Older
1
// Copyright 2010 the V8 project authors. All rights reserved.
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
//     * Redistributions of source code must retain the above copyright
//       notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above
//       copyright notice, this list of conditions and the following
//       disclaimer in the documentation and/or other materials provided
//       with the distribution.
//     * Neither the name of Google Inc. nor the names of its
//       contributors may be used to endorse or promote products derived
//       from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

// This file relies on the fact that the following declarations have been made
// in runtime.js:
// const $Array = global.Array;

// -------------------------------------------------------------------

// Global list of arrays visited during toString, toLocaleString and
// join invocations.
36
var visited_arrays = new InternalArray();
37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74


// Gets a sorted array of array keys.  Useful for operations on sparse
// arrays.  Dupes have not been removed.
function GetSortedArrayKeys(array, intervals) {
  var length = intervals.length;
  var keys = [];
  for (var k = 0; k < length; k++) {
    var key = intervals[k];
    if (key < 0) {
      var j = -1 - key;
      var limit = j + intervals[++k];
      for (; j < limit; j++) {
        var e = array[j];
        if (!IS_UNDEFINED(e) || j in array) {
          keys.push(j);
        }
      }
    } else {
      // The case where key is undefined also ends here.
      if (!IS_UNDEFINED(key)) {
        var e = array[key];
        if (!IS_UNDEFINED(e) || key in array) {
          keys.push(key);
        }
      }
    }
  }
  keys.sort(function(a, b) { return a - b; });
  return keys;
}


// Optimized for sparse arrays if separator is ''.
function SparseJoin(array, len, convert) {
  var keys = GetSortedArrayKeys(array, %GetArrayKeys(array, len));
  var last_key = -1;
  var keys_length = keys.length;
75

76
  var elements = new InternalArray(keys_length);
77 78
  var elements_length = 0;

79 80 81 82
  for (var i = 0; i < keys_length; i++) {
    var key = keys[i];
    if (key != last_key) {
      var e = array[key];
83 84
      if (!IS_STRING(e)) e = convert(e);
      elements[elements_length++] = e;
85 86 87
      last_key = key;
    }
  }
88
  return %StringBuilderConcat(elements, elements_length, '');
89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107
}


function UseSparseVariant(object, length, is_array) {
   return is_array &&
       length > 1000 &&
       (!%_IsSmi(length) ||
        %EstimateNumberOfElements(object) < (length >> 2));
}


function Join(array, length, separator, convert) {
  if (length == 0) return '';

  var is_array = IS_ARRAY(array);

  if (is_array) {
    // If the array is cyclic, return the empty string for already
    // visited arrays.
108
    if (!%PushIfAbsent(visited_arrays, array)) return '';
109 110 111 112
  }

  // Attempt to convert the elements.
  try {
113
    if (UseSparseVariant(array, length, is_array) && (separator.length == 0)) {
114 115 116
      return SparseJoin(array, length, convert);
    }

117 118 119
    // Fast case for one-element arrays.
    if (length == 1) {
      var e = array[0];
120 121
      if (IS_STRING(e)) return e;
      return convert(e);
122 123
    }

124
    // Construct an array for the elements.
125
    var elements = new InternalArray(length);
126

127 128
    // We pull the empty separator check outside the loop for speed!
    if (separator.length == 0) {
129
      var elements_length = 0;
130 131
      for (var i = 0; i < length; i++) {
        var e = array[i];
132
        if (!IS_UNDEFINED(e)) {
133 134
          if (!IS_STRING(e)) e = convert(e);
          elements[elements_length++] = e;
135 136
        }
      }
137 138 139 140 141
      elements.length = elements_length;
      var result = %_FastAsciiArrayJoin(elements, '');
      if (!IS_UNDEFINED(result)) return result;
      return %StringBuilderConcat(elements, elements_length, '');
    }
142
    // Non-empty separator case.
143
    // If the first element is a number then use the heuristic that the
144 145 146 147
    // remaining elements are also likely to be numbers.
    if (!IS_NUMBER(array[0])) {
      for (var i = 0; i < length; i++) {
        var e = array[i];
148 149
        if (!IS_STRING(e)) e = convert(e);
        elements[i] = e;
150
      }
151
    } else {
152 153 154 155 156 157 158 159
      for (var i = 0; i < length; i++) {
        var e = array[i];
        if (IS_NUMBER(e)) elements[i] = %_NumberToString(e);
        else {
          if (!IS_STRING(e)) e = convert(e);
          elements[i] = e;
        }
      }
160
    }
161
    var result = %_FastAsciiArrayJoin(elements, separator);
162
    if (!IS_UNDEFINED(result)) return result;
163

164
    return %StringBuilderJoin(elements, length, separator);
165
  } finally {
166 167 168
    // Make sure to remove the last element of the visited array no
    // matter what happens.
    if (is_array) visited_arrays.length = visited_arrays.length - 1;
169
  }
170
}
171 172


173
function ConvertToString(x) {
174
  // Assumes x is a non-string.
175 176 177
  if (IS_NUMBER(x)) return %_NumberToString(x);
  if (IS_BOOLEAN(x)) return x ? 'true' : 'false';
  return (IS_NULL_OR_UNDEFINED(x)) ? '' : %ToString(%DefaultString(x));
178
}
179 180 181


function ConvertToLocaleString(e) {
182 183 184 185 186 187 188 189 190 191 192 193
  if (e == null) {
    return '';
  } else {
    // e_obj's toLocaleString might be overwritten, check if it is a function.
    // Call ToString if toLocaleString is not a function.
    // See issue 877615.
    var e_obj = ToObject(e);
    if (IS_FUNCTION(e_obj.toLocaleString))
      return ToString(e_obj.toLocaleString());
    else
      return ToString(e);
  }
194
}
195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236


// This function implements the optimized splice implementation that can use
// special array operations to handle sparse arrays in a sensible fashion.
function SmartSlice(array, start_i, del_count, len, deleted_elements) {
  // Move deleted elements to a new array (the return value from splice).
  // Intervals array can contain keys and intervals.  See comment in Concat.
  var intervals = %GetArrayKeys(array, start_i + del_count);
  var length = intervals.length;
  for (var k = 0; k < length; k++) {
    var key = intervals[k];
    if (key < 0) {
      var j = -1 - key;
      var interval_limit = j + intervals[++k];
      if (j < start_i) {
        j = start_i;
      }
      for (; j < interval_limit; j++) {
        // ECMA-262 15.4.4.12 line 10.  The spec could also be
        // interpreted such that %HasLocalProperty would be the
        // appropriate test.  We follow KJS in consulting the
        // prototype.
        var current = array[j];
        if (!IS_UNDEFINED(current) || j in array) {
          deleted_elements[j - start_i] = current;
        }
      }
    } else {
      if (!IS_UNDEFINED(key)) {
        if (key >= start_i) {
          // ECMA-262 15.4.4.12 line 10.  The spec could also be
          // interpreted such that %HasLocalProperty would be the
          // appropriate test.  We follow KJS in consulting the
          // prototype.
          var current = array[key];
          if (!IS_UNDEFINED(current) || key in array) {
            deleted_elements[key - start_i] = current;
          }
        }
      }
    }
  }
237
}
238 239 240 241 242 243


// This function implements the optimized splice implementation that can use
// special array operations to handle sparse arrays in a sensible fashion.
function SmartMove(array, start_i, del_count, len, num_additional_args) {
  // Move data to new array.
244
  var new_array = new InternalArray(len - del_count + num_additional_args);
245 246 247 248 249 250 251 252 253 254 255 256
  var intervals = %GetArrayKeys(array, len);
  var length = intervals.length;
  for (var k = 0; k < length; k++) {
    var key = intervals[k];
    if (key < 0) {
      var j = -1 - key;
      var interval_limit = j + intervals[++k];
      while (j < start_i && j < interval_limit) {
        // The spec could also be interpreted such that
        // %HasLocalProperty would be the appropriate test.  We follow
        // KJS in consulting the prototype.
        var current = array[j];
257
        if (!IS_UNDEFINED(current) || j in array) {
258
          new_array[j] = current;
259
        }
260 261 262 263 264 265 266 267 268
        j++;
      }
      j = start_i + del_count;
      while (j < interval_limit) {
        // ECMA-262 15.4.4.12 lines 24 and 41.  The spec could also be
        // interpreted such that %HasLocalProperty would be the
        // appropriate test.  We follow KJS in consulting the
        // prototype.
        var current = array[j];
269
        if (!IS_UNDEFINED(current) || j in array) {
270
          new_array[j - del_count + num_additional_args] = current;
271
        }
272 273 274 275 276 277 278 279 280
        j++;
      }
    } else {
      if (!IS_UNDEFINED(key)) {
        if (key < start_i) {
          // The spec could also be interpreted such that
          // %HasLocalProperty would be the appropriate test.  We follow
          // KJS in consulting the prototype.
          var current = array[key];
281
          if (!IS_UNDEFINED(current) || key in array) {
282
            new_array[key] = current;
283
          }
284 285 286 287 288 289
        } else if (key >= start_i + del_count) {
          // ECMA-262 15.4.4.12 lines 24 and 41.  The spec could also
          // be interpreted such that %HasLocalProperty would be the
          // appropriate test.  We follow KJS in consulting the
          // prototype.
          var current = array[key];
290
          if (!IS_UNDEFINED(current) || key in array) {
291
            new_array[key - del_count + num_additional_args] = current;
292
          }
293 294 295 296 297 298
        }
      }
    }
  }
  // Move contents of new_array into this array
  %MoveArrayContents(new_array, array);
299
}
300 301 302 303 304 305 306 307 308 309 310 311 312 313 314


// This is part of the old simple-minded splice.  We are using it either
// because the receiver is not an array (so we have no choice) or because we
// know we are not deleting or moving a lot of elements.
function SimpleSlice(array, start_i, del_count, len, deleted_elements) {
  for (var i = 0; i < del_count; i++) {
    var index = start_i + i;
    // The spec could also be interpreted such that %HasLocalProperty
    // would be the appropriate test.  We follow KJS in consulting the
    // prototype.
    var current = array[index];
    if (!IS_UNDEFINED(current) || index in array)
      deleted_elements[i] = current;
  }
315
}
316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354


function SimpleMove(array, start_i, del_count, len, num_additional_args) {
  if (num_additional_args !== del_count) {
    // Move the existing elements after the elements to be deleted
    // to the right position in the resulting array.
    if (num_additional_args > del_count) {
      for (var i = len - del_count; i > start_i; i--) {
        var from_index = i + del_count - 1;
        var to_index = i + num_additional_args - 1;
        // The spec could also be interpreted such that
        // %HasLocalProperty would be the appropriate test.  We follow
        // KJS in consulting the prototype.
        var current = array[from_index];
        if (!IS_UNDEFINED(current) || from_index in array) {
          array[to_index] = current;
        } else {
          delete array[to_index];
        }
      }
    } else {
      for (var i = start_i; i < len - del_count; i++) {
        var from_index = i + del_count;
        var to_index = i + num_additional_args;
        // The spec could also be interpreted such that
        // %HasLocalProperty would be the appropriate test.  We follow
        // KJS in consulting the prototype.
        var current = array[from_index];
        if (!IS_UNDEFINED(current) || from_index in array) {
          array[to_index] = current;
        } else {
          delete array[to_index];
        }
      }
      for (var i = len; i > len - del_count + num_additional_args; i--) {
        delete array[i - 1];
      }
    }
  }
355
}
356 357 358 359 360 361 362 363 364 365


// -------------------------------------------------------------------


function ArrayToString() {
  if (!IS_ARRAY(this)) {
    throw new $TypeError('Array.prototype.toString is not generic');
  }
  return Join(this, this.length, ',', ConvertToString);
366
}
367 368 369 370 371 372 373


function ArrayToLocaleString() {
  if (!IS_ARRAY(this)) {
    throw new $TypeError('Array.prototype.toString is not generic');
  }
  return Join(this, this.length, ',', ConvertToLocaleString);
374
}
375 376 377


function ArrayJoin(separator) {
378 379 380
  if (IS_UNDEFINED(separator)) {
    separator = ',';
  } else if (!IS_STRING(separator)) {
381
    separator = NonStringToString(separator);
382
  }
383 384

  var result = %_FastAsciiArrayJoin(this, separator);
385
  if (!IS_UNDEFINED(result)) return result;
386

387
  return Join(this, TO_UINT32(this.length), separator, ConvertToString);
388
}
389 390 391 392 393


// Removes the last element from the array and returns it. See
// ECMA-262, section 15.4.4.6.
function ArrayPop() {
394
  var n = TO_UINT32(this.length);
395 396 397 398 399 400 401 402 403
  if (n == 0) {
    this.length = n;
    return;
  }
  n--;
  var value = this[n];
  this.length = n;
  delete this[n];
  return value;
404
}
405 406 407 408 409


// Appends the arguments to the end of the array and returns the new
// length of the array. See ECMA-262, section 15.4.4.7.
function ArrayPush() {
410
  var n = TO_UINT32(this.length);
411 412 413 414 415 416
  var m = %_ArgumentsLength();
  for (var i = 0; i < m; i++) {
    this[i+n] = %_Arguments(i);
  }
  this.length = n + m;
  return this.length;
417
}
418 419 420


function ArrayConcat(arg1) {  // length == 1
421
  var arg_count = %_ArgumentsLength();
422
  var arrays = new InternalArray(1 + arg_count);
423 424 425
  arrays[0] = this;
  for (var i = 0; i < arg_count; i++) {
    arrays[i + 1] = %_Arguments(i);
426 427
  }

428
  return %ArrayConcat(arrays);
429
}
430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476


// For implementing reverse() on large, sparse arrays.
function SparseReverse(array, len) {
  var keys = GetSortedArrayKeys(array, %GetArrayKeys(array, len));
  var high_counter = keys.length - 1;
  var low_counter = 0;
  while (low_counter <= high_counter) {
    var i = keys[low_counter];
    var j = keys[high_counter];

    var j_complement = len - j - 1;
    var low, high;

    if (j_complement <= i) {
      high = j;
      while (keys[--high_counter] == j);
      low = j_complement;
    }
    if (j_complement >= i) {
      low = i;
      while (keys[++low_counter] == i);
      high = len - i - 1;
    }

    var current_i = array[low];
    if (!IS_UNDEFINED(current_i) || low in array) {
      var current_j = array[high];
      if (!IS_UNDEFINED(current_j) || high in array) {
        array[low] = current_j;
        array[high] = current_i;
      } else {
        array[high] = current_i;
        delete array[low];
      }
    } else {
      var current_j = array[high];
      if (!IS_UNDEFINED(current_j) || high in array) {
        array[low] = current_j;
        delete array[high];
      }
    }
  }
}


function ArrayReverse() {
477
  var j = TO_UINT32(this.length) - 1;
478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503

  if (UseSparseVariant(this, j, IS_ARRAY(this))) {
    SparseReverse(this, j+1);
    return this;
  }

  for (var i = 0; i < j; i++, j--) {
    var current_i = this[i];
    if (!IS_UNDEFINED(current_i) || i in this) {
      var current_j = this[j];
      if (!IS_UNDEFINED(current_j) || j in this) {
        this[i] = current_j;
        this[j] = current_i;
      } else {
        this[j] = current_i;
        delete this[i];
      }
    } else {
      var current_j = this[j];
      if (!IS_UNDEFINED(current_j) || j in this) {
        this[i] = current_j;
        delete this[j];
      }
    }
  }
  return this;
504
}
505 506 507


function ArrayShift() {
508
  var len = TO_UINT32(this.length);
509

510 511 512 513
  if (len === 0) {
    this.length = 0;
    return;
  }
514

515
  var first = this[0];
516

517 518 519 520
  if (IS_ARRAY(this))
    SmartMove(this, 0, 1, len, 0);
  else
    SimpleMove(this, 0, 1, len, 0);
521

522
  this.length = len - 1;
523

524
  return first;
525
}
526 527 528


function ArrayUnshift(arg1) {  // length == 1
529
  var len = TO_UINT32(this.length);
530
  var num_arguments = %_ArgumentsLength();
531

532 533 534 535
  if (IS_ARRAY(this))
    SmartMove(this, 0, 0, len, num_arguments);
  else
    SimpleMove(this, 0, 0, len, num_arguments);
536

537 538 539
  for (var i = 0; i < num_arguments; i++) {
    this[i] = %_Arguments(i);
  }
540

541
  this.length = len + num_arguments;
542

543
  return len + num_arguments;
544
}
545 546 547


function ArraySlice(start, end) {
548
  var len = TO_UINT32(this.length);
549 550
  var start_i = TO_INTEGER(start);
  var end_i = len;
551

552
  if (end !== void 0) end_i = TO_INTEGER(end);
553

554 555 556 557 558 559
  if (start_i < 0) {
    start_i += len;
    if (start_i < 0) start_i = 0;
  } else {
    if (start_i > len) start_i = len;
  }
560

561 562 563 564 565 566
  if (end_i < 0) {
    end_i += len;
    if (end_i < 0) end_i = 0;
  } else {
    if (end_i > len) end_i = len;
  }
567

568
  var result = [];
569 570 571 572

  if (end_i < start_i) return result;

  if (IS_ARRAY(this)) {
573
    SmartSlice(this, start_i, end_i - start_i, len, result);
574
  } else {
575
    SimpleSlice(this, start_i, end_i - start_i, len, result);
576 577
  }

578
  result.length = end_i - start_i;
579

580
  return result;
581
}
582 583 584 585


function ArraySplice(start, delete_count) {
  var num_arguments = %_ArgumentsLength();
586

587
  var len = TO_UINT32(this.length);
588
  var start_i = TO_INTEGER(start);
589

590 591 592 593 594 595
  if (start_i < 0) {
    start_i += len;
    if (start_i < 0) start_i = 0;
  } else {
    if (start_i > len) start_i = len;
  }
596

597
  // SpiderMonkey, TraceMonkey and JSC treat the case where no delete count is
598 599
  // given as a request to delete all the elements from the start.
  // And it differs from the case of undefined delete count.
600 601 602
  // This does not follow ECMA-262, but we do the same for
  // compatibility.
  var del_count = 0;
603 604 605
  if (num_arguments == 1) {
    del_count = len - start_i;
  } else {
606 607 608 609
    del_count = TO_INTEGER(delete_count);
    if (del_count < 0) del_count = 0;
    if (del_count > len - start_i) del_count = len - start_i;
  }
610

611 612
  var deleted_elements = [];
  deleted_elements.length = del_count;
613

614 615 616 617 618
  // Number of elements to add.
  var num_additional_args = 0;
  if (num_arguments > 2) {
    num_additional_args = num_arguments - 2;
  }
619

620
  var use_simple_splice = true;
621

622 623 624 625 626 627 628 629 630
  if (IS_ARRAY(this) && num_additional_args !== del_count) {
    // If we are only deleting/moving a few things near the end of the
    // array then the simple version is going to be faster, because it
    // doesn't touch most of the array.
    var estimated_non_hole_elements = %EstimateNumberOfElements(this);
    if (len > 20 && (estimated_non_hole_elements >> 2) < (len - start_i)) {
      use_simple_splice = false;
    }
  }
631

632 633 634 635 636 637 638
  if (use_simple_splice) {
    SimpleSlice(this, start_i, del_count, len, deleted_elements);
    SimpleMove(this, start_i, del_count, len, num_additional_args);
  } else {
    SmartSlice(this, start_i, del_count, len, deleted_elements);
    SmartMove(this, start_i, del_count, len, num_additional_args);
  }
639

640 641 642 643 644 645 646 647 648
  // Insert the arguments into the resulting array in
  // place of the deleted elements.
  var i = start_i;
  var arguments_index = 2;
  var arguments_length = %_ArgumentsLength();
  while (arguments_index < arguments_length) {
    this[i++] = %_Arguments(arguments_index++);
  }
  this.length = len - del_count + num_additional_args;
649

650 651
  // Return the deleted elements.
  return deleted_elements;
652
}
653 654 655


function ArraySort(comparefn) {
olehougaard's avatar
olehougaard committed
656
  // In-place QuickSort algorithm.
olehougaard's avatar
olehougaard committed
657
  // For short (length <= 22) arrays, insertion sort is used for efficiency.
658

659 660 661 662 663
  if (!IS_FUNCTION(comparefn)) {
    comparefn = function (x, y) {
      if (x === y) return 0;
      if (%_IsSmi(x) && %_IsSmi(y)) {
        return %SmiLexicographicCompare(x, y);
664
      }
665 666 667 668 669
      x = ToString(x);
      y = ToString(y);
      if (x == y) return 0;
      else return x < y ? -1 : 1;
    };
670
  }
671
  var global_receiver = %GetGlobalReceiver();
672

olehougaard's avatar
olehougaard committed
673 674 675
  function InsertionSort(a, from, to) {
    for (var i = from + 1; i < to; i++) {
      var element = a[i];
676 677
      for (var j = i - 1; j >= from; j--) {
        var tmp = a[j];
678
        var order = %_CallFunction(global_receiver, tmp, element, comparefn);
679 680
        if (order > 0) {
          a[j + 1] = tmp;
olehougaard's avatar
olehougaard committed
681
        } else {
682
          break;
olehougaard's avatar
olehougaard committed
683 684
        }
      }
685
      a[j + 1] = element;
olehougaard's avatar
olehougaard committed
686 687
    }
  }
688

689
  function QuickSort(a, from, to) {
olehougaard's avatar
olehougaard committed
690
    // Insertion sort is faster for short arrays.
691
    if (to - from <= 10) {
olehougaard's avatar
olehougaard committed
692 693 694
      InsertionSort(a, from, to);
      return;
    }
695 696 697 698 699
    // Find a pivot as the median of first, last and middle element.
    var v0 = a[from];
    var v1 = a[to - 1];
    var middle_index = from + ((to - from) >> 1);
    var v2 = a[middle_index];
700
    var c01 = %_CallFunction(global_receiver, v0, v1, comparefn);
701 702 703 704 705 706
    if (c01 > 0) {
      // v1 < v0, so swap them.
      var tmp = v0;
      v0 = v1;
      v1 = tmp;
    } // v0 <= v1.
707
    var c02 = %_CallFunction(global_receiver, v0, v2, comparefn);
708 709 710 711 712 713 714 715
    if (c02 >= 0) {
      // v2 <= v0 <= v1.
      var tmp = v0;
      v0 = v2;
      v2 = v1;
      v1 = tmp;
    } else {
      // v0 <= v1 && v0 < v2
716
      var c12 = %_CallFunction(global_receiver, v1, v2, comparefn);
717 718 719 720 721 722 723 724 725 726 727
      if (c12 > 0) {
        // v0 <= v2 < v1
        var tmp = v1;
        v1 = v2;
        v2 = tmp;
      }
    }
    // v0 <= v1 <= v2
    a[from] = v0;
    a[to - 1] = v2;
    var pivot = v1;
728 729
    var low_end = from + 1;   // Upper bound of elements lower than pivot.
    var high_start = to - 1;  // Lower bound of elements greater than pivot.
730 731 732
    a[middle_index] = a[low_end];
    a[low_end] = pivot;

733 734
    // From low_end to i are elements equal to pivot.
    // From i to high_start are elements that haven't been compared yet.
735
    partition: for (var i = low_end + 1; i < high_start; i++) {
736
      var element = a[i];
737
      var order = %_CallFunction(global_receiver, element, pivot, comparefn);
olehougaard's avatar
olehougaard committed
738
      if (order < 0) {
739
        %_SwapElements(a, i, low_end);
olehougaard's avatar
olehougaard committed
740 741
        low_end++;
      } else if (order > 0) {
742 743 744 745 746 747
        do {
          high_start--;
          if (high_start == i) break partition;
          var top_elem = a[high_start];
          order = %_CallFunction(global_receiver, top_elem, pivot, comparefn);
        } while (order > 0);
748
        %_SwapElements(a, i, high_start);
749 750 751 752
        if (order < 0) {
          %_SwapElements(a, i, low_end);
          low_end++;
        }
753 754
      }
    }
olehougaard's avatar
olehougaard committed
755 756
    QuickSort(a, from, low_end);
    QuickSort(a, high_start, to);
757 758
  }

759 760
  // Copy elements in the range 0..length from obj's prototype chain
  // to obj itself, if obj has holes. Return one more than the maximal index
761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818
  // of a prototype property.
  function CopyFromPrototype(obj, length) {
    var max = 0;
    for (var proto = obj.__proto__; proto; proto = proto.__proto__) {
      var indices = %GetArrayKeys(proto, length);
      if (indices.length > 0) {
        if (indices[0] == -1) {
          // It's an interval.
          var proto_length = indices[1];
          for (var i = 0; i < proto_length; i++) {
            if (!obj.hasOwnProperty(i) && proto.hasOwnProperty(i)) {
              obj[i] = proto[i];
              if (i >= max) { max = i + 1; }
            }
          }
        } else {
          for (var i = 0; i < indices.length; i++) {
            var index = indices[i];
            if (!IS_UNDEFINED(index) &&
                !obj.hasOwnProperty(index) && proto.hasOwnProperty(index)) {
              obj[index] = proto[index];
              if (index >= max) { max = index + 1; }
            }
          }
        }
      }
    }
    return max;
  }

  // Set a value of "undefined" on all indices in the range from..to
  // where a prototype of obj has an element. I.e., shadow all prototype
  // elements in that range.
  function ShadowPrototypeElements(obj, from, to) {
    for (var proto = obj.__proto__; proto; proto = proto.__proto__) {
      var indices = %GetArrayKeys(proto, to);
      if (indices.length > 0) {
        if (indices[0] == -1) {
          // It's an interval.
          var proto_length = indices[1];
          for (var i = from; i < proto_length; i++) {
            if (proto.hasOwnProperty(i)) {
              obj[i] = void 0;
            }
          }
        } else {
          for (var i = 0; i < indices.length; i++) {
            var index = indices[i];
            if (!IS_UNDEFINED(index) && from <= index &&
                proto.hasOwnProperty(index)) {
              obj[index] = void 0;
            }
          }
        }
      }
    }
  }

819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875
  function SafeRemoveArrayHoles(obj) {
    // Copy defined elements from the end to fill in all holes and undefineds
    // in the beginning of the array.  Write undefineds and holes at the end
    // after loop is finished.
    var first_undefined = 0;
    var last_defined = length - 1;
    var num_holes = 0;
    while (first_undefined < last_defined) {
      // Find first undefined element.
      while (first_undefined < last_defined &&
             !IS_UNDEFINED(obj[first_undefined])) {
        first_undefined++;
      }
      // Maintain the invariant num_holes = the number of holes in the original
      // array with indices <= first_undefined or > last_defined.
      if (!obj.hasOwnProperty(first_undefined)) {
        num_holes++;
      }

      // Find last defined element.
      while (first_undefined < last_defined &&
             IS_UNDEFINED(obj[last_defined])) {
        if (!obj.hasOwnProperty(last_defined)) {
          num_holes++;
        }
        last_defined--;
      }
      if (first_undefined < last_defined) {
        // Fill in hole or undefined.
        obj[first_undefined] = obj[last_defined];
        obj[last_defined] = void 0;
      }
    }
    // If there were any undefineds in the entire array, first_undefined
    // points to one past the last defined element.  Make this true if
    // there were no undefineds, as well, so that first_undefined == number
    // of defined elements.
    if (!IS_UNDEFINED(obj[first_undefined])) first_undefined++;
    // Fill in the undefineds and the holes.  There may be a hole where
    // an undefined should be and vice versa.
    var i;
    for (i = first_undefined; i < length - num_holes; i++) {
      obj[i] = void 0;
    }
    for (i = length - num_holes; i < length; i++) {
      // For compatability with Webkit, do not expose elements in the prototype.
      if (i in obj.__proto__) {
        obj[i] = void 0;
      } else {
        delete obj[i];
      }
    }

    // Return the number of defined elements.
    return first_undefined;
  }

876
  var length = TO_UINT32(this.length);
877
  if (length < 2) return this;
878

879 880 881 882 883 884 885 886 887 888 889 890 891 892
  var is_array = IS_ARRAY(this);
  var max_prototype_element;
  if (!is_array) {
    // For compatibility with JSC, we also sort elements inherited from
    // the prototype chain on non-Array objects.
    // We do this by copying them to this object and sorting only
    // local elements. This is not very efficient, but sorting with
    // inherited elements happens very, very rarely, if at all.
    // The specification allows "implementation dependent" behavior
    // if an element on the prototype chain has an element that
    // might interact with sorting.
    max_prototype_element = CopyFromPrototype(this, length);
  }

893
  var num_non_undefined = %RemoveArrayHoles(this, length);
894 895 896 897 898 899
  if (num_non_undefined == -1) {
    // There were indexed accessors in the array.  Move array holes and
    // undefineds to the end using a Javascript function that is safe
    // in the presence of accessors.
    num_non_undefined = SafeRemoveArrayHoles(this);
  }
900

901
  QuickSort(this, 0, num_non_undefined);
902

903 904 905 906 907 908
  if (!is_array && (num_non_undefined + 1 < max_prototype_element)) {
    // For compatibility with JSC, we shadow any elements in the prototype
    // chain that has become exposed by sort moving a hole to its position.
    ShadowPrototypeElements(this, num_non_undefined, max_prototype_element);
  }

909
  return this;
910
}
911 912 913 914 915 916 917 918 919 920 921 922 923


// The following functions cannot be made efficient on sparse arrays while
// preserving the semantics, since the calls to the receiver function can add
// or delete elements from the array.
function ArrayFilter(f, receiver) {
  if (!IS_FUNCTION(f)) {
    throw MakeTypeError('called_non_callable', [ f ]);
  }
  // Pull out the length so that modifications to the length in the
  // loop will not affect the looping.
  var length = this.length;
  var result = [];
924
  var result_length = 0;
925 926 927
  for (var i = 0; i < length; i++) {
    var current = this[i];
    if (!IS_UNDEFINED(current) || i in this) {
928
      if (f.call(receiver, current, i, this)) {
929 930
        result[result_length++] = current;
      }
931 932 933
    }
  }
  return result;
934
}
935 936 937 938 939 940 941 942


function ArrayForEach(f, receiver) {
  if (!IS_FUNCTION(f)) {
    throw MakeTypeError('called_non_callable', [ f ]);
  }
  // Pull out the length so that modifications to the length in the
  // loop will not affect the looping.
943
  var length =  TO_UINT32(this.length);
944 945 946
  for (var i = 0; i < length; i++) {
    var current = this[i];
    if (!IS_UNDEFINED(current) || i in this) {
947
      f.call(receiver, current, i, this);
948 949
    }
  }
950
}
951 952 953 954 955 956 957 958 959 960


// Executes the function once for each element present in the
// array until it finds one where callback returns true.
function ArraySome(f, receiver) {
  if (!IS_FUNCTION(f)) {
    throw MakeTypeError('called_non_callable', [ f ]);
  }
  // Pull out the length so that modifications to the length in the
  // loop will not affect the looping.
961
  var length = TO_UINT32(this.length);
962 963 964
  for (var i = 0; i < length; i++) {
    var current = this[i];
    if (!IS_UNDEFINED(current) || i in this) {
965
      if (f.call(receiver, current, i, this)) return true;
966 967 968
    }
  }
  return false;
969
}
970 971 972 973 974 975 976 977


function ArrayEvery(f, receiver) {
  if (!IS_FUNCTION(f)) {
    throw MakeTypeError('called_non_callable', [ f ]);
  }
  // Pull out the length so that modifications to the length in the
  // loop will not affect the looping.
978
  var length = TO_UINT32(this.length);
979 980 981
  for (var i = 0; i < length; i++) {
    var current = this[i];
    if (!IS_UNDEFINED(current) || i in this) {
982
      if (!f.call(receiver, current, i, this)) return false;
983 984 985
    }
  }
  return true;
986
}
987 988 989 990 991 992 993

function ArrayMap(f, receiver) {
  if (!IS_FUNCTION(f)) {
    throw MakeTypeError('called_non_callable', [ f ]);
  }
  // Pull out the length so that modifications to the length in the
  // loop will not affect the looping.
994
  var length = TO_UINT32(this.length);
995 996
  var result = new $Array();
  var accumulator = new InternalArray(length);
997 998 999
  for (var i = 0; i < length; i++) {
    var current = this[i];
    if (!IS_UNDEFINED(current) || i in this) {
1000
      accumulator[i] = f.call(receiver, current, i, this);
1001 1002
    }
  }
1003
  %MoveArrayContents(accumulator, result);
1004
  return result;
1005
}
1006 1007 1008


function ArrayIndexOf(element, index) {
1009 1010
  var length = TO_UINT32(this.length);
  if (length == 0) return -1;
1011
  if (IS_UNDEFINED(index)) {
1012 1013 1014 1015
    index = 0;
  } else {
    index = TO_INTEGER(index);
    // If index is negative, index from the end of the array.
1016 1017 1018 1019 1020
    if (index < 0) {
      index = length + index;
      // If index is still negative, search the entire array.
      if (index < 0) index = 0;
    }
1021
  }
1022 1023
  var min = index;
  var max = length;
lrn@chromium.org's avatar
lrn@chromium.org committed
1024
  if (UseSparseVariant(this, length, IS_ARRAY(this))) {
1025 1026 1027 1028 1029
    var intervals = %GetArrayKeys(this, length);
    if (intervals.length == 2 && intervals[0] < 0) {
      // A single interval.
      var intervalMin = -(intervals[0] + 1);
      var intervalMax = intervalMin + intervals[1];
lrn@chromium.org's avatar
lrn@chromium.org committed
1030
      if (min < intervalMin) min = intervalMin;
1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047
      max = intervalMax;  // Capped by length already.
      // Fall through to loop below.
    } else {
      if (intervals.length == 0) return -1;
      // Get all the keys in sorted order.
      var sortedKeys = GetSortedArrayKeys(this, intervals);
      var n = sortedKeys.length;
      var i = 0;
      while (i < n && sortedKeys[i] < index) i++;
      while (i < n) {
        var key = sortedKeys[i];
        if (!IS_UNDEFINED(key) && this[key] === element) return key;
        i++;
      }
      return -1;
    }
  }
1048
  // Lookup through the array.
1049
  if (!IS_UNDEFINED(element)) {
1050
    for (var i = min; i < max; i++) {
1051 1052 1053 1054
      if (this[i] === element) return i;
    }
    return -1;
  }
1055 1056
  // Lookup through the array.
  for (var i = min; i < max; i++) {
1057 1058
    if (IS_UNDEFINED(this[i]) && i in this) {
      return i;
1059 1060 1061
    }
  }
  return -1;
1062
}
1063 1064 1065


function ArrayLastIndexOf(element, index) {
1066 1067
  var length = TO_UINT32(this.length);
  if (length == 0) return -1;
1068
  if (%_ArgumentsLength() < 2) {
1069 1070 1071 1072
    index = length - 1;
  } else {
    index = TO_INTEGER(index);
    // If index is negative, index from end of the array.
1073
    if (index < 0) index += length;
1074
    // If index is still negative, do not search the array.
1075
    if (index < 0) return -1;
1076 1077
    else if (index >= length) index = length - 1;
  }
1078 1079
  var min = 0;
  var max = index;
lrn@chromium.org's avatar
lrn@chromium.org committed
1080
  if (UseSparseVariant(this, length, IS_ARRAY(this))) {
1081 1082 1083 1084 1085
    var intervals = %GetArrayKeys(this, index + 1);
    if (intervals.length == 2 && intervals[0] < 0) {
      // A single interval.
      var intervalMin = -(intervals[0] + 1);
      var intervalMax = intervalMin + intervals[1];
lrn@chromium.org's avatar
lrn@chromium.org committed
1086
      if (min < intervalMin) min = intervalMin;
1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101
      max = intervalMax;  // Capped by index already.
      // Fall through to loop below.
    } else {
      if (intervals.length == 0) return -1;
      // Get all the keys in sorted order.
      var sortedKeys = GetSortedArrayKeys(this, intervals);
      var i = sortedKeys.length - 1;
      while (i >= 0) {
        var key = sortedKeys[i];
        if (!IS_UNDEFINED(key) && this[key] === element) return key;
        i--;
      }
      return -1;
    }
  }
1102
  // Lookup through the array.
1103
  if (!IS_UNDEFINED(element)) {
1104
    for (var i = max; i >= min; i--) {
1105 1106 1107 1108
      if (this[i] === element) return i;
    }
    return -1;
  }
1109
  for (var i = max; i >= min; i--) {
1110 1111
    if (IS_UNDEFINED(this[i]) && i in this) {
      return i;
1112 1113 1114
    }
  }
  return -1;
1115
}
1116 1117


1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140
function ArrayReduce(callback, current) {
  if (!IS_FUNCTION(callback)) {
    throw MakeTypeError('called_non_callable', [callback]);
  }
  // Pull out the length so that modifications to the length in the
  // loop will not affect the looping.
  var length = this.length;
  var i = 0;

  find_initial: if (%_ArgumentsLength() < 2) {
    for (; i < length; i++) {
      current = this[i];
      if (!IS_UNDEFINED(current) || i in this) {
        i++;
        break find_initial;
      }
    }
    throw MakeTypeError('reduce_no_initial', []);
  }

  for (; i < length; i++) {
    var element = this[i];
    if (!IS_UNDEFINED(element) || i in this) {
1141
      current = callback.call(null, current, element, i, this);
1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166
    }
  }
  return current;
}

function ArrayReduceRight(callback, current) {
  if (!IS_FUNCTION(callback)) {
    throw MakeTypeError('called_non_callable', [callback]);
  }
  var i = this.length - 1;

  find_initial: if (%_ArgumentsLength() < 2) {
    for (; i >= 0; i--) {
      current = this[i];
      if (!IS_UNDEFINED(current) || i in this) {
        i--;
        break find_initial;
      }
    }
    throw MakeTypeError('reduce_no_initial', []);
  }

  for (; i >= 0; i--) {
    var element = this[i];
    if (!IS_UNDEFINED(element) || i in this) {
1167
      current = callback.call(null, current, element, i, this);
1168 1169 1170 1171 1172
    }
  }
  return current;
}

1173 1174 1175 1176
// ES5, 15.4.3.2
function ArrayIsArray(obj) {
  return IS_ARRAY(obj);
}
1177

1178 1179 1180

// -------------------------------------------------------------------
function SetupArray() {
1181 1182
  // Setup non-enumerable constructor property on the Array.prototype
  // object.
1183
  %SetProperty($Array.prototype, "constructor", $Array, DONT_ENUM);
1184

1185 1186 1187 1188 1189
  // Setup non-enumerable functions on the Array object.
  InstallFunctions($Array, DONT_ENUM, $Array(
    "isArray", ArrayIsArray
  ));

1190 1191 1192 1193 1194 1195 1196
  var specialFunctions = %SpecialArrayFunctions({});

  function getFunction(name, jsBuiltin, len) {
    var f = jsBuiltin;
    if (specialFunctions.hasOwnProperty(name)) {
      f = specialFunctions[name];
    }
1197
    if (!IS_UNDEFINED(len)) {
1198 1199 1200 1201 1202
      %FunctionSetLength(f, len);
    }
    return f;
  }

1203 1204
  // Setup non-enumerable functions of the Array.prototype object and
  // set their names.
1205 1206
  // Manipulate the length of some of the functions to meet
  // expectations set by ECMA-262 or Mozilla.
1207
  InstallFunctionsOnHiddenPrototype($Array.prototype, DONT_ENUM, $Array(
1208 1209 1210 1211 1212
    "toString", getFunction("toString", ArrayToString),
    "toLocaleString", getFunction("toLocaleString", ArrayToLocaleString),
    "join", getFunction("join", ArrayJoin),
    "pop", getFunction("pop", ArrayPop),
    "push", getFunction("push", ArrayPush, 1),
1213
    "concat", getFunction("concat", ArrayConcat, 1),
1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228
    "reverse", getFunction("reverse", ArrayReverse),
    "shift", getFunction("shift", ArrayShift),
    "unshift", getFunction("unshift", ArrayUnshift, 1),
    "slice", getFunction("slice", ArraySlice, 2),
    "splice", getFunction("splice", ArraySplice, 2),
    "sort", getFunction("sort", ArraySort),
    "filter", getFunction("filter", ArrayFilter, 1),
    "forEach", getFunction("forEach", ArrayForEach, 1),
    "some", getFunction("some", ArraySome, 1),
    "every", getFunction("every", ArrayEvery, 1),
    "map", getFunction("map", ArrayMap, 1),
    "indexOf", getFunction("indexOf", ArrayIndexOf, 1),
    "lastIndexOf", getFunction("lastIndexOf", ArrayLastIndexOf, 1),
    "reduce", getFunction("reduce", ArrayReduce, 1),
    "reduceRight", getFunction("reduceRight", ArrayReduceRight, 1)
1229
  ));
1230

1231
  %FinishArrayPrototypeSetup($Array.prototype);
1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245

  // The internal Array prototype doesn't need to be fancy, since it's never
  // exposed to user code, so no hidden prototypes or DONT_ENUM attributes
  // are necessary.
  // The null __proto__ ensures that we never inherit any user created
  // getters or setters from, e.g., Object.prototype.
  InternalArray.prototype.__proto__ = null;
  // Adding only the functions that are actually used, and a toString.
  InternalArray.prototype.join = getFunction("join", ArrayJoin);
  InternalArray.prototype.pop = getFunction("pop", ArrayPop);
  InternalArray.prototype.push = getFunction("push", ArrayPush);
  InternalArray.prototype.toString = function() {
    return "Internal Array, length " + this.length;
  };
1246
}
1247 1248 1249


SetupArray();