https://github.com/graphitemaster/libintrusive

Intrusive data structures for C
https://github.com/graphitemaster/libintrusive

Last synced: 2 months ago
JSON representation

Intrusive data structures for C

• Host: GitHub
• URL: https://github.com/graphitemaster/libintrusive
• Owner: graphitemaster
• License: unlicense
• Created: 2014-12-12T12:08:39.000Z (about 10 years ago)
• Default Branch: master
• Last Pushed: 2017-06-09T20:42:49.000Z (over 7 years ago)
• Last Synced: 2024-07-31T22:57:19.918Z (5 months ago)
• Language: C
• Homepage:
• Size: 15.6 KB
• Stars: 55
• Watchers: 4
• Forks: 8
• Open Issues: 2
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
### libintrusive

A collection of intrusive data-structures for C

#### Why?

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.

#### Supported

* Doubly-linked list

* AVL tree

* Red-Black tree

* Hash-table

### Using

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