therubyracer 0.4.8-x86-darwin-10 → 0.4.9-x86-darwin-10

data/ext/v8/upstream/2.0.6/test/mjsunit/array-sort.js

@@ -1,362 +0,0 @@
-// Copyright 2008 the V8 project authors. All rights reserved.
-// 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.
-
-// Flags: --allow-natives-syntax
-
-// Test array sort.
-
-// Test counter-intuitive default number sorting.
-function TestNumberSort() {
-  var a = [ 200, 45, 7 ];
-
-  // Default sort converts each element to string and orders
-  // lexicographically.
-  a.sort();
-  assertArrayEquals([ 200, 45, 7 ], a);
-  // Sort numbers by value using a compare functions.
-  a.sort(function(x, y) { return x - y; });
-  assertArrayEquals([ 7, 45, 200 ], a);
-
-  // Default sort on negative numbers.
-  a = [-12345,-123,-1234,-123456];
-  a.sort();
-  assertArrayEquals([-123,-1234,-12345,-123456], a);
-
-  // Default sort on negative and non-negative numbers.
-  a = [123456,0,-12345,-123,123,1234,-1234,0,12345,-123456];
-  a.sort();
-  assertArrayEquals([-123,-1234,-12345,-123456,0,0,123,1234,12345,123456], a);
-
-  // Tricky case avoiding integer overflow in Runtime_SmiLexicographicCompare.
-  a = [9, 1000000000].sort();
-  assertArrayEquals([1000000000, 9], a);
-  a = [1000000000, 1].sort();
-  assertArrayEquals([1, 1000000000], a);
-  a = [1000000000, 0].sort();
-  assertArrayEquals([0, 1000000000], a);
-
-  // One string is a prefix of the other.
-  a = [1230, 123].sort();
-  assertArrayEquals([123, 1230], a);
-  a = [1231, 123].sort();
-  assertArrayEquals([123, 1231], a);
-
-  // Default sort on Smis and non-Smis.
-  a = [1000000000, 10000000000, 1000000001, -1000000000, -10000000000, -1000000001];
-  a.sort();
-  assertArrayEquals([-1000000000, -10000000000, -1000000001, 1000000000, 10000000000, 1000000001], a);
-
-
-  for (var xb = 1; xb <= 1000 * 1000 * 1000; xb *= 10) {
-    for (var xf = 0; xf <= 9; xf++) {
-      for (var xo = -1; xo <= 1; xo++) {
-        for (var yb = 1; yb <= 1000 * 1000 * 1000; yb *= 10) {
-          for (var yf = 0; yf <= 9; yf++) {
-            for (var yo = -1; yo <= 1; yo++) {
-              var x = xb * xf + xo;
-              var y = yb * yf + yo;
-              if (!%_IsSmi(x)) continue;
-              if (!%_IsSmi(y)) continue;
-              var lex = %SmiLexicographicCompare(x, y);
-              if (lex < 0) lex = -1;
-              if (lex > 0) lex = 1;
-              assertEquals(lex, (x == y) ? 0 : ((x + "") < (y + "") ? -1 : 1), x + " < " + y);
-            }
-          }
-        }
-      }
-    }
-  }
-}
-
-TestNumberSort();
-
-
-// Test lexicographical string sorting.
-function TestStringSort() {
-  var a = [ "cc", "c", "aa", "a", "bb", "b", "ab", "ac" ];
-  a.sort();
-  assertArrayEquals([ "a", "aa", "ab", "ac", "b", "bb", "c", "cc" ], a);
-}
-
-TestStringSort();
-
-
-// Test object sorting.  Calls toString on each element and sorts
-// lexicographically.
-function TestObjectSort() {
-  var obj0 = { toString: function() { return "a"; } };
-  var obj1 = { toString: function() { return "b"; } };
-  var obj2 = { toString: function() { return "c"; } };
-  var a = [ obj2, obj0, obj1 ];
-  a.sort();
-  assertArrayEquals([ obj0, obj1, obj2 ], a);
-}
-
-TestObjectSort();
-
-// Test array sorting with holes in the array.
-function TestArraySortingWithHoles() {
-  var a = [];
-  a[4] = "18";
-  a[10] = "12";
-  a.sort();
-  assertEquals(11, a.length);
-  assertEquals("12", a[0]);
-  assertEquals("18", a[1]);
-}
-
-TestArraySortingWithHoles();
-
-// Test array sorting with undefined elemeents in the array.
-function TestArraySortingWithUndefined() {
-  var a = [ 3, void 0, 2 ];
-  a.sort();
-  assertArrayEquals([ 2, 3, void 0 ], a);
-}
-
-TestArraySortingWithUndefined();
-
-// Test that sorting using an unsound comparison function still gives a
-// sane result, i.e. it terminates without error and retains the elements
-// in the array.
-function TestArraySortingWithUnsoundComparisonFunction() {
-  var a = [ 3, void 0, 2 ];
-  a.sort(function(x, y) { return 1; });
-  a.sort();
-  assertArrayEquals([ 2, 3, void 0 ], a);
-}
-
-TestArraySortingWithUnsoundComparisonFunction();
-
-
-function TestSparseNonArraySorting(length) {
-  assertTrue(length > 101);
-  var obj = {length: length};
-  obj[0] = 42;
-  obj[10] = 37;
-  obj[100] = undefined;
-  obj[length - 1] = null;
-  Array.prototype.sort.call(obj);
-  assertEquals(length, obj.length, "objsort length unaffected");
-  assertEquals(37, obj[0], "objsort smallest number");
-  assertEquals(42, obj[1], "objsort largest number");
-  assertEquals(null, obj[2], "objsort null");
-  assertEquals(undefined, obj[3], "objsort undefined");
-  assertTrue(3 in obj, "objsort undefined retained");
-  assertFalse(4 in obj, "objsort non-existing retained");
-}
-
-TestSparseNonArraySorting(5000);
-TestSparseNonArraySorting(500000);
-TestSparseNonArraySorting(Math.pow(2, 31) + 1);
-
-
-function TestArrayLongerLength(length) {
-  var x = new Array(4);
-  x[0] = 42;
-  x[2] = 37;
-  x.length = length;
-  Array.prototype.sort.call(x);
-  assertEquals(length, x.length, "longlength length");
-  assertEquals(37, x[0], "longlength first");
-  assertEquals(42, x[1], "longlength second");
-  assertFalse(2 in x,"longlength third");
-}
-
-TestArrayLongerLength(4);
-TestArrayLongerLength(10);
-TestArrayLongerLength(1000);
-TestArrayLongerLength(500000);
-TestArrayLongerLength(Math.pow(2,32) - 1);
-
-
-function TestNonArrayLongerLength(length) {
-  var x = {};
-  x[0] = 42;
-  x[2] = 37;
-  x.length = length;
-  Array.prototype.sort.call(x);
-  assertEquals(length, x.length, "longlength length");
-  assertEquals(37, x[0], "longlength first");
-  assertEquals(42, x[1], "longlength second");
-  assertFalse(2 in x,"longlength third");
-}
-
-TestNonArrayLongerLength(4);
-TestNonArrayLongerLength(10);
-TestNonArrayLongerLength(1000);
-TestNonArrayLongerLength(500000);
-TestNonArrayLongerLength(Math.pow(2,32) - 1);
-
-
-function TestNonArrayWithAccessors() {
-  // Regression test for issue 346, more info at URL
-  // http://code.google.com/p/v8/issues/detail?id=346
-  // Reported by nth10sd, test based on this report.
-  var x = {};
-  x[0] = 42;
-  x.__defineGetter__("1", function(){return this.foo;});
-  x.__defineSetter__("1", function(val){this.foo = val;});
-  x[1] = 49
-  x[3] = 37;
-  x.length = 4;
-  Array.prototype.sort.call(x);
-  // Behavior of sort with accessors is undefined.  This accessor is
-  // well-behaved (acts like a normal property), so it should work.
-  assertEquals(4, x.length, "sortaccessors length");
-  assertEquals(37, x[0], "sortaccessors first");
-  assertEquals(42, x[1], "sortaccessors second");
-  assertEquals(49, x[2], "sortaccessors third")
-  assertFalse(3 in x, "sortaccessors fourth");
-}
-
-TestNonArrayWithAccessors();
-
-
-function TestInheritedElementSort(depth) {
-  var length = depth * 2 + 3;
-  var obj = {length: length};
-  obj[depth * 2 + 1] = 0;
-  for (var i = 0; i < depth; i++) {
-    var newObj = {};
-    newObj.__proto__ = obj;
-    obj[i] = undefined;
-    obj[i + depth + 1] = depth - i;
-    obj = newObj;
-  }
-  // expected (inherited) object: [undef1,...undefdepth,hole,1,...,depth,0,hole]
-
-  Array.prototype.sort.call(obj, function(a,b) { return (b < a) - (a < b); });
-  // expected result: [0,1,...,depth,undef1,...,undefdepth,undef,hole]
-  var name = "SortInherit("+depth+")-";
-
-  assertEquals(length, obj.length, name+"length");
-  for (var i = 0; i <= depth; i++) {
-    assertTrue(obj.hasOwnProperty(i), name + "hasvalue" + i);
-    assertEquals(i, obj[i], name + "value" + i);
-  }
-  for (var i = depth + 1; i <= depth * 2 + 1; i++) {
-    assertEquals(undefined, obj[i], name + "undefined" + i);
-    assertTrue(obj.hasOwnProperty(i), name + "hasundefined" + i);
-  }
-  assertTrue(!obj.hasOwnProperty(depth * 2 + 2), name + "hashole");
-}
-
-TestInheritedElementSort(5);
-TestInheritedElementSort(15);
-
-function TestSparseInheritedElementSort(scale) {
-  var length = scale * 10;
-  var x = {length: length};
-  var y = {};
-  y.__proto__ = x;
-
-  for (var i = 0; i < 5; i++) {
-    x[i * 2 * scale] = 2 * (4 - i);
-    y[(i * 2 + 1) * scale] = 2 * (4 - i) + 1;
-  }
-
-  var name = "SparseSortInherit(" + scale + ")-";
-
-  Array.prototype.sort.call(y);
-
-  assertEquals(length, y.length, name +"length");
-
-  for (var i = 0; i < 10; i++) {
-    assertTrue(y.hasOwnProperty(i), name + "hasvalue" + i);
-    assertEquals(i, y[i], name + "value" + i);
-  }
-  for (var i = 10; i < length; i++) {
-    assertEquals(x.hasOwnProperty(i), y.hasOwnProperty(i),
-                 name + "hasundef" + i);
-    assertEquals(undefined, y[i], name+"undefined"+i);
-    if (x.hasOwnProperty(i)) {
-      assertTrue(0 == i % (2 * scale), name + "new_x" + i);
-    }
-  }
-}
-
-TestSparseInheritedElementSort(10);
-TestSparseInheritedElementSort(100);
-TestSparseInheritedElementSort(1000);
-
-function TestSpecialCasesInheritedElementSort() {
-
-  var x = {
-    1:"d1",
-    2:"c1",
-    3:"b1",
-    4: undefined,
-    __proto__: {
-      length: 10000,
-      1: "e2",
-      10: "a2",
-      100: "b2",
-      1000: "c2",
-      2000: undefined,
-      8000: "d2",
-      12000: "XX",
-      __proto__: {
-        0: "e3",
-        1: "d3",
-        2: "c3",
-        3: "b3",
-        4: "f3",
-        5: "a3",
-        6: undefined,
-      }
-    }
-  };
-  Array.prototype.sort.call(x);
-
-  var name = "SpecialInherit-";
-
-  assertEquals(10000, x.length, name + "length");
-  var sorted = ["a2", "a3", "b1", "b2", "c1", "c2", "d1", "d2", "e3",
-                undefined, undefined, undefined];
-  for (var i = 0; i < sorted.length; i++) {
-    assertTrue(x.hasOwnProperty(i), name + "has" + i)
-    assertEquals(sorted[i], x[i], name + i);
-  }
-  assertFalse(x.hasOwnProperty(sorted.length), name + "haspost");
-  assertFalse(sorted.length in x, name + "haspost2");
-  assertTrue(x.hasOwnProperty(10), name + "hasundefined10");
-  assertEquals(undefined, x[10], name + "undefined10");
-  assertTrue(x.hasOwnProperty(100), name + "hasundefined100");
-  assertEquals(undefined, x[100], name + "undefined100");
-  assertTrue(x.hasOwnProperty(1000), name + "hasundefined1000");
-  assertEquals(undefined, x[1000], name + "undefined1000");
-  assertTrue(x.hasOwnProperty(2000), name + "hasundefined2000");
-  assertEquals(undefined, x[2000], name + "undefined2000");
-  assertTrue(x.hasOwnProperty(8000), name + "hasundefined8000");
-  assertEquals(undefined, x[8000], name + "undefined8000");
-  assertFalse(x.hasOwnProperty(12000), name + "has12000");
-  assertEquals("XX", x[12000], name + "XX12000");
-}
-
-TestSpecialCasesInheritedElementSort();

data/ext/v8/upstream/2.0.6/test/mjsunit/array-splice.js

@@ -1,314 +0,0 @@
-// Copyright 2008 the V8 project authors. All rights reserved.
-// 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.
-
-/**
- * @fileoverview Test splice, shift, unshift, slice and join on small
- * and large arrays.  Some of these methods are specified such that they
- * should work on other objects too, so we test that too.
- */
-
-var LARGE = 40000000;
-var VERYLARGE = 4000000000;
-
-// Nicer for firefox 1.5.  Unless you uncomment the following two lines,
-// smjs will appear to hang on this file.
-//var LARGE = 40000;
-//var VERYLARGE = 40000;
-
-var fourhundredth = LARGE/400;
-
-function PseudoArray() {
-};
-
-for (var use_real_arrays = 0; use_real_arrays <= 1; use_real_arrays++) {
-  var poses = [0, 140, 20000, VERYLARGE];
-  var the_prototype;
-  var new_function;
-  var push_function;
-  var concat_function;
-  var slice_function;
-  var splice_function;
-  var splice_function_2;
-  var unshift_function;
-  var unshift_function_2;
-  var shift_function;
-  if (use_real_arrays) {
-    new_function = function(length) {
-      return new Array(length);
-    };
-    the_prototype = Array.prototype;
-    push_function = function(array, elt) {
-      return array.push(elt);
-    };
-    concat_function = function(array, other) {
-      return array.concat(other);
-    };
-    slice_function = function(array, start, len) {
-      return array.slice(start, len);
-    };
-    splice_function = function(array, start, len) {
-      return array.splice(start, len);
-    };
-    splice_function_2 = function(array, start, len, elt) {
-      return array.splice(start, len, elt);
-    };
-    unshift_function = function(array, elt) {
-      return array.unshift(elt);
-    };
-    unshift_function_2 = function(array, elt1, elt2) {
-      return array.unshift(elt1, elt2);
-    };
-    shift_function = function(array) {
-      return array.shift();
-    };
-  } else {
-    // Don't run largest size on non-arrays or we'll be here for ever.
-    poses.pop();
-    new_function = function(length) {
-      var obj = new PseudoArray();
-      obj.length = length;
-      return obj;
-    };
-    the_prototype = PseudoArray.prototype;
-    push_function = function(array, elt) {
-      array[array.length] = elt;
-      array.length++;
-    };
-    concat_function = function(array, other) {
-      return Array.prototype.concat.call(array, other);
-    };
-    slice_function = function(array, start, len) {
-      return Array.prototype.slice.call(array, start, len);
-    };
-    splice_function = function(array, start, len) {
-      return Array.prototype.splice.call(array, start, len);
-    };
-    splice_function_2 = function(array, start, len, elt) {
-      return Array.prototype.splice.call(array, start, len, elt);
-    };
-    unshift_function = function(array, elt) {
-      return Array.prototype.unshift.call(array, elt);
-    };
-    unshift_function_2 = function(array, elt1, elt2) {
-      return Array.prototype.unshift.call(array, elt1, elt2);
-    };
-    shift_function = function(array) {
-      return Array.prototype.shift.call(array);
-    };
-  }
-
-  for (var pos_pos = 0; pos_pos < poses.length; pos_pos++) {
-    var pos = poses[pos_pos];
-    if (pos > 100) {
-      var a = new_function(pos);
-      assertEquals(pos, a.length);
-      push_function(a, 'foo');
-      assertEquals(pos + 1, a.length);
-      var b = ['bar'];
-      // Delete a huge number of holes.
-      var c = splice_function(a, 10, pos - 20);
-      assertEquals(pos - 20, c.length);
-      assertEquals(21, a.length);
-    }
-
-    // Add a numeric property to the prototype of the array class.  This
-    // allows us to test some borderline stuff relative to the standard.
-    the_prototype["" + (pos + 1)] = 'baz';
-
-    if (use_real_arrays) {
-      // It seems quite clear from ECMAScript spec 15.4.4.5.  Just call Get on
-      // every integer in the range.
-      // IE, Safari get this right.
-      // FF, Opera get this wrong.
-      var a = ['zero', ,'two'];
-      if (pos == 0) {
-        assertEquals("zero,baz,two", a.join(","));
-      }
-
-      // Concat only applies to real arrays, unlike most of the other methods.
-      var a = new_function(pos);
-      push_function(a, "con");
-      assertEquals("con", a[pos]);
-      assertEquals(pos + 1, a.length);
-      var b = new_function(0);
-      push_function(b, "cat");
-      assertEquals("cat", b[0]);
-      var ab = concat_function(a, b);
-      assertEquals("con", ab[pos]);
-      assertEquals(pos + 2, ab.length);
-      assertEquals("cat", ab[pos + 1]);
-      var ba = concat_function(b, a);
-      assertEquals("con", ba[pos + 1]);
-      assertEquals(pos + 2, ba.length);
-      assertEquals("cat", ba[0]);
-
-      // Join with '' as separator.
-      var join = a.join('');
-      assertEquals("con", join);
-      join = b.join('');
-      assertEquals("cat", join);
-      join = ab.join('');
-      assertEquals("concat", join);
-      join = ba.join('');
-      assertEquals("catcon", join);
-
-      var sparse = [];
-      sparse[pos + 1000] = 'is ';
-      sparse[pos + 271828] = 'time ';
-      sparse[pos + 31415] = 'the ';
-      sparse[pos + 012260199] = 'all ';
-      sparse[-1] = 'foo';
-      sparse[pos + 22591927] = 'good ';
-      sparse[pos + 1618033] = 'for ';
-      sparse[pos + 91] = ': Now ';
-      sparse[pos + 86720199] = 'men.';
-      sparse.hest = 'fisk';
-
-      assertEquals("baz: Now is the time for all good men.", sparse.join(''));
-    }
-
-    a = new_function(pos);
-    push_function(a, 'zero');
-    push_function(a, void 0);
-    push_function(a, 'two');
-
-    // Splice works differently from join.
-    // IE, Safari get this wrong.
-    // FF, Opera get this right.
-    // 15.4.4.12 line 24 says the object itself has to have the property...
-    var zero = splice_function(a, pos, 1);
-    assertEquals("undefined", typeof(a[pos]));
-    assertEquals("two", a[pos+1], "pos1:" + pos);
-    assertEquals(pos + 2, a.length, "a length");
-    assertEquals(1, zero.length, "zero length");
-    assertEquals("zero", zero[0]);
-
-    // 15.4.4.12 line 41 says the object itself has to have the property...
-    a = new_function(pos);
-    push_function(a, 'zero');
-    push_function(a, void 0);
-    push_function(a, 'two');
-    var nothing = splice_function_2(a, pos, 0, 'minus1');
-    assertEquals("minus1", a[pos]);
-    assertEquals("zero", a[pos+1]);
-    assertEquals("undefined", typeof(a[pos+2]), "toot!");
-    assertEquals("two", a[pos+3], "pos3");
-    assertEquals(pos + 4, a.length);
-    assertEquals(1, zero.length);
-    assertEquals("zero", zero[0]);
-
-    // 15.4.4.12 line 10 says the object itself has to have the property...
-    a = new_function(pos);
-    push_function(a, 'zero');
-    push_function(a, void 0);
-    push_function(a, 'two');
-    var one = splice_function(a, pos + 1, 1);
-    assertEquals("", one.join(","));
-    assertEquals(pos + 2, a.length);
-    assertEquals("zero", a[pos]);
-    assertEquals("two", a[pos+1]);
-
-    // Set things back to the way they were.
-    the_prototype[pos + 1] = undefined;
-
-    // Unshift.
-    var a = new_function(pos);
-    push_function(a, "foo");
-    assertEquals("foo", a[pos]);
-    assertEquals(pos + 1, a.length);
-    unshift_function(a, "bar");
-    assertEquals("foo", a[pos+1]);
-    assertEquals(pos + 2, a.length);
-    assertEquals("bar", a[0]);
-    unshift_function_2(a, "baz", "boo");
-    assertEquals("foo", a[pos+3]);
-    assertEquals(pos + 4, a.length);
-    assertEquals("baz", a[0]);
-    assertEquals("boo", a[1]);
-    assertEquals("bar", a[2]);
-
-    // Shift.
-    var baz = shift_function(a);
-    assertEquals("baz", baz);
-    assertEquals("boo", a[0]);
-    assertEquals(pos + 3, a.length);
-    assertEquals("foo", a[pos + 2]);
-
-    // Slice.
-    var bar = slice_function(a, 1, 0);  // don't throw an exception please.
-    bar = slice_function(a, 1, 2);
-    assertEquals("bar", bar[0]);
-    assertEquals(1, bar.length);
-    assertEquals("bar", a[1]);
-
-  }
-}
-
-// Lets see if performance is reasonable.
-
-var a = new Array(LARGE + 10);
-for (var i = 0; i < a.length; i += 1000) {
-  a[i] = i;
-}
-
-// Take something near the end of the array.
-for (var i = 0; i < 100; i++) {
-  var top = a.splice(LARGE, 5);
-  assertEquals(5, top.length);
-  assertEquals(LARGE, top[0]);
-  assertEquals("undefined", typeof(top[1]));
-  assertEquals(LARGE + 5, a.length);
-  a.splice(LARGE, 0, LARGE);
-  a.length = LARGE + 10;
-}
-
-var a = new Array(LARGE + 10);
-for (var i = 0; i < a.length; i += fourhundredth) {
-  a[i] = i;
-}
-
-// Take something near the middle of the array.
-for (var i = 0; i < 10; i++) {
-  var top = a.splice(LARGE >> 1, 5);
-  assertEquals(5, top.length);
-  assertEquals(LARGE >> 1, top[0]);
-  assertEquals("undefined", typeof(top[1]));
-  assertEquals(LARGE + 5, a.length);
-  a.splice(LARGE >> 1, 0, LARGE >> 1, void 0, void 0, void 0, void 0);
-}
-
-
-// Test http://b/issue?id=1202711
-arr = [0];
-arr.length = 2;
-Array.prototype[1] = 1;
-assertEquals(1, arr.pop());
-assertEquals(0, arr.pop());
-Array.prototype[1] = undefined;
-
-// Test http://code.google.com/p/chromium/issues/detail?id=21860
-Array.prototype.push.apply([], [1].splice(0, -(-1 % 5)));