Standard Template Library

Every trade has its tricks. If you have ever worked with carpenters you’ve probably heard the saying, “Measure twice, cut once.” This is, of course, an easy to remember rule that is meant to protect you from your own mistakes. If you measure your cut twice then your chances of making a mistake are much [...]

STL Set A set is a simple unique sorted associative container. It is a simple associative container as the key and the value are the same entities. It is a unique associative container as the values contained in a set are unique. During insertion, if a matching entry is found in the set, the insertion [...]

STL Map A map is a sorted unique associative container that maintains a collection of key value pairs. These collections are sorted by the key. These collections are unique as only one value is allowed in the collection for the key.   Fundamentally, the most frequently used member of the STL’s map API is the [...]

STL List A list is a sequential container optimised for insertions and deletions of data elements at arbitrary locations within the collection. However, a list does not provide index-based access to the elements in the collection. STL list is implemented as a doubly linked list. A doubly linked list is a data structure in which [...]

Vector   Vectors are sequential containers that are considered growable arrays, i.e., arrays that are flexible and grow as more data is inserted in them. Vectors usually store elements in a contiguous linear memory space so that index-based access is performed efficiently.       When a vector’s originally allocated memory space is exceeded, a larger [...]

Standard Template Library STL: An Overview Any programmer developing a moderately complicated system soon realizes that efficient coding requires the use of fundamental data structures like lists, queues and stacks as well as algorithms to process the data stored in these data structures. Most Java programmers would be familiar with various implementations of these data [...]

Standard Template Library Introduction The Standard Template Library (STL) is a collection of generic fundamental computing data structures (or containers of data), mechanisms to access and manipulate data contained in these containers and algorithms that can be applied to these data structures. These data structures and algorithms are implemented in C++ and provide reusable components [...]

Stack<> Container class In this article we will discuss about a Simple Container Class Stack. This represents a Stack of your data type. <> Stack is modeled using a deque (Or a double ended queue). All the operators < , > , <=, >=, != , = = are overloaded for the stack container class. That [...]

STL Container Class Introduction Before we start dig deep into STL, it is mandatory that we learn about Container classes. A Container class is defined as a class that gives you the power to store any type of data. There are two type of container classes available in STL in C++, namely “Simple Container Classes” [...]

   C++ vector is a container template available with Standard Template Library pack. This C++ vector can be used to store similar typed objects sequentially, which can be accessed at a later point of time. As this is a template, all types of data including user defined data types like struct and class can be [...]