dynahash 0.1

data/LICENSE

@@ -0,0 +1,27 @@
+DynaHash Ruby Gem
+Copyright (c) 2010, Tony Heupel, All Rights Reserved
+
+=====================================================
+Licensed under the MIT License:
+
+The MIT License
+
+Copyright (c) 2010 Tony Heupel
+
+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/lib/dynahash.rb

@@ -0,0 +1,34 @@
+# = DynaHash
+# (c) 2010 Tony Heupel
+#
+# An extension to Ruby's Hash class that allows for dot-notation
+# access to a Hash's keys as if they were just properties on the 
+# object.
+# It ignores:
+#  *  @ (xml-simple gem attribute prefix)
+#  *  : (symbol notation)
+#  *  - (dash in name)
+#
+# It replaces spaces with underscores to more closely resemble
+# a property name.
+#
+# Based off of my .NET/C# HyperDynamo work at 
+# http://github.com/tonyheupel/hypercore
+#
+class Hash
+  
+  def method_missing(m, *args, &block)
+    self.fetch(find_member(m))
+  end
+  
+  private
+
+  def find_member(m)
+    # get the first key that matches the test
+    # if none of the keys match, just return
+    # the original name passed in and let the
+    # caller handle it.
+    name = m.to_s
+    self.keys.find(name) { |key| key.to_s.gsub(/(@|:|\-)/, '').gsub(' ', '_').casecmp(name) == 0 }
+  end
+end

data/test/test.rb

@@ -0,0 +1,68 @@
+# !/usr/bin/env/ ruby
+require "test/unit"
+
+require "../lib/dynahash"
+
+class TestDynaHash < Test::Unit::TestCase
+  def test_case_matches
+    h = {'UserName' => 'tonyheupel', 'Password' => 'yeah, right'}
+    
+    assert_equal('tonyheupel', h.UserName)
+    assert_equal(h['UserName'], h.UserName)
+    
+    assert_equal('yeah, right', h.Password) 
+    assert_equal(h['Password'], h.Password)
+    
+  end
+  
+  def test_case_insensitive
+    h = {'UserName' => 'tonyheupel', 'Password' => 'yeah, right'}
+    
+    assert_equal('tonyheupel', h.username)
+    assert_equal('tonyheupel', h.uSERnaMe)
+    
+    assert_equal('yeah, right', h.password)
+    assert_equal('yeah, right', h.pASSwOrD)
+  end
+  
+  def test_replace_space_with_underscore
+    h = {'Tony Heupel' => 'cool', 'Zed Shaw' => 'coolest'}
+    
+    assert_equal('cool', h.Tony_Heupel)
+    assert_equal(h['Tony Heupel'], h.Tony_Heupel)
+    
+    assert_equal('coolest', h.Zed_Shaw)
+    assert_equal(h['Zed Shaw'], h.Zed_Shaw)
+  end
+  
+  def test_remove_at_symbol
+    h = {'@name' => 'Tony', 'gen@der' => :male}
+    
+    assert_equal('Tony', h.name)
+    assert_equal(:male, h.gender)
+  end
+  
+  def test_remove_colon_symbol
+    h = {:name => 'Tony', 'gen:der' => :male}
+
+    assert_equal('Tony', h.name)
+    assert_equal(:male, h.gender)
+  end
+  
+  def test_remove_dash_symbol
+    h = {'My-Name-Is' => 'Slim Shady', '-gender-' => :male}
+
+    assert_equal('Slim Shady', h.MyNameIs)
+    assert_equal(:male, h.gender)
+  end
+  
+  def test_all_removals_and_replacements_together
+    h = {'@name' => 'Tony', 'Person Gender' => :male, :dude_type => 'coolness', '-w:T@@F--' => 'um, ok' }
+    
+    assert_equal('Tony', h.name)
+    assert_equal(:male, h.person_gender)
+    assert_equal('coolness', h.dude_type)
+    assert_equal('um, ok', h.WTF)
+    
+  end
+end

metadata

@@ -0,0 +1,71 @@
+--- !ruby/object:Gem::Specification 
+name: dynahash
+version: !ruby/object:Gem::Version 
+  hash: 9
+  prerelease: false
+  segments: 
+  - 0
+  - 1
+  version: "0.1"
+platform: ruby
+authors: 
+- Tony Heupel
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2010-10-17 00:00:00 -07:00
+default_executable: 
+dependencies: []
+
+description: DynaHash changs the Hash class method_missing to see if it can map the property being accessed to a key in the Hash itself.  It saves typing and looks more like a regular object instance.
+email: 
+- tonyheupel@gmail.com
+executables: []
+
+extensions: []
+
+extra_rdoc_files: []
+
+files: 
+- lib/dynahash.rb
+- LICENSE
+- test/test.rb
+has_rdoc: true
+homepage: http://github.com/tonyheupel/dynahash
+licenses: []
+
+post_install_message: 
+rdoc_options: []
+
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
+      - 0
+      version: "0"
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: 21
+      segments: 
+      - 1
+      - 3
+      - 7
+      version: 1.3.7
+requirements: []
+
+rubyforge_project: dynahash
+rubygems_version: 1.3.7
+signing_key: 
+specification_version: 3
+summary: Reference Hash keys as if they were dot-notation properties
+test_files: 
+- test/test.rb