Chromium Code Reviews| OLD | NEW |
|---|---|
| (Empty) | |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | |
| 2 // Redistribution and use in source and binary forms, with or without | |
| 3 // modification, are permitted provided that the following conditions are | |
| 4 // met: | |
| 5 // | |
| 6 // * Redistributions of source code must retain the above copyright | |
| 7 // notice, this list of conditions and the following disclaimer. | |
| 8 // * Redistributions in binary form must reproduce the above | |
| 9 // copyright notice, this list of conditions and the following | |
| 10 // disclaimer in the documentation and/or other materials provided | |
| 11 // with the distribution. | |
| 12 // * Neither the name of Google Inc. nor the names of its | |
| 13 // contributors may be used to endorse or promote products derived | |
| 14 // from this software without specific prior written permission. | |
| 15 // | |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
| 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
| 27 | |
| 28 // Check that reduce and reduceRight call the callback function with | |
| 29 // undefined as the receiver. | |
| 30 // | |
| 31 // In addition, check that none of the array functions that take | |
| 32 // callbacks use Function.prototype.apply or Function.prototype.call | |
| 33 // internally. | |
| 34 | |
| 35 Function.prototype.apply = function() { | |
| 36 throw "Array operation used Function.prototype.apply"; | |
| 37 }; | |
| 38 | |
| 39 | |
| 40 Function.prototype.call = function() { | |
| 41 throw "Array operation used Function.prototype.call"; | |
| 42 }; | |
| 43 | |
| 44 | |
| 45 // Check receiver for reduce and reduceRight. | |
| 46 assertEquals(void 0, [2, 3].reduce(function(){ return this; })); | |
|
Lasse Reichstein
2011/06/08 18:41:42
That's incorrect. The "this" value should be the g
| |
| 47 assertEquals(void 0, [2, 3].reduceRight(function(){ return this; })); | |
| 48 | |
| 49 | |
| 50 // Call each of the other array functions to verify that the overwritten | |
| 51 // Function.prototype.{call,apply} are not called. | |
| 52 [2, 3].filter(function() {}); | |
| 53 [2, 3].forEach(function() {}); | |
| 54 [2, 3].some(function() {}); | |
| 55 [2, 3].every(function() {}); | |
| 56 [2, 3].map(function() {}); | |
|
Lasse Reichstein
2011/06/08 18:41:42
Try testing with both strict and non-strict functi
| |
| OLD | NEW |