Tag: c++

C++ iostream Library

C++ iostream objects

The <iostream> library provides objects which can read user input and output data to the console or to a file.

A list of all iostream objects can be found in the table below. Continue reading C++ iostream Library

C++ Keywords

C++ Keywords

A list of useful keywords in C++ can be found in the table below. Continue reading C++ Keywords

C++ Iterator

C++ Iterators

Iterators are used to access and iterate through elements of data structures (vectors, sets, etc.), by “pointing” to them.

It is called an “iterator” because “iterating” is the technical term for looping.

To iterate through a vector, look at the following example:

Example

// Create a vector called cars that will store strings
vector<string> cars = {"Volvo", "BMW", "Ford", "Mazda"};

// Create a vector iterator called it
vector<string>::iterator it;

// Loop through the vector with the iterator
for (it = cars.begin(); it != cars.end(); ++it) {
  cout << *it << "\n";
}

Continue reading C++ Iterator

C++ Maps

C++ Map

A map stores elements in “key/value” pairs.

Elements in a map are:

  • Accessible by keys (not index), and each key is unique.
  • Automatically sorted in ascending order by their keys.

To use a map, you have to include the <map> header file:

// Include the map library
#include <map>

Continue reading C++ Maps

C++ Sets

C++ Set

A set stores unique elements where they:

  • Are sorted automatically in ascending order.
  • Are unique, meaning equal or duplicate values are ignored.
  • Can be added or removed, but the value of an existing element cannot be changed.
  • Cannot be accessed by index numbers, because the order is based on sorting and not indexing.

To use a set, you have to include the <set> header file:

// Include the set library
#include <set>

Continue reading C++ Sets

C++ Deque

C++ Deque

In the previous page, your learned that elements in a queue are added at the end and removed from the front.

A deque (stands for double-ended queue) however, is more flexible, as elements can be added and removed from both ends (at the front and the back). You can also access elements by index numbers.

To use a deque, you have to include the <deque> header file:

// Include the deque library
#include <deque>

Continue reading C++ Deque

C++ Queues

C++ Queue

A queue stores multiple elements in a specific order, called FIFO.

FIFO stands for First in, First Out. To visualize FIFO, think of a queue as people standing in line in a supermarket. The first person to stand in line is also the first who can pay and leave the supermarket. This way of organizing elements is called FIFO in computer science and programming.

Unlike vectors, elements in the queue are not accessed by index numbers. Since queue elements are added at the end and removed from the front, you can only access an element at the front or the back.

To use a queue, you have to include the <queue> header file:

// Include the queue library
#include <queue>

Continue reading C++ Queues

C++ Stacks

C++ Stack

A stack stores multiple elements in a specific order, called LIFO.

LIFO stands for Last in, First Out. To vizualise LIFO, think of a pile of pancakes, where pancakes are both added and removed from the top. So when removing a pancake, it will always be the last one you added. This way of organizing elements is called LIFO in computer science and programming.

Unlike vectors, elements in the stack are not accessed by index numbers. Since elements are added and removed from the top, you can only access the element at the top of the stack. Continue reading C++ Stacks

C++ List

C++ List

A list is similar to a vector in that it can store multiple elements of the same type and dynamically grow in size.

However, two major differences between lists and vectors are:

    1. You can add and remove elements from both the beginning and at the end of a list, while vectors are generally optimized for adding and removing at the end.

 

  1. Unlike vectors, a list does not support random access, meaning you cannot directly jump to a specific index, or access elements by index numbers.

Continue reading C++ List