We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
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?