Skip to content

Tag Archives: cpp-containers-library

Queue are a type of container adaptors which operate in a first in first out (FIFO) type of arrangement. Elements are inserted at the back… Read More
Lists are containers used in C++ to store data in a non contiguous fashion, Normally, Arrays and Vectors are contiguous in nature, therefore the insertion… Read More
Lists are containers used in C++ to store data in a non contiguous fashion, Normally, Arrays and Vectors are contiguous in nature, therefore the insertion… Read More
Usually, main purpose of using map stl container is for efficient search operations and sorted order retrieval. As map stores key-value pair, all the search… Read More
List has been discussed in many articles, but the sole purpose of this article is to cover all types of insertions that are possible to… Read More
We have discussed about unordered_set in our previous post the problem with unordered_set is that, it is not possible to store duplicate entries in that… Read More
Allows Duplicates: We have discussed unordered_map in our previous post , but there is a limitation, we can not store duplicates in unordered_map, that is if… Read More
A vector, once declared, has all its values initialized to zero. Following is an example code to demonstrate the same. // C++ program for displaying… Read More
unordered_map is an associated container that stores elements formed by the combination of key-value and a mapped value. The key value is used to uniquely… Read More
An unordered_set is implemented using a hash table where keys are hashed into indices of a hash table so that the insertion is always randomized.… Read More
Click here for Set 1 and Set 2 of Vectors.    Vector – upper_bound and lower_bound Iterator lower_bound (Iterator first, Iterator last, const val) Iterator upper_bound… Read More
The pair container is a simple container defined in <utility> header consisting of two data elements or objects.  The first element is referenced as ‘first’… Read More
Click here for Set 1 of Vectors.   Modifiers 1.1 assign(input_iterator first, input_iterator last) – Assigns new content to vector and resize 1.2 assign(size_type n,… Read More
Double ended queues are sequence containers with the feature of expansion and contraction on both the ends. They are similar to vectors, but are more… Read More
Queues are a type of container adaptors which operate in a first in first out (FIFO) type of arrangement. Elements are inserted at the back… Read More