# C/C++ Shared Library for Common Collections Algorithm and Structures
This C/C++ shared library provides a collection of commonly used data structures and algorithms, including linked lists,
hash maps, and array lists. It allows you to efficiently manage and manipulate collections of data in your C/C++ projects.
## Features
- [x] Event / Event Bus for creating commands system
- [x] Linked lists implementations (Simple / Double Chained and Circular) for storing and traversing data in a dynamic manner
- [ ] (Not released yet) Hash map implementation for fast key-value lookups and storage
- [x] Binary trees implementations for organizing and efficiently searching data
- [x] Heap & Stack implementations for LIFO / FIFO data organization
- [x] Data Sets (Simple and Randomized) implementations for storing and traversing data in a dynamic manner
- [x] Deques / Queues (Simple, Priority) implementations for storing elements in the order they were added
- [ ] (Not released yet) Graphs implementations for organizing and efficiently searching data
- [ ] (Not released ) Sort & Search Algorithms associated to data structures mentionned bellow
## Usage
To use this library in your C projects, simply include the appropriate header files and link against the shared library
during compilation. Detailed usage instructions and examples can be found in the [documentation](link/to/documentation).
## Installation
To install the library, follow these steps:
1. Clone the repository: `git clone https://github.com/nakira974/collections_commons`
2. Build the library: `make`
3. Install the library: `make install`
## Contributing
Contributions are welcome! If you encounter any issues or have suggestions for improvements, please open an issue or
submit a pull request.
## License
This library is licensed under the [MIT License](https://github.com/git/git-scm.com/blob/main/MIT-LICENSE.txt). Feel
free to use it in your own projects.