Skip to content

hashmap and mutable values and efficiency #2567

Description

@jesse99

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?

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions