therubyracer 0.4.8 → 0.4.9

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

@@ -1,131 +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 reverse on small * and large arrays.
- */
-
-var VERYLARGE = 4000000000;
-
-// Nicer for firefox 1.5.  Unless you uncomment the following line,
-// smjs will appear to hang on this file.
-//var VERYLARGE = 40000;
-
-
-// Simple test of reverse on sparse array.
-var a = [];
-a.length = 2000;
-a[15] = 'a';
-a[30] = 'b';
-Array.prototype[30] = 'B';  // Should be hidden by a[30].
-a[40] = 'c';
-a[50] = 'deleted';
-delete a[50]; // Should leave no trace once deleted.
-a[1959] = 'd'; // Swapped with a[40] when reversing.
-a[1999] = 'e';
-assertEquals("abcde", a.join(''));
-a.reverse();
-delete Array.prototype[30];
-assertEquals("edcba", a.join(''));
-
-
-
-var seed = 43;
-
-// CONG pseudo random number generator.  Used for fuzzing the sparse array
-// reverse code.
-function DoOrDont() {
-  seed = (69069 * seed + 1234567) % 0x100000000;
-  return (seed & 0x100000) != 0;
-}
-
-var sizes = [140, 40000, VERYLARGE];
-var poses = [0, 10, 50, 69];
-
-
-// Fuzzing test of reverse on sparse array.
-for (var iterations = 0; iterations < 20; iterations++) {
-  for (var size_pos = 0; size_pos < sizes.length; size_pos++) {
-    var size = sizes[size_pos];
-
-    var to_delete = [];
-
-    var a;
-    // Make sure we test both array-backed and hash-table backed
-    // arrays.
-    if (size < 1000) {
-      a = new Array(size);
-    } else {
-      a = new Array();
-      a.length = size;
-    }
-
-    var expected = '';
-    var expected_reversed = '';
-
-    for (var pos_pos = 0; pos_pos < poses.length; pos_pos++) {
-      var pos = poses[pos_pos];
-      var letter = String.fromCharCode(97 + pos_pos);
-      if (DoOrDont()) {
-        a[pos] = letter;
-        expected += letter;
-        expected_reversed = letter + expected_reversed;
-      } else if (DoOrDont()) {
-        Array.prototype[pos] = letter;
-        expected += letter;
-        expected_reversed = letter + expected_reversed;
-        to_delete.push(pos);
-      }
-    }
-    var expected2 = '';
-    var expected_reversed2 = '';
-    for (var pos_pos = poses.length - 1; pos_pos >= 0; pos_pos--) {
-      var letter = String.fromCharCode(110 + pos_pos);
-      var pos = size - poses[pos_pos] - 1;
-      if (DoOrDont()) {
-        a[pos] = letter;
-        expected2 += letter;
-        expected_reversed2 = letter + expected_reversed2;
-      } else if (DoOrDont()) {
-        Array.prototype[pos] = letter;
-        expected2 += letter;
-        expected_reversed2 = letter + expected_reversed2;
-        to_delete.push(pos);
-      }
-    }
-
-    assertEquals(expected + expected2, a.join(''), 'join' + size);
-    a.reverse();
-
-    while (to_delete.length != 0) {
-      var pos = to_delete.pop();
-      delete(Array.prototype[pos]);
-    }
-
-    assertEquals(expected_reversed2 + expected_reversed, a.join(''), 'reverse then join' + size);
-  }
-}

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

@@ -1,41 +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.
-
-// Because of a bug in the heuristics used to figure out when to
-// convert a slow-case elements backing storage to fast case, the
-// following took a very long time.
-//
-// This test passes if it finishes almost immediately.
-for (var repetitions = 0; repetitions < 20; repetitions++) {
-  var stride = 500;
-  var array = [];
-  for (var i = 0; i < 1000; i++) {
-    array[i * stride] = i;
-  }
-}
-
-

data/ext/v8/upstream/2.0.6/test/mjsunit/stack-traces.js

@@ -1,204 +0,0 @@
-// Copyright 2009 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 testMethodNameInference() {
-  function Foo() { }
-  Foo.prototype.bar = function () { FAIL; };
-  (new Foo).bar();
-}
-
-function testNested() {
-  function one() {
-    function two() {
-      function three() {
-        FAIL;
-      }
-      three();
-    }
-    two();
-  }
-  one();
-}
-
-function testArrayNative() {
-  [1, 2, 3].map(function () { FAIL; });
-}
-
-function testImplicitConversion() {
-  function Nirk() { }
-  Nirk.prototype.valueOf = function () { FAIL; };
-  return 1 + (new Nirk);
-}
-
-function testEval() {
-  eval("function Doo() { FAIL; }; Doo();");
-}
-
-function testNestedEval() {
-  var x = "FAIL";
-  eval("function Outer() { eval('function Inner() { eval(x); }'); Inner(); }; Outer();");
-}
-
-function testValue() {
-  Number.prototype.causeError = function () { FAIL; };
-  (1).causeError();
-}
-
-function testConstructor() {
-  function Plonk() { FAIL; }
-  new Plonk();
-}
-
-function testRenamedMethod() {
-  function a$b$c$d() { return FAIL; }
-  function Wookie() { }
-  Wookie.prototype.d = a$b$c$d;
-  (new Wookie).d();
-}
-
-function testAnonymousMethod() {
-  (function () { FAIL }).call([1, 2, 3]);
-}
-
-function CustomError(message, stripPoint) {
-  this.message = message;
-  Error.captureStackTrace(this, stripPoint);
-}
-
-CustomError.prototype.toString = function () {
-  return "CustomError: " + this.message;
-};
-
-function testDefaultCustomError() {
-  throw new CustomError("hep-hey", undefined);
-}
-
-function testStrippedCustomError() {
-  throw new CustomError("hep-hey", CustomError);
-}
-
-// Utility function for testing that the expected strings occur
-// in the stack trace produced when running the given function.
-function testTrace(name, fun, expected, unexpected) {
-  var threw = false;
-  try {
-    fun();
-  } catch (e) {
-    for (var i = 0; i < expected.length; i++) {
-      assertTrue(e.stack.indexOf(expected[i]) != -1,
-                 name + " doesn't contain expected[" + i + "]");
-    }
-    if (unexpected) {
-      for (var i = 0; i < unexpected.length; i++) {
-        assertEquals(e.stack.indexOf(unexpected[i]), -1,
-                     name + " contains unexpected[" + i + "]");
-      }
-    }
-    threw = true;
-  }
-  assertTrue(threw, name + " didn't throw");
-}
-
-// Test that the error constructor is not shown in the trace
-function testCallerCensorship() {
-  var threw = false;
-  try {
-    FAIL;
-  } catch (e) {
-    assertEquals(-1, e.stack.indexOf('at new ReferenceError'),
-                 "CallerCensorship contained new ReferenceError");
-    threw = true;
-  }
-  assertTrue(threw, "CallerCensorship didn't throw");
-}
-
-// Test that the explicit constructor call is shown in the trace
-function testUnintendedCallerCensorship() {
-  var threw = false;
-  try {
-    new ReferenceError({
-      toString: function () {
-        FAIL;
-      }
-    });
-  } catch (e) {
-    assertTrue(e.stack.indexOf('at new ReferenceError') != -1,
-               "UnintendedCallerCensorship didn't contain new ReferenceError");
-    threw = true;
-  }
-  assertTrue(threw, "UnintendedCallerCensorship didn't throw");
-}
-
-// If an error occurs while the stack trace is being formatted it should
-// be handled gracefully.
-function testErrorsDuringFormatting() {
-  function Nasty() { }
-  Nasty.prototype.foo = function () { throw new RangeError(); };
-  var n = new Nasty();
-  n.__defineGetter__('constructor', function () { CONS_FAIL; });
-  var threw = false;
-  try {
-    n.foo();
-  } catch (e) {
-    threw = true;
-    assertTrue(e.stack.indexOf('<error: ReferenceError') != -1,
-               "ErrorsDuringFormatting didn't contain error: ReferenceError");
-  }
-  assertTrue(threw, "ErrorsDuringFormatting didn't throw");
-  threw = false;
-  // Now we can't even format the message saying that we couldn't format
-  // the stack frame.  Put that in your pipe and smoke it!
-  ReferenceError.prototype.toString = function () { NESTED_FAIL; };
-  try {
-    n.foo();
-  } catch (e) {
-    threw = true;
-    assertTrue(e.stack.indexOf('<error>') != -1,
-               "ErrorsDuringFormatting didn't contain <error>");
-  }
-  assertTrue(threw, "ErrorsDuringFormatting didnt' throw (2)");
-}
-
-
-testTrace("testArrayNative", testArrayNative, ["Array.map (native)"]);
-testTrace("testNested", testNested, ["at one", "at two", "at three"]);
-testTrace("testMethodNameInference", testMethodNameInference, ["at Foo.bar"]);
-testTrace("testImplicitConversion", testImplicitConversion, ["at Nirk.valueOf"]);
-testTrace("testEval", testEval, ["at Doo (eval at testEval"]);
-testTrace("testNestedEval", testNestedEval, ["eval at Inner (eval at Outer"]);
-testTrace("testValue", testValue, ["at Number.causeError"]);
-testTrace("testConstructor", testConstructor, ["new Plonk"]);
-testTrace("testRenamedMethod", testRenamedMethod, ["Wookie.a$b$c$d [as d]"]);
-testTrace("testAnonymousMethod", testAnonymousMethod, ["Array.<anonymous>"]);
-testTrace("testDefaultCustomError", testDefaultCustomError,
-    ["hep-hey", "new CustomError"],
-    ["collectStackTrace"]);
-testTrace("testStrippedCustomError", testStrippedCustomError, ["hep-hey"],
-    ["new CustomError", "collectStackTrace"]);
-testCallerCensorship();
-testUnintendedCallerCensorship();
-testErrorsDuringFormatting();

data/ext/v8/upstream/2.0.6/test/mjsunit/str-to-num.js

@@ -1,158 +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 toNumber(val) {
-  return Number(val);
-}
-
-// assertEquals(, toNumber());
-
-
-assertEquals(123, toNumber(" 123"));
-assertEquals(123, toNumber("\n123"));
-assertEquals(123, toNumber("\r123"));
-assertEquals(123, toNumber("\t123"));
-assertEquals(123, toNumber("\f123"));
-
-assertEquals(123, toNumber("123 "));
-assertEquals(123, toNumber("123\n"));
-assertEquals(123, toNumber("123\r"));
-assertEquals(123, toNumber("123\t"));
-assertEquals(123, toNumber("123\f"));
-
-assertEquals(123, toNumber(" 123 "));
-assertEquals(123, toNumber("\n123\n"));
-assertEquals(123, toNumber("\r123\r"));
-assertEquals(123, toNumber("\t123\t"));
-assertEquals(123, toNumber("\f123\f"));
-
-assertTrue(isNaN(toNumber(" NaN ")));
-assertEquals(Infinity,  toNumber(" Infinity ") ," Infinity");
-assertEquals(-Infinity, toNumber(" -Infinity "));
-assertEquals(Infinity,  toNumber(" +Infinity "), " +Infinity");
-assertEquals(Infinity,  toNumber("Infinity ") ,"Infinity");
-assertEquals(-Infinity, toNumber("-Infinity "));
-assertEquals(Infinity,  toNumber("+Infinity "), "+Infinity");
-
-assertEquals(0,  toNumber("0"));
-assertEquals(0,  toNumber("+0"));
-assertEquals(-0, toNumber("-0"));
-
-assertEquals(1,  toNumber("1"));
-assertEquals(1,  toNumber("+1"));
-assertEquals(-1, toNumber("-1"));
-
-assertEquals(2,  toNumber("2"));
-assertEquals(2,  toNumber("+2"));
-assertEquals(-2, toNumber("-2"));
-
-assertEquals(3.1415926,  toNumber("3.1415926"));
-assertEquals(3.1415926,  toNumber("+3.1415926"));
-assertEquals(-3.1415926, toNumber("-3.1415926"));
-
-assertEquals(5,  toNumber("5."));
-assertEquals(5,  toNumber("+5."));
-assertEquals(-5, toNumber("-5."));
-
-assertEquals(500,   toNumber("5e2"));
-assertEquals(500,   toNumber("+5e2"));
-assertEquals(-500,  toNumber("-5e2"));
-assertEquals(500,   toNumber("5e+2"));
-assertEquals(500,   toNumber("+5e+2"));
-assertEquals(-500,  toNumber("-5e+2"));
-assertEquals(0.05,  toNumber("5e-2"));
-assertEquals(0.05,  toNumber("+5e-2"));
-assertEquals(-0.05, toNumber("-5e-2"));
-
-assertEquals(0.00001,   toNumber(".00001"));
-assertEquals(0.00001,   toNumber("+.00001"));
-assertEquals(-0.00001,  toNumber("-.00001"));
-assertEquals(1,         toNumber(".00001e5"));
-assertEquals(1,         toNumber("+.00001e5"));
-assertEquals(-1,        toNumber("-.00001e5"));
-assertEquals(1,         toNumber(".00001e+5"));
-assertEquals(1,         toNumber("+.00001e+5"));
-assertEquals(-1,        toNumber("-.00001e+5"));
-assertEquals(0.00001,   toNumber(".001e-2"));
-assertEquals(0.00001,   toNumber("+.001e-2"));
-assertEquals(-0.00001,  toNumber("-.001e-2"));
-
-assertEquals(12340000,   toNumber("1234e4"));
-assertEquals(12340000,   toNumber("+1234e4"));
-assertEquals(-12340000,  toNumber("-1234e4"));
-assertEquals(12340000,   toNumber("1234e+4"));
-assertEquals(12340000,   toNumber("+1234e+4"));
-assertEquals(-12340000,  toNumber("-1234e+4"));
-assertEquals(0.1234,     toNumber("1234e-4"));
-assertEquals(0.1234,     toNumber("+1234e-4"));
-assertEquals(-0.1234,    toNumber("-1234e-4"));
-
-assertEquals(0,  toNumber("0x0"));
-assertEquals(1,  toNumber("0x1"));
-assertEquals(2,  toNumber("0x2"));
-assertEquals(9,  toNumber("0x9"));
-assertEquals(10, toNumber("0xa"));
-assertEquals(11, toNumber("0xb"));
-assertEquals(15, toNumber("0xf"));
-assertEquals(10, toNumber("0xA"));
-assertEquals(11, toNumber("0xB"));
-assertEquals(15, toNumber("0xF"));
-
-assertEquals(0,  toNumber("0X0"));
-assertEquals(9,  toNumber("0X9"));
-assertEquals(10, toNumber("0Xa"));
-assertEquals(10, toNumber("0XA"));
-assertEquals(15, toNumber("0Xf"));
-assertEquals(15, toNumber("0XF"));
-
-assertEquals(0,  toNumber("0x000"));
-assertEquals(9,  toNumber("0x009"));
-assertEquals(10, toNumber("0x00a"));
-assertEquals(10, toNumber("0x00A"));
-assertEquals(15, toNumber("0x00f"));
-assertEquals(15, toNumber("0x00F"));
-
-assertEquals(0, toNumber("00"));
-assertEquals(1, toNumber("01"));
-assertEquals(2, toNumber("02"));
-assertEquals(10, toNumber("010"));
-assertEquals(100, toNumber("0100"));
-assertEquals(100, toNumber("000100"));
-
-assertEquals(Infinity,  toNumber("1e999"), "1e999");
-assertEquals(-Infinity, toNumber("-1e999"));
-assertEquals(0,         toNumber("1e-999"));
-assertEquals(0,         toNumber("-1e-999"));
-assertEquals(Infinity,  1 / toNumber("1e-999"), "1e-999");
-assertEquals(-Infinity, 1 / toNumber("-1e-999"));
-
-assertTrue(isNaN(toNumber("junk")), "junk");
-assertTrue(isNaN(toNumber("100 junk")), "100 junk");
-assertTrue(isNaN(toNumber("0x100 junk")), "0x100 junk");
-assertTrue(isNaN(toNumber("100.0 junk")), "100.0 junk");
-assertTrue(isNaN(toNumber(".1e4 junk")), ".1e4 junk");
-assertTrue(isNaN(toNumber("Infinity junk")), "Infinity junk");