minor: remove unused code in OrderedHash

Author: banker

lib/bson/ordered_hash.rb

@@ -62,26 +62,26 @@ def initialize(*a, &b)
       end
 
       def keys
-        @ordered_keys || []
+        @ordered_keys# || []
       end
 
       def []=(key, value)
-        @ordered_keys ||= []
+        #@ordered_keys ||= []
         unless has_key?(key)
           @ordered_keys << key
         end
         super(key, value)
       end
 
       def each
-        @ordered_keys ||= []
+        #@ordered_keys ||= []
         @ordered_keys.each { |k| yield k, self[k] }
         self
       end
       alias :each_pair :each
 
       def to_a
-        @ordered_keys ||= []
+        #@ordered_keys ||= []
         @ordered_keys.map { |k| [k, self[k]] }      
       end
 
@@ -96,7 +96,7 @@ def merge(other)
       end
 
       def merge!(other)
-        @ordered_keys ||= []
+        #@ordered_keys ||= []
         @ordered_keys += other.keys # unordered if not an BSON::OrderedHash
         @ordered_keys.uniq!
         super(other)
@@ -106,7 +106,7 @@ def merge!(other)
 
       def dup
         result = OrderedHash.new
-        @ordered_keys ||= []
+        #@ordered_keys ||= []
         @ordered_keys.each do |key|
           result[key] = self[key]
         end