📄 apply.js.svn-base
字号:
// 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;}assertTrue(this === f0.apply(), "1-0");assertTrue(this === f0.apply(this), "2a");assertTrue(this === f0.apply(this, new Array(1)), "2b");assertTrue(this === f0.apply(this, new Array(2)), "2c");assertTrue(this === f0.apply(this, new Array(4242)), "2c");assertTrue(this === f0.apply(null), "3a");assertTrue(this === f0.apply(null, new Array(1)), "3b");assertTrue(this === f0.apply(null, new Array(2)), "3c");assertTrue(this === f0.apply(this, new Array(4242)), "2c");assertTrue(this === f0.apply(void 0), "4a");assertTrue(this === f0.apply(void 0, new Array(1)), "4b");assertTrue(this === f0.apply(void 0, new Array(2)), "4c");assertTrue(void 0 === f1.apply(), "1-1");assertTrue(void 0 === f1.apply(this), "2a");assertTrue(void 0 === f1.apply(this, new Array(1)), "2b");assertTrue(void 0 === f1.apply(this, new Array(2)), "2c");assertTrue(void 0 === f1.apply(this, new Array(4242)), "2c");assertTrue(42 === f1.apply(this, new Array(42, 43)), "2c");assertEquals("foo", f1.apply(this, new Array("foo", "bar", "baz", "boo")), "2c");assertTrue(void 0 === f1.apply(null), "3a");assertTrue(void 0 === f1.apply(null, new Array(1)), "3b");assertTrue(void 0 === f1.apply(null, new Array(2)), "3c");assertTrue(void 0 === f1.apply(null, new Array(4242)), "2c");assertTrue(42 === f1.apply(null, new Array(42, 43)), "2c");assertEquals("foo", f1.apply(null, new Array("foo", "bar", "baz", "boo")), "2c");assertTrue(void 0 === f1.apply(void 0), "4a");assertTrue(void 0 === f1.apply(void 0, new Array(1)), "4b");assertTrue(void 0 === f1.apply(void 0, new Array(2)), "4c");assertTrue(void 0 === f1.apply(void 0, new Array(4242)), "4c");assertTrue(42 === f1.apply(void 0, new Array(42, 43)), "2c");assertEquals("foo", f1.apply(void 0, new Array("foo", "bar", "baz", "boo")), "2c");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));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));function s() { var doo = this; for (var i = 0; i < arguments.length; i++) { doo += arguments[i]; } return doo;}assertEquals("bar42foofishhorse", s.apply("bar", arr));function al() { assertEquals(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("Function.prototype.apply") != -1); for (; j < 0x40000000; j <<= 1) { var caught = false; try { a = new Array(j); a[j - 1] = 42; al.apply(345, a); assertEquals("Shouldn't get", "here"); } catch (e) { assertTrue(e.toString().indexOf("Function.prototype.apply") != -1); caught = true; } assertTrue(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]);assertEquals(primes.length, same_primes.length);Array.prototype["1"] = "sep";var holey = new Array(3);holey[0] = "mor";holey[2] = "er";assertEquals("morseper", String.prototype.concat.apply("", holey));assertEquals("morseper", String.prototype.concat.apply("", holey, 1));assertEquals("morseper", String.prototype.concat.apply("", holey, 1, 2));assertEquals("morseper", String.prototype.concat.apply("", holey, 1, 2, 3));assertEquals("morseper", String.prototype.concat.apply("", holey, 1, 2, 3, 4));primes[0] = "";primes[1] = holey;assertThrows("String.prototype.concat.apply.apply('foo', primes)");assertEquals("morseper", String.prototype.concat.apply.apply(String.prototype.concat, primes));delete(Array.prototype["1"]);
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -