Hi! I cleaned up your code for you!

Firebug Usage/fb_debug

@@ -17,8 +17,8 @@
     <link rel="search" type="application/opensearchdescription+xml" title="Mozilla Add-ons"
         href="/AMOSearch.xml" />
 
-    
-            <link rel="stylesheet" type="text/css" href="/css/amo2009/style.min.css?52492" media="all" />    
+
+            <link rel="stylesheet" type="text/css" href="/css/amo2009/style.min.css?52492" media="all" />
     <!--[if IE]>
         <link rel="stylesheet" type="text/css" href="/css/amo2009/ie.css" media="screen,projection,tv" />    <![endif]-->
     <!--[if IE 7]>
@@ -53,13 +53,13 @@
         <li><a href="#categories">Skip to categories menu</a></li>
         <li><a href="#other-apps">Skip to other applications menu</a></li>
     </ul>
-        
+
     <div class="section">
         <div id="header" role="banner">
         <p id="title"><a href="/en-US/firefox/" title="Return to the Firefox Add-ons homepage">Add-ons <em>for</em> <img alt="Firefox" src="/img/amo2009/app-icons/firefox.png" /> <strong>Firefox</strong></a></p>
     <p id="brand"><a href="http://www.mozilla.com/en-US/" title="Mozilla" accesskey="1">Mozilla</a></p>
 
-    
+
     <div id="aux-nav" role="navigation">
         <ul id="other-apps" class="change" title="Find add-ons for other applications">
             <li>
@@ -80,12 +80,12 @@
             </li>
         </ul>
 
-        
+
     <p class="context">
         <a href="/en-US/firefox/users/register">Register</a> or <a href="/en-US/firefox/users/login?to=en-US%2Ffirefox%2Faddon%2F1843">Log in</a>    </p>
     </div>
 </div>
-    
+
 
 <div class="stand-alone-options">
   <div id="categories" class="categories">
@@ -154,7 +154,7 @@
         </li>
     </ul>
 </div>
-  
+
 <div class="search-form expanded-search-form">
     <form method="get" action="/en-US/firefox/search" id="search-form">
         <div class="basic" id="search-query">
@@ -180,7 +180,7 @@
                                                                     <option value="1,92">Toolbars</option>
                                                                     <option value="1,4">Web Development</option>
                                                                     <option value="1,73">Other</option>
-                    
+
                     <option class="cat-all" value="collections">all collections</option>
             </select>
             <button type="submit"><img src="/img/amo2009/blank.gif" alt="Search for add-ons"/></button>
@@ -295,7 +295,7 @@ versions[60] = {"0.1": "0.1", "0.7": "0.7", "1.0": "1.0", 'Any' : 'any' };
 
     default_low = ( ('' == '-1' || '' == '')  && current_app_id == 1) ? low_appversion : 'any';
 
-    
+
     $("#lver-td input").remove();
 
     var verArr =  versions[1];
@@ -334,7 +334,7 @@ versions[60] = {"0.1": "0.1", "0.7": "0.7", "1.0": "1.0", 'Any' : 'any' };
         return true;
     });
 
-    
+
     $(document).ready(function() {
         var q = $("#query");
         var l = $("#search-query label[for=query]");
@@ -406,15 +406,15 @@ Firebug 1.4 requires Firefox 3.0 or higher.            </p>
         	<script type="text/javascript">
         installVersusDownloadCheck("installTrigger65631-79ab13a7", "Add to Firefox ", "Download Now ");
 	</script>
-    
+
             <strong>recommended</strong>
         </div>
 
     <script type="text/javascript">setTimeout(function() {initExpConfirm('79554-79ab13a7');fixPlatformLinks('79554-79ab13a7', 'Firebug');addCompatibilityHints('1843', '79554-79ab13a7', '3.0', '3.5.*', '');},0);</script>
 
             </div>
-                
-            
+
+
             <table summary="Add-on Information">
               <tbody>
                                     <tr>
@@ -469,7 +469,7 @@ Firebug 1.4 requires Firefox 3.0 or higher.            </p>
                                   <a class="screenshot thumbnail" rel="lightbox" href="/en-US/firefox/images/p/9486/" title="">
               <img alt="" src="/en-US/firefox/images/t/9486/" />
             </a>
-          
+
           <div class="share-this">
             <a class="share" href="#">Share this Add-on</a>
             <div class="share-networks">
@@ -525,11 +525,11 @@ Visit the Firebug website for documentation, screen shots, and discussion forums
            href="/en-US/firefox/images/p/11828/" title="Network">
           <img src="/en-US/firefox/images/t/11828/" alt="" />
         </a>
-          
+
           <h4>Support</h4>
       <p>
                   Support for this add-on is provided by the developer at <a href="http://groups.google.com/group/firebug/topics" >http://groups.google.com/group/firebug/topics</a>              </p>
-    
+
               <h4>Developer Comments</h4>
       <p >
         If you have any problems, please read the FireBug FAQ.<br />
@@ -572,15 +572,15 @@ I can&#039;t even think of working without this !</p>
           See all 681 reviews of this add-on        </a>
       </p>
     </div>
-  
+
 
       <h3>What do you think?</h3>
     <div id="review-box" class="highlight">
               <p>Please <a href="/en-US/firefox/users/login?to=en-US%2Ffirefox%2Faddon%2F1843">log in</a> to submit a review</p>
-      
+
       <form class="addon-feedback" method="post"
             action="/en-US/firefox/reviews/add/1843">
-        
+
                 <div class="container">
           <label for="review">Review</label>
           <textarea name="data[Review][body]" id="review" disabled="disabled"                    cols="30" rows="6"></textarea>
@@ -610,7 +610,7 @@ I can&#039;t even think of working without this !</p>
           Detailed Review        </a>
       </p>
     </div> <!-- highlight -->
-  
+
         <h3>Release Notes</h3>
       <div class="article">
         <a href="/en-US/firefox/addons/versions/1843#version-1.4.3"  title="Permanent link to this version">Version 1.4.3</a>    <span title="September 29, 2009, 11:35 AM">&mdash;
@@ -619,15 +619,15 @@ I can&#039;t even think of working without this !</p>
 <br />
 Replaced &quot;Off for All Web Pages&quot; with &quot;Clear Activation List&quot;.        </p>
 
-        
+
         <ul class="further-navigation">
                     <li>
             <a href="/en-US/firefox/addons/versions/1843">
               View Older Versions            </a>
           </li>
         </ul>
       </div> <!-- Release Notes -->
-  
+
 </div> <!-- primary -->
 
 <div class="secondary" role="secondary">
@@ -701,7 +701,7 @@ Replaced &quot;Off for All Web Pages&quot; with &quot;Clear Activation List&quot
 </form>
     </div>
 
-            <a href="/en-US/firefox/users/register">Register</a> or <a href="/en-US/firefox/users/login?to=en-US%2Ffirefox%2Faddon%2F1843">Log in</a> to add tags    
+            <a href="/en-US/firefox/users/register">Register</a> or <a href="/en-US/firefox/users/login?to=en-US%2Ffirefox%2Faddon%2F1843">Log in</a> to add tags
 </div>
 <!-- /.highlight-->
 
@@ -730,7 +730,7 @@ Replaced &quot;Off for All Web Pages&quot; with &quot;Clear Activation List&quot
             </li>
                   </ul>
       </div>
-    
+
     <div class="collections-add">
         <h3 class="compact-bottom">Related Collections</h3>
 
@@ -824,7 +824,7 @@ Replaced &quot;Off for All Web Pages&quot; with &quot;Clear Activation List&quot
                 <button type="submit">Go</button>
               </div>
             </form>
-        
+
         <p><strong>Copyright <span title="pm-app-amo15.mozilla.org">&#169;</span> 2005&#8211;2009 Mozilla.</strong> All rights reserved.</p>
         <ul>
             <li><a href="/en-US/firefox/pages/privacy" >Privacy Policy</a></li>

README

@@ -1,18 +1,18 @@
 =============================
-Test Driving JavaScript Book 
+Test Driving JavaScript Book
 =============================
- 
-This is the source code and actual book in open office formate (.odt), Test Driving JavaScript (aka TD JavaScript). It is licensed under the Creative Commons Attribution-Non Commercial-Share Alike 3.0 license. http://creativecommons.org/licenses/by-sa/3.0/us/ 
- 
+
+This is the source code and actual book in open office formate (.odt), Test Driving JavaScript (aka TD JavaScript). It is licensed under the Creative Commons Attribution-Non Commercial-Share Alike 3.0 license. http://creativecommons.org/licenses/by-sa/3.0/us/
+
 Contributors
 =====================
 I am interested in contributors that may have relevant experience, information, that I am not already supplying. For example, here are some possible topics/chapters that would probably improve the book:
 - IE specific debugging via the IE8 JavaScript debugger would be a great addition.
 - Integration with a continuous integration system.
-Note that the goal of the book is to be short and sweet so contributions will need to be to the point. Given that the main document is currently using Open Office, I'd ask that contributions come in that form. I still need to research merging a .odt document, so I'm still unsure of how to go about patches/contributions (in that regard). Please email me if you're serious about contributing. 
+Note that the goal of the book is to be short and sweet so contributions will need to be to the point. Given that the main document is currently using Open Office, I'd ask that contributions come in that form. I still need to research merging a .odt document, so I'm still unsure of how to go about patches/contributions (in that regard). Please email me if you're serious about contributing.
 
 Errata
 =====================
 If you find any technical mistakes and/or parts of the book that are in need of correction,
-please email me at roblevintennis at gmail dot com to inform me. 
+please email me at roblevintennis at gmail dot com to inform me.
 

code/5_min_drill/README.rdoc

@@ -3,7 +3,7 @@
 
 Description
 
-== License 
+== License
 
 (The MIT License)
 

code/5_min_drill/lib/test_js_itself.js

@@ -3,12 +3,12 @@ JSTest.prototype = {
     constructor: JSTest,
     switchTest : function(c) {
 	switch(c) {
-	    case 0: 
+	    case 0:
 		return "zero";
 		break;
 	    case 1:
 		return "one";
-		break; 
+		break;
 	    case "no break case":
 		// do nothing...testing fall through
 	    case "next case":

code/5_min_drill/spec/spec.test_js_itself.js

@@ -1,11 +1,11 @@
 describe 'TestJsItself'
-    before_each  
-	jsTest = new JSTest   
+    before_each
+	jsTest = new JSTest
 	arr = jsTest.arrayTest()
-    end  
+    end
     describe '.switchTest()'
 	it 'should return corresponding case primitive int as a string'
-	    jsTest.switchTest(1).should.eql "one" 
+	    jsTest.switchTest(1).should.eql "one"
 	end
 	it 'should fall through to next case when omitting a break'
 	    jsTest.switchTest("no break case").should.eql "next case"
@@ -16,7 +16,7 @@ describe 'TestJsItself'
 	    (typeof arr == 'object').should.eql true
 	end
 	it 'should use zero based indexing'
-	    arr[1].should.eql 2 
+	    arr[1].should.eql 2
 	end
     end
 end

code/binary_tree/bin_tree/README.rdoc

@@ -3,7 +3,7 @@
 
 Description
 
-== License 
+== License
 
 (The MIT License)
 

code/binary_tree/bin_tree/lib/yourlib.core.js

@@ -10,7 +10,7 @@ function BSTree(n) {
 		this.root = n;
 };
 BSTree.prototype = {
-		// Essentially have to go past node it should be connected to  
+		// Essentially have to go past node it should be connected to
 		// looking for undefined, so we always need pointer to parent node
 		addNode: function(node) {
 				var current = this.root;
@@ -45,10 +45,10 @@ BSTree.prototype = {
 								}
 						}
 				}
-				return null;	
+				return null;
 		},
 		// Builds an "in order" array of the list's nodes (eg [1,2,3,4...])
-		traverseInOrder: function(inOrdArray, cNode) { 
+		traverseInOrder: function(inOrdArray, cNode) {
 				if(cNode !== undefined) {
 						this.traverseInOrder(inOrdArray, cNode.left);
 						inOrdArray.push(cNode);

code/binary_tree/bin_tree/spec/spec.core.js

@@ -1,7 +1,7 @@
 /*
-------------------------- Binary Search Tree ------------------------- 
+------------------------- Binary Search Tree -------------------------
 
-NOTE: This is about the simplest Binary Search Tree we could make. It does NOT implement deletion 
+NOTE: This is about the simplest Binary Search Tree we could make. It does NOT implement deletion
       which is rather complex. However, Zakas has a series of articles online (part II does the deletiation part):
       http://www.nczonline.net/blog/2009/06/16/computer-science-in-javascript-binary-search-tree-part-2/
 			http://www.nczonline.net/blog/2009/06/09/computer-science-in-javascript-binary-search-tree-part-1/
@@ -40,7 +40,7 @@ the root. If we assume the root is Level 0, its children will be Level 1, its gr
 will be Level 2, and so on.
 
 -- Keys: We’ve seen that one data item in an object is usually designated a key value. This
-value is used to search for the item or perform other operations on it. 
+value is used to search for the item or perform other operations on it.
 
 -- Binary Trees: If every node in a tree can have at most two children, the tree is called a binary
 tree.
@@ -64,10 +64,10 @@ describe 'Binary Search Tree'
 				tree				= new BSTree(root)
 				tree.addNode(leftChild)
 				tree.addNode(rightChild)
-		end	
+		end
 		it 'should create a node2 with left and right nodes'
 				// Node should be as initialized data, left/right null
-				node2.data.should.be 222 
+				node2.data.should.be 222
 				node2['left'].should.be_null
 				node2['right'].should.be_null
 				// After assignment, left/right should be as assigned
@@ -104,8 +104,8 @@ describe 'Binary Search Tree'
 				tree.find(10).id.should.equal 10
 				tree.find(16).id.should.equal 16
 				tree.find(17).id.should.equal 17
-				tree.find(888).should.be_null 
-				tree.find('abc').should.be_null 
+				tree.find(888).should.be_null
+				tree.find('abc').should.be_null
 		end
 		it 'should add and find nodes even if negative numbers'
 				var negNode = new Node(-10)
@@ -115,7 +115,7 @@ describe 'Binary Search Tree'
 		it 'should traverse in order and return in order array'
 				var llGrandChild	= new Node(5,5)
 				tree.addNode(llGrandChild)
-				var inOrderArray = tree.traverseInOrder([], root)	
+				var inOrderArray = tree.traverseInOrder([], root)
 				inOrderArray[0].id.should.equal llGrandChild.id
 				inOrderArray[1].id.should.equal leftChild.id
 				inOrderArray[2].id.should.equal root.id

code/gotchas/README.rdoc

@@ -3,7 +3,7 @@
 
 Description
 
-== License 
+== License
 
 (The MIT License)
 

code/gotchas/lib/gotchas.js

@@ -17,8 +17,8 @@ var privileged_singleton = function() {
     var obj = SomeObject;
     obj.publicVar = 'this is public';
     obj.publicFunc = function() {
-	var message = 'publicFunc is privileged, and hereby allows you to see private var: ' + 
-	    privateVar + ', as well as see the return value of privateFunc: ' + privateFunc(); 
+	var message = 'publicFunc is privileged, and hereby allows you to see private var: ' +
+	    privateVar + ', as well as see the return value of privateFunc: ' + privateFunc();
 	return message;
     };
     return obj;