1 files changed, 0 insertions, 199 deletions
diff --git a/src/3rdparty/v8/test/mjsunit/apply.js b/src/3rdparty/v8/test/mjsunit/apply.js
deleted file mode 100644
index 413ee93..0000000
--- a/src/3rdparty/v8/test/mjsunit/apply.js
+++ /dev/null
@@ -1,199 +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.
-
-function f0() {
-  return this;
-}
-
-function f1(a) {
-  return a;
-}
-
-assertSame(this, f0.apply(), "1-0");
-
-assertSame(this, f0.apply(this), "2a");
-assertSame(this, f0.apply(this, new Array(1)), "2b");
-assertSame(this, f0.apply(this, new Array(2)), "2c");
-assertSame(this, f0.apply(this, new Array(4242)), "2d");
-
-assertSame(this, f0.apply(null), "3a");
-assertSame(this, f0.apply(null, new Array(1)), "3b");
-assertSame(this, f0.apply(null, new Array(2)), "3c");
-assertSame(this, f0.apply(this, new Array(4242)), "3d");
-
-assertSame(this, f0.apply(void 0), "4a");
-assertSame(this, f0.apply(void 0, new Array(1)), "4b");
-assertSame(this, f0.apply(void 0, new Array(2)), "4c");
-
-assertEquals(void 0, f1.apply(), "1-1");
-
-assertEquals(void 0, f1.apply(this), "5a");
-assertEquals(void 0, f1.apply(this, new Array(1)), "5b");
-assertEquals(void 0, f1.apply(this, new Array(2)), "5c");
-assertEquals(void 0, f1.apply(this, new Array(4242)), "5d");
-assertEquals(42, f1.apply(this, new Array(42, 43)), "5e");
-assertEquals("foo", f1.apply(this, new Array("foo", "bar", "baz", "bo")), "5f");
-
-assertEquals(void 0, f1.apply(null), "6a");
-assertEquals(void 0, f1.apply(null, new Array(1)), "6b");
-assertEquals(void 0, f1.apply(null, new Array(2)), "6c");
-assertEquals(void 0, f1.apply(null, new Array(4242)), "6d");
-assertEquals(42, f1.apply(null, new Array(42, 43)), "6e");
-assertEquals("foo", f1.apply(null, new Array("foo", "bar", "baz", "bo")), "6f");
-
-assertEquals(void 0, f1.apply(void 0), "7a");
-assertEquals(void 0, f1.apply(void 0, new Array(1)), "7b");
-assertEquals(void 0, f1.apply(void 0, new Array(2)), "7c");
-assertEquals(void 0, f1.apply(void 0, new Array(4242)), "7d");
-assertEquals(42, f1.apply(void 0, new Array(42, 43)), "7e");
-assertEquals("foo", f1.apply(void 0, new Array("foo", "bar", "ba", "b")), "7f");
-
-var arr = new Array(42, "foo", "fish", "horse");
-function j(a, b, c, d, e, f, g, h, i, j, k, l) {
-  return "" + a + b + c + d + e + f + g + h + i + j + k + l;
-}
-
-
-var expect = "42foofishhorse";
-for (var i = 0; i < 8; i++)
-  expect += "undefined";
-assertEquals(expect, j.apply(undefined, arr), "apply to undefined");
-
-assertThrows("f0.apply(this, 1);");
-assertThrows("f0.apply(this, 1, 2);");
-assertThrows("f0.apply(this, 1, new Array(2));");
-
-function f() {
-  var doo = "";
-  for (var i = 0; i < arguments.length; i++) {
-    doo += arguments[i];
-  }
-  return doo;
-}
-
-assertEquals("42foofishhorse", f.apply(this, arr), "apply to this");
-
-function s() {
-  var doo = this;
-  for (var i = 0; i < arguments.length; i++) {
-    doo += arguments[i];
-  }
-  return doo;
-}
-
-assertEquals("bar42foofishhorse", s.apply("bar", arr), "apply to string");
-
-function al() {
-  assertEquals(Object(345), this);
-  return arguments.length + arguments[arguments.length - 1];
-}
-
-for (var j = 1; j < 0x40000000; j <<= 1) {
-  try {
-    var a = new Array(j);
-    a[j - 1] = 42;
-    assertEquals(42 + j, al.apply(345, a));
-  } catch (e) {
-    assertTrue(e.toString().indexOf("Maximum call stack size exceeded") != -1);
-    for (; j < 0x40000000; j <<= 1) {
-      var caught = false;
-      try {
-        a = new Array(j);
-        a[j - 1] = 42;
-        al.apply(345, a);
-        assertUnreachable("Apply of array with length " + a.length +
-                          " should have thrown");
-      } catch (e) {
-        assertTrue(e.toString().indexOf("Maximum call stack size exceeded") != -1);
-        caught = true;
-      }
-      assertTrue(caught, "exception not caught");
-    }
-    break;
-  }
-}
-
-var primes = new Array(0);
-
-function isPrime(possible_prime) {
-  for (var d = 0; d < primes.length; d++) {
-    var p = primes[d];
-    if (possible_prime % p == 0)
-      return false;
-    if (p * p > possible_prime)
-      return true;
-  }
-  return true;
-}
-
-for (var i = 2; i < 10000; i++) {
-  if (isPrime(i)) {
-    primes.push(i);
-  }
-}
-
-assertEquals(1229, primes.length);
-
-var same_primes = Array.prototype.constructor.apply(Array, primes);
-
-for (var i = 0; i < primes.length; i++)
-  assertEquals(primes[i], same_primes[i], "prime" + primes[i]);
-assertEquals(primes.length, same_primes.length, "prime-length");
-
-
-Array.prototype["1"] = "sep";
-
-var holey = new Array(3);
-holey[0] = "mor";
-holey[2] = "er";
-
-assertEquals("morseper", String.prototype.concat.apply("", holey),
-             "moreseper0");
-assertEquals("morseper", String.prototype.concat.apply("", holey, 1),
-             "moreseper1");
-assertEquals("morseper", String.prototype.concat.apply("", holey, 1, 2),
-             "moreseper2");
-assertEquals("morseper", String.prototype.concat.apply("", holey, 1, 2, 3),
-             "morseper3");
-assertEquals("morseper", String.prototype.concat.apply("", holey, 1, 2, 3, 4),
-             "morseper4");
-
-primes[0] = "";
-primes[1] = holey;
-assertThrows("String.prototype.concat.apply.apply('foo', primes)");
-assertEquals("morseper",
-    String.prototype.concat.apply.apply(String.prototype.concat, primes),
-    "moreseper-prime");
-
-delete(Array.prototype["1"]);
-
-// Check correct handling of non-array argument lists.
-assertSame(this, f0.apply(this, {}), "non-array-1");
-assertSame(this, f0.apply(this, { length:1 }), "non-array-2");
-assertEquals(void 0, f1.apply(this, { length:1 }), "non-array-3");
-assertEquals(void 0, f1.apply(this, { 0:"foo" }), "non-array-4");
-assertEquals("foo", f1.apply(this, { length:1, 0:"foo" }), "non-array-5");