OLD | NEW |
1 // Copyright 2010-2015 the V8 project authors. All rights reserved. | 1 // Copyright 2010-2015 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 10 matching lines...) Expand all Loading... |
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
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 // Tests the Reflect.preventExtensions method - ES6 26.1.12. | 28 // Tests the Reflect.preventExtensions method - ES6 26.1.12. |
29 // This is adapted from object-prevent-extensions.js. | 29 // This is adapted from object-prevent-extensions.js. |
30 | 30 |
31 // Flags: --allow-natives-syntax --harmony-reflect | 31 // Flags: --allow-natives-syntax |
32 | 32 |
33 | 33 |
34 var obj1 = {}; | 34 var obj1 = {}; |
35 // Extensible defaults to true. | 35 // Extensible defaults to true. |
36 assertTrue(Object.isExtensible(obj1)); | 36 assertTrue(Object.isExtensible(obj1)); |
37 assertTrue(Reflect.preventExtensions(obj1)); | 37 assertTrue(Reflect.preventExtensions(obj1)); |
38 | 38 |
39 // Make sure the is_extensible flag is set. | 39 // Make sure the is_extensible flag is set. |
40 assertFalse(Object.isExtensible(obj1)); | 40 assertFalse(Object.isExtensible(obj1)); |
41 obj1.x = 42; | 41 obj1.x = 42; |
(...skipping 113 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
155 obj = { prop1: 1, prop2: 2, 75: 'foo' }; | 155 obj = { prop1: 1, prop2: 2, 75: 'foo' }; |
156 obj2 = { prop1: 3, prop2: 4, 150: 'bar' }; | 156 obj2 = { prop1: 3, prop2: 4, 150: 'bar' }; |
157 assertTrue(%HaveSameMap(obj, obj2)); | 157 assertTrue(%HaveSameMap(obj, obj2)); |
158 assertTrue(Reflect.preventExtensions(obj)); | 158 assertTrue(Reflect.preventExtensions(obj)); |
159 assertTrue(Reflect.preventExtensions(obj2)); | 159 assertTrue(Reflect.preventExtensions(obj2)); |
160 assertFalse(Object.isExtensible(obj)); | 160 assertFalse(Object.isExtensible(obj)); |
161 assertFalse(Object.isExtensible(obj2)); | 161 assertFalse(Object.isExtensible(obj2)); |
162 assertFalse(Object.isSealed(obj)); | 162 assertFalse(Object.isSealed(obj)); |
163 assertFalse(Object.isSealed(obj2)); | 163 assertFalse(Object.isSealed(obj2)); |
164 assertTrue(%HaveSameMap(obj, obj2)); | 164 assertTrue(%HaveSameMap(obj, obj2)); |
OLD | NEW |