3 ms·
So, like http://troydhanson.github.io/uthash/ http://troydhanson.github.io/uthash/ but without the documentation? (NetBSD has had an all-macro red/black tree i
by 95014_refugee 7y ago
So, like http://troydhanson.github.io/uthash/ http://troydhanson.github.io/uthash/ but without the documentation?
(NetBSD has had an all-macro red/black tree implementation forever, plus the ancient and well-understood BSD queue.h)
- codr7 7y agoFrom a quick glance; it's hashed (as in not ordered), not pool allocated and intrusive as opposed to offering value semantics. Couldn't get more different. There's nothing new under the sun, I never claimed novelty. This is simply how I would do it, take or leave.