3 ms·
And? rb and splay tree, not particularly fast. Normally you would use a btree, just when you need pointer and iterator stability you'd need these slower pointe
by rurban 6y ago
And? rb and splay tree, not particularly fast.
Normally you would use a btree, just when you need pointer and iterator stability you'd need these slower pointer chasing ones. This is not even documented.
- deleted 6y ago[deleted]
- JoachimSchipper 6y agotree.h is production-proven and available under a very liberal license (ISC). tree.h is also fairly extensively documented (e.g. https://man.openbsd.org/tree.3); https://man.openbsd.org/tree.3); the only real footgun the API allows is documented under "NOTES". You are, of course, right that pointer-heavy data structures do not perform optimally on modern hardware. But I've still reached for tree.h quite a few times, because it gives you a very flexible data structure that Just Works with little fuss and minimal dependencies.
- Datagenerator 6y agoThe link needs some TLC
- brohee 6y agohttps://man.openbsd.org/tree.3 https://man.openbsd.org/tree.3