This project is a re-implementation of some C++ containers, namely, std::vector
, std::map
and std::stack
.
The implementation follows the C++98 standard.
The implementation works exactly as the original Containers.
is a data structure similar to the traditional array, except in that it has a dynamic size unlike arrays. In fact, the vector is implemented using an array, the array starts with an initial size, and whenever the array is full, the size is reallocated (new size = old size + old size / 2)
in a new array and items are copied to the new reallocated memory.
https://continuous-neptune-703.notion.site/ft-Containers-T-1497b15ece22485ba89bb57e49a78a33