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
|
#
# = Hash Recursive Merge
#
# Merges a Ruby Hash recursively, Also known as deep merge.
# Recursive version of Hash#merge and Hash#merge!.
#
# Category:: Ruby
# Package:: Hash
# Author:: Simone Carletti <weppos@weppos.net>
# Copyright:: 2007-2008 The Authors
# License:: MIT License
# Link:: http://www.simonecarletti.com/
# Source:: http://gist.github.com/gists/6391/
#
module HashRecursiveMerge
#
# Recursive version of Hash#merge!
#
# Adds the contents of +other_hash+ to +hsh+,
# merging entries in +hsh+ with duplicate keys with those from +other_hash+.
#
# Compared with Hash#merge!, this method supports nested hashes.
# When both +hsh+ and +other_hash+ contains an entry with the same key,
# it merges and returns the values from both arrays.
#
# h1 = {"a" => 100, "b" => 200, "c" => {"c1" => 12, "c2" => 14}}
# h2 = {"b" => 254, "c" => {"c1" => 16, "c3" => 94}}
# h1.rmerge!(h2) #=> {"a" => 100, "b" => 254, "c" => {"c1" => 16, "c2" => 14, "c3" => 94}}
#
# Simply using Hash#merge! would return
#
# h1.merge!(h2) #=> {"a" => 100, "b" = >254, "c" => {"c1" => 16, "c3" => 94}}
#
def rmerge!(other_hash)
merge!(other_hash) do |key, oldval, newval|
oldval.class == self.class ? oldval.rmerge!(newval) : newval
end
end
#
# Recursive version of Hash#merge
#
# Compared with Hash#merge!, this method supports nested hashes.
# When both +hsh+ and +other_hash+ contains an entry with the same key,
# it merges and returns the values from both arrays.
#
# Compared with Hash#merge, this method provides a different approch
# for merging nasted hashes.
# If the value of a given key is an Hash and both +other_hash+ abd +hsh
# includes the same key, the value is merged instead replaced with
# +other_hash+ value.
#
# h1 = {"a" => 100, "b" => 200, "c" => {"c1" => 12, "c2" => 14}}
# h2 = {"b" => 254, "c" => {"c1" => 16, "c3" => 94}}
# h1.rmerge(h2) #=> {"a" => 100, "b" => 254, "c" => {"c1" => 16, "c2" => 14, "c3" => 94}}
#
# Simply using Hash#merge would return
#
# h1.merge(h2) #=> {"a" => 100, "b" = >254, "c" => {"c1" => 16, "c3" => 94}}
#
def rmerge(other_hash)
r = {}
merge(other_hash) do |key, oldval, newval|
r[key] = oldval.class == self.class ? oldval.rmerge(newval) : newval
end
end
end
class Hash
include HashRecursiveMerge
end
|