Class: RecursiveOpenStruct

Inherits:
OpenStruct
  • Object
show all
Defined in:
lib/recursive_open_struct.rb

Constant Summary collapse

VERSION = 
"0.5.0"

Instance Method Summary collapse

Constructor Details

#initialize(h = nil, args = {}) ⇒ RecursiveOpenStruct

Returns a new instance of RecursiveOpenStruct.



6
7
8
9
10
 
# File 'lib/recursive_open_struct.rb', line 6

def initialize(h=nil, args={})
  @recurse_over_arrays = args.fetch(:recurse_over_arrays,false)
  super(h)
  @sub_elements = {}
end

Instance Method Details

#debug_inspect(io = STDOUT, indent_level = 0, recursion_limit = 12) ⇒ Object 



59
60
61
 
# File 'lib/recursive_open_struct.rb', line 59

def debug_inspect(io = STDOUT, indent_level = 0, recursion_limit = 12)
  display_recursive_open_struct(io, @table, indent_level, recursion_limit)
end

#display_recursive_open_struct(io, ostrct_or_hash, indent_level, recursion_limit) ⇒ Object 



63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
 
# File 'lib/recursive_open_struct.rb', line 63

def display_recursive_open_struct(io, ostrct_or_hash, indent_level, recursion_limit)

  if recursion_limit <= 0 then
    # protection against recursive structure (like in the tests)
    io.puts '  '*indent_level + '(recursion limit reached)'
  else
    #puts ostrct_or_hash.inspect
    if ostrct_or_hash.is_a?(self.class) then
      ostrct_or_hash = ostrct_or_hash.marshal_dump
    end

    # 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?(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?(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
        io.puts '  '*indent_level + key.to_s + ' '*(data_indent - key.to_s.length) + ' = ' + value.inspect
      end
    end
  end

  true
end

#new_ostruct_member(name) ⇒ Object 



26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
 
# File 'lib/recursive_open_struct.rb', line 26

def new_ostruct_member(name)
  name = name.to_sym
  unless self.respond_to?(name)
    class << self; self; end.class_eval do
      define_method(name) do
        v = @table[name]
        if v.is_a?(Hash)
          @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
          v
        end
      end
      define_method("#{name}=") { |x| modifiable[name] = x }
      define_method("#{name}_as_a_hash") { @table[name] }
    end
  end
  name
end

#recurse_over_array(array) ⇒ Object 



47
48
49
50
51
52
53
54
55
56
57
 
# File 'lib/recursive_open_struct.rb', line 47

def recurse_over_array array
  array.map do |a|
    if a.is_a? Hash
      self.class.new(a, :recurse_over_arrays => true)
    elsif a.is_a? Array
      recurse_over_array a
    else
      a
    end
  end
end

#to_h ⇒ Object Also known as: to_hash 



12
13
14
15
16
17
18
19
20
21
22
 
# File 'lib/recursive_open_struct.rb', line 12

def to_h
  @table.dup.update(@sub_elements) do |k, oldval, newval|
    if newval.kind_of?(self.class)
      newval.to_h
    elsif newval.kind_of?(Array)
      newval.map { |a| a.kind_of?(self.class) ? a.to_h : a }
    else
      raise "Cached value of unsupported type: #{newval.inspect}"
    end
  end
end