A collection of intrusive data-structures for C
Intrusive data structures are much better for cache locality, utilize less allocations and allow for various optimizations like removing an object from a doubly-linked list in constant time.
Using an intrusive data structure is slightly different than a non-intrusive data structure. The node for the structure becomes a member of the thing you want to have a collection of. See example.c for an example
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4