recursive-open-struct 0.4.4 → 0.4.5

data/lib/recursive_open_struct.rb

@@ -1,7 +1,7 @@
 require 'ostruct'
 
 class RecursiveOpenStruct < OpenStruct
-  VERSION = "0.4.4"
+  VERSION = "0.4.5"
 
   def initialize(h=nil, args={})
     @recurse_over_arrays = args.fetch(:recurse_over_arrays,false)
@@ -28,7 +28,7 @@ class RecursiveOpenStruct < OpenStruct
         define_method(name) do
           v = @table[name]
           if v.is_a?(Hash)
-            @sub_elements[name] ||= RecursiveOpenStruct.new(v, :recurse_over_arrays => @recurse_over_arrays)
+            @sub_elements[name] ||= self.class.new(v, :recurse_over_arrays => @recurse_over_arrays)
           elsif v.is_a?(Array) and @recurse_over_arrays
             @sub_elements[name] ||= recurse_over_array v
           else
@@ -45,7 +45,7 @@ class RecursiveOpenStruct < OpenStruct
   def recurse_over_array array
     array.map do |a|
       if a.is_a? Hash
-        RecursiveOpenStruct.new(a, :recurse_over_arrays => true)
+        self.class.new(a, :recurse_over_arrays => true)
       elsif a.is_a? Array
         recurse_over_array a
       else
@@ -65,7 +65,7 @@ class RecursiveOpenStruct < OpenStruct
       io.puts '  '*indent_level + '(recursion limit reached)'
     else
       #puts ostrct_or_hash.inspect
-      if ostrct_or_hash.is_a?(RecursiveOpenStruct) then
+      if ostrct_or_hash.is_a?(self.class) then
         ostrct_or_hash = ostrct_or_hash.marshal_dump
       end
 
@@ -73,12 +73,12 @@ class RecursiveOpenStruct < OpenStruct
       # 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) } \
+        .reject { |k, v| v.is_a?(self.class) || v.is_a?(Hash) } \
           .max {|a,b| a[0].to_s.length <=> b[0].to_s.length}[0].to_s.length
       # puts "max length = #{data_indent}"
 
       ostrct_or_hash.each do |key, value|
-        if (value.is_a?(RecursiveOpenStruct) || value.is_a?(Hash)) then
+        if (value.is_a?(self.class) || value.is_a?(Hash)) then
           io.puts '  '*indent_level + key.to_s + '.'
           display_recursive_open_struct(io, value, indent_level + 1, recursion_limit - 1)
         else

data/spec/recursive_open_struct_spec.rb

@@ -234,6 +234,14 @@ QUOTE
       @io.string.should match /^                      h2\.$/
       @io.string.should match /^                        \(recursion limit reached\)$/
     end
+
+    it "creates nested objects via subclass" do
+      RecursiveOpenStructSubClass = Class.new(RecursiveOpenStruct)
+      
+      rossc = RecursiveOpenStructSubClass.new({ :one => [{:two => :three}] }, recurse_over_arrays: true)
+
+      rossc.one.first.class.should == RecursiveOpenStructSubClass
+    end
   end # additionnel features
 
 end # describe RecursiveOpenStruct

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: recursive-open-struct
 version: !ruby/object:Gem::Version
-  version: 0.4.4
+  version: 0.4.5
   prerelease: 
 platform: ruby
 authors:
@@ -9,7 +9,7 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2013-08-28 00:00:00.000000000 Z
+date: 2013-10-24 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rspec