OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
2 // Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved. | 2 // Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved. |
3 // | 3 // |
4 // Redistribution and use in source and binary forms, with or without | 4 // Redistribution and use in source and binary forms, with or without |
5 // modification, are permitted provided that the following conditions | 5 // modification, are permitted provided that the following conditions |
6 // are met: | 6 // are met: |
7 // 1. Redistributions of source code must retain the above copyright | 7 // 1. Redistributions of source code must retain the above copyright |
8 // notice, this list of conditions and the following disclaimer. | 8 // notice, this list of conditions and the following disclaimer. |
9 // 2. Redistributions in binary form must reproduce the above copyright | 9 // 2. Redistributions in binary form must reproduce the above copyright |
10 // notice, this list of conditions and the following disclaimer in the | 10 // notice, this list of conditions and the following disclaimer in the |
11 // documentation and/or other materials provided with the distribution. | 11 // documentation and/or other materials provided with the distribution. |
12 // | 12 // |
13 // THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND AN
Y | 13 // THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND AN
Y |
14 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED | 14 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
15 // WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE | 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 AN
Y | 16 // DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR AN
Y |
17 // DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES | 17 // DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
18 // (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | 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 O
N | 19 // LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND O
N |
20 // ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 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 | 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. | 22 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
23 | 23 |
24 description( | 24 description( |
25 "Tests the behavior of Array.prototype.concat while the array is having a bad ti
me due to one of the elements we are concatenating." | 25 'This test checks lastIndexOf for various values in an array' |
26 ); | 26 ); |
27 | 27 |
28 Object.defineProperty(Array.prototype, 0, { writable: false }); | |
29 shouldBe("[42].concat()", "[42]"); | |
30 | 28 |
| 29 var testArray = [2, 5, 9, 2]; |
| 30 var lastIndex = 0; |
31 | 31 |
| 32 lastIndex = testArray.lastIndexOf(2,-500); |
| 33 shouldBe('lastIndex', '-1'); |
| 34 lastIndex = testArray.lastIndexOf(9,500); |
| 35 shouldBe('lastIndex', '2'); |
| 36 lastIndex = testArray.lastIndexOf(2); |
| 37 shouldBe('lastIndex', '3'); |
| 38 lastIndex = testArray.lastIndexOf(7); |
| 39 shouldBe('lastIndex', '-1'); |
| 40 lastIndex = testArray.lastIndexOf(2, 3); |
| 41 shouldBe('lastIndex', '3'); |
| 42 lastIndex = testArray.lastIndexOf(2, 2); |
| 43 shouldBe('lastIndex', '0'); |
| 44 lastIndex = testArray.lastIndexOf(2, -2); |
| 45 shouldBe('lastIndex', '0'); |
| 46 lastIndex = testArray.lastIndexOf(2, -1); |
| 47 shouldBe('lastIndex', '3'); |
| 48 |
| 49 delete testArray[1]; |
| 50 |
| 51 lastIndex = testArray.lastIndexOf(undefined); |
| 52 shouldBe('lastIndex', '-1'); |
| 53 |
| 54 delete testArray[3]; |
| 55 |
| 56 lastIndex = testArray.lastIndexOf(undefined); |
| 57 shouldBe('lastIndex', '-1'); |
| 58 |
| 59 testArray = new Array(20); |
| 60 |
| 61 lastIndex = testArray.lastIndexOf(undefined); |
| 62 shouldBe('lastIndex', '-1'); |
| 63 |
| 64 testArray[19] = undefined; |
| 65 |
| 66 lastIndex = testArray.lastIndexOf(undefined); |
| 67 shouldBe('lastIndex', '19'); |
| 68 |
| 69 lastIndex = testArray.lastIndexOf(undefined, 18); |
| 70 shouldBe('lastIndex', '-1'); |
| 71 |
| 72 delete testArray[19]; |
| 73 |
| 74 lastIndex = testArray.lastIndexOf(undefined); |
| 75 shouldBe('lastIndex', '-1'); |
OLD | NEW |