forked from mbklein/confstruct
/
hash_with_struct_access.rb
192 lines (164 loc) · 4.51 KB
/
hash_with_struct_access.rb
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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
require 'delegate'
require 'confstruct/utils'
module Confstruct
class Deferred < Proc; end
def self.deferred █ Deferred.new(&block); end
if ::RUBY_VERSION < '1.9'
begin
require 'active_support/ordered_hash'
class HashWithStructAccess < DelegateClass(ActiveSupport::OrderedHash); @@ordered = true; @@hash_class = ActiveSupport::OrderedHash; end
rescue LoadError, NameError
class HashWithStructAccess < DelegateClass(Hash); @@ordered = false; @@hash_class = Hash; end
end
else
class HashWithStructAccess < DelegateClass(Hash); @@ordered = true; @@hash_class = Hash; end
end
class HashWithStructAccess
attr_accessor :default_values
@default_values = {}
class << self
def from_hash hash
symbolized_hash = symbolize_hash hash
self.new(symbolized_hash)
end
def ordered?
@@ordered
end
def symbolize_hash hash
hash.inject(@@hash_class.new) do |h,(k,v)|
h[symbolize k] = v.is_a?(Hash) ? symbolize_hash(v) : v
h
end
end
def symbolize key
(key.to_s.gsub(/\s+/,'_').to_sym rescue key.to_sym) || key
end
end
def initialize hash = @@hash_class.new
super(hash)
end
def [] key
result = super(symbolize(key))
if result.is_a?(Hash) and not result.is_a?(HashWithStructAccess)
result = HashWithStructAccess.new(result)
elsif result.is_a?(Deferred)
result = eval_or_yield self, &result
end
result
end
def []= key,value
k = symbolize(key)
v = (value.is_a?(Hash) and not value.is_a?(HashWithStructAccess)) ? HashWithStructAccess.new(value) : value
if v.is_a?(Hash) and self[k].is_a?(Hash)
self[k].replace(v)
else
super(k, v)
end
end
def deep_copy
result = self.class.new(@@hash_class.new)
self.each_pair do |k,v|
if v.respond_to?(:deep_copy)
result[k] = v.deep_copy
else
result[k] = Marshal.load(Marshal.dump(v)) rescue v.dup
end
end
result
end
alias_method :inheritable_copy, :deep_copy
def deep_merge hash
do_deep_merge! hash, self.deep_copy
end
def deep_merge! hash
do_deep_merge! hash, self
end
def deferred! &block
Deferred.new(&block)
end
def has? key_path
val = self
keys = key_path.split(/\./)
keys.each do |key|
return false if val.nil?
if val.respond_to?(:has_key?) and val.has_key?(key.to_sym)
val = val[key.to_sym]
else
return false
end
end
return true
end
def inspect
r = self.keys.collect { |k| "#{k.inspect}=>#{self[k].inspect}" }
"{#{r.compact.join(', ')}}"
end
def is_a? klazz
klazz == @@hash_class or super
end
def lookup! key_path
val = self
keys = key_path.split(/\./)
keys.each do |key|
return nil if val.nil?
if val.respond_to?(:has_key?) and val.has_key?(key.to_sym)
val = val[key.to_sym]
else
return nil
end
end
return val
end
def method_missing sym, *args, &block
if args.length > 1
super(sym,*args,&block)
end
name = sym.to_s.chomp('=').to_sym
if args.length == 1
self[name] = args[0]
else
result = self[name]
if result.nil? and block_given?
result = self[name] = HashWithStructAccess.new(@@hash_class.new)
end
if result.is_a?(HashWithStructAccess) and block_given?
eval_or_yield result, &block
end
result
end
end
def methods
key_methods = keys.collect do |k|
self[k].is_a?(Deferred) ? k.to_s : [k.to_s, "#{k}="]
end
super + key_methods.compact.flatten
end
def ordered?
self.class.ordered?
end
def respond_to? arg
super(arg) || keys.include?(symbolize(arg.to_s.sub(/=$/,'')))
end
def symbolize key
self.class.symbolize(key)
end
def values
keys.collect { |k| self[k] }
end
protected
def do_deep_merge! source, target
source.each_pair do |k,v|
if target.has_key?(k)
if v.respond_to?(:each_pair) and target[k].respond_to?(:merge)
do_deep_merge! v, target[k]
elsif v != target[k]
target[k] = v
end
else
target[k] = v
end
end
target
end
end
end