Class: Hash
- Inherits:
-
Object
- Object
- Hash
- Defined in:
- lib/hashlib.rb
Instance Method Summary collapse
- #coalesce(prefix = nil, base = nil, delimiter = '_') ⇒ Object
- #compact ⇒ Object
- #diff(other) ⇒ Object
- #each_recurse(options = {}, &block) ⇒ Object
- #get(path, default = nil) ⇒ Object
- #join(inner_delimiter, outer_delimiter = nil) ⇒ Object
- #rekey(from, to) ⇒ Object
- #rget(path, default = nil) ⇒ Object
- #rset(path, value, options = {}) ⇒ Object
- #set(path, value) ⇒ Object
- #stringify_keys ⇒ Object
- #symbolize_keys ⇒ Object
- #unset(path) ⇒ Object
Instance Method Details
#coalesce(prefix = nil, base = nil, delimiter = '_') ⇒ Object
125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 |
# File 'lib/hashlib.rb', line 125 def coalesce(prefix=nil, base=nil, delimiter='_') base = self unless base rv = {} if base.is_a?(Hash) base.each do |k,v| if v base.coalesce(k,v,delimiter).each do |kk,vv| kk = (prefix.to_s+delimiter+kk.to_s) if prefix rv[kk.to_s] = vv end end end else rv[prefix.to_s] = base end rv end |
#compact ⇒ Object
181 182 183 184 185 186 187 |
# File 'lib/hashlib.rb', line 181 def compact() return each_recurse do |k,v,p,out| if v.nil? or (v.respond_to?(:empty?) and v.empty?) out.delete(p) end end end |
#diff(other) ⇒ Object
2 3 4 5 6 7 8 9 10 11 12 13 |
# File 'lib/hashlib.rb', line 2 def diff(other) self.keys.inject({}) do |memo, key| unless self[key] == other[key] if other[key].is_a?(Hash) memo[key] = self[key].diff(other[key]) else memo[key] = [self[key], other[key]] end end memo end end |
#each_recurse(options = {}, &block) ⇒ Object
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 |
# File 'lib/hashlib.rb', line 145 def each_recurse(={}, &block) self.inject({}) do |h, (k, v)| path = [*[:path]]+[k] h[k] = v if v.is_a?(Hash) if [:intermediate] === true yield(k.to_s, v, path, h[k]) end v.each_recurse(.merge({ :path => path }), &block) elsif v.is_a?(Array) and v.first.is_a?(Hash) v.each_index do |i| if v[i].is_a?(Hash) if [:intermediate] === true yield(k.to_s, v[i], path, h[k][i], i) end v[i].each_recurse(.merge({ :path => path, :index => i }), &block) end end else rv = yield(k.to_s, v, path, h, [:index]) end h end end |
#get(path, default = nil) ⇒ Object
15 16 17 |
# File 'lib/hashlib.rb', line 15 def get(path, default=nil) rget(path, default) end |
#join(inner_delimiter, outer_delimiter = nil) ⇒ Object
120 121 122 123 |
# File 'lib/hashlib.rb', line 120 def join(inner_delimiter, outer_delimiter=nil) outer_delimiter = inner_delimiter unless outer_delimiter self.to_a.collect{|i| i.join(inner_delimiter) }.join(outer_delimiter) end |
#rekey(from, to) ⇒ Object
114 115 116 117 118 |
# File 'lib/hashlib.rb', line 114 def rekey(from, to) value = get(from) unset(from) set(to, value) end |
#rget(path, default = nil) ⇒ Object
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 |
# File 'lib/hashlib.rb', line 23 def rget(path, default=nil) path = path.split('.') if path.is_a?(String) return default if path.nil? or path.empty? # arrayify all paths path = [*path] root = self.stringify_keys() key = path.first.to_s rest = path[1..-1] if root.has_key?(key) if root[key].is_a?(Hash) if rest.empty? return root[key] else return root[key].rget(rest, default) end elsif root[key].is_a?(Array) and root[key].first.is_a?(Hash) if rest.empty? return root[key] else return root[key].collect{|v| v.rget(rest, default) }.flatten end else return root[key] end else return default end end |
#rset(path, value, options = {}) ⇒ Object
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 |
# File 'lib/hashlib.rb', line 58 def rset(path, value, ={}) path = path.split('.') if path.is_a?(String) return nil if path.nil? or path.empty? # arrayify all paths path = [*path] key = path.first.to_s rest = path[1..-1] # stringify the key we're processing if (self.has_key?(key.to_sym) rescue false) self[key] = self.delete(key.to_sym) end if rest.empty? if [:delete_nil] === true and value.nil? self.delete(key) else self[key] = value end else if self[key].is_a?(Array) and self[key].first.is_a?(Hash) # set only on specific array items if [:index] [*[:index]].each do |i| self[key][i].rset(rest, value, .reject{|k| k == :index }) unless self[key][i].nil? end # set path on all array items else self[key] = self[key].collect{|v| v.rset(rest, value, ) }.compact end else if not self[key].is_a?(Hash) self[key] = {} end self[key].rset(rest, value, ) end end self end |
#set(path, value) ⇒ Object
19 20 21 |
# File 'lib/hashlib.rb', line 19 def set(path, value) rset(path, value) end |
#stringify_keys ⇒ Object
189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 |
# File 'lib/hashlib.rb', line 189 def stringify_keys() rv = {} each do |k, v| if v.is_a?(Hash) v = v.stringify_keys() elsif v.is_a?(Array) v = v.collect do |i| if i.is_a?(Hash) i.stringify_keys() else i end end end rv[k.to_s] = v end return rv end |
#symbolize_keys ⇒ Object
210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 |
# File 'lib/hashlib.rb', line 210 def symbolize_keys() rv = {} each do |k, v| if v.is_a?(Hash) v = v.symbolize_keys() elsif v.is_a?(Array) v = v.collect do |i| if i.is_a?(Hash) i.symbolize_keys() else i end end end rv[(k.to_sym rescue k)] = v end return rv end |
#unset(path) ⇒ Object
108 109 110 111 112 |
# File 'lib/hashlib.rb', line 108 def unset(path) rset(path, nil, { :delete_nil => true }) end |