recursive-open-struct 0.2.0 → 0.2.1

data/README.rdoc

@@ -3,17 +3,17 @@
 RecursiveOpenStruct is a extension of OpenStruct.
 It enhance OpenStruct in that it allows nested hashes to be treated in a recursive
 fashion. For example:
+  ros = RecursiveOpenStruct.new( { :fooa => { :foob => 'fooc' } } )
+can now be accessed this way :
+  ros.fooa.foob # 'fooc'
 
-    ros = RecursiveOpenStruct.new({ :a => { :b => 'c' } })
-    ros.a.b # 'c'
+Also, if needed, nested hashes can still be accessed as hashes :
 
-Also, nested hashes can still be accessed as hashes:
-
-    ros.a_as_a_hash # { :b => 'c' }
+  ros.fooa_as_a_hash # { :foob => 'fooc' }
 
 == Installation
 
-So easy.
+Available as a gem in rubygems, the default gem repository.
 
 If you use bundler, just throw that in your gemfile :
   gem 'recursive-open-struct'
@@ -21,6 +21,8 @@ If you use bundler, just throw that in your gemfile :
 You may also install the gem manually :
   gem install recursive-open-struct
 
+Isn't that easy ? (Special thanks to the jeweler tool)
+
 == Note on Patches/Pull Requests
  
 * Fork the project.

data/VERSION

@@ -1 +1 @@
-0.2.0
+0.2.1

data/lib/recursive_open_struct.rb

@@ -32,13 +32,20 @@ class RecursiveOpenStruct < OpenStruct
         ostrct_or_hash = ostrct_or_hash.marshal_dump
       end
       
-      data_indent = ostrct_or_hash.max {|a,b| a[0].to_s.length <=> b[0].to_s.length}[0].length
+      # We'll display the key values like this :    key =  value
+      # to align display, we look for the maximum key length of the data that will be displayed
+      # (everything except hashes)
+      data_indent = ostrct_or_hash
+        .reject { |k, v| v.is_a?(RecursiveOpenStruct) || v.is_a?(Hash) }
+          .max {|a,b| a[0].to_s.length <=> b[0].to_s.length}[0].length
+      # puts "max length = #{data_indent}"
+      
       ostrct_or_hash.each do |key, value|
         if (value.is_a?(RecursiveOpenStruct) || value.is_a?(Hash)) then
           puts '  '*indent_level + key.to_s + '.'
           display_recursive_open_struct(value, indent_level + 1, recursion_limit - 1)
         else
-          puts '  '*indent_level + key.to_s + ' '*(data_indent - key.to_s.length) + '= ' + value.inspect
+          puts '  '*indent_level + key.to_s + ' '*(data_indent - key.to_s.length) + ' = ' + value.inspect
         end
       end
     end

data/recursive-open-struct.gemspec

@@ -5,11 +5,11 @@
 
 Gem::Specification.new do |s|
   s.name = %q{recursive-open-struct}
-  s.version = "0.2.0"
+  s.version = "0.2.1"
 
   s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
   s.authors = [%q{William (B.J.) Snow Orvis}]
-  s.date = %q{2011-05-25}
+  s.date = %q{2011-05-31}
   s.description = %q{RecursiveOpenStruct is a subclass of OpenStruct. It differs from
 OpenStruct in that it allows nested hashes to be treated in a recursive
 fashion. For example:

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: recursive-open-struct
 version: !ruby/object:Gem::Version
-  version: 0.2.0
+  version: 0.2.1
   prerelease: 
 platform: ruby
 authors:
@@ -9,11 +9,11 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2011-05-25 00:00:00.000000000Z
+date: 2011-05-31 00:00:00.000000000Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rspec
-  requirement: &74135210 !ruby/object:Gem::Requirement
+  requirement: &73346940 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -21,10 +21,10 @@ dependencies:
         version: '0'
   type: :development
   prerelease: false
-  version_requirements: *74135210
+  version_requirements: *73346940
 - !ruby/object:Gem::Dependency
   name: bundler
-  requirement: &74134960 !ruby/object:Gem::Requirement
+  requirement: &73346640 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -32,10 +32,10 @@ dependencies:
         version: '0'
   type: :development
   prerelease: false
-  version_requirements: *74134960
+  version_requirements: *73346640
 - !ruby/object:Gem::Dependency
   name: jeweler
-  requirement: &74134720 !ruby/object:Gem::Requirement
+  requirement: &73346350 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -43,10 +43,10 @@ dependencies:
         version: '0'
   type: :development
   prerelease: false
-  version_requirements: *74134720
+  version_requirements: *73346350
 - !ruby/object:Gem::Dependency
   name: rcov
-  requirement: &74134480 !ruby/object:Gem::Requirement
+  requirement: &73346110 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -54,7 +54,7 @@ dependencies:
         version: '0'
   type: :development
   prerelease: false
-  version_requirements: *74134480
+  version_requirements: *73346110
 description: ! "RecursiveOpenStruct is a subclass of OpenStruct. It differs from\nOpenStruct
   in that it allows nested hashes to be treated in a recursive\nfashion. For example:\n\n
   \   ros = RecursiveOpenStruct.new({ :a => { :b => 'c' } })\n    ros.a.b # 'c'\n\nAlso,
@@ -94,7 +94,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
       version: '0'
       segments:
       - 0
-      hash: 914381613
+      hash: 764807215
 required_rubygems_version: !ruby/object:Gem::Requirement
   none: false
   requirements: