This question already has an answer here:
Given a hash such as:
AppConfig = {
'service' => {
'key' => 'abcdefg',
'secret' => 'secret_abcdefg'
},
'other' => {
'service' => {
'key' => 'cred_abcdefg',
'secret' => 'cred_secret_abcdefg'
}
}
}
I need a function to return service/key in some cases and other/service/key in other cases. A straightforward way is to pass in the hash and an array of keys, like so:
def val_for(hash, array_of_key_names)
h = hash
array_of_key_names.each { |k| h = h[k] }
h
end
So that this call results in 'cred_secret_abcdefg':
val_for(AppConfig, %w[other service secret])
It seems like there should be a better way than what I've written in val_for().
This will raise an exception if some intermediate key is not found. Note also that this is completely equivalent to
keys.reduce(hash, :[])
, but this may very well confuse some readers, I'd use the block.Ruby 2.3.0 introduced a new method called
dig
on bothHash
andArray
that solves this problem entirely.It returns
nil
if the key is missing at any level.