Remove tabs and trailing whitspace in LayoutTests/dom/.../*.js

LayoutTests/dom/xhtml/level1/core/hc_nodereplacechildnodeancestor.js

Index: LayoutTests/dom/xhtml/level1/core/hc_nodereplacechildnodeancestor.js
diff --git a/LayoutTests/dom/xhtml/level1/core/hc_nodereplacechildnodeancestor.js b/LayoutTests/dom/xhtml/level1/core/hc_nodereplacechildnodeancestor.js
index 5e7b044f5bf685dd32854d82508a369bface47bd..2e65b2300ea896573fe51c41cfaa61b33106153c 100644
--- a/LayoutTests/dom/xhtml/level1/core/hc_nodereplacechildnodeancestor.js
+++ b/LayoutTests/dom/xhtml/level1/core/hc_nodereplacechildnodeancestor.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 "replaceChild(newChild,oldChild)" method raises a 
+*
+    The "replaceChild(newChild,oldChild)" method raises a
     HIERARCHY_REQUEST_ERR DOMException if the node to put
     in is one of this node's ancestors.
-    
+
     Retrieve the second employee and attempt to replace
     one of its children with an ancestor node(root node).
-    An attempt to make such a replacement should raise the 
+    An attempt to make such a replacement should raise the
     desired exception.
 
 * @author Curt Arnold
@@ -100,7 +94,7 @@ function hc_nodereplacechildnodeancestor() {
       var childList;
       var oldChild;
       var replacedNode;
-      
+
       var docRef = null;
       if (typeof(this.doc) != 'undefined') {
         docRef = this.doc;
@@ -113,23 +107,20 @@ function hc_nodereplacechildnodeancestor() {
       childList = employeeNode.childNodes;
 
       oldChild = childList.item(0);
-      
-	{
-		success = false;
-		try {
+
+    {
+        success = false;
+        try {
             replacedNode = employeeNode.replaceChild(newChild,oldChild);
         }
-		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_nodereplacechildnodeancestor();
 }