Hi everyone In this tutorial we will talk about Forward List So, What is Forward List actually? Forward List is a sequence container of C++ STL that stores its elements in a singly linked list. Each element (node) holds its value and a single pointer to the next node — and that is the whole […]

Hi everyone In this tutorial we will talk about Flat Multiset So, What is Flat Multiset actually? Flat Multiset is an associative container of C++ STL that stores elements as keys — there are no associated values (that is the job of flat map and flat multimap). It is basically a combination of two containers

Hi everyone In this tutorial we will talk about Flat Set So, What is Flat Set actually? Flat Set is an associative container of C++ STL that stores only unique elements, just like set. Each element inside a flat set is a key — there are no associated values (that is the job of flat

Hi everyone In this tutorial we will talk about Unordered Multiset So, What is Unordered Multiset actually? Unordered Multiset is an associative container of C++ STL that stores elements as keys — there are no associated values (that is the job of map and multimap). It is basically a combination of two containers we already

Hi everyone In this tutorial we will talk about Multiset So, What is Multiset actually? Multiset is an associative container of C++ STL that stores elements in sorted order, just like set. Each element is a key — there are no associated values (that is the job of map and multimap). The one big difference

Hi everyone In this tutorial we will talk about Unordered Set So, What is Unordered Set actually? Unordered Set is an associative container of C++ STL that stores only unique elements, just like set. Each element is a key, and there are no associated values. The big difference from set is that unordered set does

Hi everyone In this tutorial we will talk about Set So, What is Set actually? Set is an associative container of C++ STL that stores only unique elements. Each element inside a set is a key — there are no associated values (that is the job of map). The elements are always kept sorted in

Hi everyone In this tutorial we will talk about Array So, What is Array actually? Array is a sequential container of C++ STL that wraps a fixed-size contiguous array. The size of an array is decided at compile time and cannot be changed once the array is declared. We all know the classic C-style array

Hi everyone In this tutorial we will talk about Flat Multimap So, What is Flat Multimap actually? Flat Multimap is an associative container of C++ STL that stores data in key–value pairs. It is basically a combination of two containers we already know — From flat_map, it takes the cache-friendly layout — two parallel sorted

Hi everyone In this tutorial we will talk about Flat Map So, What is Flat Map actually? Flat Map is an associative container of C++ STL that stores data in key–value pairs, just like map. Each key inside a flat map is unique, and the elements are kept sorted by key automatically. From the outside,