troydhanson/uthash
Uthash
uthash is a macro-based data structure library for C that provides header-only implementations of hash tables, linked lists, stacks, and dynamic arrays. It allows for key-based lookups and organized data storage without requiring external library linking.
The library uses intrusive linking to embed metadata directly into user-defined structures via macros. This approach enables in-place structure extension, allowing hash and link fields to be added to existing structs without separate memory allocations for container nodes.
The project also covers specialized memory and data stream management, including fixed-size circular buffers for continuous data flows and string buffers with automatic memory allocation. These utilities facilitate data handling in resource-constrained environments and embedded systems.
Features
- Hash Table Implementations - Provides a complete macro-based implementation of hash tables for key-based lookups in C.
- Hash Tables - Provides efficient key-value lookups in C using hash-based indexing for memory-resident data.
- Structure Extensions - Enables in-place addition of hash and link fields to user-defined structs via macros.
- C Data Structure Libraries - Implements essential data structures like linked lists and stacks specifically for the C language.
- C Libraries - Provides a portable collection of C libraries for fundamental data structure management.
- Intrusive Containers - Implements intrusive containers that embed linking metadata directly within structures to optimize memory.
- Header-Only Libraries - Provides a header-only distribution model to eliminate separate compilation and linking steps.
- Dynamic Array Management - Provides growable collections of data with indexed access using dynamic array management.
- Automatic Growth Buffers - Ships a utility for manipulating text sequences with automatic memory allocation and buffer growth.
- Dynamic String Buffers - Provides specialized buffers for manipulating text sequences with automatic memory allocation.
- Embedded Data Handling Libraries - Provides lightweight data interchange utilities optimized for resource-constrained embedded environments.
- C Memory Management - Handles low-level allocation and cleanup of dynamic memory buffers within C.
- Circular Memory Buffers - Implements high-performance circular memory buffers for continuous data stream management.
- Stacks - Implements LIFO stack structures for managing sequential data retrieval.
- Linked List Implementations - Implements sequential data structures using memory references for efficient element insertion and removal.
- Ring Buffers - Provides fixed-size circular queues to manage continuous data stream flows.
- Data Structures - Generic hash and list structures.
- Developer Tools and Utilities - Hash table implementation for C structures.
