hashshashin 0.0.1

data/.gitignore

@@ -0,0 +1,17 @@
+*.gem
+*.rbc
+.bundle
+.config
+.yardoc
+Gemfile.lock
+InstalledFiles
+_yardoc
+coverage
+doc/
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp

data/.rvmrc

@@ -0,0 +1,81 @@
+#!/usr/bin/env bash
+
+# This is an RVM Project .rvmrc file, used to automatically load the ruby
+# development environment upon cd'ing into the directory
+
+# First we specify our desired <ruby>[@<gemset>], the @gemset name is optional.
+environment_id="ruby-1.9.3-p194@hashshashin"
+
+#
+# Uncomment the following lines if you want to verify rvm version per project
+#
+# rvmrc_rvm_version="1.10.2" # 1.10.1 seams as a safe start
+# eval "$(echo ${rvm_version}.${rvmrc_rvm_version} | awk -F. '{print "[[ "$1*65536+$2*256+$3" -ge "$4*65536+$5*256+$6" ]]"}' )" || {
+#   echo "This .rvmrc file requires at least RVM ${rvmrc_rvm_version}, aborting loading."
+#   return 1
+# }
+#
+
+#
+# Uncomment following line if you want options to be set only for given project.
+#
+# PROJECT_JRUBY_OPTS=( --1.9 )
+#
+# The variable PROJECT_JRUBY_OPTS requires the following to be run in shell:
+#
+#    chmod +x ${rvm_path}/hooks/after_use_jruby_opts
+#
+
+#
+# First we attempt to load the desired environment directly from the environment
+# file. This is very fast and efficient compared to running through the entire
+# CLI and selector. If you want feedback on which environment was used then
+# insert the word 'use' after --create as this triggers verbose mode.
+#
+if [[ -d "${rvm_path:-$HOME/.rvm}/environments" \
+  && -s "${rvm_path:-$HOME/.rvm}/environments/$environment_id" ]]
+then
+  \. "${rvm_path:-$HOME/.rvm}/environments/$environment_id"
+
+  if [[ -s "${rvm_path:-$HOME/.rvm}/hooks/after_use" ]]
+  then
+    . "${rvm_path:-$HOME/.rvm}/hooks/after_use"
+  fi
+else
+  # If the environment file has not yet been created, use the RVM CLI to select.
+  if ! rvm --create  "$environment_id"
+  then
+    echo "Failed to create RVM environment '${environment_id}'."
+    return 1
+  fi
+fi
+
+#
+# If you use an RVM gemset file to install a list of gems (*.gems), you can have
+# it be automatically loaded. Uncomment the following and adjust the filename if
+# necessary.
+#
+# filename=".gems"
+# if [[ -s "$filename" ]]
+# then
+#   rvm gemset import "$filename" | grep -v already | grep -v listed | grep -v complete | sed '/^$/d'
+# fi
+
+# If you use bundler, this might be useful to you:
+# if [[ -s Gemfile ]] && ! command -v bundle >/dev/null
+# then
+#   printf "%b" "The rubygem 'bundler' is not installed. Installing it now.\n"
+#   gem install bundler
+# fi
+# if [[ -s Gemfile ]] && command -v bundle
+# then
+#   bundle install
+# fi
+
+if [[ $- == *i* ]] # check for interactive shells
+then
+    echo "Using: $(tput setaf 2)$GEM_HOME$(tput sgr0)" # show the user the ruby and gemset they are using in green
+else 
+	echo "Using: $GEM_HOME" # don't use colors in interactive shells
+fi
+

data/Gemfile

@@ -0,0 +1,3 @@
+source :rubygems
+
+gemspec

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2013 Aaron Oman
+
+MIT License
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.md

@@ -0,0 +1,48 @@
+# Hashshashin
+
+What is Hashshashin? [Hashish consuming, intoxicated assassins](https://en.wikipedia.org/wiki/Assassins).
+
+This is a SimpleDelegator that wraps Ruby's built-in Hash object and adds useful
+functionality.  For example, there's a recursive method to convert all keys to symbols.
+
+##Installation
+Add this line to your project's Gemfile:
+
+```
+gem 'hashshashin'
+```
+
+Then execute:
+
+```
+bundle install
+```
+
+Or, install it yourself with:
+
+```
+$ gem install hashshashin
+```
+
+##Usage
+Create a new instance:
+
+```
+regular_hash = { 'a' => 1, 'b' => 2, 'c' => 3 }
+fancy_hash = Hashshashin.new(regular_hash)
+
+fancy_hash.class # => Hashshashin
+```
+
+Invoking a Hashashin instance method:
+
+```
+fancy_hash.recursive_symbolize_keys # => { :a => 1, :b => 2, :c => 3 }
+```
+
+##Contributing
+1. Fork it
+2. Create your feature branch (git checkout -b my-new-feature)
+3. Commit your changes (git commit -am 'Add some feature')
+4. Push to the branch (git push origin my-new-feature)
+5. Create new Pull Request

data/Rakefile

@@ -0,0 +1,12 @@
+#!/usr/bin/env rake
+
+require "bundler/gem_tasks"
+require 'rake/testtask'
+
+Rake::TestTask.new do |t|
+  t.libs << 'lib/hashshashin'
+  t.test_files = FileList['test/lib/hashshashin/*_test.rb']
+  t.verbose = true
+end
+
+task default: :test

data/hashshashin.gemspec

@@ -0,0 +1,25 @@
+# -*- encoding: utf-8 -*-
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+
+require 'hashshashin/version'
+
+Gem::Specification.new do |gem|
+  gem.name          = 'hashshashin'
+  gem.version       = HashshashinUtils::VERSION
+  gem.authors       = ["Aaron Oman"]
+  gem.email         = ["aaron@unbounce.com"]
+  gem.description   = %q{Convenient recursive methods to extend Ruby's built-in Hash.}
+  gem.summary       = %q{Destructive and non-destructive recursive methods to augment the build in Hash.}
+  gem.homepage      = ""
+
+  gem.files         = `git ls-files`.split($/)
+  gem.executables   = gem.files.grep(%r{^bin/}).map{ |f| File.basename(f) }
+  gem.test_files    = gem.files.grep(%r{^(test|spec|features)/})
+  gem.require_paths = ["lib"]
+
+  gem.add_development_dependency 'rake'
+  gem.add_development_dependency 'shoulda'
+  gem.add_development_dependency 'rspec'
+  gem.add_dependency 'timecop'
+end

data/lib/hashshashin/version.rb

@@ -0,0 +1,3 @@
+module HashshashinUtils
+  VERSION = '0.0.1'
+end

data/lib/hashshashin.rb

@@ -0,0 +1,241 @@
+require 'delegate'
+
+class Hashshashin < SimpleDelegator
+  # Adds the ability to cherrypick specific key/value pairs from a hash
+  #
+  # Example:
+  #
+  #   x = { a: 1, b: 2, c: 3 }
+  #   y = Hashshashin.new(x)
+  #
+  #   y.pick
+  #   => {}
+  #
+  #   y.pick(:a, :c)
+  #   => { a: 1, c: 3 }
+  #
+  #   y.pick(:a, :c, :d)
+  #   => { a: 1, c: 3, d: nil }
+  #
+  def pick(*keys)
+    values = values_at(*keys)
+    Hash[keys.zip(values)]
+  end
+
+  # See:
+  # http://stackoverflow.com/a/12360142/321897
+  #
+  # By default, remove any key/value pairs recursively from the hash if the value is
+  # nil, 0, false, empty or a blank string.
+  # Alternatively, a block can be passed in which specifies the condition for whether the
+  # key/value pair should be excised.
+  #
+  # Example:
+  #
+  # {
+  #   hash: {
+  #     false: false, nil: nil, zero: 0, empty_string: '', empty_list: [], empty_hash: {}, one: 1
+  #   },
+  #   false: false,
+  #   nil: nil,
+  #   zero: 0,
+  #   empty_string: '',
+  #   empty_list: [],
+  #   empty_hash: {},
+  #   one: 1
+  # }
+  #
+  # Becomes:
+  #
+  # { hash: { one: 1 }, one: 1 }
+  #
+  def recursive_compact!
+    self.delete_if do |key, value|
+      if block_given?
+        yield(key, value)
+      else
+        value.nil? || value === 0 || value === false || empty?(value)
+      end
+    end
+
+    self.each do |key, value|
+      value = Hashshashin.new(value) if value.is_a?(Hash)
+
+      if value.is_a?(Hashshashin)
+        if block_given?
+          self[key] = value.recursive_compact!(&Proc.new)
+        else
+          self[key] = value.recursive_compact!
+        end
+      end
+
+    end
+
+    return self
+  end
+
+  # The same as #recursive_compact! above, except this doesn't modify self; instead,
+  # this returns a new hash with the recursive compaction applied.
+  #
+  def recursive_compact(&block)
+    Marshal.load(Marshal.dump(self)).recursive_compact!(&block)
+  end
+
+  # By default, call #to_datetime, then #rfc3339 on the values for every key/value pair
+  # in the hash where the value is a Time or DateTime object, or responds to
+  # #to_datetime.
+  # Alternatively, a block can be passed in that specifies the acceptance condition for
+  # key/value pairs in the hash.
+  #
+  # Note: Regardless of the acceptance block, we will call #to_datetime, then #rfc3339
+  # on the value.
+  #
+  # Example:
+  #
+  # {
+  #   hash: {
+  #     time: '2012-12-05 12:26:54 -0800', # Time.now (object) shown as a string.
+  #     datetime: 'Wed, 05 Dec 2012 12:26:56 -0800' # DateTime.now (object) shown as a string.
+  #   },
+  #   time: '2012-12-05 12:26:54 -0800', # Time.now (object) shown as a string.
+  #   datetime: 'Wed, 05 Dec 2012 12:26:56 -0800' # DateTime.now (object) shown as a string.
+  # }
+  #
+  # Becomes:
+  # {
+  #   hash: {
+  #     time: '2012-01-01T12:26:54-08:00', # String
+  #     datetime: '2012-01-01T12:26:56-08:00' # String
+  #   },
+  #   time: '2012-01-01T12:26:54-08:00', # String
+  #   datetime: '2012-01-01T12:26:56-08:00' # String
+  # }
+  #
+  def recursive_rfc3339!
+    hash = self.dup
+
+    hash.keep_if do |key, value|
+      if block_given?
+        yield(key, value)
+      else
+        time?(value) || datetime?(value) || rfc3339able_and_not_string?(value)
+      end
+    end
+
+    hash.each do |key, value|
+      datetime = value.to_datetime
+      hash[key] = datetime.rfc3339 if datetime.respond_to?(:rfc3339)
+    end
+
+    self.merge!(hash)
+
+    self.each do |key, value|
+      value = Hashshashin.new(value) if value.is_a?(Hash)
+
+      if value.is_a?(Hashshashin)
+        if block_given?
+          self[key] = value.recursive_rfc3339!(&Proc.new)
+        else
+          self[key] = value.recursive_rfc3339!
+        end
+      end
+
+    end
+
+    return self
+  end
+
+  # The same as #recursive_rfc3339! above, except this doesn't modify self; instead,
+  # this returns a new hash with the recursive time formatting applied.
+  #
+  def recursive_rfc3339(&block)
+    Marshal.load(Marshal.dump(self)).recursive_rfc3339!(&block)
+  end
+
+  # Replace all string keys with symbols.
+  # ie.
+  #
+  #   Hashshashin.new({ 'a' => 1, 'b' => 2 }).recursive_symbolize_keys!
+  #
+  #   => { a: 1, b: 2 }
+  #
+  def recursive_symbolize_keys!
+    string_pairs = self.select { |key, value| key.kind_of?(String) }
+
+    string_pairs.each do |key, value|
+      self[key.to_sym] = value
+      self.delete(key)
+    end
+
+    self.each do |key, value|
+      value = Hashshashin.new(value) if value.is_a?(Hash)
+
+      self[key] = value.recursive_symbolize_keys! if value.is_a?(Hashshashin)
+    end
+
+    self
+  end
+
+  # The same as #recursive_symbolize_keys! above, except this doesn't modify self;
+  # instead, this returns a new hash with the recursively defined symbolized keys.
+  #
+  def recursive_symbolize_keys
+    Marshal.load(Marshal.dump(self)).recursive_symbolize_keys!
+  end
+
+  # This method takes a block that returns an array of [key, value] pairs.
+  # It then returns a new hash where each [key, value] pair in the original hash has been
+  # replaced with those returned by the block.
+  #
+  # For example:
+  #
+  #   h = { a: 1, b: 2, c: 3, d: 4 }
+  #
+  # Hashshashin.new(h).recursively_apply do |key, value|
+  #   if v < 3
+  #     [key, value + 10]
+  #   else
+  #     [key, value]
+  #   end
+  # end
+  #
+  # # => { a: 11, b: 12, c: 3, d: 4 }
+  #
+  def recursively_apply
+    return self unless block_given?
+
+    new_hash = Hash[ self.collect { |key, value| yield(key, value) } ]
+
+    new_hash.each do |key, value|
+      value = Hashshashin.new(value) if value.is_a?(Hash)
+
+      new_hash[key] = value.recursively_apply(&Proc.new) if value.is_a?(Hashshashin)
+    end
+
+    new_hash
+  end
+
+  private
+
+    def time?(value)
+      value.kind_of?(Time)
+    end
+
+    def datetime?(value)
+      value.kind_of?(DateTime)
+    end
+
+    def rfc3339able_and_not_string?(value)
+      value.respond_to?('to_datetime') && !value.kind_of?(String)
+    end
+
+    def empty?(value)
+      empty = value.empty? if value.respond_to?('empty?')
+
+      strip_empty = if value.respond_to?('strip') && value.respond_to?('empty')
+        value.strip.empty?
+      end
+
+      empty || strip_empty
+    end
+end

data/spec/lib/hashshashin_spec.rb

@@ -0,0 +1,361 @@
+require 'spec_helper'
+
+describe Hashshashin do
+  let(:populated_hash) { { a: 1, b: 2, c: 3 } }
+
+  describe '#pick' do
+    context 'for no keys' do
+      it('returns an empty hash') { Hashshashin.new(populated_hash).pick.should == {} }
+      it('returns nils') { Hashshashin.new({}).pick(:a, :b).should == { a: nil, b: nil } }
+    end
+
+    context 'for a single key' do
+      it('returns the hash') { Hashshashin.new(populated_hash).pick(:a).should == { a: 1 } }
+      it('returns the hash') { Hashshashin.new({ a: 1 }).pick(:a, :b).should == { a: 1, b: nil } }
+    end
+
+    context 'for multiple keys' do
+      it('returns a hash') { Hashshashin.new(populated_hash).pick(:a, :c).should == { a: 1, c: 3 } }
+    end
+  end
+
+  describe '#recursive_compact' do
+
+    it 'does not alter self' do
+      Timecop.freeze(DateTime.now) do
+        decorator = Hashshashin.new(sample_hash)
+        decorator.recursive_compact
+        decorator.should == Hashshashin.new(sample_hash)
+      end
+    end
+
+    it 'returns a Hashshashin instance' do
+      Hashshashin.new(sample_hash).recursive_compact.kind_of?(Hashshashin).should be_true
+    end
+
+    it 'removes nil' do
+      result = Hashshashin.new(sample_hash).recursive_compact
+      result.has_key?(:nil).should be_false
+    end
+
+    it 'recursively removes nil' do
+      result = Hashshashin.new(sample_hash).recursive_compact
+      result[:hash].has_key?(:nil).should be_false
+    end
+
+    it 'removes 0' do
+      result = Hashshashin.new(sample_hash).recursive_compact
+      result.has_key?(:zero).should be_false
+    end
+
+    it 'recursively removes 0' do
+      result = Hashshashin.new(sample_hash).recursive_compact
+      result[:hash].has_key?(:zero).should be_false
+    end
+
+    it 'removes false' do
+      result = Hashshashin.new(sample_hash).recursive_compact
+      result.has_key?(:false).should be_false
+    end
+
+    it 'recursively removes false' do
+      result = Hashshashin.new(sample_hash).recursive_compact
+      result[:hash].has_key?(:false).should be_false
+    end
+
+    it 'removes empty' do
+      result = Hashshashin.new(sample_hash).recursive_compact
+      result.has_key?(:empty_list).should be_false
+    end
+
+    it 'recursively removes empty' do
+      result = Hashshashin.new(sample_hash).recursive_compact
+      result[:hash].has_key?(:empty_list).should be_false
+    end
+
+    it 'removes :one' do
+      result = Hashshashin.new(sample_hash).recursive_compact { |k,v| k == :one }
+      result.has_key?(:one).should be_false
+    end
+
+    it 'recursively removes :one' do
+      result = Hashshashin.new(sample_hash).recursive_compact { |k,v| k == :one }
+      result[:hash].has_key?(:one).should be_false
+    end
+
+  end
+
+  describe '#recursive_compact!' do
+
+    it 'alters self' do
+      decorator = Hashshashin.new(sample_hash)
+      decorator.recursive_compact!
+      decorator.should_not == Hashshashin.new(sample_hash)
+    end
+
+    it 'returns a Hashshashin instance' do
+      Hashshashin.new(sample_hash).recursive_compact!.kind_of?(Hashshashin).should be_true
+    end
+
+    it 'removes nil' do
+      result = Hashshashin.new(sample_hash).recursive_compact!
+      result.has_key?(:nil).should be_false
+    end
+
+    it 'recursively removes nil' do
+      result = Hashshashin.new(sample_hash).recursive_compact!
+      result[:hash].has_key?(:nil).should be_false
+    end
+
+    it 'removes 0' do
+      result = Hashshashin.new(sample_hash).recursive_compact!
+      result.has_key?(:zero).should be_false
+    end
+
+    it 'recursively removes 0' do
+      result = Hashshashin.new(sample_hash).recursive_compact!
+      result[:hash].has_key?(:zero).should be_false
+    end
+
+    it 'removes false' do
+      result = Hashshashin.new(sample_hash).recursive_compact!
+      result.has_key?(:false).should be_false
+    end
+
+    it 'recursively removes false' do
+      result = Hashshashin.new(sample_hash).recursive_compact!
+      result[:hash].has_key?(:false).should be_false
+    end
+
+    it 'removes empty' do
+      result = Hashshashin.new(sample_hash).recursive_compact!
+      result.has_key?(:empty_list).should be_false
+    end
+
+    it 'recursively removes empty' do
+      result = Hashshashin.new(sample_hash).recursive_compact!
+      result[:hash].has_key?(:empty_list).should be_false
+    end
+
+    it 'removes :one' do
+      result = Hashshashin.new(sample_hash).recursive_compact! { |k,v| k == :one }
+      result.has_key?(:one).should be_false
+    end
+
+    it 'recursively removes :one' do
+      result = Hashshashin.new(sample_hash).recursive_compact! { |k,v| k == :one }
+      result[:hash].has_key?(:one).should be_false
+    end
+
+  end
+
+  describe '#recursive_rfc3339' do
+
+    it 'does not alter self' do
+      Timecop.freeze(DateTime.now) do
+        decorator = Hashshashin.new(sample_hash)
+        decorator.recursive_rfc3339
+        decorator.should == Hashshashin.new(sample_hash)
+      end
+    end
+
+    it 'returns a Hashshashin instance' do
+      Hashshashin.new(sample_hash).recursive_rfc3339.kind_of?(Hashshashin).should be_true
+    end
+
+    it 'replaces Time values' do
+      result = Hashshashin.new(sample_hash).recursive_rfc3339
+      result[:Time].should be_kind_of(String)
+      result[:Time].should == sample_hash[:Time].to_datetime.rfc3339
+    end
+
+    it 'recursively replaces Time values' do
+      result = Hashshashin.new(sample_hash).recursive_rfc3339
+      result[:hash][:Time].should be_kind_of(String)
+      result[:hash][:Time].should == sample_hash[:Time].to_datetime.rfc3339
+    end
+
+    it 'replaces DateTime values' do
+      result = Hashshashin.new(sample_hash).recursive_rfc3339
+      result[:DateTime].should be_kind_of(String)
+      result[:DateTime].should == sample_hash[:DateTime].to_datetime.rfc3339
+    end
+
+    it 'recursively replaces DateTime values' do
+      result = Hashshashin.new(sample_hash).recursive_rfc3339
+      result[:hash][:DateTime].should be_kind_of(String)
+      result[:hash][:DateTime].should == sample_hash[:DateTime].to_datetime.rfc3339
+    end
+
+  end
+
+  describe '#recursive_rfc3339!' do
+
+    it 'alters self' do
+      Timecop.freeze(DateTime.now) do
+        decorator = Hashshashin.new(sample_hash)
+        decorator.recursive_rfc3339!
+        decorator.should_not == Hashshashin.new(sample_hash)
+      end
+    end
+
+    it 'returns a Hashshashin instance' do
+      Hashshashin.new(sample_hash).recursive_rfc3339!.kind_of?(Hashshashin).should be_true
+    end
+
+    it 'replaces Time values' do
+      result = Hashshashin.new(sample_hash).recursive_rfc3339!
+      result[:Time].should be_kind_of(String)
+      result[:Time].should == sample_hash[:Time].to_datetime.rfc3339
+    end
+
+    it 'recursively replaces Time values' do
+      result = Hashshashin.new(sample_hash).recursive_rfc3339!
+      result[:hash][:Time].should be_kind_of(String)
+      result[:hash][:Time].should == sample_hash[:Time].to_datetime.rfc3339
+    end
+
+    it 'replaces DateTime values' do
+      Timecop.freeze(DateTime.now) do
+        result = Hashshashin.new(sample_hash).recursive_rfc3339!
+        result[:DateTime].should be_kind_of(String)
+        result[:DateTime].should == sample_hash[:DateTime].to_datetime.rfc3339
+      end
+    end
+
+    it 'recursively replaces DateTime values' do
+      result = Hashshashin.new(sample_hash).recursive_rfc3339!
+      result[:hash][:DateTime].should be_kind_of(String)
+      result[:hash][:DateTime].should == sample_hash[:DateTime].to_datetime.rfc3339
+    end
+
+  end
+
+  describe '#recursive_symbolize_keys' do
+
+    it 'does not alter self' do
+      Timecop.freeze(DateTime.now) do
+        decorator = Hashshashin.new(sample_hash)
+        decorator.recursive_symbolize_keys
+        decorator.should == Hashshashin.new(sample_hash)
+      end
+    end
+
+    it 'returns a Hashshashin instance' do
+      Hashshashin.new(sample_hash).recursive_symbolize_keys.kind_of?(Hashshashin).should be_true
+    end
+
+    it 'replaces String keys' do
+      result = Hashshashin.new(sample_hash).recursive_symbolize_keys
+      result.keys.any? { |key| key.kind_of?(String) }.should be_false
+
+      result[:string_key].should be
+    end
+
+    it 'recursively replaces String keys' do
+      result = Hashshashin.new(sample_hash).recursive_symbolize_keys
+      result[:hash].keys.any? { |key| key.kind_of?(String) }.should be_false
+
+      result[:hash][:string_key].should be
+    end
+
+  end
+
+  describe '#recursive_symbolize_keys!' do
+
+    it 'alters self' do
+      Timecop.freeze(DateTime.now) do
+        decorator = Hashshashin.new(sample_hash)
+        decorator.recursive_symbolize_keys!
+        decorator.should_not == Hashshashin.new(sample_hash)
+      end
+    end
+
+    it 'returns a Hashshashin instance' do
+      Hashshashin.new(sample_hash).recursive_symbolize_keys!.kind_of?(Hashshashin).should be_true
+    end
+
+    it 'replaces String keys' do
+      result = Hashshashin.new(sample_hash).recursive_symbolize_keys!
+      result.keys.any? { |key| key.kind_of?(String) }.should be_false
+
+      result[:string_key].should be
+    end
+
+    it 'recursively replaces String keys' do
+      result = Hashshashin.new(sample_hash).recursive_symbolize_keys!
+      result[:hash].keys.any? { |key| key.kind_of?(String) }.should be_false
+
+      result[:hash][:string_key].should be
+    end
+
+  end
+
+  describe '#recursively_apply' do
+    subject do
+      Hashshashin.new(sample_hash).recursively_apply do |key, value|
+        ["#{key.to_s}_key", value]
+      end
+    end
+
+    specify { subject['false_key'].should == false }
+    specify { subject['nil_key'].should == nil }
+    specify { subject['zero_key'].should == 0 }
+    specify { subject['empty_string_key'].should == '' }
+    specify { subject['empty_list_key'].should == [] }
+    specify { subject['empty_hash_key'].should == {} }
+    specify { subject['one_key'].should == 1 }
+    specify { subject['a_key'].should == 'a' }
+    specify { subject['Time_key'].should be }
+    specify { subject['DateTime_key'].should be }
+    specify { subject['string_key_key'].should == 'value' }
+    specify { subject['camelize_me_key'].should == :camelize_me }
+
+    specify { subject['hash_key']['false_key'].should == false }
+    specify { subject['hash_key']['nil_key'].should == nil }
+    specify { subject['hash_key']['zero_key'].should == 0 }
+    specify { subject['hash_key']['empty_string_key'].should == '' }
+    specify { subject['hash_key']['empty_list_key'].should == [] }
+    specify { subject['hash_key']['empty_hash_key'].should == {} }
+    specify { subject['hash_key']['one_key'].should == 1 }
+    specify { subject['hash_key']['a_key'].should == 'a' }
+    specify { subject['hash_key']['Time_key'].should be }
+    specify { subject['hash_key']['DateTime_key'].should be }
+    specify { subject['hash_key']['string_key_key'].should == 'value' }
+    specify { subject['hash_key']['camelize_me_key'].should == :camelize_me }
+  end
+
+  def sample_hash
+    {
+      hash: {
+        false: false,
+        nil: nil,
+        zero: 0,
+        empty_string: '',
+        empty_list: [],
+        empty_hash: {},
+        one: 1,
+        a: 'a',
+        Time: Time.now,
+        DateTime: DateTime.now,
+        'string_key' => 'value',
+        'camelize_me' => 'camelize_me',
+        :camelize_me => :camelize_me
+      },
+      false: false,
+      nil: nil,
+      zero: 0,
+      empty_string: '',
+      empty_list: [],
+      empty_hash: {},
+      one: 1,
+      a: 'a',
+      Time: Time.now,
+      DateTime: DateTime.now,
+      'string_key' => 'value',
+      'camelize_me' => 'camelize_me',
+      :camelize_me => :camelize_me
+    }
+  end
+
+end

data/spec/spec_helper.rb

@@ -0,0 +1,3 @@
+require 'rubygems'
+require 'timecop'
+require File.expand_path('../../lib/hashshashin', __FILE__)

metadata

@@ -0,0 +1,109 @@
+--- !ruby/object:Gem::Specification
+name: hashshashin
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+  prerelease: 
+platform: ruby
+authors:
+- Aaron Oman
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-02-05 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: &70164491435080 !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: *70164491435080
+- !ruby/object:Gem::Dependency
+  name: shoulda
+  requirement: &70164491434580 !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: *70164491434580
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: &70164491434040 !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: *70164491434040
+- !ruby/object:Gem::Dependency
+  name: timecop
+  requirement: &70164491433360 !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: *70164491433360
+description: Convenient recursive methods to extend Ruby's built-in Hash.
+email:
+- aaron@unbounce.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- .rvmrc
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- hashshashin.gemspec
+- lib/hashshashin.rb
+- lib/hashshashin/version.rb
+- spec/lib/hashshashin_spec.rb
+- spec/spec_helper.rb
+homepage: ''
+licenses: []
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+      segments:
+      - 0
+      hash: -850569894321753333
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+      segments:
+      - 0
+      hash: -850569894321753333
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.15
+signing_key: 
+specification_version: 3
+summary: Destructive and non-destructive recursive methods to augment the build in
+  Hash.
+test_files:
+- spec/lib/hashshashin_spec.rb
+- spec/spec_helper.rb