1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
|
module RecursiveOpenStruct::DebugInspect
def debug_inspect(io = STDOUT, indent_level = 0, recursion_limit = 12)
display_recursive_open_struct(io, @table, indent_level, recursion_limit)
end
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
end
|
