1
// -*- mode: c++; c-basic-offset: 4 -*-
3
* Copyright (C) 2006 Apple Computer, Inc. All rights reserved.
5
* Redistribution and use in source and binary forms, with or without
6
* modification, are permitted provided that the following conditions
8
* 1. Redistributions of source code must retain the above copyright
9
* notice, this list of conditions and the following disclaimer.
10
* 2. Redistributions in binary form must reproduce the above copyright
11
* notice, this list of conditions and the following disclaimer in the
12
* documentation and/or other materials provided with the distribution.
14
* THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY
15
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
17
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR
18
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
19
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
20
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
21
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
22
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
24
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
function shouldBe(a, b)
36
if (evalA == b || isNaN(evalA) && typeof evalA == 'number' && isNaN(b) && typeof b == 'number')
37
print("PASS: " + a + " should be " + b + " and is.", "green");
39
print("__FAIL__: " + a + " should be " + b + " but instead is " + evalA + ".", "red");
44
print("Node is " + Node);
46
print(p + ": " + Node[p]);
49
print("node is " + node);
51
print(p + ": " + node[p]);
57
node.appendChild(child1);
58
node.appendChild(child2);
60
var childNodes = node.childNodes;
62
for (var i = 0; i < childNodes.length + 1; i++) {
63
print("item " + i + ": " + childNodes.item(i));
66
for (var i = 0; i < childNodes.length + 1; i++) {
67
print(i + ": " + childNodes[i]);
70
node.removeChild(child1);
71
node.replaceChild(child3, child2);
73
for (var i = 0; i < childNodes.length + 1; i++) {
74
print("item " + i + ": " + childNodes.item(i));
77
for (var i = 0; i < childNodes.length + 1; i++) {
78
print(i + ": " + childNodes[i]);
82
node.appendChild(null);
84
print("caught: " + e);
89
o.appendChild = node.appendChild;
92
print("caught: " + e);
98
print("caught: " + e);
101
oldNodeType = node.nodeType;
103
shouldBe("node.nodeType", oldNodeType);
105
shouldBe("node instanceof Node", true);
106
shouldBe("new Object() instanceof Node", false);