9bed566bdb
Added presubmit step to check copyright. git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@242 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
87 lines
3.0 KiB
JavaScript
87 lines
3.0 KiB
JavaScript
// Copyright 2008 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.
|
|
|
|
function props(x) {
|
|
var array = [];
|
|
for (var p in x) array.push(p);
|
|
return array.sort();
|
|
}
|
|
|
|
assertEquals(0, props({}).length);
|
|
assertEquals(1, props({x:1}).length);
|
|
assertEquals(2, props({x:1, y:2}).length);
|
|
|
|
assertArrayEquals(["x"], props({x:1}));
|
|
assertArrayEquals(["x", "y"], props({x:1, y:2}));
|
|
assertArrayEquals(["x", "y", "zoom"], props({x:1, y:2, zoom:3}));
|
|
|
|
assertEquals(0, props([]).length);
|
|
assertEquals(1, props([1]).length);
|
|
assertEquals(2, props([1,2]).length);
|
|
|
|
assertArrayEquals(["0"], props([1]));
|
|
assertArrayEquals(["0", "1"], props([1,2]));
|
|
assertArrayEquals(["0", "1", "2"], props([1,2,3]));
|
|
|
|
var o = {};
|
|
var a = [];
|
|
for (var i = 0x0020; i < 0x01ff; i+=2) {
|
|
var s = 'char:' + String.fromCharCode(i);
|
|
a.push(s);
|
|
o[s] = i;
|
|
}
|
|
assertArrayEquals(a, props(o));
|
|
|
|
var a = [];
|
|
assertEquals(0, props(a).length);
|
|
a[Math.pow(2,30)-1] = 0;
|
|
assertEquals(1, props(a).length);
|
|
a[Math.pow(2,31)-1] = 0;
|
|
assertEquals(2, props(a).length);
|
|
a[1] = 0;
|
|
assertEquals(3, props(a).length);
|
|
|
|
for (var hest = 'hest' in {}) { }
|
|
assertEquals('hest', hest);
|
|
|
|
var result = '';
|
|
for (var p in {a : [0], b : 1}) { result += p; }
|
|
assertEquals('ab', result);
|
|
|
|
var result = '';
|
|
for (var p in {a : {v:1}, b : 1}) { result += p; }
|
|
assertEquals('ab', result);
|
|
|
|
var result = '';
|
|
for (var p in { get a() {}, b : 1}) { result += p; }
|
|
assertEquals('ab', result);
|
|
|
|
var result = '';
|
|
for (var p in { get a() {}, set a(x) {}, b : 1}) { result += p; }
|
|
assertEquals('ab', result);
|
|
|