https://github.com/jakethesillysnake/containersplus
Custom implementation of containers in C++ STL.
https://github.com/jakethesillysnake/containersplus
Last synced: 2 months ago
JSON representation
Custom implementation of containers in C++ STL.
- Host: GitHub
- URL: https://github.com/jakethesillysnake/containersplus
- Owner: JakeTheSillySnake
- License: other
- Created: 2024-08-23T18:55:16.000Z (9 months ago)
- Default Branch: main
- Last Pushed: 2024-11-20T21:44:09.000Z (6 months ago)
- Last Synced: 2025-02-05T09:33:43.490Z (4 months ago)
- Language: C++
- Homepage:
- Size: 45.9 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# s21_containers
Implementation of the s21_containers.h library.
NOTE: I have programmed list, stack, map (tests included), Makefile and edited/contributed to binary_tree, set, multiset. Other parts of the project were created by different people. Below is the original version of the task.
- The program must be developed in C++ language of C++17 standard using gcc compiler;
- The program code must be located in the src folder;
- When writing code it is necessary to follow the Google style;
- Make sure to use iterators;
- Classes must be template;
- Classes must be implemented within the `s21` namespace;
- Prepare full coverage of container classes methods with unit-tests using the GTest library;
- Copying of the Standard Template Library (STL) implementation is not allowed;
- The logic of the Standard Template Library (STL) must be followed (in terms of checks, memory handling and behaviour in abnormal situations).
### Part 1. Implementation of the s21_containers.h library
You need to implement the `s21_containers.h` library classes (specifications are given in the relevant material sections, see **"Main containers"**). \
List of classes: `list`, `map`, `queue`, `set`, `stack`, `vector`.
- Make it as a header file `s21_containers.h` which includes different header files with implementations of the specified containers (`s21_list.h`, `s21_map.h` and etc.);
- Provide a Makefile for testing the library (with targets clean, test);
- The classical implementation of containers should be considered as a basis, but the final choice of implementations remains free. Except for the list - it should be implemented via the list structure rather than the array.
### Part 2. Bonus. Implementation of the s21_containersplus.h library.
You need to implement the `s21_containersplus.h` library functions (see **"Additional containers"** for specifications). \
List of classes to be implemented additionally: `array`, `multiset`.
- Make it as a header file `s21_containersplus.h` which includes different header files with implementations of the specified containers (`s21_array.h`, `s21_multiset.h`);
- Provide a Makefile for testing the library (with targets clean, test);
- The classical implementation of containers should be considered as a basis, but the final choice of the algorithm remains free.
### Part 3. Bonus. Implementation of the `insert_many` method.
You need to complete the classes with the appropriate methods, according to the table:
| Modifiers | Definition | Containers |
|----------------|-------------------------------------------------| -------------------------------------------|
| `iterator insert_many(const_iterator pos, Args&&... args)` | Inserts new elements into the container directly before `pos`. | List, Vector. |
| `void insert_many_back(Args&&... args)` | Appends new elements to the end of the container. | List, Vector, Queue. |
| `void insert_many_front(Args&&... args)` | Appends new elements to the top of the container. | List, Stack. |
| `vector> insert_many(Args&&... args)` | Inserts new elements into the container. | Map, Set, Multiset. |
Note: the arguments are the already created elements of the appropriate container that should be inserted into this container.