[ruby-core:77296] [Ruby trunk Feature#12770] Hash#left_merge

Issue #12770 has been updated by Marc-Andre Lafortune.

Assignee set to Yukihiro Matsumoto

My feeling is that this won't be accepted (for lack of need and lack of a good name), but if you want to have a chance, you need provide a real use case.

Also your definition doesn't work for `false` values. You example also doesn't show which of the receiver or the argument takes precedence (I realize your definition does)

----------------------------------------
Feature #12770: Hash#left_merge
https://bugs.ruby-lang.org/issues/12770#change-60534

* Author: Derek Kniffin
* Status: Open
* Priority: Normal
* Assignee: Yukihiro Matsumoto
----------------------------------------
I would like a Hash method that does the following:

````ruby
a = {a: 1, b: nil, c: nil, d: nil}
b = {a: 1, b: 2, c: nil}
a.left_merge(b) # => {a: 1, b: 2, c: nil, d: nil}
```` 

So, it takes the first hash, and for any values that are nil, if there's a value for that key in the second hash, fill in the value from the second hash.

I've searched around a bit, and I haven't found this anywhere, so I'd like to propose a new one: `Hash#left_merge`. I've also got a first draft of the method definition:

````ruby
class Hash
  def left_merge(new_hash)
    merge(new_hash) { |_, old_v, new_v| old_v || new_v }
  end
end
````



-- 
https://bugs.ruby-lang.org/

Unsubscribe: <mailto:[e-mail]?subject=unsubscribe>
<http://lists.ruby-lang.org/cgi-bin/mailman/options/ruby-core>