You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
When the node in a HAMT is full, you can avoid all the popcounting overhead, which usually makes it worth special casing. Was sad when after 5 minutes of adding random nodes to finally get the root to be made of all 1s that it didn't switch from Many to another case, like we have in unordered-containers. ;)
The text was updated successfully, but these errors were encountered:
This is intentional! I wanted the implementation to be as simple as possible and I copied it straight from https://vaibhavsagar.com/blog/2018/07/29/hamts-from-scratch/. A production-ready implementation would support full nodes and collisions (as indicated in that blog post).
When the node in a HAMT is full, you can avoid all the popcounting overhead, which usually makes it worth special casing. Was sad when after 5 minutes of adding random nodes to finally get the root to be made of all 1s that it didn't switch from
Many
to another case, like we have inunordered-containers
. ;)The text was updated successfully, but these errors were encountered: