Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1 | // Copyright 2012 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 | // Regression test checking that the sequence of element access in built-in |
| 29 | // array functions is specification conform (i.e. [[HasProperty]] might return |
| 30 | // bogus result after [[Get]] has been called). |
| 31 | |
| 32 | function CheckSequence(builtin, callback) { |
| 33 | var array = [1,2,3]; |
| 34 | var callback_count = 0; |
| 35 | var callback_wrapper = function() { |
| 36 | callback_count++; |
| 37 | return callback() |
| 38 | } |
| 39 | |
| 40 | // Define getter that will delete itself upon first invocation. |
| 41 | Object.defineProperty(array, '1', { |
| 42 | get: function () { delete array[1]; }, |
| 43 | configurable: true |
| 44 | }); |
| 45 | |
| 46 | assertTrue(array.hasOwnProperty('1')); |
| 47 | builtin.apply(array, [callback_wrapper, 'argument']); |
| 48 | assertFalse(array.hasOwnProperty('1')); |
| 49 | assertEquals(3, callback_count); |
| 50 | } |
| 51 | |
| 52 | CheckSequence(Array.prototype.every, function() { return true; }); |
| 53 | CheckSequence(Array.prototype.filter, function() { return true; }); |
| 54 | CheckSequence(Array.prototype.forEach, function() { return 0; }); |
| 55 | CheckSequence(Array.prototype.map, function() { return 0; }); |
| 56 | CheckSequence(Array.prototype.reduce, function() { return 0; }); |
| 57 | CheckSequence(Array.prototype.reduceRight, function() { return 0; }); |
| 58 | CheckSequence(Array.prototype.some, function() { return false; }); |