Category Archives: C++ STL

C++ STL Unordered Map – std::unordered_map

In this tutorial you will learn about stl unordered map container i.e. std::unordered_map and all functions applicable on it. By its name we can say that it comes under Associative containers with Unordered property. We know that any unordered container internally implemented with hash tables. So same has hashing concept in worst case any operation… Read More »

C++ STL Unordered Set – std::unordered_set

In this tutorial you will learn about stl unordered set container in c++ and various functions applicable on it. Unordered Set comes under unordered containers. As we discussed in introduction to stl article, unordered containers internally implemented with hash tables. Each item calculated by hash function, to map to hash table. The main advantage is… Read More »

C++ STL Multimap Container – std::multimap

In this tutorial you will learn about stl multimap i.e., std::multimap and all functions applicable on it with some example code. In previous articles we already learned about std::map container. It is an associative container which give priority to key values. But problem with map is it won’t allow duplicate values. But multimap allows duplicate… Read More »

C++ STL Multiset Container – std::multiset

In this tutorial you will learn about STL Multiset container in C++ i.e. std::multiset and all functions applicable on it. Multiset is an associative container. Same like set this also follows some specific order to store elements. But only difference is these multisets allow duplicate values. And some more similarity to sets to multisets are… Read More »

C++ STL Priority Queue – std::priority_queue

In this tutorial you will learn about STL priority queue in C++ i.e std::priority_queue and all functions applicable on it. std:: priority_queue is a container adaptor. This is almost same as queue container adaptor. i.e this also works as first in first out (FIFO). Elements always inserted at front position and deletion also done from front… Read More »

C++ STL Queue Container Adaptor – std::queue

In this tutorial you will learn about STL queue container in C++ or std::queue and all functions which it provides. std::queue is a container adaptor. Since queue is a container adaptor, this class uses an encapsulated object. It operates in such way that First in First out (FIFO) type of arrangement. Always elements inserted at… Read More »

C++ STL Stack Container Adaptor – std::stack

In this tutorial you will learn about STL stack container adaptor in C++ i.e. std::stack and all functions which it provides. std::stack is a container adaptor. We know that container adaptors are not containers. They provide specific interfaces. Elements manipulated in container adaptors by encapsulated functions of specific classes. Stack operates in Last in First… Read More »

C++ STL Map Container – std::map

In this tutorial you will learn about STL Map container in C++ i.e., std::map and all functions applicable on it. Map is an associative container. Map satisfies the word “associative”. That means every value in map is associated with a key. All keys are unique. No two mapped values can have same key. The type… Read More »