Unordered maps are associative containers that store elements formed by the combination of a key value and a mapped value, and which allows for fast retrieval of individual elements based on their keys. The elements in the unordered_map are not sorted in any particular order with respect to either their [...]
Maps are used to replicate associative arrays. Maps contain sorted key-value pair, in which each key is unique and cannot be changed, and it can be inserted or deleted but cannot be altered. Value associated with keys can be altered. We can search, remove and insert in a map within [...]
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 efficient in case of insertion and deletion of elements. Unlike vectors, contiguous storage allocation may not be guaranteed. Both vectors and deques provide a very similar interface [...]
The array is a container for constant size arrays. This container wraps around fixed size arrays and also doesn’t loose the information of its length when decayed to a pointer. Syntax array<object_type, array_size> array_name; The above code creates an empty array of object_type with maximum size of array_size. Member Functions [...]
tuple and pair are very similar in their structure. Just like in pair we can pair two heterogeneous object, in tuple we can pair three heterogeneous objects. The elements of tuples are initialized as arguments in order in which they will be accessed. Operations on tuple get() :- Used to [...]
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’ and the second element as ‘second’ and the order is fixed (first, second). Pair is used to combine together two values which may be different in type. [...]
Array and Vector are contiguous containers, i.e they store their data on continuous memory, thus the insert operation at the middle of vector/array is very costly (in terms of number of operation and process time) because we have to shift all the elements, linked list overcome this problem. Linked list [...]
The variable template is one of the major proposals in Standard C++14. The main purpose of the variable template is to simplify definitions and uses of parameterized constants. With variable templates of C++14, manipulation of constant values with various types can be significantly simplified as shown in below example. PI [...]
Introduction Move semantics in C++ is used to move resources around in an optimal way by avoiding unnecessary copies of temporary objects. C++11 defines two new functions for move semantics : move constructor, and move assignment operator. Copy constructor (and assignment) make a copy of one object to another, while [...]
Introduction An exception is a problem that arises during the execution of a program. A C++ exception is a response to an exceptional circumstance that arises while a program is running, such as an attempt to divide by zero. Exceptions provide a way to transfer control from one part of [...]