4 ms·
Are these the same as Crit-bit trees [0]? [0]: https://cr.yp.to/critbit.html https://cr.yp.to/critbit.html Edit: I think I understand now from the design sect
by commandersaki 3y ago
Are these the same as Crit-bit trees [0]?
[0]: https://cr.yp.to/critbit.html https://cr.yp.to/critbit.html
Edit: I think I understand now from the design section on your page, they are both tries, but the HAMT uses the hash of the key to locate the node whereas Crit-bit uses the key itself.
- silasdavis 3y agoCrit bit tries are also, therefore, sorted. They can be iterated in order. See also https://dotat.at/prog/qp/README.html https://dotat.at/prog/qp/README.html
- commandersaki 3y agoVery cool!