https://github.com/xant/libhl

Simple and fast C library implementing a thread-safe API to manage hash-tables, linked lists, lock-free ring buffers and queues
https://github.com/xant/libhl

Last synced: 16 days ago
JSON representation

Simple and fast C library implementing a thread-safe API to manage hash-tables, linked lists, lock-free ring buffers and queues

• Host: GitHub
• URL: https://github.com/xant/libhl
• Owner: xant
• License: lgpl-3.0
• Created: 2013-10-10T13:54:45.000Z (about 11 years ago)
• Default Branch: master
• Last Pushed: 2022-06-08T18:01:06.000Z (over 2 years ago)
• Last Synced: 2024-07-31T22:55:01.366Z (3 months ago)
• Language: C
• Homepage:
• Size: 1.56 MB
• Stars: 419
• Watchers: 35
• Forks: 114
• Open Issues: 2
• Metadata Files:
  • Readme: README.md
  • Changelog: ChangeLog
  • License: COPYING

Awesome Lists containing this project

README

        
libhl

=====

C library implementing a set of APIs to efficiently manage some basic data structures

such as : hashtables, linked lists, queues, trees, ringbuffers, red-black trees, priority queues, skip lists

The provided APIs are :

- hashtable.[ch]  :  A thread-safe hashtable implementation

- linklist.[ch]   :  Thread-safe double linked lists (with also a tag-based API)

- rbtree.[ch]     :  A generic red/black tree implementation

- fbuf.[ch]       :  Dynamically-growing flat buffers

- queue.[ch]      :  A lock-free thread-safe flat (dynamically growing) queue implementation

- rqueue.[ch]     :  A lock-free thread-safe circular (fixed size) queue implementation (aka: vaule-oriented ringbuffers)

- rbuf.[ch]       :  Byte-oriented ringbuffers

- refcnt.[ch]     :  Reference-count memory manager

- binheap.[ch]    :  A binomial heap implementation (building block for the priority queue implementation)

- pqueue.[ch]     :  A priority queue implementation

- skiplist.[ch]   :  A skip list implementation

- graph.[ch]      :  A generic graph implementation which allow defining chooser functions to determine paths

Provided APIs typically don't depend on each other and can be simply included in an existing project by 

copying both the .c and the .h files plus, if necessary, bsd_queue.h and/or atomic_defs.h into the project sourcetree.

The only exceptions are:

- queue => depending on: refcnt

- pqueue => depending on: binheap

- graph => depending on: hashtable