Skip to content

Tag Archives: cpp-containers-library

In STL, containers can change size dynamically. Allocator is an object that is responsible for dynamic memory allocation/deallocation. get_allocator() is used to allocate memory chunks… Read More
Forward list in STL implements singly linked list. Introduced from C++11, the forward list is useful than other containers for insertion, removal and moving operations… Read More
Non-modifying sequence operations  std :: all_of  : Test condition on all elements in range std :: any_of  : Test if any element in range fulfills… Read More
Forward list in STL implements singly linked list. Introduced from C++11, forward list are useful than other containers in insertion, removal and moving operations (like… Read More
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
Forward list in STL implements singly linked list. Introduced from C++11, forward list are useful than other containers in insertion, removal and moving operations (like… Read More
Forward list in STL implements singly linked list. Introduced from C++11, forward list are useful than other containers in insertion, removal and moving operations (like… Read More
Forward list in STL implements singly linked list. Introduced from C++11, forward list are useful than other containers in insertion, removal and moving operations (like… Read More
Stacks are a type of container adaptors with LIFO(Last In First Out) type of working, where a new element is added at one end and… Read More
Stacks are a type of container adaptors with LIFO(Last In First Out) type of work, where a new element is added at one end called… Read More
Stacks are a type of container adaptors with LIFO(Last In First Out) type of working, where a new element is added at one end and… Read More
Deque or Double ended queues are sequence containers with the feature of expansion and contraction on both the ends. They are similar to vectors, but… Read More
Deque or Double ended queues are sequence containers with the feature of expansion and contraction on both the ends. They are similar to vectors, but… Read More
Deque or Double ended queues are sequence containers with the feature of expansion and contraction on both the ends. They are similar to vectors, but… Read More
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