Skip to content

name_t assumes no hash collitions #138

Description

@sean-parent

The name_t pool is indexed by hash. It is done to avoid the cost of rehashing when the map grows (?) and the cost of hashing when looking up static values (pre-hashed).

Given that we will only rehash with a closed_hash map log(n) times, a better option is to allow a precalculated hash to be used for find and insert, and not worry about the cost of a rehash.

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