An assortment of polymorphic data structures similar to java utils implemented in C, datastructures include:
- Dynamic-Array
- Linked-List (Queue)
- Stack
- HashMap
- HashSet
- RB-Tree
- Ordered-Heaps (Priority-Queue)
- (and maybe some more if I can be bothered...)
Data structures hold void pointers allowing for polymorphism however use with primitive types requires packing and unpacking to primitive and void pointers (similar to java). Ordered data structures require comparison methods for non-primitive types, for primitive types a collection of comparison methods in prim_comp.c are provided. Similarly Hashed data structures such as HashSet and HashMap require a hashing method for non-primitive types.