This project aims at making coding in C a little easier, by providing some vital generic data structures, as well as some utility functions.
All data structures provided are dynamic, allocating space in the heap for their content and letting go of that space on node deletion or overall structure destruction. They also require some member methods fit to the specific data type they are requested to host, in order to be able to appropriately initialize, display and destroy an instance created.
This structure is a doubly linked-list allowing insertion on both ends
and deletion from the beginning or by value, therefore operating
both as a queue and as a stack.
Please take a look at the corresponding
documentation for the implementation
and the API to find out more.
This structure is a dynamic one-dimensional array, doubling it's size on insertion
if full, therefore having constant amortized insertion complexity.
Please take a look at the corresponding
documentation for the implementation
and the API to find out more.
A simple 2D dynamic table of unsigned 64-bit integers, adding rows as needed on insertion.
A linked hash-set implemented as a vector of doubly linked-lists, that can store any data-type, primitive or user-defined, based on a key field, using linear hashing in order to preserve load factor under a certain threshold at all times.
Under ./utils/src one can find many utility functions related to
- memory management
- string manipulation
- bit manipulation
- sorting methods
- error handling and
- mathematics
All of the above go with a demo directory or source file displaying their usage & functionality, as well as a makefile making compilation & linking easier. See the corresponding READMEs for more information.
Data structures mentioned above make use of the utilities library. Therefore, they all are connected to this library and can not be used independently.
- name: Kostas Koyias
- web-page: kostaskoyias.github.io
Thank you.