hashery 2.0.1 → 2.1.0

data/{.ruby → .meta}

@@ -1,6 +1,6 @@
 ---
 source:
-- meta
+- METADATA
 authors:
 - name: Trans
   email: transfire@gmail.com
@@ -72,5 +72,5 @@ description: ! 'The Hashery is a tight collection of Hash-like classes. Included
   of the CRUDHash which defines a CRUD model on top of Ruby''s standard Hash
 
   making it a snap to subclass and augment to fit any specific use case.'
-version: 2.0.1
-date: '2012-07-06'
+version: 2.1.0
+date: '2012-11-24'

data/HISTORY.rdoc

@@ -1,5 +1,28 @@
 = RELEASE HISTORY
 
+== 2.1.0 / 2012-11-24
+
+The major change of the 2.1 release is to switch over to `Hash#fetch`
+as the fundamental CRUD read method inplace of the previous `#read` core
+extension (an alias of `#[]`). This is a pretty fundamental change which
+required modification of a number of classes. So please do extra-diligence
+and file an issue if you experience any problems.
+
+In addition, the Hash#read core extension has been renamed to Hash#retrieve
+to avoid any possible confusion with IO objects. This release also fixes
+a couple of issues with 1.8 compatibility and makes a few other small 
+enhancements.
+
+Changes:
+
+* Rename Hash#read to Hash#retrieve.
+* Deprecate `Dictionary.alpha` in favor of `Dictionary.alphabetic`.
+* Add support for block argument in Dictionary#order_by_key and #order_by_value.
+* Fix OpenHash issues with Ruby 1.8.x compatibility.
+* OpenHash methods are opened up via `protected` instead of `private`.
+* Change OpenCascade to auto-create the subclass when inherited.
+
+
 == 2.0.1 / 2012-07-06
 
 This minor release fixes an issue with OpenCascade (#13).
@@ -7,7 +30,7 @@ The key_proc procedure wasn't being passed along to sub-cascades.
 
 Changes:
 
-* OpenCascade passes along key_proc to childern.
+* OpenCascade passes along key_proc to children.
 
 
 == 2.0.0 / 2012-05-11
@@ -49,7 +72,7 @@ Changes:
 
 == 1.5.0 / 2011-11-10
 
-In this release, CoreExt module has been addeed to encapsulate
+In this release, CoreExt module has been added to encapsulate
 methods that extend Ruby's core Hash class (there are only a few).
 Presently these are only loaded when using `require 'hashery'`.
 If you are cherry-picking from Hashery but still want the core
@@ -69,7 +92,7 @@ Changes:
 
 This release includes a copy of Ruby Facets' BasicObject class, which
 fixes the loading bug of the previous version. This release also renames
-OpenObject to BasicStruct, which is a much better destription of what the
+OpenObject to BasicStruct, which is a much better description of what the
 class actually provides.
 
 Changes:
@@ -96,7 +119,7 @@ Changes:
 
 == 1.2.0 / 2010-06-04
 
-This release makes two signifficant changes to the Hashery.
+This release makes two significant changes to the Hashery.
 First, we have a new shiny library called FuzzyHash by
 Joshua Hull. It's a cool idea that allows hash keys to be
 regular expressions. Secondly, OpenCascade is now a subclass
@@ -123,7 +146,7 @@ entries, but they each belong in a unique way. An Association
 is akin to a single entry Hash --it represents a pairing.
 While a SpareArray, though compatible with the Array class,
 is completely under-pinned by a Hash in order to make it
-effcient when no ebtries are given for a set of indexes,
+efficient when no entries are given for a set of indexes,
 hence "sparse".
 
 Changes:

data/README.rdoc

@@ -13,25 +13,31 @@
 
 Among Ruby Facets most common additions were an assortment
 of Hash-like classes. To better support this collection
-of libraries it was deemed prudent to create a side project
-specifically for them. Hence the "Facets" Hashery.
+of libraries it was deemed prudent to create a new project
+specifically for them. Hence the *Facets* Hashery.
 
 Included in this collection are the widely used OrderedHash, 
 the related but more featured Dictionary class, a number
-of _open_ classes, similar to the standard OpenStruct, 
-plus a few variations of the standard Hash and a few
+of _open_ classes similar to the standard OpenStruct, 
+some variations of the standard Hash class and a few
 other yummy morsels.
 
 
-== RELEASE NOTES
+== HOW TO USE
 
-Please see the HISTORY file.
+For usage information, see the individual library files included
+in this collection and read the demo documents which give
+examples of almost all features.
 
 
-== HOW TO USE
+== CORE EXTENSIONS
 
-For usage information, see the individual library files included
-in this collection.
+Hashery adds four core extensions of Ruby's Hash class: `#retrieve`,
+`#rekey`, `#rekey!` and `Hash.create`. The first is simply an alias
+for `#[]`. The later two have proven too useful over the years to
+omit. And the last is a convenience class method for populating
+a new hash with another hash upon initialization. All of these are
+sorely missing for Ruby itself, which is why they are provided here.
 
 
 == HOW TO INSTALL
@@ -72,7 +78,7 @@ Run the QED specs via:
   $ qed -Ilib demo/
 
 Lemon is used to create low-level unit tests. Run these via the 
-RubyTest univeral test harness.
+RubyTest universal test harness.
 
   $ rubytest -Ilib test/
 
@@ -90,7 +96,12 @@ so I won't bug you with it yet again.
 Yes, we FOSS programmers need to eat too! ;-) No seriously, any help you can
 offer goes a long way toward continued development of Rubyworks projects,
 including Hashery. See the upper right-hand corner on the
-Rubyworks[http://rubyworks.github.com] hompage. Thanks.
+Rubyworks[http://rubyworks.github.com] homepage. Thanks.
+
+
+== RELEASE NOTES
+
+Please see the HISTORY file.
 
 
 == COPYRIGHTS
@@ -103,5 +114,5 @@ See COPYING.rdoc file for further details.
 
 Some libraries included in the Hashery have special copyrights
 attributing specific authors. Please see each library script for
-specifics and the NOITCE.txt file for an overview.
+specifics and the NOTICE.txt file for an overview.
 

data/alt/hashery/basicobject.rb

@@ -0,0 +1 @@
+require 'hasery/basic_object'

data/alt/hashery/castinghash.rb

@@ -0,0 +1 @@
+require 'hashery/casting_hash'

data/alt/hashery/fuzzyhash.rb

@@ -0,0 +1 @@
+require 'hashery/fuzzy_hash'

data/alt/hashery/keyhash.rb

@@ -0,0 +1 @@
+require 'hashery/key_hash'

data/alt/hashery/linkedlist.rb

@@ -0,0 +1 @@
+require 'hashery/linked_list'

data/alt/hashery/lruhash.rb

@@ -0,0 +1 @@
+require 'hashery/lru_hash'

data/alt/hashery/opencascade.rb

@@ -0,0 +1 @@
+require 'hashery/open_cascade'

data/alt/hashery/openhash.rb

@@ -0,0 +1 @@
+require 'hashery/open_hash'

data/alt/hashery/orderedhash.rb

@@ -0,0 +1 @@
+require 'hashery/ordered_hash'

data/alt/hashery/propertyhash.rb

@@ -0,0 +1 @@
+require 'hashery/property_hash'

data/alt/hashery/queryhash.rb

@@ -0,0 +1 @@
+require 'hashery/query_hash'

data/alt/hashery/statichash.rb

@@ -0,0 +1 @@
+require 'hashery/static_hash'

data/lib/hashery.rb

@@ -1,3 +1,7 @@
+module Hashery
+  VERSION = "2.1.0"
+end
+
 require 'hashery/core_ext'
 
 #require 'hashery/basic_struct'

data/lib/hashery.yml

@@ -1,6 +1,6 @@
 ---
 source:
-- meta
+- METADATA
 authors:
 - name: Trans
   email: transfire@gmail.com
@@ -72,5 +72,5 @@ description: ! 'The Hashery is a tight collection of Hash-like classes. Included
   of the CRUDHash which defines a CRUD model on top of Ruby''s standard Hash
 
   making it a snap to subclass and augment to fit any specific use case.'
-version: 2.0.1
-date: '2012-07-06'
+version: 2.1.0
+date: '2012-11-24'

data/lib/hashery/core_ext.rb

@@ -15,21 +15,30 @@ class Hash
   end
 
   #
-  # Alias for `#[]`.
+  # Like #fetch but returns the results of calling `default_proc`, if defined,
+  # otherwise `default`.
   #
-  alias :read :[]
+  # key - Hash key to lookup.
+  #
+  # Returns value of Hash entry or `nil`.
+  #
+  def retrieve(key)
+    fetch(key, default_proc ? default_proc[self, key] : default)
+  end
 
   #
   # Convert to Hash.
   #
   def to_hash
     dup  # -or- `h = {}; each{ |k,v| h[k] = v }; h` ?
-  end
+  end \
+  unless method_defined?(:to_hash)
 
   #
   # For a Hash, `#to_h` is the same as `#to_hash`.
   #
-  alias :to_h :to_hash
+  alias :to_h :to_hash \
+  unless method_defined?(:to_h)
 
   #
   # Synonym for Hash#rekey, but modifies the receiver in place (and returns it).

data/lib/hashery/crud_hash.rb

@@ -12,8 +12,28 @@ module Hashery
   # In addition to the CRUD features, CRUDHash supports a `#key_proc`, akin to
   # `#default_proc`, that can be used to normalize keys.
   #
+  # The CRUD methods are:
+  #
+  # * key?
+  # * fetch
+  # * store
+  # * delete
+  #
+  # In addition to these main methods, there are these supporting "CRUD" methods:
+  #
+  # * default
+  # * default_proc
+  # * default_proc=
+  # * key_proc
+  # * key_proc=
+  #
   class CRUDHash < ::Hash
 
+    #
+    # Dummy object for null arguments.
+    #
+    NA = Object.new
+
     #
     # This method is overridden to ensure that new entries pass through
     # the `#store` method.
@@ -112,14 +132,19 @@ module Hashery
     end
 
     #
-    # CRUD method for reading value.
+    # CRUD method for read. This method gets the value for a given key.
+    # An error is raised if the key is not present, but an optional argument
+    # can be provided to be returned instead.
     #
-    # key - Hash key to lookup.
+    # key     - Hash key to lookup.
+    # default - Value to return if key is not present.
     #
-    # Returns value of Hash entry.
+    # Raises KeyError when key is not found and default has not been given.
     #
-    def read(key)
-      super cast_key(key)
+    # Returns the `Object` that is the Hash entry's value.
+    #
+    def fetch(key, *default)
+       super(cast_key(key), *default)
     end
 
     #
@@ -145,16 +170,38 @@ module Hashery
       super cast_key(key)
     end
 
+    # END OF CRUD METHODS
+
     #
-    # Like #read but raises an error if key is not present.
+    # Like #fetch but returns the results of calling `default_proc`, if defined,
+    # otherwise `default`.
     #
     # key - Hash key to lookup.
     #
-    # Returns the `Object` that is the Hash entry's value.
+    # Returns value of Hash entry or `nil`.
+    #
+    def retrieve(key)
+      if key?(key)
+        fetch(key)
+      else
+        default_proc ? default_proc.call(self, key) : default
+      end
+    end
+
+    #
+    # Method for reading value. Returns `nil` if key is not present.
     #
-    def fetch(key)
-      raise KeyError, "key not found: #{key.inspect}" unless key?(key)
-      read key
+    # Note that this method used to be the CRUD method instead of #retrieve. Complaints about
+    # #read being indicative of an IO object (though in my opinion that is a bad asumption) have
+    # led to this method's deprecation.
+    #
+    # key - Hash key to lookup.
+    #
+    # Returns value of Hash entry.
+    #
+    def read(key)
+      warn "The #read method as been deprecated. Use #retrieve instead."
+      retrieve(key)
     end
 
     #
@@ -178,21 +225,14 @@ module Hashery
     end
 
     #
-    # Operator for `#read`.
+    # Operator for `#retrieve`.
     #
     # key - Index key to lookup.
     #
     # Returns `Object` value of key.
     #
     def [](key)
-      #if key?(key)
-      #  fetch(key)
-      #elsif default_proc
-      #  default_proc.call(self, key)
-      #else
-      #  default
-      #end
-      read(key)
+      retrieve(key)
     end
 
     #
@@ -246,7 +286,7 @@ module Hashery
     def each #:yield:
       if block_given?
         keys.each do |k|
-          yield(k, read(k))
+          yield(k, retrieve(k))
         end
       else
         to_enum(:each)

data/lib/hashery/dictionary.rb

@@ -56,10 +56,14 @@ module Hashery
     include Enumerable
 
     class << self
-      #--
-      # TODO is this needed? Doesn't the super class do this?
-      #++
 
+      #
+      # Create a new Dictionary storing argument pairs as an initial mapping.
+      #
+      # TODO: Is this needed? Doesn't the super class do this?
+      #
+      # Returns Dictionary instance.
+      #
       def [](*args)
         hsh = new
         if Hash === args[0]
@@ -75,16 +79,18 @@ module Hashery
       end
 
       #
-      # Like #new but the block sets the order.
+      # Like #new but the block sets the order instead of the default.
+      #
+      #   Dictionary.new_by{ |k,v| k }
       #
       def new_by(*args, &blk)
         new(*args).order_by(&blk)
       end
 
       #
-      # Alternate to #new which creates a dictionary sorted by key.
+      # Alternate to #new which creates a dictionary sorted by the key as a string.
       #
-      #   d = Dictionary.alpha
+      #   d = Dictionary.alphabetic
       #   d["z"] = 1
       #   d["y"] = 2
       #   d["x"] = 3
@@ -92,12 +98,15 @@ module Hashery
       #
       # This is equivalent to:
       #
-      #   Dictionary.new.order_by { |key,value| key }
-
-      def alpha(*args, &block)
-        new(*args, &block).order_by_key
+      #   Dictionary.new.order_by { |key,value| key.to_s }
+      #
+      def alphabetic(*args, &block)
+        new(*args, &block).order_by { |key,value| key.to_s }
       end
 
+      # DEPRECATED: Use #alphabetic instead.
+      alias :alpha :alphabetic
+
       #
       # Alternate to #new which auto-creates sub-dictionaries as needed.
       #
@@ -120,7 +129,7 @@ module Hashery
       @order = []
       @order_by = nil
       if blk
-        dict = self                                  # This ensure autmatic key entry effect the
+        dict = self                                  # This ensures automatic key entry effect the
         oblk = lambda{ |hsh, key| blk[dict,key] }    # dictionary rather then just the interal hash.
         @hash = Hash.new(*args, &oblk)
       else
@@ -169,7 +178,11 @@ module Hashery
     # Returns +self+.
     #
     def order_by_key
-      @order_by = Proc.new{ |k,v| k }
+      if block_given?
+        @order_by = Proc.new{ |k,v| yield(k) }
+      else
+        @order_by = Proc.new{ |k,v| k }
+      end
       order
       self
     end
@@ -188,7 +201,11 @@ module Hashery
     #   Dictionary.new.order_by { |key,value| value }
     #
     def order_by_value
-      @order_by = Proc.new{ |k,v| v }
+      if block_given?
+        @order_by = Proc.new{ |k,v| yield(v) }
+      else
+        @order_by = Proc.new{ |k,v| v }
+      end
       order
       self
     end

data/lib/hashery/open_cascade.rb

@@ -43,6 +43,10 @@ module Hashery
   #
   #   c.x!(4).y!(3)         #=> #<OpenCascade:0x7fac3680ccf0 {:x=>4, :y=>3}>
   #
+  # Subclassing OpenCascade with cause the new subclass to become the class that
+  # is auto-created. If this is not the behavior desired, consider using delegation
+  # instead of subclassing.
+  #
   class OpenCascade < OpenHash
 
     #
@@ -60,14 +64,14 @@ module Hashery
     def initialize(*default)
       @read = {}
 
-      leet = lambda { |h,k| h[k] = OpenCascade.new(&leet) }
+      leet = lambda { |h,k| h[k] = self.class.new(&leet) }
       super(*default, &leet)
     end
 
     #
     # Alias for original read method.
     #
-    alias :read! :read
+    alias :retrieve! :retrieve
 
     #
     # Read value given a +key+.
@@ -76,11 +80,12 @@ module Hashery
     #
     # Returns value.
     #
-    def read(key)
-      if @read[cast_key(key)]
+    def retrieve(key)
+      ckey = cast_key(key)
+      if @read[ckey]
         super(key)
       else
-        @read[cast_key(key)] = store(key, cast_value(super(key)))
+        @read[ckey] = store(key, cast_value(super(key)))
       end
     end
 
@@ -95,12 +100,12 @@ module Hashery
       when '='
         store(name, args.first)
       when '?'
-        key?(name) ? read!(name) : nil    # key?(name)
+        key?(name) ? retrieve!(name) : nil    # key?(name)
       when '!'
         __send__(name, *args, &blk)
       else
         #if key?(name)
-          read(name)
+          retrieve(name)
         #else
         #  #default = OpenCascade.new #self.class.new
         #  #default = default_proc ? default_proc.call(self, name) : default

data/lib/hashery/open_hash.rb

@@ -41,6 +41,11 @@ module Hashery
     #
     attr_accessor :safe
 
+    #
+    # Alias to original store method.
+    #
+    #alias :store! :store
+
     #
     # Index `value` to `key`. Unless safe mode, will also open up the 
     # key if it is not already open.
@@ -51,7 +56,7 @@ module Hashery
     # Returns +value+.
     #
     def store(key, value)
-      open!(key)
+      #open!(key)
       super(key, value)
     end
 
@@ -65,21 +70,19 @@ module Hashery
     # Returns Array of slot names that were opened.
     #
     def open!(*methods)
-      # only select string and symbols, any other type of key is allowed,
+      # Only select string and symbols, any other type of key is allowed,
       # it just won't be accessible via dynamic methods.
       methods = methods.select{ |x| String === x || Symbol === x }
-      # @todo should we just ignore these instead of raising an error?
-      #methods.reject!{ |x| x.to_s =~ /^__/ }
       if methods.any?{ |m| m.to_s.start_with?('__') }
-        raise ArgumentError, "cannot set shadow methods"
+        raise ArgumentError, "cannot open shadow methods"
       end
-      # only public methods need to be made private
+      # only public methods need be made protected
       methods = methods.map{ |x| x.to_sym }
-      methods = methods & public_methods(true)
+      methods = methods & public_methods(true).map{ |x| x.to_sym }
       if @safe
         raise ArgumentError, "cannot set public method" unless methods.empty?
       else
-        (class << self; self; end).class_eval{ private *methods }
+        (class << self; self; end).class_eval{ protected *methods }
       end
       methods
     end
@@ -95,7 +98,8 @@ module Hashery
     # Returns `true` or `false`.
     #
     def open?(method)
-      ! public_methods(true).include?(method.to_sym)
+      methods = public_methods(true).map{ |m| m.to_sym }
+      ! methods.include?(method.to_sym)
     end
 
     #
@@ -120,8 +124,6 @@ module Hashery
 
       case type
       when '='
-        #open!(key) unless open?(key)
-        #self[key] = a.first
         store(key, a.first)
       when '?'
         key?(key)
@@ -131,7 +133,7 @@ module Hashery
         __send__(name, *a, &b)
       else
         #if key?(key)
-          read(key)
+          retrieve(key)
         #else
         #  super(s,*a,&b)
         #end

data/lib/hashery/property_hash.rb

@@ -102,7 +102,7 @@ module Hashery
       if opts[:default]
         store!(key, opts[:default])
       else
-        store!(key, read(key))
+        store!(key, retrieve(key))
       end
     end
 

data/lib/hashery/static_hash.rb

@@ -29,7 +29,7 @@ module Hashery
     # Retruns value.
     #
     def store(key, value)
-      if key?(key) && read(key) != value
+      if key?(key) && fetch(key) != value
         raise ArgumentError, "Duplicate key for StaticHash -- #{key.inspect}"
       end
       super(key, value)

data/test/case_dictionary.rb

@@ -218,6 +218,7 @@ testcase Dictionary do
 
   method :each_key do
     d = Dictionary[:a=>1, :b=>2, :c=>3]
+    d.order_by_key
     a = []
     d.each_key{ |k| a << k }
     a.assert == [:a, :b, :c]
@@ -225,6 +226,7 @@ testcase Dictionary do
 
   method :each_value do
     d = Dictionary[:a=>1, :b=>2, :c=>3]
+    d.order_by_value
     a = []
     d.each_value{ |v| a << v }
     a.assert == [1, 2, 3]

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: hashery
 version: !ruby/object:Gem::Version
-  version: 2.0.1
+  version: 2.1.0
   prerelease: 
 platform: ruby
 authors:
@@ -15,11 +15,11 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-07-06 00:00:00.000000000 Z
+date: 2012-11-25 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: detroit
-  requirement: !ruby/object:Gem::Requirement
+  requirement: &6389540 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -27,15 +27,10 @@ dependencies:
         version: '0'
   type: :development
   prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    none: false
-    requirements:
-    - - ! '>='
-      - !ruby/object:Gem::Version
-        version: '0'
+  version_requirements: *6389540
 - !ruby/object:Gem::Dependency
   name: qed
-  requirement: !ruby/object:Gem::Requirement
+  requirement: &6373700 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -43,15 +38,10 @@ dependencies:
         version: '0'
   type: :development
   prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    none: false
-    requirements:
-    - - ! '>='
-      - !ruby/object:Gem::Version
-        version: '0'
+  version_requirements: *6373700
 - !ruby/object:Gem::Dependency
   name: lemon
-  requirement: !ruby/object:Gem::Requirement
+  requirement: &6363300 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -59,12 +49,7 @@ dependencies:
         version: '0'
   type: :development
   prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    none: false
-    requirements:
-    - - ! '>='
-      - !ruby/object:Gem::Version
-        version: '0'
+  version_requirements: *6363300
 description: ! 'The Hashery is a tight collection of Hash-like classes. Included among
   its many
 
@@ -80,55 +65,113 @@ email:
 executables: []
 extensions: []
 extra_rdoc_files:
-- NOTICE.txt
 - LICENSE.txt
+- NOTICE.txt
 - HISTORY.rdoc
 - DEMO.rdoc
 - README.rdoc
 files:
-- .ruby
+- .meta
 - .yardopts
-- lib/hashery/association.rb
-- lib/hashery/casting_hash.rb
-- lib/hashery/core_ext.rb
-- lib/hashery/crud_hash.rb
-- lib/hashery/dictionary.rb
-- lib/hashery/fuzzy_hash.rb
-- lib/hashery/ini_hash.rb
-- lib/hashery/key_hash.rb
-- lib/hashery/linked_list.rb
-- lib/hashery/lru_hash.rb
-- lib/hashery/open_cascade.rb
-- lib/hashery/open_hash.rb
-- lib/hashery/ordered_hash.rb
-- lib/hashery/path_hash.rb
-- lib/hashery/property_hash.rb
-- lib/hashery/query_hash.rb
-- lib/hashery/stash.rb
-- lib/hashery/static_hash.rb
-- lib/hashery.rb
-- lib/hashery.yml
-- test/case_association.rb
-- test/case_casting_hash.rb
-- test/case_core_ext.rb
-- test/case_crud_hash.rb
-- test/case_dictionary.rb
-- test/case_ini_hash.rb
-- test/case_key_hash.rb
-- test/case_linked_list.rb
-- test/case_lru_hash.rb
-- test/case_open_cascade.rb
-- test/case_open_hash.rb
-- test/case_property_hash.rb
-- test/case_query_hash.rb
-- test/fixture/example.ini
-- test/helper.rb
+- !binary |-
+  YWx0L2hhc2hlcnkva2V5aGFzaC5yYg==
+- !binary |-
+  YWx0L2hhc2hlcnkvb3Blbmhhc2gucmI=
+- !binary |-
+  YWx0L2hhc2hlcnkvYmFzaWNvYmplY3QucmI=
+- !binary |-
+  YWx0L2hhc2hlcnkvcHJvcGVydHloYXNoLnJi
+- !binary |-
+  YWx0L2hhc2hlcnkvbHJ1aGFzaC5yYg==
+- !binary |-
+  YWx0L2hhc2hlcnkvY2FzdGluZ2hhc2gucmI=
+- !binary |-
+  YWx0L2hhc2hlcnkvb3JkZXJlZGhhc2gucmI=
+- !binary |-
+  YWx0L2hhc2hlcnkvZnV6enloYXNoLnJi
+- !binary |-
+  YWx0L2hhc2hlcnkvcXVlcnloYXNoLnJi
+- !binary |-
+  YWx0L2hhc2hlcnkvb3BlbmNhc2NhZGUucmI=
+- !binary |-
+  YWx0L2hhc2hlcnkvc3RhdGljaGFzaC5yYg==
+- !binary |-
+  YWx0L2hhc2hlcnkvbGlua2VkbGlzdC5yYg==
+- !binary |-
+  bGliL2hhc2hlcnkueW1s
+- !binary |-
+  bGliL2hhc2hlcnkucmI=
+- !binary |-
+  bGliL2hhc2hlcnkvZnV6enlfaGFzaC5yYg==
+- !binary |-
+  bGliL2hhc2hlcnkvcGF0aF9oYXNoLnJi
+- !binary |-
+  bGliL2hhc2hlcnkvb3Blbl9jYXNjYWRlLnJi
+- !binary |-
+  bGliL2hhc2hlcnkvYXNzb2NpYXRpb24ucmI=
+- !binary |-
+  bGliL2hhc2hlcnkvbGlua2VkX2xpc3QucmI=
+- !binary |-
+  bGliL2hhc2hlcnkvb3Blbl9oYXNoLnJi
+- !binary |-
+  bGliL2hhc2hlcnkvZGljdGlvbmFyeS5yYg==
+- !binary |-
+  bGliL2hhc2hlcnkva2V5X2hhc2gucmI=
+- !binary |-
+  bGliL2hhc2hlcnkvY29yZV9leHQucmI=
+- !binary |-
+  bGliL2hhc2hlcnkvc3RhdGljX2hhc2gucmI=
+- !binary |-
+  bGliL2hhc2hlcnkvcXVlcnlfaGFzaC5yYg==
+- !binary |-
+  bGliL2hhc2hlcnkvaW5pX2hhc2gucmI=
+- !binary |-
+  bGliL2hhc2hlcnkvcHJvcGVydHlfaGFzaC5yYg==
+- !binary |-
+  bGliL2hhc2hlcnkvb3JkZXJlZF9oYXNoLnJi
+- !binary |-
+  bGliL2hhc2hlcnkvbHJ1X2hhc2gucmI=
+- !binary |-
+  bGliL2hhc2hlcnkvY3J1ZF9oYXNoLnJi
+- !binary |-
+  bGliL2hhc2hlcnkvc3Rhc2gucmI=
+- !binary |-
+  bGliL2hhc2hlcnkvY2FzdGluZ19oYXNoLnJi
+- !binary |-
+  dGVzdC9jYXNlX29wZW5fY2FzY2FkZS5yYg==
+- !binary |-
+  dGVzdC9jYXNlX3F1ZXJ5X2hhc2gucmI=
+- !binary |-
+  dGVzdC9oZWxwZXIucmI=
+- !binary |-
+  dGVzdC9jYXNlX2NydWRfaGFzaC5yYg==
+- !binary |-
+  dGVzdC9jYXNlX2xydV9oYXNoLnJi
+- !binary |-
+  dGVzdC9jYXNlX2RpY3Rpb25hcnkucmI=
+- !binary |-
+  dGVzdC9jYXNlX2luaV9oYXNoLnJi
+- !binary |-
+  dGVzdC9jYXNlX2NvcmVfZXh0LnJi
+- !binary |-
+  dGVzdC9jYXNlX29wZW5faGFzaC5yYg==
+- !binary |-
+  dGVzdC9jYXNlX2tleV9oYXNoLnJi
+- !binary |-
+  dGVzdC9jYXNlX2Fzc29jaWF0aW9uLnJi
+- !binary |-
+  dGVzdC9jYXNlX3Byb3BlcnR5X2hhc2gucmI=
+- !binary |-
+  dGVzdC9maXh0dXJlL2V4YW1wbGUuaW5p
+- !binary |-
+  dGVzdC9jYXNlX2Nhc3RpbmdfaGFzaC5yYg==
+- !binary |-
+  dGVzdC9jYXNlX2xpbmtlZF9saXN0LnJi
 - HISTORY.rdoc
 - DEMO.rdoc
-- NOTICE.txt
-- Config.rb
-- README.rdoc
 - LICENSE.txt
+- README.rdoc
+- NOTICE.txt
 homepage: http://rubyworks.github.com/hashery
 licenses:
 - BSD-2-Clause
@@ -151,8 +194,23 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 1.8.24
+rubygems_version: 1.8.11
 signing_key: 
 specification_version: 3
 summary: Facets-bread collection of Hash-like classes.
-test_files: []
+test_files:
+- test/case_open_cascade.rb
+- test/case_query_hash.rb
+- test/helper.rb
+- test/case_crud_hash.rb
+- test/case_lru_hash.rb
+- test/case_dictionary.rb
+- test/case_ini_hash.rb
+- test/case_core_ext.rb
+- test/case_open_hash.rb
+- test/case_key_hash.rb
+- test/case_association.rb
+- test/case_property_hash.rb
+- test/case_casting_hash.rb
+- test/case_linked_list.rb
+has_rdoc: 

data/Config.rb

@@ -1,28 +0,0 @@
-config 'rubytest' do
-  $:.unshift 'test'
-  $:.unshift 'lib'
-end
-
-profile 'coverage' do
-  config 'rubytest' do
-    $:.unshift 'test'
-    $:.unshift 'lib'
-
-    require 'simplecov'
-    SimpleCov.command_name 'RubyTest'
-    SimpleCov.start do
-      add_filter '/test/'
-      add_filter '/lib/hashery/ordered_hash.rb'
-      coverage_dir 'log/coverage'
-    end
-  end
-
-  config 'qed' do
-    require 'simplecov'
-    SimpleCov.command_name 'QED'
-    SimpleCov.start do
-      add_filter '/demo/'
-      coverage_dir 'log/coverage'
-    end
-  end
-end