[42 Project] → ft_Containers
Learn Time 🧑🎓.Containers library.Sequence containers.Associative containers.std::map vs std::setContainer adaptors.Warm-up Time 💡.Start Coding.Vector and Stack.Reference
Learn Time 🧑🎓.
Containers library.
The Containers library is a generic collection of class templates and algorithms that allow programmers to quickly implement common data structures like queues, lists and stacks. There are two (until C++11) and three (since C++11) classes of containers:
- Sequence containers.
- Associative containers and,
- Unordered associative containers (since c++11).
On This Post, we will discuss only containers c++98; for more information regarding Containers STL, please visit this link.
Sequence containers.
Sequence containers implement data structures which can be accessed sequentially.
Sequence_containers
Associative containers.
Associative containers implement sorted data structures that can be quickly searched (O(log n)
complexity).
Associative_containers
std::map vs std::set
![notion image](https://www.notion.so/image/https%3A%2F%2Fs3-us-west-2.amazonaws.com%2Fsecure.notion-static.com%2F4a47a3c4-6ad5-4c77-8652-79a1638122a5%2FUntitled.png?table=block&id=7492828d-f5bd-4e71-a5d9-fff00cd1d167&cache=v2)
Container adaptors.
Container adaptors provide a different interface for sequential containers.
Container_adaptors
Warm-up Time 💡.
Now is the time To learn new stuff to help us with our projects.
warm_up
Name
Tags