The source code written in C++ must be compiled (i.e. translated to the machine code) by one or another compiler such as Embarcadero RAD Studio C++ compilers before in can be runned. In general, there are two types of the resulting machine code: library and main executable (hereinafter simply executable). This post will briefly cover the later of these two.
When an executable produced from a…
The posts General Loop Statements in Modern C++ and Range-for-statement in modern C++ cover ways to write explicit loops. But explicit loops can be tedious to write and, what is more important, – harder to read, because the resulting code requires to spend the extra time…
Each loop statement in C++ has its loop body which is executed repeatedly until the loop condition expression that yields a loop condition becomes false (otherwise, the loop will run “forever”). The statement continue can be used to interrupt the current iteration and…
The C++ language provides the switch statement which can be used to replace the set of if statements (see If Statements in Modern C++). First of all, let’s define the enum type Traffic_light_color as follows:
enum class Traffic_light_color { red, yellow, green };
Then, the following snippet:
// Snippet 1
#include
#include
std::string_view to_string(const Traffic_light_color…
Every implementation of the C++ Standard Library like one included to Embarcadero RAD Studio C++ compilers provides two ways for (pseudo-)random numbers generation: old-fashioned facilities from and modern facilities provided by .
Facilities from
There are two very…
In addition to Helpers for Generic C++ Code Iterating Over Sequences the C++17 Standard Library provides the following helpers for writing generic code:
#include // new helpers of C++17 are defined here
template
void foo(Container& c)
{
// Generic way to obtain:
…
The iterator library that is part of the C++ Standard Library provides the following helpers for writing generic code:
#include // helpers are defined here
template
void foo(Container& c)
{
// Generic way to obtain (constant) iterators
auto b = std::begin(c); // (1)
auto cb = std::cbegin(c); // (2)
auto e = std::end(c); // (3)
auto ce = std::cend(c); // (4)
…
Since C++11 there are elegant way to access each element of a containers (or, more generally, sequences) – so called range-for-statement. The syntaxes are follow:
template
void foo(Container& container)
{
for (auto element : container); // (1)
for (const auto…
Let’s slightly modify the example from The Move Iterator Adapter in C++ post:
#include
#include
#include
#include
/// @warning BUG! PLEASE, DON'T USE!
auto deep_copy_to_list(const std::vector& src)
{
std::list dst; // constructs the empty list
copy(cbegin(src)…
The dereference prefix operator * being applied to iterator returns the lvalue reference to the element pointed by the iterator. Therefore, algorithms such as std::copy or std::transform calls copying constructors of processed elements, for example:
#include
#include
#include
#include
auto deep_copy_to_list(const std::vector& src)
{
std::list dst(src.size()); // allocate the memory to…
