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 // Test dictionary -> double elements -> dictionary elements round trip |
| 29 |
| 30 var foo = new Array(500000); |
| 31 |
| 32 function func(a) { |
| 33 for (var i= 0; i < 100000; ++i ) { |
| 34 a[i] = i+0.5; |
| 35 } |
| 36 } |
| 37 |
| 38 func(foo); |
| 39 |
| 40 for (var i= 0; i < 100000; i += 500 ) { |
| 41 assertEquals(i+0.5, foo[i]); |
| 42 } |
| 43 |
| 44 delete foo[5]; |
| 45 // Don't use assertEquals for comparison to undefined due to |
| 46 assertTrue(undefined === foo[5]); |
| 47 assertTrue(undefined === foo[500000-1]); |
| 48 assertTrue(undefined === foo[-1]); |
| 49 assertEquals(500000, foo.length); |
| 50 |
| 51 // Cause the array to grow beyond it's JSArray length. This will double the |
| 52 // size of the capacity and force the array into "slow" dictionary case. |
| 53 foo[500001] = 50; |
| 54 assertEquals(50, foo[500001]); |
| 55 assertEquals(500002, foo.length); |
| 56 assertTrue(undefined === foo[5]) |
| 57 assertTrue(undefined === foo[500000-1]) |
| 58 assertTrue(undefined === foo[-1]) |
| 59 assertEquals(500002, foo.length); |
| 60 |
| 61 // Test dictionary -> double elements -> fast elements. |
| 62 |
| 63 var foo2 = new Array(500000); |
| 64 func(foo2); |
| 65 delete foo2[5]; |
| 66 |
| 67 // Convert back to fast elements and make sure the contents of the array are |
| 68 // unchanged. |
| 69 foo2[25] = new Object(); |
| 70 for (var i= 0; i < 100000; i += 500 ) { |
| 71 if (i != 25 && i != 5) { |
| 72 assertEquals(i+0.5, foo2[i]); |
| 73 } |
| 74 } |
| 75 assertTrue(undefined === foo2[5]) |
| 76 assertTrue(undefined === foo2[500000-1]) |
| 77 assertTrue(undefined === foo2[-1]) |
| 78 assertEquals(500000, foo2.length); |
OLD | NEW |