Optimize HashMap

[jfecher]

Problem

std::collections::hashmap::HashMap loops through the entire map on get/insert which should not be necessary.

Happy Case

There's a few alternate algorithms/structures we could use:

• A bucketed hashmap would only need to loop up to the bucket size
• The lookup function could be partially unconstrained and can take advantage of break as long as the results are properly constrained afterward.

Project Impact

None

Impact Context

No response

Workaround

None

Workaround Description

No response

Additional Context

No response

Would you like to submit a PR for this Issue?

None

Support Needs

No response