| Index: LayoutTests/dom/html/level1/core/hc_nodeinsertbeforenodeancestor.js
|
| diff --git a/LayoutTests/dom/html/level1/core/hc_nodeinsertbeforenodeancestor.js b/LayoutTests/dom/html/level1/core/hc_nodeinsertbeforenodeancestor.js
|
| index cd7c9568c9423e231d585e86e480bc554bcf1a16..e549801103dbcfbedeed49180485005b04e11c00 100644
|
| --- a/LayoutTests/dom/html/level1/core/hc_nodeinsertbeforenodeancestor.js
|
| +++ b/LayoutTests/dom/html/level1/core/hc_nodeinsertbeforenodeancestor.js
|
| @@ -1,17 +1,14 @@
|
| -
|
| /*
|
| -Copyright © 2001-2004 World Wide Web Consortium,
|
| -(Massachusetts Institute of Technology, European Research Consortium
|
| -for Informatics and Mathematics, Keio University). All
|
| -Rights Reserved. This work is distributed under the W3C® Software License [1] in the
|
| -hope that it will be useful, but WITHOUT ANY WARRANTY; without even
|
| -the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
| +Copyright © 2001-2004 World Wide Web Consortium,
|
| +(Massachusetts Institute of Technology, European Research Consortium
|
| +for Informatics and Mathematics, Keio University). All
|
| +Rights Reserved. This work is distributed under the W3C® Software License [1] in the
|
| +hope that it will be useful, but WITHOUT ANY WARRANTY; without even
|
| +the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
|
|
| [1] http://www.w3.org/Consortium/Legal/2002/copyright-software-20021231
|
| */
|
|
|
| -
|
| -
|
| /**
|
| * Gets URI that identifies the test.
|
| * @return uri identifier of test
|
| @@ -41,26 +38,24 @@ function setUpPage() {
|
| builder = createConfiguredBuilder();
|
|
|
| docsLoaded = 0;
|
| -
|
| +
|
| var docRef = null;
|
| if (typeof(this.doc) != 'undefined') {
|
| docRef = this.doc;
|
| }
|
| docsLoaded += preload(docRef, "doc", "hc_staff");
|
| -
|
| +
|
| if (docsLoaded == 1) {
|
| setUpPageStatus = 'complete';
|
| }
|
| } catch(ex) {
|
| - catchInitializationError(builder, ex);
|
| + catchInitializationError(builder, ex);
|
| setUpPageStatus = 'complete';
|
| }
|
| }
|
|
|
| -
|
| -
|
| //
|
| -// This method is called on the completion of
|
| +// This method is called on the completion of
|
| // each asychronous load started in setUpTests.
|
| //
|
| // When every synchronous loaded document has completed,
|
| @@ -72,16 +67,15 @@ function loadComplete() {
|
| }
|
| }
|
|
|
| -
|
| /**
|
| -*
|
| - The "insertBefore(newChild,refChild)" method raises a
|
| +*
|
| + The "insertBefore(newChild,refChild)" method raises a
|
| HIERARCHY_REQUEST_ERR DOMException if the node to be
|
| inserted is one of this nodes ancestors.
|
| -
|
| +
|
| Retrieve the second employee and attempt to insert a
|
| - node that is one of its ancestors(root node). An
|
| - attempt to insert such a node should raise the
|
| + node that is one of its ancestors(root node). An
|
| + attempt to insert such a node should raise the
|
| desired exception.
|
|
|
| * @author Curt Arnold
|
| @@ -100,7 +94,7 @@ function hc_nodeinsertbeforenodeancestor() {
|
| var childList;
|
| var refChild;
|
| var insertedNode;
|
| -
|
| +
|
| var docRef = null;
|
| if (typeof(this.doc) != 'undefined') {
|
| docRef = this.doc;
|
| @@ -113,23 +107,20 @@ function hc_nodeinsertbeforenodeancestor() {
|
| childList = employeeNode.childNodes;
|
|
|
| refChild = childList.item(0);
|
| -
|
| - {
|
| - success = false;
|
| - try {
|
| +
|
| + {
|
| + success = false;
|
| + try {
|
| insertedNode = employeeNode.insertBefore(newChild,refChild);
|
| }
|
| - catch(ex) {
|
| + catch(ex) {
|
| success = (typeof(ex.code) != 'undefined' && ex.code == 3);
|
| - }
|
| - assertTrue("throw_HIERARCHY_REQUEST_ERR",success);
|
| - }
|
| + }
|
| + assertTrue("throw_HIERARCHY_REQUEST_ERR",success);
|
| + }
|
|
|
| }
|
|
|
| -
|
| -
|
| -
|
| function runTest() {
|
| hc_nodeinsertbeforenodeancestor();
|
| }
|
|
|