mirror of https://github.com/lukechilds/node.git
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
105 lines
3.0 KiB
105 lines
3.0 KiB
// Copyright 2009 the V8 project authors. All rights reserved.
|
|
// Redistribution and use in source and binary forms, with or without
|
|
// modification, are permitted provided that the following conditions are
|
|
// met:
|
|
//
|
|
// * Redistributions of source code must retain the above copyright
|
|
// notice, this list of conditions and the following disclaimer.
|
|
// * Redistributions in binary form must reproduce the above
|
|
// copyright notice, this list of conditions and the following
|
|
// disclaimer in the documentation and/or other materials provided
|
|
// with the distribution.
|
|
// * Neither the name of Google Inc. nor the names of its
|
|
// contributors may be used to endorse or promote products derived
|
|
// from this software without specific prior written permission.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
var obj = {
|
|
a: 7,
|
|
b: { x: 12, y: 24 },
|
|
c: 'Zebra'
|
|
}
|
|
|
|
assertEquals(7, obj.a);
|
|
assertEquals(12, obj.b.x);
|
|
assertEquals(24, obj.b.y);
|
|
assertEquals('Zebra', obj.c);
|
|
|
|
var z = 24;
|
|
|
|
var obj2 = {
|
|
a: 7,
|
|
b: { x: 12, y: z },
|
|
c: 'Zebra'
|
|
}
|
|
|
|
assertEquals(7, obj2.a);
|
|
assertEquals(12, obj2.b.x);
|
|
assertEquals(24, obj2.b.y);
|
|
assertEquals('Zebra', obj2.c);
|
|
|
|
var arr = [];
|
|
for (var i = 0; i < 2; i++) {
|
|
arr[i] = {
|
|
a: 7,
|
|
b: { x: 12, y: 24 },
|
|
c: 'Zebra'
|
|
}
|
|
}
|
|
|
|
arr[0].b.x = 2;
|
|
assertEquals(2, arr[0].b.x);
|
|
assertEquals(12, arr[1].b.x);
|
|
|
|
|
|
function makeSparseArray() {
|
|
return {
|
|
'0': { x: 12, y: 24 },
|
|
'1000000': { x: 0, y: 0 }
|
|
};
|
|
}
|
|
|
|
var sa1 = makeSparseArray();
|
|
sa1[0].x = 0;
|
|
var sa2 = makeSparseArray();
|
|
assertEquals(12, sa2[0].x);
|
|
|
|
// Test that non-constant literals work.
|
|
var n = new Object();
|
|
|
|
function makeNonConstantArray() { return [ [ n ] ]; }
|
|
|
|
var a = makeNonConstantArray();
|
|
a[0][0].foo = "bar";
|
|
assertEquals("bar", n.foo);
|
|
|
|
function makeNonConstantObject() { return { a: { b: n } }; }
|
|
|
|
a = makeNonConstantObject();
|
|
a.a.b.bar = "foo";
|
|
assertEquals("foo", n.bar);
|
|
|
|
// Test that exceptions for regexps still hold.
|
|
function makeRegexpInArray() { return [ [ /a*/, {} ] ]; }
|
|
|
|
a = makeRegexpInArray();
|
|
var b = makeRegexpInArray();
|
|
assertTrue(a[0][0] === b[0][0]);
|
|
assertFalse(a[0][1] === b[0][1]);
|
|
|
|
function makeRegexpInObject() { return { a: { b: /b*/, c: {} } }; }
|
|
a = makeRegexpInObject();
|
|
b = makeRegexpInObject();
|
|
assertTrue(a.a.b === b.a.b);
|
|
assertFalse(a.a.c === b.a.c);
|
|
|