Hi everyone ✋ In the previous post we learned about pass by value and pass by reference. We also briefly touched pointer arithmetic along the way. If you haven’t read the earlier posts in this series, please go through them first, because today we are going to combine almost everything we have learned so far. […]
Pointers and Arrays Read More »
Hi everyone ✋ In the previous post we learned the very basics of pointers ─ the address-of operator, the dereference operator, and the asterisk operator. If you haven’t read that one yet, go through it first because we will be using all of those concepts here. Today we will talk about something that confuses a
Pass by Value and Pass by Reference Read More »
Hi everyone In this tutorial we will talk about Bitset So, What is Bitset actually? Bitset is a container of C++ STL that stores a fixed-size sequence of bits — just 0s and 1s. Think of it as an array of bools, but far more compact and with a whole toolbox of bit-level operations built
Hi everyone In this tutorial we will talk about Forward List So, What is Forward List actually? Forward List is a sequence container of C++ STL that stores its elements in a singly linked list. Each element (node) holds its value and a single pointer to the next node — and that is the whole
Hi everyone In this tutorial we will talk about Flat Multiset So, What is Flat Multiset actually? Flat Multiset is an associative container of C++ STL that stores elements as keys — there are no associated values (that is the job of flat map and flat multimap). It is basically a combination of two containers
Hi everyone In this tutorial we will talk about Flat Set So, What is Flat Set actually? Flat Set is an associative container of C++ STL that stores only unique elements, just like set. Each element inside a flat set is a key — there are no associated values (that is the job of flat
Hi everyone In this tutorial we will talk about Unordered Multiset So, What is Unordered Multiset actually? Unordered Multiset is an associative container of C++ STL that stores elements as keys — there are no associated values (that is the job of map and multimap). It is basically a combination of two containers we already
Unordered Multiset Read More »
Hi everyone In this tutorial we will talk about Multiset So, What is Multiset actually? Multiset is an associative container of C++ STL that stores elements in sorted order, just like set. Each element is a key — there are no associated values (that is the job of map and multimap). The one big difference
Hi everyone In this tutorial we will talk about Unordered Set So, What is Unordered Set actually? Unordered Set is an associative container of C++ STL that stores only unique elements, just like set. Each element is a key, and there are no associated values. The big difference from set is that unordered set does
Hi everyone In this tutorial we will talk about Set So, What is Set actually? Set is an associative container of C++ STL that stores only unique elements. Each element inside a set is a key — there are no associated values (that is the job of map). The elements are always kept sorted in