The ninth C++ module of the 42 curriculum, focused on templated containers, iterators, and algorithms.
This project explores the C++ Standard Template Library (STL) through practical use of containers, iterators, and algorithm design with templates.
Each exercise (ex00 to ex02) contains its own Makefile. Compile and run individually:
cd ex00
make
./ex00- ex00:
easyfind— a function template that searches for a value in any STL container, returning an iterator or throwing if not found. - ex01:
Span— a class that stores up to N integers and computes the shortest and longest span between stored values. - ex02:
MutantStack— astd::stackextension that exposes iterators, making it iterable like any standard container.
Each exercise is self-contained in its own directory with its own source files, headers, and Makefile, following the standard 42 module layout.