As far as I can tell there is no way to efficiently use a hashmap with a mutable value. Consider a type like ``` type pets = hashmap<str, dvec<str>>; ``` How can new elements be efficiently added to the dvec?