Hashli the tree based hash table

hashli.rb

class Hashli
  attr_accessor :store, :depth

  def initialize()
    self.depth = 3
    init_store
  end

  def hash k
    k.hash.to_s.chars.take(@depth).map(&:to_i)
  end

  def get k
    store.dig(*hash(k))
  end

  def set(k,v)
    *is, last = hash(k)
    # ensure the branches are in place, then place the leaf
    is.reduce(store) do |agg,i| 
      agg[i] ||= Array.new(10)
    end[last] = v
    self
  end

  def delete(k)
    set(k, nil)
  end

  private

  def init_store
    # collapse arrays into a nested Tree-like structure
    self.store = Array.new(depth){ Array.new(10) }.reduce do |agg, a|
      a.append(agg)
    end
  end


end