Steve Block | a7e24c1 | 2009-10-30 11:49:00 +0000 | [diff] [blame^] | 1 | // Copyright 2008 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 | function props(x) { |
| 29 | var array = []; |
| 30 | for (var p in x) array.push(p); |
| 31 | return array.sort(); |
| 32 | } |
| 33 | |
| 34 | assertEquals(0, props({}).length); |
| 35 | assertEquals(1, props({x:1}).length); |
| 36 | assertEquals(2, props({x:1, y:2}).length); |
| 37 | |
| 38 | assertArrayEquals(["x"], props({x:1})); |
| 39 | assertArrayEquals(["x", "y"], props({x:1, y:2})); |
| 40 | assertArrayEquals(["x", "y", "zoom"], props({x:1, y:2, zoom:3})); |
| 41 | |
| 42 | assertEquals(0, props([]).length); |
| 43 | assertEquals(1, props([1]).length); |
| 44 | assertEquals(2, props([1,2]).length); |
| 45 | |
| 46 | assertArrayEquals(["0"], props([1])); |
| 47 | assertArrayEquals(["0", "1"], props([1,2])); |
| 48 | assertArrayEquals(["0", "1", "2"], props([1,2,3])); |
| 49 | |
| 50 | var o = {}; |
| 51 | var a = []; |
| 52 | for (var i = 0x0020; i < 0x01ff; i+=2) { |
| 53 | var s = 'char:' + String.fromCharCode(i); |
| 54 | a.push(s); |
| 55 | o[s] = i; |
| 56 | } |
| 57 | assertArrayEquals(a, props(o)); |
| 58 | |
| 59 | var a = []; |
| 60 | assertEquals(0, props(a).length); |
| 61 | a[Math.pow(2,30)-1] = 0; |
| 62 | assertEquals(1, props(a).length); |
| 63 | a[Math.pow(2,31)-1] = 0; |
| 64 | assertEquals(2, props(a).length); |
| 65 | a[1] = 0; |
| 66 | assertEquals(3, props(a).length); |
| 67 | |
| 68 | for (var hest = 'hest' in {}) { } |
| 69 | assertEquals('hest', hest); |
| 70 | |
| 71 | var result = ''; |
| 72 | for (var p in {a : [0], b : 1}) { result += p; } |
| 73 | assertEquals('ab', result); |
| 74 | |
| 75 | var result = ''; |
| 76 | for (var p in {a : {v:1}, b : 1}) { result += p; } |
| 77 | assertEquals('ab', result); |
| 78 | |
| 79 | var result = ''; |
| 80 | for (var p in { get a() {}, b : 1}) { result += p; } |
| 81 | assertEquals('ab', result); |
| 82 | |
| 83 | var result = ''; |
| 84 | for (var p in { get a() {}, set a(x) {}, b : 1}) { result += p; } |
| 85 | assertEquals('ab', result); |
| 86 | |