How perry280/generic_data_structures works
This is a small C library of generic container data structures, not an end-user application. A caller creates and operates on a vector, singly linked list, or hash map; each stores fixed-size values and can use shared comparison, cleanup, and hashing callbacks. The excerpts show the implementations and the hash map’s default hash call. No README or usage example was supplied, so caller links represent the declared APIs rather than a documented application workflow.
Main entry points: generic_hashmap.c Hash map · generic_types.h Callback contract · generic_vector.c Dynamic vector · generic_singly_linked_list.c Singly linked list
Components 6
Generic containers
- Dynamic vector
generic_vector/generic_vector.c - Singly linked list
generic_singly_linked_list/generic_singly_linked_list.c - Hash map
generic_hashmap/generic_hashmap.c
Shared utilities
- Callback contract
generic_types.h - FNV-1a hashing
generic_hashmap/hash.c
Other components
- Library caller
Connections 7
- Library caller → Dynamic vector: uses API
- Library caller → Singly linked list: uses API
- Library caller → Hash map: uses API
- Dynamic vector → Callback contract: uses callbacks
- Singly linked list → Callback contract: uses callbacks
- Hash map → Callback contract: uses callbacks
- Hash map → FNV-1a hashing: hashes keys
generic_hashmap/generic_hashmap.c