ager@chromium.org | 9258b6b | 2008-09-11 09:11:10 +0000 | [diff] [blame] | 1 | // Copyright 2008 the V8 project authors. All rights reserved. |
mads.s.ager@gmail.com | 9a4089a | 2008-09-01 08:55:01 +0000 | [diff] [blame] | 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 check_enumeration_order(obj) { |
ager@chromium.org | 65dad4b | 2009-04-23 08:48:43 +0000 | [diff] [blame] | 29 | var value = 0; |
mads.s.ager@gmail.com | 9a4089a | 2008-09-01 08:55:01 +0000 | [diff] [blame] | 30 | for (var name in obj) assertTrue(value < obj[name]); |
| 31 | value = obj[name]; |
| 32 | } |
| 33 | |
| 34 | function make_object(size) { |
| 35 | var a = new Object(); |
ager@chromium.org | 65dad4b | 2009-04-23 08:48:43 +0000 | [diff] [blame] | 36 | |
mads.s.ager@gmail.com | 9a4089a | 2008-09-01 08:55:01 +0000 | [diff] [blame] | 37 | for (var i = 0; i < size; i++) a["a_" + i] = i + 1; |
| 38 | check_enumeration_order(a); |
ager@chromium.org | 65dad4b | 2009-04-23 08:48:43 +0000 | [diff] [blame] | 39 | |
mads.s.ager@gmail.com | 9a4089a | 2008-09-01 08:55:01 +0000 | [diff] [blame] | 40 | for (var i = 0; i < size; i +=3) delete a["a_" + i]; |
| 41 | check_enumeration_order(a); |
| 42 | } |
| 43 | |
| 44 | // Validate the enumeration order for object up to 100 named properties. |
| 45 | for (var j = 1; j< 100; j++) make_object(j); |
| 46 | |
| 47 | |
| 48 | function make_literal_object(size) { |
| 49 | var code = "{ "; |
| 50 | for (var i = 0; i < size-1; i++) code += " a_" + i + " : " + (i + 1) + ", "; |
| 51 | code += "a_" + (size - 1) + " : " + size; |
| 52 | code += " }"; |
| 53 | eval("var a = " + code); |
ager@chromium.org | 65dad4b | 2009-04-23 08:48:43 +0000 | [diff] [blame] | 54 | check_enumeration_order(a); |
mads.s.ager@gmail.com | 9a4089a | 2008-09-01 08:55:01 +0000 | [diff] [blame] | 55 | } |
| 56 | |
ager@chromium.org | 65dad4b | 2009-04-23 08:48:43 +0000 | [diff] [blame] | 57 | // Validate the enumeration order for object literals up to 100 named |
| 58 | // properties. |
mads.s.ager@gmail.com | 9a4089a | 2008-09-01 08:55:01 +0000 | [diff] [blame] | 59 | for (var j = 1; j< 100; j++) make_literal_object(j); |
| 60 | |
ager@chromium.org | 65dad4b | 2009-04-23 08:48:43 +0000 | [diff] [blame] | 61 | // We enumerate indexed properties in numerical order followed by |
| 62 | // named properties in insertion order, followed by indexed properties |
| 63 | // of the prototype object in numerical order, followed by named |
| 64 | // properties of the prototype object in insertion order, and so on. |
| 65 | // |
| 66 | // This enumeration order is not required by the specification, so |
| 67 | // this just documents our choice. |
| 68 | var proto2 = {}; |
| 69 | proto2[140000] = 0; |
| 70 | proto2.a = 0; |
| 71 | proto2[2] = 0; |
| 72 | proto2[3] = 0; // also on the 'proto1' object |
| 73 | proto2.b = 0; |
| 74 | proto2[4294967295] = 0; |
| 75 | proto2.c = 0; |
| 76 | proto2[4294967296] = 0; |
| 77 | |
| 78 | var proto1 = {}; |
| 79 | proto1[5] = 0; |
| 80 | proto1.d = 0; |
| 81 | proto1[3] = 0; |
| 82 | proto1.e = 0; |
| 83 | proto1.f = 0; // also on the 'o' object |
| 84 | |
| 85 | var o = {}; |
| 86 | o[-23] = 0; |
| 87 | o[300000000000] = 0; |
| 88 | o[23] = 0; |
| 89 | o.f = 0; |
| 90 | o.g = 0; |
| 91 | o[-4] = 0; |
| 92 | o[42] = 0; |
| 93 | |
| 94 | o.__proto__ = proto1; |
| 95 | proto1.__proto__ = proto2; |
| 96 | |
| 97 | var expected = ['23', '42', // indexed from 'o' |
| 98 | '-23', '300000000000', 'f', 'g', '-4', // named from 'o' |
| 99 | '3', '5', // indexed from 'proto1' |
| 100 | 'd', 'e', // named from 'proto1' |
| 101 | '2', '140000', '4294967295', // indexed from 'proto2' |
| 102 | 'a', 'b', 'c', '4294967296']; // named from 'proto2' |
| 103 | var actual = []; |
| 104 | for (var p in o) actual.push(p); |
| 105 | assertArrayEquals(expected, actual); |
| 106 | |
| 107 | |
| 108 | |
| 109 | |