Andrew Top | ef837fa | 2017-10-04 22:44:25 -0700 | [diff] [blame] | 1 | # Copyright 2013 the V8 project authors. All rights reserved. |
| 2 | # Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved. |
| 3 | # |
| 4 | # Redistribution and use in source and binary forms, with or without |
| 5 | # modification, are permitted provided that the following conditions |
| 6 | # are met: |
| 7 | # 1. Redistributions of source code must retain the above copyright |
| 8 | # notice, this list of conditions and the following disclaimer. |
| 9 | # 2. Redistributions in binary form must reproduce the above copyright |
| 10 | # notice, this list of conditions and the following disclaimer in the |
| 11 | # documentation and/or other materials provided with the distribution. |
| 12 | # |
| 13 | # THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND ANY |
| 14 | # EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
| 15 | # WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
| 16 | # DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR ANY |
| 17 | # DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
| 18 | # (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
| 19 | # LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON |
| 20 | # ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 21 | # (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
| 22 | # SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 23 | |
| 24 | This tests that arrays have holes that you can see the prototype through, not just missing values. |
| 25 | |
| 26 | On success, you will see a series of "PASS" messages, followed by "TEST COMPLETE". |
| 27 | |
| 28 | |
| 29 | PASS var a = []; a.length = 1; showHoles(a) is '[hole]' |
| 30 | PASS var a = []; a[0] = undefined; showHoles(a) is '[undefined]' |
| 31 | PASS var a = []; a[0] = undefined; delete a[0]; showHoles(a) is '[hole]' |
| 32 | PASS showHoles([0, , 2]) is '[0, hole, 2]' |
| 33 | PASS showHoles([0, 1, ,]) is '[0, 1, hole]' |
| 34 | PASS showHoles([0, , 2].concat([3, , 5])) is '[0, hole, 2, 3, hole, 5]' |
| 35 | PASS showHoles([0, , 2, 3].reverse()) is '[3, 2, hole, 0]' |
| 36 | PASS a = [0, , 2, 3]; a.shift(); showHoles(a) is '[hole, 2, 3]' |
| 37 | PASS showHoles([0, , 2, 3].slice(0, 3)) is '[0, hole, 2]' |
| 38 | PASS showHoles([0, , 2, 3].sort()) is '[0, 2, 3, hole]' |
| 39 | PASS showHoles([0, undefined, 2, 3].sort()) is '[0, 2, 3, undefined]' |
| 40 | PASS a = [0, , 2, 3]; a.splice(2, 3, 5, 6); showHoles(a) is '[0, hole, 5, 6]' |
| 41 | PASS a = [0, , 2, 3]; a.unshift(4); showHoles(a) is '[4, 0, hole, 2, 3]' |
| 42 | PASS showHoles([0, , 2, 3].filter(returnTrue)) is '[0, 2, 3]' |
| 43 | PASS showHoles([0, undefined, 2, 3].filter(returnTrue)) is '[0, undefined, 2, 3]' |
| 44 | PASS showHoles([0, , 2, 3].map(returnTrue)) is '[true, hole, true, true]' |
| 45 | PASS showHoles([0, undefined, 2, 3].map(returnTrue)) is '[true, true, true, true]' |
| 46 | PASS a = []; [0, , 2, 3].every(addToArrayReturnTrue); showHoles(a) is '[0, 2, 3]' |
| 47 | PASS a = []; [0, undefined, 2, 3].every(addToArrayReturnTrue); showHoles(a) is '[0, undefined, 2, 3]' |
| 48 | PASS a = []; [0, , 2, 3].forEach(addToArray); showHoles(a) is '[0, 2, 3]' |
| 49 | PASS a = []; [0, undefined, 2, 3].forEach(addToArray); showHoles(a) is '[0, undefined, 2, 3]' |
| 50 | PASS a = []; [0, , 2, 3].some(addToArrayReturnFalse); showHoles(a) is '[0, 2, 3]' |
| 51 | PASS a = []; [0, undefined, 2, 3].some(addToArrayReturnFalse); showHoles(a) is '[0, undefined, 2, 3]' |
| 52 | PASS [0, , 2, 3].indexOf() is -1 |
| 53 | PASS [0, undefined, 2, 3].indexOf() is 1 |
| 54 | PASS [0, , 2, 3].lastIndexOf() is -1 |
| 55 | PASS [0, undefined, 2, 3].lastIndexOf() is 1 |
| 56 | PASS showHoles([0, , 2]) is '[0, hole, 2]' |
| 57 | PASS showHoles([0, 1, ,]) is '[0, 1, hole]' |
| 58 | PASS showHoles([0, , 2].concat([3, , 5])) is '[0, peekaboo, 2, 3, peekaboo, 5]' |
| 59 | PASS showHoles([0, , 2, 3].reverse()) is '[3, 2, peekaboo, 0]' |
| 60 | PASS a = [0, , 2, 3]; a.shift(); showHoles(a) is '[peekaboo, 2, 3]' |
| 61 | PASS showHoles([0, , 2, 3].slice(0, 3)) is '[0, peekaboo, 2]' |
Andrew Top | 63c7ad4 | 2019-11-25 16:10:13 -0800 | [diff] [blame] | 62 | PASS showHoles([0, , 2, 3].sort()) is '[0, 2, 3, peekaboo]' |
Andrew Top | ef837fa | 2017-10-04 22:44:25 -0700 | [diff] [blame] | 63 | PASS showHoles([0, undefined, 2, 3].sort()) is '[0, 2, 3, undefined]' |
| 64 | PASS a = [0, , 2, 3]; a.splice(2, 3, 5, 6); showHoles(a) is '[0, hole, 5, 6]' |
| 65 | PASS a = [0, , 2, 3]; a.unshift(4); showHoles(a) is '[4, 0, peekaboo, 2, 3]' |
| 66 | PASS showHoles([0, , 2, 3].filter(returnTrue)) is '[0, peekaboo, 2, 3]' |
| 67 | PASS showHoles([0, undefined, 2, 3].filter(returnTrue)) is '[0, undefined, 2, 3]' |
| 68 | PASS showHoles([0, , 2, 3].map(returnTrue)) is '[true, true, true, true]' |
| 69 | PASS showHoles([0, undefined, 2, 3].map(returnTrue)) is '[true, true, true, true]' |
| 70 | PASS a = []; [0, , 2, 3].every(addToArrayReturnTrue); showHoles(a) is '[0, peekaboo, 2, 3]' |
| 71 | PASS a = []; [0, undefined, 2, 3].every(addToArrayReturnTrue); showHoles(a) is '[0, undefined, 2, 3]' |
| 72 | PASS a = []; [0, , 2, 3].forEach(addToArray); showHoles(a) is '[0, peekaboo, 2, 3]' |
| 73 | PASS a = []; [0, undefined, 2, 3].forEach(addToArray); showHoles(a) is '[0, undefined, 2, 3]' |
| 74 | PASS a = []; [0, , 2, 3].some(addToArrayReturnFalse); showHoles(a) is '[0, peekaboo, 2, 3]' |
| 75 | PASS a = []; [0, undefined, 2, 3].some(addToArrayReturnFalse); showHoles(a) is '[0, undefined, 2, 3]' |
| 76 | PASS [0, , 2, 3].indexOf() is -1 |
| 77 | PASS [0, , 2, 3].indexOf('peekaboo') is 1 |
| 78 | PASS [0, undefined, 2, 3].indexOf() is 1 |
| 79 | PASS [0, , 2, 3].lastIndexOf() is -1 |
| 80 | PASS [0, , 2, 3].lastIndexOf('peekaboo') is 1 |
| 81 | PASS [0, undefined, 2, 3].lastIndexOf() is 1 |
| 82 | PASS successfullyParsed is true |
| 83 | |
| 84 | TEST COMPLETE |
| 85 | |