*Massive cleanup redux.

--HG--
branch : trunk

1 files changed, 0 insertions, 11 deletions

diff --git a/dep/include/g3dlite/G3D/Table.h b/dep/include/g3dlite/G3D/Table.h
index 1d021daae2b..aded5c38555 100644
--- a/dep/include/g3dlite/G3D/Table.h
+++ b/dep/include/g3dlite/G3D/Table.h
@@ -28,7 +28,6 @@
 #   pragma warning (disable : 4786)
 #endif
 
-
 template<typename Key>
 struct GHashCode{};
 
@@ -76,7 +75,6 @@ struct GHashCode<std::string>
 
 namespace G3D {
 
-
 /**
  An unordered data structure mapping keys to values.
 
@@ -103,7 +101,6 @@ namespace G3D {
 
   And rely on the default enum operator==.
 
-
   Periodically check that debugGetLoad() is low (> 0.1).  When it gets near
   1.0 your hash function is badly designed and maps too many inputs to
   the same output.
@@ -131,7 +128,6 @@ private:
         Entry       entry;
         Node*       next;
 
-
         /** Provide pooled allocation for speed. */
         inline void* operator new (size_t size) {
             return System::malloc(size);
@@ -141,7 +137,6 @@ private:
             System::free(p);
         }
 
-
         Node(Key key, Value value, size_t hashCode, Node* next) {
             this->entry.key   = key;
             this->entry.value = value;
@@ -419,7 +414,6 @@ public:
         }
     };
 
-
     /**
      C++ STL style iterator method.  Returns the first Entry, which
      contains a key and value.  Use preincrement (++entry) to get to
@@ -448,7 +442,6 @@ public:
          System::memset(bucket, 0, sizeof(Node*) * numBuckets);
     }
 
-
     /**
      Returns the number of keys.
      */
@@ -456,7 +449,6 @@ public:
         return _size;
     }
 
-
     /**
      If you insert a pointer into the key or value of a table, you are
      responsible for deallocating the object eventually.  Inserting
@@ -546,7 +538,6 @@ public:
           n = n->next;
        } while (n != NULL);
 
-
       alwaysAssertM(false, "Tried to remove a key that was not in the table.");
    }
 
@@ -616,7 +607,6 @@ public:
        return false;
    }
 
-
    /**
     Short syntax for get.
     */
@@ -624,7 +614,6 @@ public:
       return get(key);
    }
 
-
    /**
     Returns an array of all of the keys in the table.
     You can iterate over the keys to get the values.