OLD | NEW |
---|---|
1 // Copyright 2008 the V8 project authors. All rights reserved. | 1 // Copyright 2008 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 11 matching lines...) Expand all Loading... | |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 assertTrue('abc'[10] === undefined); | 28 assertTrue('abc'[10] === undefined); |
29 String.prototype[10] = 'x'; | 29 String.prototype[10] = 'x'; |
30 assertEquals('abc'[10], 'x'); | 30 assertEquals('abc'[10], 'x'); |
31 | 31 |
32 // Test that the fast case character-at stub handles an out-of-bound | |
33 // index correctly. We need to call the function twice to initialize | |
34 // the character-at stub. | |
35 function f() { | |
36 assertEquals('abc'[10], 'x'); | |
37 } | |
38 f(); | |
Kasper Lund
2010/09/16 09:17:05
Add a comment about why you need two calls here.
| |
39 f(); | |
40 | |
32 assertTrue(2[11] === undefined); | 41 assertTrue(2[11] === undefined); |
33 Number.prototype[11] = 'y'; | 42 Number.prototype[11] = 'y'; |
34 assertEquals(2[11], 'y'); | 43 assertEquals(2[11], 'y'); |
35 | 44 |
36 assertTrue(true[12] === undefined); | 45 assertTrue(true[12] === undefined); |
37 Boolean.prototype[12] = 'z'; | 46 Boolean.prototype[12] = 'z'; |
38 assertEquals(true[12], 'z'); | 47 assertEquals(true[12], 'z'); |
OLD | NEW |