C++ Standard Template Library (STL)


Type ImplemenetaionDescriptionExplore!
Associative Containers set
Set is a container which contains sorted set of unique items. set is implemented as a binary search tree.
Explain Me
multiset
Multiset is an ordered collection of items where the items may occur 0 or more times. The multiset elements are always sorted in ascending order.
Explain Me
map
map is an associative container that store the items by combination of key and values. The key value is unique and stored in sorted order.
Explain Me
multimap
Multimap allows duplicate keys. Multimaps are associative container that store the elements with combination of keys and values with sorted order.
Explain Me
hash_set
hashset is implemented as a hash table. Hash set is an extension which support to store and retrieve the data from collection faster.
Explain Me
hash_multiset
hash multiset implemented based on hashing with multiset options. its elements are grouped into buckets based on the value of a hash function in key values.
Explain Me
hash_map
hash_map helps to store and retrieve the key and value pair elements. The elements are grouped into buckets based on the value of a hash function.
Explain Me
hash_multimap
hash_multimap helps to store and retrieve the key and value pair elements. hash_multimap class is a bidirectional iterator.
Explain Me
Container Adaptors queue
Queue is a container which store the data in first in first out order. The items always stored in back and removed from front.
Explain Me
priority queue
Priority queue is a container which store and remove the items basdon the priority. Priority queue does not allow the iteration trough the elements. It look up the largest item in constant time.
Explain Me
stack
Stack is a data structure store and remove the items based on last in and first out. Priority queues are implemented based on container.
Explain Me
Ordered Collections array
Array is a container that hold fixed size of arrays.
Explain Me
vector
Vector is a container that hold dynamic size of arrays.
Explain Me
list
List is a container implemented on doubly linked list. It can be iterated both forwards and backwards.
Explain Me
forward_list
The forward_list is a container that implement on single linked list. The singly linked list can be iterated only forward.
Explain Me
deque
Double-ended queues or dequeue is a container with dynamic sizes. It can be expanded on both ends.
Explain Me
Simple pair
Pair is container for holding two objects as single object. Pair object can be easily pass an argument.
Explain Me
bitset
Bitset is a container for storing the data at the bit level.
Explain Me
valarray
Valarray hold array of elements which used in mathematical operations.
Explain Me
string
String represent sequences of characters which can be manipulate string operations easily. String can be used to represent ascii or wide characters.
Explain Me
Unordered Collections Unordered Set
Unordered sets are container that store the unique items without any order.
Explain Me
unordered_multiset
unordered_multiset are equivalent to Unordered Set with one difference. It allows different elements to have equivalent values.
Explain Me
unordered_map
Unordered maps are associative containers that store elements using key and value pair. the value retrieved based on the key.
Explain Me
unordered_multimap
Unordered multimaps are equivalent to unordered map containers with different elements to have equivalent keys property.
Explain Me