| Index: LayoutTests/dom/xhtml/level3/core/nodeisequalnode01.js
|
| diff --git a/LayoutTests/dom/xhtml/level3/core/nodeisequalnode01.js b/LayoutTests/dom/xhtml/level3/core/nodeisequalnode01.js
|
| index 1acc476098e3094191ca7767fb98f15a266c573c..ec7904bba293ed04621fb2edca3fb6d41bcc5f64 100644
|
| --- a/LayoutTests/dom/xhtml/level3/core/nodeisequalnode01.js
|
| +++ b/LayoutTests/dom/xhtml/level3/core/nodeisequalnode01.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,32 +38,30 @@ function setUpPage() {
|
| builder = createConfiguredBuilder();
|
|
|
| docsLoaded = 0;
|
| -
|
| +
|
| var doc1Ref = null;
|
| if (typeof(this.doc1) != 'undefined') {
|
| doc1Ref = this.doc1;
|
| }
|
| docsLoaded += preload(doc1Ref, "doc1", "hc_staff");
|
| -
|
| +
|
| var doc2Ref = null;
|
| if (typeof(this.doc2) != 'undefined') {
|
| doc2Ref = this.doc2;
|
| }
|
| docsLoaded += preload(doc2Ref, "doc2", "hc_staff");
|
| -
|
| +
|
| if (docsLoaded == 2) {
|
| 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,
|
| @@ -78,13 +73,11 @@ function loadComplete() {
|
| }
|
| }
|
|
|
| -
|
| /**
|
| -*
|
| +*
|
|
|
| -
|
| - Using isEqualNode check if 2 Document nodes created by parsing the same xml document
|
| - are equal.
|
| + Using isEqualNode check if 2 Document nodes created by parsing the same xml document
|
| + are equal.
|
|
|
| * @author IBM
|
| * @author Neil Delima
|
| @@ -96,13 +89,13 @@ function nodeisequalnode01() {
|
| var doc1;
|
| var doc2;
|
| var isEqual;
|
| -
|
| +
|
| var doc1Ref = null;
|
| if (typeof(this.doc1) != 'undefined') {
|
| doc1Ref = this.doc1;
|
| }
|
| doc1 = load(doc1Ref, "doc1", "hc_staff");
|
| -
|
| +
|
| var doc2Ref = null;
|
| if (typeof(this.doc2) != 'undefined') {
|
| doc2Ref = this.doc2;
|
| @@ -113,9 +106,6 @@ function nodeisequalnode01() {
|
|
|
| }
|
|
|
| -
|
| -
|
| -
|
| function runTest() {
|
| nodeisequalnode01();
|
| }
|
|
|