standard template library - OpenGenus IQ: Learn Algorithms, DL, System Design

begin() and end() in Array C++ STL

In this article, we have explored begin() and end() functions in Array container of C++ STL in depth. We have covered the basic idea of iterators as well as both functions deal with iterators.

Software Engineering

Vector::front() in C++ STL

We have covered front() function of vector container in C++ STL in depth along with differences between front(), begin(), back() and end() Functions.

Software Engineering

Vector::size() in C++ STL

Vector::size() in C++ STL is used to get the size of a vector container that is the number of elements it has. We have compared it with empty() and capacity() functions as well which are related.

Software Engineering

set::rbegin() and set::rend() in C++ STL

In this article, we will explore the rbegin and rend function of set container in C++ STL and use examples to demonstrate different use cases like reverse traversal

Software Engineering

set::begin and set::end in C++ STL

In this article, we will explore the begin and end function of set container in C++ STL and use examples to demonstrate different use cases.

Software Engineering

Initialize Stack in C++ STL

std::stack is a type of container adapter, specifically designed to operate in a LIFO fashion elements can be inserted or removed from only one end

Software Engineering

Sorting in C++ using std::sort()

With Standard template library available in C++, many functions are easier to implement. One of them present is sort function as well which we are going to discuss.

Software Engineering

Creating a Set in C++ STL

In this article, we took a look at creating a set in C++ Standard template library in different ways.

Software Engineering

Add elements to your vector using Vector::push_back() in C++

In this article we will take a look into one of the most conventional ways of taking input in the vector as vector::push_back() and will try to find the complexity and other aspects in which it differs from the usual array implementation in taking the input.

Software Engineering

Different ways to Initialize Map in C++ STL

In this article, our focus will be to provide information about various methods of map initialization like using copy constructor

Software Engineering

Different ways to initialize a vector in C++ STL

In this article, we take a look at different ways to initialize a vector in C++ Standard Template library including ways to use predefined array and vector to define a new vector.

Software Engineering

Learn to use Pair in C++ STL

pair in the C++ STL is a container defined under the library used to store a pair of two data elements or objects.

Software Engineering

Use Deque in C++ STL

deque in the STL of C++ is a dynamically resizing container to implement a double-ended queue data structure.

Algorithms

Generating all permutations of an array in C++ using STL

We can generate all permutations of an array by making use of the C++ STL function next_permutation.

C++

Stack in C++ STL

Stack in the STL of C++ is a dynamically resizing container. Stack class is an container adapter. Containers or container classes store objects and data. There are in total seven standard "first-class" container classes and three container adaptor classes and only seven header files

C++

Containers in C++ STL

In C++ STL, Containers or container classes store objects and data. There are in total seven standard “first-class” container classes and three container adaptor classes and only seven header files that provide access to these containers or container adaptors.

C++

Multimap in C++ STL

Multi-map in C++ is an associative container like map. It internally store elements in key value pair. But unlike map which store only unique keys, multimap can have duplicate keys.

C++

Set in C++ STL

In C++ STL, a set is an Associative container which contains a sorted set of unique objects of type Key. The commonly used functions are begin(), cbegin(), end(), size(), max_size(), empty(), insert(), erase(), emplace() and emplace_hint()

C++

Unordered map in C++ STL

In C++ STL, Unordered map is a dictionary like data structure. The most commonly used methods of unordered_map are at(), begin(), end(), bucket(), bucket_count() / bucket_size(), count(), equal_range(), hash_function(), insert(), reserve() and load_factor()

C++

Iterators in C++ STL

Iterators in C++ Standard Template Library are used to point at the memory addresses of STL containers. They are primarily used in sequence of numbers, characters etc. They reduce the complexity and execution time of program.

C++

Map in C++ STL

Map in C++ STL is a dictionary like data structure. It is a sequence of (key, value) pair, where only single value is associated with each unique key. It is often referred as associative array.

C++

Priority Queue in C++ STL

Priority queue in the STL of C++ is a dynamically resizing container to implement the special case of priority queye under the queue data structure. It is a sequential linear container. The top element of the priority queue is the greatest with all elements arranged in non-increasing order.

C++

Queue in C++ STL

Queue in the STL of C++ is a dynamically resizing container to implement the queue data structure. It is a sequential linear container which follows the First In First Out(FIFO) arrangement. We explore the various functions like empty, size, swap, emplace, front, back, push and pop operations

C++

Most commonly used utilities in Standard Template Library in C++

This is an overview of the most commonly used utilities in Standard Template Library in C++. We have covered Iterator, Vector, Stack, Queue, Priority Queue, Map, Set and Pair utilities.

C++

Standard Template Library in C++

Standard Template Library in C++ is a pre-defined generic implementation of most widely used data structures and algorithms. By generic implementation it means that there is a single implementation of various Classes and Functions which works with multiple datatypes by the use of templates.