i am searching for an implementation of a hierarchic datastructure that
behaves similar to a file system except that get of an inexistent path
returns nil and set of an unexistent path creates the required nodes
d[:foo, :bar] # => nil
d[:foo, :bar] # => 42
d[:foo, :foo, 0, 1, :bar]=Object.new # creates a hash in an array in an
array in a hash in a hash
i want to check if this kind of data structure (or similar) has been
implemented already as library. if not i am going to do it.
thx for any comments!