Simple Hash Table implementation in C
- Dynamic sizing based on load factor, with adjustable max & min thresholds (default: 0.2/0.7).
- Thread-Safe.
- Automatic memory management (if
ght_t::freeis provided). - Generic Types.
- Division.
- Changing with Linked-Lists.
For insert / search / delete
- Average-case: O(1)
- Worst-case: O(n)
Setup
meson setup build/
Compile
ninja -C build/
Run
./build/example/example
Binary Search Tree / Red-Black Tree