This library is being created by me to attempt a library, similar to C++'s "Standard Template Library", however, making it generic by using void pointers and enumeration as a way to store any data type. I have utilised either structs or classes to create "blueprints" of the structure, being able to create instances wherever necessary. Additionally, the use of enumeration for data types allows for the deferencing of void pointers to access the value. The downside of this implementation is the amount of memory being used, as the structures are dynamically allocated, and will carry more data due to the use of void pointers, enums indicating the type of structure and data type. Compared to a regular, specific data type based data structure will carry less data.
These are the data structures I am attempting to implement within the library:
- Stacks
- Queues/Circular Queues
- Dynamic Arrays
- Linked List (Singly/Doubly)
- Graphs
- Binary Trees
As of the 27th July 2025, these are the structures I am currently trying to implement:
- Stacks
- Singly Linked Lists
- Dynamic Array (current focus)
- Hash Map
As of the 7th August 2025, only the dynamic array has been completed. However, it has yet to be tested.