Ruby deep nested hash from array

Question

I need to convert this array:

[:a, :b, :c, :d, :e]

Into this hash:

{:a=>{:b=>{:c=>{:d=>:e}}}}

Unfortunately, I'm missing the Recursion Lobe of the brain. I found BottomlessHash

# http://firedev.com/posts/2015/bottomless-ruby-hash/
class BottomlessHash < Hash
  def initialize
    super &-> h, k { h[k] = self.class.new }
  end
end

While I'm struggling to understand the "pretzel stab", it does the trick if you write it out explicitly,

bhash = BottomlessHash.new
bhash[:a][:b][:c][:d] = :e 
bhash # => {:a=>{:b=>{:c=>{:d=>:e}}}}

However I can't figure out a way to pass arbitrary values programmatically.

store doesn't work, nor does send("[:a][:b][:c][:d]=", :e)

What should be the result if the array has 0 or 1 elements?

ndnenkov
– ndnenkov

2019-03-06 16:36:13 +00:00
Commented Mar 6, 2019 at 16:36 — ndnenkov
– ndnenkov, Commented Mar 6, 2019 at 16:36

tadman · Accepted Answer · 2019-03-06 16:45:45Z

What send does is call a method, just one, with zero or more arguments. It can't call multiple methods at once. Your example here:

send("[:a][:b][:c][:d]=", :e)

This is trying to call a method named, literally, [:a][:b][:b][:d]= which doesn't exist, so the send fails.

Now this bit of actual Ruby code:

x[:a][:b][:c][:d] = :e

Becomes interpreted by Ruby as:

x.send(:[], :a).send(:[], :b).send(:[], :c).send(:[]=, :d, :e)

Which is just a really long, ugly way of doing what the original code did. The key here is that each [...] part represents a method call that returns something and then the next part is evaluated against that, or chained on.

Now for the original part, this pretzel-stab:

super &-> h, k { h[k] = self.class.new }

The & means "pass through this Proc as a block argument", as in for a method with the signature:

initialize(&block)

Where &block represents a block, if given, to that method, as in:

Hash.new { |h,k| h[k] = { } }

In a more basic implementation.

The -> h, k { ... } part is traditionally written as:

lambda { |h, k| ... }

Where that's probably more recognizable.

sawa · Accepted Answer · 2019-03-07 07:57:16Z

2

[:a, :b, :c, :d, :e].reverse_each.inject{|h, k| {k => h}}
# => {:a=>{:b=>{:c=>{:d=>:e}}}}

answered Mar 7, 2019 at 7:57

sawa

169k51 gold badges287 silver badges398 bronze badges

Comments

Sebastián Palma · Accepted Answer · 2019-03-06 16:38:04Z

1

array = [*:a..:e]
array[0..-2].reverse.reduce(array[-1]) { |b, a| { a => b } }
#  {:a=>{:b=>{:c=>{:d=>:e}}}}

answered Mar 6, 2019 at 16:38

Sebastián Palma

33.6k6 gold badges45 silver badges65 bronze badges

Comments

ndnenkov · Accepted Answer · 2019-03-06 20:02:52Z

1

items = [:a, :b, :c, :d, :e]

# Iterative version
def hashify(items)
  items = items.dup

  result = items.pop
  result = {items.pop => result} until items.empty?
  result
end

hashify(items) # => {:a=>{:b=>{:c=>{:d=>:e}}}}

# Recursive version
def hashify(items)
  return items.last if items.size < 2

  *head, penultimate, last = items
  hashify(head + [{penultimate => last}])
end

hashify(items) # => {:a=>{:b=>{:c=>{:d=>:e}}}}

edited Mar 6, 2019 at 20:02

answered Mar 6, 2019 at 16:35

ndnenkov

36.2k9 gold badges80 silver badges109 bronze badges

Collectives™ on Stack Overflow

Ruby deep nested hash from array

4 Answers 4

Comments

Comments

Comments

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

4 Answers 4

Comments

Comments

Comments

Comments

Your Answer

Sign up or log in

Post as a guest

Related