therubyracer 0.4.8-x86-darwin-9 → 0.4.9-x86-darwin-9

data/ext/v8/upstream/2.0.6/test/mjsunit/string-compare-alignment.js

@@ -1,47 +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.
-
-// Test that we can compare two strings that are not 4-byte aligned.
-// This situation can arise with sliced strings.  This tests for an ARM bug
-// that was fixed in r554.
-
-var base = "Now is the time for all good men to come to the aid of the party. " + 
-           "Now is the time for all good men to come to the aid of the party."
-var s1 = base.substring(0, 64);
-var s2 = base.substring(66, 130);
-
-var o = new Object();
-o[s1] = 1;
-o[s2] = 2;
-
-var first_time = true;
-
-for (var x in o) {
-  assertTrue(o[x] == 2, "expect 2");
-  assertTrue(first_time, "once only");
-  first_time = false;
-}

data/ext/v8/upstream/2.0.6/test/mjsunit/string-flatten.js

@@ -1,37 +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.
-
-// Check for regression of bug 1011505 (out of memory when flattening strings).
-var i;
-var s = "";
-
-for (i = 0; i < 1024; i++) {
-  s = s + (i + (i+1));
-  s = s.substring(1);
-}
-// Flatten the string.
-assertEquals(57, s.charCodeAt(0));

data/ext/v8/upstream/2.0.6/test/mjsunit/string-index.js

@@ -1,154 +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 indexing on strings with [].
- */
-
-var foo = "Foo";
-assertEquals("Foo", foo);
-assertEquals("F", foo[0]);
-assertEquals("o", foo[1]);
-assertEquals("o", foo[2]);
-
-assertEquals("F", foo["0" + ""], "string index");
-assertEquals("o", foo["1"], "string index");
-assertEquals("o", foo["2"], "string index");
-
-assertEquals("undefined", typeof(foo[3]), "out of range");
-// SpiderMonkey 1.5 fails this next one.  So does FF 2.0.6.
-assertEquals("undefined", typeof(foo[-1]), "known failure in SpiderMonkey 1.5");
-assertEquals("undefined", typeof(foo[-2]), "negative index");
-
-foo[0] = "f";
-assertEquals("Foo", foo);
-
-foo[3] = "t";
-assertEquals("Foo", foo);
-assertEquals("undefined", typeof(foo[3]), "out of range");
-assertEquals("undefined", typeof(foo[-2]), "negative index");
-
-var S = new String("foo");
-assertEquals("foo", S);
-assertEquals("f", S[0], "string object");
-assertEquals("f", S["0"], "string object");
-S[0] = 'bente';
-assertEquals("f", S[0], "string object");
-assertEquals("f", S["0"], "string object");
-S[-2] = 'spider';
-assertEquals('spider', S[-2]);
-S[3] = 'monkey';
-assertEquals('monkey', S[3]);
-S['foo'] = 'Fu';
-assertEquals("Fu", S.foo);
-
-// In FF this is ignored I think.  In V8 it puts a property on the String object
-// but you won't ever see it because it is hidden by the 0th character in the
-// string.  The net effect is pretty much the same.
-S["0"] = 'bente';
-assertEquals("f", S[0], "string object");
-assertEquals("f", S["0"], "string object");
-
-assertEquals(true, 0 in S, "0 in");
-assertEquals(false, -1 in S, "-1 in");
-assertEquals(true, 2 in S, "2 in");
-assertEquals(true, 3 in S, "3 in");
-assertEquals(false, 4 in S, "3 in");
-
-assertEquals(true, "0" in S, '"0" in');
-assertEquals(false, "-1" in S, '"-1" in');
-assertEquals(true, "2" in S, '"2" in');
-assertEquals(true, "3" in S, '"3" in');
-assertEquals(false, "4" in S, '"3" in');
-
-assertEquals(true, S.hasOwnProperty(0), "0 hasOwnProperty");
-assertEquals(false, S.hasOwnProperty(-1), "-1 hasOwnProperty");
-assertEquals(true, S.hasOwnProperty(2), "2 hasOwnProperty");
-assertEquals(true, S.hasOwnProperty(3), "3 hasOwnProperty");
-assertEquals(false, S.hasOwnProperty(4), "3 hasOwnProperty");
-
-assertEquals(true, S.hasOwnProperty("0"), '"0" hasOwnProperty');
-assertEquals(false, S.hasOwnProperty("-1"), '"-1" hasOwnProperty');
-assertEquals(true, S.hasOwnProperty("2"), '"2" hasOwnProperty');
-assertEquals(true, S.hasOwnProperty("3"), '"3" hasOwnProperty');
-assertEquals(false, S.hasOwnProperty("4"), '"3" hasOwnProperty');
-
-assertEquals(true, "foo".hasOwnProperty(0), "foo 0 hasOwnProperty");
-assertEquals(false, "foo".hasOwnProperty(-1), "foo -1 hasOwnProperty");
-assertEquals(true, "foo".hasOwnProperty(2), "foo 2 hasOwnProperty");
-assertEquals(false, "foo".hasOwnProperty(4), "foo 3 hasOwnProperty");
-
-assertEquals(true, "foo".hasOwnProperty("0"), 'foo "0" hasOwnProperty');
-assertEquals(false, "foo".hasOwnProperty("-1"), 'foo "-1" hasOwnProperty');
-assertEquals(true, "foo".hasOwnProperty("2"), 'foo "2" hasOwnProperty');
-assertEquals(false, "foo".hasOwnProperty("4"), 'foo "3" hasOwnProperty');
-
-//assertEquals(true, 0 in "foo", "0 in");
-//assertEquals(false, -1 in "foo", "-1 in");
-//assertEquals(true, 2 in "foo", "2 in");
-//assertEquals(false, 3 in "foo", "3 in");
-//
-//assertEquals(true, "0" in "foo", '"0" in');
-//assertEquals(false, "-1" in "foo", '"-1" in');
-//assertEquals(true, "2" in "foo", '"2" in');
-//assertEquals(false, "3" in "foo", '"3" in');
-
-delete S[3];
-assertEquals("undefined", typeof(S[3]));
-assertEquals(false, 3 in S);
-assertEquals(false, "3" in S);
-
-var N = new Number(43);
-assertEquals(43, N);
-N[-2] = "Alpha";
-assertEquals("Alpha", N[-2]);
-N[0] = "Zappa";
-assertEquals("Zappa", N[0]);
-assertEquals("Zappa", N["0"]);
-
-var A = ["V", "e", "t", "t", "e", "r"];
-var A2 = (A[0] = "v");
-assertEquals('v', A[0]);
-assertEquals('v', A2);
-
-var S = new String("Onkel");
-var S2 = (S[0] = 'o');
-assertEquals('O', S[0]);
-assertEquals('o', S2);
-
-var s = "Tante";
-var s2 = (s[0] = 't');
-assertEquals('T', s[0]);
-assertEquals('t', s2);
-
-var S2 = (S[-2] = 'o');
-assertEquals('o', S[-2]);
-assertEquals('o', S2);
-
-var s2 = (s[-2] = 't');
-assertEquals('undefined', typeof(s[-2]));
-assertEquals('t', s2);

data/ext/v8/upstream/2.0.6/test/mjsunit/string-indexof-1.js

@@ -1,99 +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.
-
-var s = "test test test";
-
-assertEquals(0, s.indexOf("t"));
-assertEquals(3, s.indexOf("t", 1));
-assertEquals(5, s.indexOf("t", 4));
-assertEquals(1, s.indexOf("e"));
-assertEquals(2, s.indexOf("s"));
-
-assertEquals(5, s.indexOf("test", 4));
-assertEquals(5, s.indexOf("test", 5));
-assertEquals(10, s.indexOf("test", 6));
-assertEquals(0, s.indexOf("test", 0));
-assertEquals(0, s.indexOf("test", -1));
-assertEquals(0, s.indexOf("test"));
-assertEquals(-1, s.indexOf("notpresent"));
-assertEquals(-1, s.indexOf());
-
-for (var i = 0; i < s.length+10; i++) {
-  var expected = i < s.length ? i : s.length;
-  assertEquals(expected, s.indexOf("", i));
-}
-
-var reString = "asdf[a-z]+(asdf)?";
-
-assertEquals(4, reString.indexOf("[a-z]+"));
-assertEquals(10, reString.indexOf("(asdf)?"));
-
-assertEquals(1, String.prototype.indexOf.length);
-
-// Random greek letters
-var twoByteString = "\u039a\u0391\u03a3\u03a3\u0395";
-
-// Test single char pattern
-assertEquals(0, twoByteString.indexOf("\u039a"), "Lamda");
-assertEquals(1, twoByteString.indexOf("\u0391"), "Alpha");
-assertEquals(2, twoByteString.indexOf("\u03a3"), "First Sigma");
-assertEquals(3, twoByteString.indexOf("\u03a3",3), "Second Sigma");
-assertEquals(4, twoByteString.indexOf("\u0395"), "Epsilon");
-assertEquals(-1, twoByteString.indexOf("\u0392"), "Not beta");  
-
-// Test multi-char pattern
-assertEquals(0, twoByteString.indexOf("\u039a\u0391"), "lambda Alpha");
-assertEquals(1, twoByteString.indexOf("\u0391\u03a3"), "Alpha Sigma");
-assertEquals(2, twoByteString.indexOf("\u03a3\u03a3"), "Sigma Sigma");
-assertEquals(3, twoByteString.indexOf("\u03a3\u0395"), "Sigma Epsilon");
-
-assertEquals(-1, twoByteString.indexOf("\u0391\u03a3\u0395"), 
-    "Not Alpha Sigma Epsilon");
-
-//single char pattern
-assertEquals(4, twoByteString.indexOf("\u0395"));
-
-// Test complex string indexOf algorithms. Only trigger for long strings.
-
-// Long string that isn't a simple repeat of a shorter string.
-var long = "A";
-for(var i = 66; i < 76; i++) {  // from 'B' to 'K'
-  long =  long + String.fromCharCode(i) + long;
-}
-
-// pattern of 15 chars, repeated every 16 chars in long
-var pattern = "ABACABADABACABA";
-for(var i = 0; i < long.length - pattern.length; i+= 7) {
-  var index = long.indexOf(pattern, i);
-  assertEquals((i + 15) & ~0xf, index, "Long ABACABA...-string at index " + i);
-}
-assertEquals(510, long.indexOf("AJABACA"), "Long AJABACA, First J");
-assertEquals(1534, long.indexOf("AJABACA", 511), "Long AJABACA, Second J");
-
-pattern = "JABACABADABACABA";
-assertEquals(511, long.indexOf(pattern), "Long JABACABA..., First J");
-assertEquals(1535, long.indexOf(pattern, 512), "Long JABACABA..., Second J");

data/ext/v8/upstream/2.0.6/test/mjsunit/string-indexof-2.js

@@ -1,68 +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.
-
-var lipsum = "lorem ipsum per se esse fugiendum. itaque aiunt hanc quasi "
-    + "naturalem atque insitam in animis nostris inesse notionem, ut "
-    + "alterum esse appetendum, alterum aspernandum sentiamus. Alii autem,"
-    + " quibus ego assentior, cum a philosophis compluribus permulta "
-    + "dicantur, cur nec voluptas in bonis sit numeranda nec in malis "
-    + "dolor, non existimant oportere nimium nos causae confidere, sed et"
-    + " argumentandum et accurate disserendum et rationibus conquisitis de"
-    + " voluptate et dolore disputandum putant.\n"
-    + "Sed ut perspiciatis, unde omnis iste natus error sit voluptatem "
-    + "accusantium doloremque laudantium, totam rem aperiam eaque ipsa,"
-    + "quae ab illo inventore veritatis et quasi architecto beatae vitae "
-    + "dicta sunt, explicabo. nemo enim ipsam voluptatem, quia voluptas"
-    + "sit, aspernatur aut odit aut fugit, sed quia consequuntur magni"
-    + " dolores eos, qui ratione voluptatem sequi nesciunt, neque porro"
-    + " quisquam est, qui dolorem ipsum, quia dolor sit, amet, "
-    + "consectetur, adipisci velit, sed quia non numquam eius modi"
-    + " tempora incidunt, ut labore et dolore magnam aliquam quaerat "
-    + "voluptatem. ut enim ad minima veniam, quis nostrum exercitationem "
-    + "ullam corporis suscipit laboriosam, nisi ut aliquid ex ea commodi "
-    + "consequatur? quis autem vel eum iure reprehenderit, qui in ea "
-    + "voluptate velit esse, quam nihil molestiae consequatur, vel illum, "
-    + "qui dolorem eum fugiat, quo voluptas nulla pariatur?\n";
-
-assertEquals(893, lipsum.indexOf("lorem ipsum, quia dolor sit, amet"),
-        "Lipsum");
-// test a lot of substrings of differing length and start-position.
-for(var i = 0; i < lipsum.length; i += 3) {
-  for(var len = 1; i + len < lipsum.length; len += 7) {
-    var substring = lipsum.substring(i, i + len);
-    var index = -1;
-    do {
-      index = lipsum.indexOf(substring, index + 1);
-      assertTrue(index != -1, 
-                 "Lipsum substring " + i + ".." + (i + len-1) + " not found");
-      assertEquals(lipsum.substring(index, index + len), substring, 
-          "Wrong lipsum substring found: " + i + ".." + (i + len - 1) + "/" + 
-              index + ".." + (index + len - 1));
-    } while (index >= 0 && index < i);
-    assertEquals(i, index, "Lipsum match at " + i + ".." + (i + len - 1));
-  }
-}

data/ext/v8/upstream/2.0.6/test/mjsunit/string-lastindexof.js

@@ -1,88 +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.
-
-var s = "test test test";
-
-var MAX_DOUBLE = 1.7976931348623157e+308;
-var MIN_DOUBLE = -MAX_DOUBLE;
-var MAX_SMI = Math.pow(2,30)-1;
-var MIN_SMI = -Math.pow(2,30);
-
-assertEquals(10, s.lastIndexOf("test", Infinity), "tinf");
-assertEquals(10, s.lastIndexOf("test", MAX_DOUBLE), "tmaxdouble");
-assertEquals(10, s.lastIndexOf("test", MAX_SMI), "tmaxsmi");
-assertEquals(10, s.lastIndexOf("test", s.length * 2), "t2length");
-assertEquals(10, s.lastIndexOf("test", 15), "t15");
-assertEquals(10, s.lastIndexOf("test", 14), "t14");
-assertEquals(10, s.lastIndexOf("test", 10), "t10");
-assertEquals(5, s.lastIndexOf("test", 9), "t9");
-assertEquals(5, s.lastIndexOf("test", 6), "t6");
-assertEquals(5, s.lastIndexOf("test", 5), "t5");
-assertEquals(0, s.lastIndexOf("test", 4), "t4");
-assertEquals(0, s.lastIndexOf("test", 0), "t0");
-assertEquals(0, s.lastIndexOf("test", -1), "t-1");
-assertEquals(0, s.lastIndexOf("test", -s.length), "t-len");
-assertEquals(0, s.lastIndexOf("test", MIN_SMI), "tminsmi");
-assertEquals(0, s.lastIndexOf("test", MIN_DOUBLE), "tmindouble");
-assertEquals(0, s.lastIndexOf("test", -Infinity), "tneginf");
-assertEquals(10, s.lastIndexOf("test"), "t");
-assertEquals(-1, s.lastIndexOf("notpresent"), "n");
-assertEquals(-1, s.lastIndexOf(), "none");
-assertEquals(10, s.lastIndexOf("test", "not a number"), "nan");
-
-var longNonMatch = "overlong string that doesn't match";
-var longAlmostMatch = "test test test!";
-var longAlmostMatch2 = "!test test test";
-
-
-assertEquals(-1, s.lastIndexOf(longNonMatch), "long");
-assertEquals(-1, s.lastIndexOf(longNonMatch, 10), "longpos");
-assertEquals(-1, s.lastIndexOf(longNonMatch, NaN), "longnan");
-assertEquals(-1, s.lastIndexOf(longAlmostMatch), "tlong");
-assertEquals(-1, s.lastIndexOf(longAlmostMatch, 10), "tlongpos");
-assertEquals(-1, s.lastIndexOf(longAlmostMatch), "tlongnan");
-
-var nonInitialMatch = "est";
-
-assertEquals(-1, s.lastIndexOf(nonInitialMatch, 0), "noninit");
-assertEquals(-1, s.lastIndexOf(nonInitialMatch, -1), "noninitneg");
-assertEquals(-1, s.lastIndexOf(nonInitialMatch, MIN_SMI), "noninitminsmi");
-assertEquals(-1, s.lastIndexOf(nonInitialMatch, MIN_DOUBLE), "noninitmindbl");
-assertEquals(-1, s.lastIndexOf(nonInitialMatch, -Infinity), "noninitneginf");
-
-for (var i = s.length + 10; i >= 0; i--) {
-  var expected = i < s.length ? i : s.length;
-  assertEquals(expected, s.lastIndexOf("", i), "empty" + i);
-}
-
-
-var reString = "asdf[a-z]+(asdf)?";
-
-assertEquals(4, reString.lastIndexOf("[a-z]+"), "r4");
-assertEquals(10, reString.lastIndexOf("(asdf)?"), "r10");
-
-assertEquals(1, String.prototype.lastIndexOf.length, "length");