# Modern C++¶

## Copy Elision / Return Value Optimization (RVO)¶

Copy elision is one of the two forms of optimization that are allowed to change the side effects. (The other is allocation elision and extension.)

Sometimes copy elision is also called return value optimization (RVO) or named return value optimization (NRVO).

In the following example, even though no optimization flag is used, the copy is optimized out. The full example code is in 01_copy.cpp.

To show that the copy construction is not called, we will use a help class:

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 class IsCopied { public: static IsCopied & instance() { // This is a singleton. static IsCopied inst; return inst; } IsCopied & void on() { m_status = true; return *this; } operator bool() const { return m_status; } ~IsCopied() = default; private: IsCopied() : m_status(false) {} IsCopied(IsCopied const & ) = delete; IsCopied(IsCopied &&) = delete; IsCopied & operator=(IsCopied const & ) = delete; IsCopied & operator=(IsCopied &&) = delete; bool m_status; }; 

Note

In the copy constructor of the class of interest is called, an instance of this class IsCopied will set the status to be true. This helper class is a singleton so there will be only one instance in the process.

In the testing program, we have a Data class whose copy status is tracked:

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 class Data { public: constexpr const static size_t NELEM = 1024*8; Data() { std::cout << "Data constructed @" << this << std::endl; } Data(Data const & other) { copy_from(other); std::cout << "Data copied to @" << this << " from @" << &other << std::endl; } ~Data() { std::cout << "Data destructed @" << this << std::endl; } private: void copy_from(Data const & other) { for (size_t it=0; it < NELEM; ++it) { m_buffer[it] = other.m_buffer[it]; } // Mark copied. IsCopied::instance().on(); } // A lot of data that we don't want to reconstruct. int m_buffer[NELEM]; }; 

In the beginning, check that nothing is copied before anything is constructed:

std::cout
<< (bool(IsCopied::instance()) ? "Something" : "Nothing")
<< " is copied" << std::endl;


Indeed there is nothing copied:

Nothing is copied


Now we call a series of helper functions to construct, process, and return the Data object:

Data data = worker2();


Let us take a look at the helper function worker2() and its inner helpers:

Manipulation code.
void manipulate_with_reference(Data & data, int value)
{
std::cout << "Manipulate with reference: " << &data << std::endl;

for (size_t it=0; it < data.size(); ++it)
{
data[it] = value + it;
}
// In a real consumer function we will do much more meaningful operations.

// However, we cannot destruct an object passed in with a reference.
}

Inner helper function that construct Data.
Data worker1()
{
Data data;

// Manipulate the Data object.
manipulate_with_reference(data, 3);

return data;
}

Outer helper function that obtain Data from worker1().
Data worker2()
{
Data data = worker1();

// Manipulate the Data object, again.
manipulate_with_reference(data, 8);

return data;
}


You may be surprised when seeing the terminal prints showing no message of copy construction:

Data constructed @0x7ffee9ebe1c0
Manipulate with reference: 0x7ffee9ebe1c0
Manipulate with reference: 0x7ffee9ebe1c0


Note

You may guess that some optimizations disabled the copy construction, but the results remain the same with optimization:

$g++ 01_copy.cpp -o 01_copy -std=c++17 -g -O3  or without it: $ g++ 01_copy.cpp -o 01_copy -std=c++17 -g -O0


We can call our copy checker again:

std::cout
<< (bool(IsCopied::instance()) ? "Something" : "Nothing")
<< " is copied" << std::endl;


It is confirmed that copy constructor is not called:

Nothing is copied
Data destructed @0x7ffee9ebe1c0


## Move Semantics and Copy Elision¶

Contents in the section

Move semantics greatly helps us to avoid copying expensive resources. I would like to show how the movement interacts with copy elision. The full example code is in 02_move.cpp.

The Data class is changed to make both copy and move construction explicit:

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 class Data { public: constexpr const static size_t NELEM = 1024*8; Data() { m_buffer = new int[NELEM]; std::cout << "Data constructed @" << this << std::endl; } Data(Data const & other) { m_buffer = new int[NELEM]; copy_from(other); std::cout << "Data copied to @" << this << " from @" << &other << std::endl; } Data & operator=(Data const & other) { if (nullptr == m_buffer) { m_buffer = new int[NELEM]; } copy_from(other); std::cout << "Data copy assigned to @" << this << " from @" << &other << std::endl; return *this; } Data(Data && other) { m_buffer = other.m_buffer; other.m_buffer = nullptr; std::cout << "Data moved to @" << this << " from @" << &other << std::endl; Status::instance().set_moved(); } Data & operator=(Data && other) { if (m_buffer) { delete[] m_buffer; } m_buffer = other.m_buffer; other.m_buffer = nullptr; std::cout << "Data move assigned to @" << this << " from @" << &other << std::endl; Status::instance().set_moved(); return *this; } ~Data() { if (m_buffer) { delete[] m_buffer; } std::cout << "Data destructed @" << this << std::endl; } }; 

### Forced Move Is a Bad Idea¶

The move semantics is certainly able to avoid copying the expensive buffer in the Data class. Sometimes we will take advantage of it.

However, movement cannot avoid copy the Data object itself, and copy elision (RVO & NRVO) can. This renders forced move a bad idea to return objects except for some corner cases. Let us check it using a slightly modified worker2() helper function. The inner helpers remain identical to the previous example:

Manipulation code.
void manipulate_with_reference(Data & data, int value)
{
std::cout << "Manipulate with reference: " << &data << std::endl;

for (size_t it=0; it < data.size(); ++it)
{
data[it] = value + it;
}
// In a real consumer function we will do much more meaningful operations.

// However, we cannot destruct an object passed in with a reference.
}

Inner helper function that construct Data.
Data worker1()
{
Data data;

// Manipulate the Data object.
manipulate_with_reference(data, 3);

return data;
}


Note that the new worker2() returns the moved object:

The outer helper function that returns a moved object.
Data worker2()
{
Data data = worker1();

// Manipulate the Data object, again.
manipulate_with_reference(data, 8);

// Explicit move semantics destroys copy elision.
return std::move(data);
}


The test driver is:

Run with the move operations.
std::cout
<< "Status:"
<< (bool(Status::instance().is_copied()) ? " copied" : " uncopied")
<< (bool(Status::instance().is_moved()) ? " moved" : " unmoved")
<< std::endl;
Data data = worker2();
std::cout
<< "Status:"
<< (bool(Status::instance().is_copied()) ? " copied" : " uncopied")
<< (bool(Status::instance().is_moved()) ? " moved" : " unmoved")
<< std::endl;


In the terminal prints, we see the movement correctly works, but it also results in two Data objects (but there is only one data buffer) in the process:

Status: uncopied unmoved
Data constructed @0x7ffee90cb0d0
Manipulate with reference: 0x7ffee90cb0d0
Manipulate with reference: 0x7ffee90cb0d0
Data moved to @0x7ffee90cb168 from @0x7ffee90cb0d0
Data destructed @0x7ffee90cb0d0
Status: uncopied moved
Data destructed @0x7ffee90cb168


### Compiler Does Copy Elision¶

The forced movement does not look good. Let us change it back to use copy elision:

The outer helper function that enables copy elision.
Data worker2()
{
Data data = worker1();

// Manipulate the Data object, again.
manipulate_with_reference(data, 8);

return data;
}


Nothing is copied, nothing is moved, and there is only one Data object throughout the whole process:

Status: uncopied unmoved
Data constructed @0x7ffee0ac61b8
Manipulate with reference: 0x7ffee0ac61b8
Manipulate with reference: 0x7ffee0ac61b8
Status: uncopied unmoved
Data destructed @0x7ffee0ac61b8


## Data Concatenation¶

Contents in the section

After knowing that the compiler almost always does copy elision, to make code more readable, we prefer to write code that returns a container:

std::vector<int> worker_return();


At the calling site, the intention of using a returned container is very clear:

 1 2 // It reads clearly that the worker produces new result. std::vector result = worker_return(); 

And we do not worry about additional data copy, which does not exist, as we have shown in the previous example of copy elision.

Consequently, we avoid code that takes an output argument:

void worker_argument(std::vector<int> & output /* output argument */);


The output argument creates ambiguity and a productivity killer. It may be used solely for output, like:

// It takes a second to understand that the worker is using result as a buffer
// for output.
std::vector<int> result;
worker_argument(result);


But it may also be used for both input and output:

/*
* The result is pre-populated before sending to the worker.  From the
* following lines we can't know how the worker will use result.
*
* By reading the worker signature we know that result may be used for output.
* We can only be sure that result is used for output after reading the full
* implementation of the worker.
*
* The worker may or may not expect the output argument to be pre-populated.
* Regardless, it has to use runtime check to ensure either case.
*/
std::vector<int> result(100);
std::fill(result.begin(), result.end(), 7);
worker_argument(result);


By looking at the function signature or its implementation, it is impossible to tell whether or not it is a pure output or read-write argument. Using code remarks at the calling site and the function definition helps, but is inferior than simply using the syntax of returning a container object in terms of testability, readability, and maintainability.

But for a more complex scenario that concatenating multiple containers from a helper function, it becomes less obvious what is the way to go. To analyze, we will use 3 cases. The full example code is in 03_accumulate.cpp.

The Data class for testing:

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 class Data { public: constexpr const static size_t NELEM = 1024*8; Data(size_t serial) : m_serial(serial) { m_buffer = new int[NELEM]; initialize(); std::cout << "Data #" << m_serial << " constructed @" << this << std::endl; } Data(Data const & other) { m_serial = other.m_serial; m_buffer = new int[NELEM]; copy_from(other); std::cout << "Data #" << m_serial << " copied to @" << this << " from @" << &other << std::endl; } Data & operator=(Data const & other) { m_serial = other.m_serial; if (nullptr == m_buffer) { m_buffer = new int[NELEM]; } copy_from(other); std::cout << "Data #" << m_serial << " copy assigned to @" << this << " from @" << &other << std::endl; return *this; } Data(Data && other) { m_serial = other.m_serial; m_buffer = other.m_buffer; other.m_buffer = nullptr; std::cout << "Data #" << m_serial << " moved to @" << this << " from @" << &other << std::endl; } Data & operator=(Data && other) { m_serial = other.m_serial; if (m_buffer) { delete[] m_buffer; } m_buffer = other.m_buffer; other.m_buffer = nullptr; std::cout << "Data #" << m_serial << " move assigned to @" << this << " from @" << &other << std::endl; return *this; } ~Data() { if (m_buffer) { delete[] m_buffer; } std::cout << "Data #" << m_serial << " destructed @" << this << std::endl; } }; 

### Style 1: Return Container¶

The first style returns a std::vector from inner and appends it in outer. It is easier to read and test. The worker that produces the inner vector:

std::vector<Data> inner1(size_t start, size_t len)
{
std::cout << "** inner1 begins with " << start << std::endl;
std::vector<Data> ret;
for (size_t it=0; it < len; ++it)
{
Data data(start+it);
ret.emplace_back(std::move(data));
}
return ret;
}


The accumulating code calls the inner helper and builds the final vector container:

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 std::cout << "* outer1 begins" << std::endl; std::vector vec; for (size_t it=0; it < len; ++it) { std::cout << std::endl; std::cout << "* outer1 loop it=" << it << " begins" << std::endl; std::vector subvec = inner1(vec.size(), it+1); std::cout << "* outer1 obtained inner1 at " << vec.size() << std::endl; vec.insert( vec.end() , std::make_move_iterator(subvec.begin()) , std::make_move_iterator(subvec.end()) ); std::cout << "* outer1 inserted subvec.size()=" << subvec.size() << std::endl; } std::cout << "* outer1 result.size() = " << vec.size() << std::endl << std::endl; 

The execution results are:

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 * outer1 begins * outer1 loop it=0 begins ** inner1 begins with 0 Data #0 constructed @0x7ffee4a620c8 Data #0 moved to @0x7fe29d405ab0 from @0x7ffee4a620c8 Data #0 destructed @0x7ffee4a620c8 * outer1 obtained inner1 at 0 Data #0 moved to @0x7fe29d405ac0 from @0x7fe29d405ab0 * outer1 inserted subvec.size()=1 Data #0 destructed @0x7fe29d405ab0 * outer1 loop it=1 begins ** inner1 begins with 1 Data #1 constructed @0x7ffee4a620c8 Data #1 moved to @0x7fe29d405ab0 from @0x7ffee4a620c8 Data #1 destructed @0x7ffee4a620c8 Data #2 constructed @0x7ffee4a620c8 Data #2 moved to @0x7fe29d405ae0 from @0x7ffee4a620c8 Data #1 copied to @0x7fe29d405ad0 from @0x7fe29d405ab0 Data #1 destructed @0x7fe29d405ab0 Data #2 destructed @0x7ffee4a620c8 * outer1 obtained inner1 at 1 Data #1 moved to @0x7fe29d405b00 from @0x7fe29d405ad0 Data #2 moved to @0x7fe29d405b10 from @0x7fe29d405ae0 Data #0 copied to @0x7fe29d405af0 from @0x7fe29d405ac0 Data #0 destructed @0x7fe29d405ac0 * outer1 inserted subvec.size()=2 Data #2 destructed @0x7fe29d405ae0 Data #1 destructed @0x7fe29d405ad0 * outer1 loop it=2 begins ** inner1 begins with 3 Data #3 constructed @0x7ffee4a620c8 Data #3 moved to @0x7fe29d504080 from @0x7ffee4a620c8 Data #3 destructed @0x7ffee4a620c8 Data #4 constructed @0x7ffee4a620c8 Data #4 moved to @0x7fe29d5040a0 from @0x7ffee4a620c8 Data #3 copied to @0x7fe29d504090 from @0x7fe29d504080 Data #3 destructed @0x7fe29d504080 Data #4 destructed @0x7ffee4a620c8 Data #5 constructed @0x7ffee4a620c8 Data #5 moved to @0x7fe29d5040d0 from @0x7ffee4a620c8 Data #4 copied to @0x7fe29d5040c0 from @0x7fe29d5040a0 Data #3 copied to @0x7fe29d5040b0 from @0x7fe29d504090 Data #4 destructed @0x7fe29d5040a0 Data #3 destructed @0x7fe29d504090 Data #5 destructed @0x7ffee4a620c8 * outer1 obtained inner1 at 3 Data #3 moved to @0x7fe29d504120 from @0x7fe29d5040b0 Data #4 moved to @0x7fe29d504130 from @0x7fe29d5040c0 Data #5 moved to @0x7fe29d504140 from @0x7fe29d5040d0 Data #2 copied to @0x7fe29d504110 from @0x7fe29d405b10 Data #1 copied to @0x7fe29d504100 from @0x7fe29d405b00 Data #0 copied to @0x7fe29d5040f0 from @0x7fe29d405af0 Data #2 destructed @0x7fe29d405b10 Data #1 destructed @0x7fe29d405b00 Data #0 destructed @0x7fe29d405af0 * outer1 inserted subvec.size()=3 Data #5 destructed @0x7fe29d5040d0 Data #4 destructed @0x7fe29d5040c0 Data #3 destructed @0x7fe29d5040b0 * outer1 result.size() = 6 Data #5 destructed @0x7fe29d504140 Data #4 destructed @0x7fe29d504130 Data #3 destructed @0x7fe29d504120 Data #2 destructed @0x7fe29d504110 Data #1 destructed @0x7fe29d504100 Data #0 destructed @0x7fe29d5040f0 

#### std::vector Resizing Requires noexcept Movement¶

It is intriguing that we saw some copying in the highlighted lines above. Didn’t we have the move constructor defined for the Data class? The reason that the copy instead of the move constructor is called is that std::vector requires the element’s move constructor to be noexcept when constructing the elements during resizing. We need to change the Data class accordingly:

Data(Data && other) noexcept
{
m_serial = other.m_serial;
m_buffer = other.m_buffer;
other.m_buffer = nullptr;
std::cout << "Data #" << m_serial << " moved to @" << this
<< " from @" << &other << std::endl;
}


With the correction, the execution results become:

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 * outer1 begins * outer1 loop it=0 begins ** inner1 begins with 0 Data #0 constructed @0x7ffee11510a8 Data #0 moved to @0x7fcf16405ab0 from @0x7ffee11510a8 Data #0 destructed @0x7ffee11510a8 * outer1 obtained inner1 at 0 Data #0 moved to @0x7fcf16405ac0 from @0x7fcf16405ab0 * outer1 inserted subvec.size()=1 Data #0 destructed @0x7fcf16405ab0 * outer1 loop it=1 begins ** inner1 begins with 1 Data #1 constructed @0x7ffee11510a8 Data #1 moved to @0x7fcf16405ab0 from @0x7ffee11510a8 Data #1 destructed @0x7ffee11510a8 Data #2 constructed @0x7ffee11510a8 Data #2 moved to @0x7fcf16405ae0 from @0x7ffee11510a8 Data #1 moved to @0x7fcf16405ad0 from @0x7fcf16405ab0 Data #1 destructed @0x7fcf16405ab0 Data #2 destructed @0x7ffee11510a8 * outer1 obtained inner1 at 1 Data #1 moved to @0x7fcf16405b00 from @0x7fcf16405ad0 Data #2 moved to @0x7fcf16405b10 from @0x7fcf16405ae0 Data #0 moved to @0x7fcf16405af0 from @0x7fcf16405ac0 Data #0 destructed @0x7fcf16405ac0 * outer1 inserted subvec.size()=2 Data #2 destructed @0x7fcf16405ae0 Data #1 destructed @0x7fcf16405ad0 * outer1 loop it=2 begins ** inner1 begins with 3 Data #3 constructed @0x7ffee11510a8 Data #3 moved to @0x7fcf16504080 from @0x7ffee11510a8 Data #3 destructed @0x7ffee11510a8 Data #4 constructed @0x7ffee11510a8 Data #4 moved to @0x7fcf165040a0 from @0x7ffee11510a8 Data #3 moved to @0x7fcf16504090 from @0x7fcf16504080 Data #3 destructed @0x7fcf16504080 Data #4 destructed @0x7ffee11510a8 Data #5 constructed @0x7ffee11510a8 Data #5 moved to @0x7fcf165040d0 from @0x7ffee11510a8 Data #4 moved to @0x7fcf165040c0 from @0x7fcf165040a0 Data #3 moved to @0x7fcf165040b0 from @0x7fcf16504090 Data #4 destructed @0x7fcf165040a0 Data #3 destructed @0x7fcf16504090 Data #5 destructed @0x7ffee11510a8 * outer1 obtained inner1 at 3 Data #3 moved to @0x7fcf16504120 from @0x7fcf165040b0 Data #4 moved to @0x7fcf16504130 from @0x7fcf165040c0 Data #5 moved to @0x7fcf16504140 from @0x7fcf165040d0 Data #2 moved to @0x7fcf16504110 from @0x7fcf16405b10 Data #1 moved to @0x7fcf16504100 from @0x7fcf16405b00 Data #0 moved to @0x7fcf165040f0 from @0x7fcf16405af0 Data #2 destructed @0x7fcf16405b10 Data #1 destructed @0x7fcf16405b00 Data #0 destructed @0x7fcf16405af0 * outer1 inserted subvec.size()=3 Data #5 destructed @0x7fcf165040d0 Data #4 destructed @0x7fcf165040c0 Data #3 destructed @0x7fcf165040b0 * outer1 result.size() = 6 Data #5 destructed @0x7fcf16504140 Data #4 destructed @0x7fcf16504130 Data #3 destructed @0x7fcf16504120 Data #2 destructed @0x7fcf16504110 Data #1 destructed @0x7fcf16504100 Data #0 destructed @0x7fcf165040f0 

std::vector now uses the move construction to replace the copy construction.

### Style 2: Use Output Argument¶

The second style uses an output argument which is passed from outer to inner. The inner worker:

 1 2 3 4 5 6 7 8 9 void inner2(size_t start, size_t len, std::vector & result /* for output */) { std::cout << "** inner2 begins with " << start << std::endl; for (size_t it=0; it < len; ++it) { Data data(start+it); result.emplace_back(std::move(data)); } } 

The accumulating code calls the inner helper and builds the final vector container:

std::cout << "* outer2 begins" << std::endl;
std::vector<Data> vec;
for (size_t it=0; it < len; ++it)
{
std::cout << std::endl;
std::cout << "* outer2 loop it=" << it << " begins" << std::endl;
inner2(vec.size(), it+1, vec);
}
std::cout << "* outer2 result.size() = " << vec.size() << std::endl << std::endl;


There is no longer the intermediate vector and it saves quite a number of movement. The prize we pay is less testability. The execution results are:

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 * outer2 begins * outer2 loop it=0 begins ** inner2 begins with 0 Data #0 constructed @0x7ffee68c60c8 Data #0 moved to @0x7f898c405ab0 from @0x7ffee68c60c8 Data #0 destructed @0x7ffee68c60c8 * outer2 loop it=1 begins ** inner2 begins with 1 Data #1 constructed @0x7ffee68c60c8 Data #1 moved to @0x7f898c405ad0 from @0x7ffee68c60c8 Data #0 moved to @0x7f898c405ac0 from @0x7f898c405ab0 Data #0 destructed @0x7f898c405ab0 Data #1 destructed @0x7ffee68c60c8 Data #2 constructed @0x7ffee68c60c8 Data #2 moved to @0x7f898c405b00 from @0x7ffee68c60c8 Data #1 moved to @0x7f898c405af0 from @0x7f898c405ad0 Data #0 moved to @0x7f898c405ae0 from @0x7f898c405ac0 Data #1 destructed @0x7f898c405ad0 Data #0 destructed @0x7f898c405ac0 Data #2 destructed @0x7ffee68c60c8 * outer2 loop it=2 begins ** inner2 begins with 3 Data #3 constructed @0x7ffee68c60c8 Data #3 moved to @0x7f898c405b10 from @0x7ffee68c60c8 Data #3 destructed @0x7ffee68c60c8 Data #4 constructed @0x7ffee68c60c8 Data #4 moved to @0x7f898c405b60 from @0x7ffee68c60c8 Data #3 moved to @0x7f898c405b50 from @0x7f898c405b10 Data #2 moved to @0x7f898c405b40 from @0x7f898c405b00 Data #1 moved to @0x7f898c405b30 from @0x7f898c405af0 Data #0 moved to @0x7f898c405b20 from @0x7f898c405ae0 Data #3 destructed @0x7f898c405b10 Data #2 destructed @0x7f898c405b00 Data #1 destructed @0x7f898c405af0 Data #0 destructed @0x7f898c405ae0 Data #4 destructed @0x7ffee68c60c8 Data #5 constructed @0x7ffee68c60c8 Data #5 moved to @0x7f898c405b70 from @0x7ffee68c60c8 Data #5 destructed @0x7ffee68c60c8 * outer2 result.size() = 6 Data #5 destructed @0x7f898c405b70 Data #4 destructed @0x7f898c405b60 Data #3 destructed @0x7f898c405b50 Data #2 destructed @0x7f898c405b40 Data #1 destructed @0x7f898c405b30 Data #0 destructed @0x7f898c405b20 

The lines of prints reduce from 70 to 50, comparing with the first style.

### Style 3: Encapsulate Concatenation (in a Class)¶

The third style uses a class to take advantage of the first and second styles and mitigate the drawbacks of them.

There is a public API Accumulator::outer() calling a private helper function Accumulator::inner2() that takes an output argument. In addition, there is also a public helper function Accumulator::inner1() that wraps around Accumulator::inner2 and make it testable.

In the Accumulator::outer() function, we move one step further to pre-calculate the number of elements to be populated in the result vector and reserve the space. Although it is possible to play the same trick with the first and second styles, it is better to only do it with the third style. The Accumulator class is an encapsulation. Without the encapsulation, element reserving may leak too much implementation detail and reduce maintainability.

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 struct Accumulator { public: // This can be called if consumers want the sub-operation one by one, and // make the code more testable. But it isn't really used in the example. std::vector inner1(size_t start, size_t len) { std::cout << "** Accumulator::inner1 begins with " << start << std::endl; std::vector ret; ret.reserve(len); inner2(start, len, ret); return ret; } private: // Caller does not see this private helper that takes an output argument. void inner2(size_t start, size_t len, std::vector & ret) { std::cout << "** Accumulator::inner2 begins with " << start << std::endl; for (size_t it=0; it < len; ++it) { Data data(start+it); ret.emplace_back(std::move(data)); } } public: // This is used when batch operation is in demand. void outer(size_t len) { std::cout << "* Accumulator::outer begins" << std::endl; result.reserve(len*(len+1)/2); for (size_t it=0; it < len; ++it) { std::cout << std::endl; std::cout << "* Accumulator::outer loop it=" << it << " begins" << std::endl; // The output argument passed into the private helper is a private // member datum. inner2(result.size(), it+1, result); } std::cout << "* Accumulator::outer result.size() = " << result.size() << std::endl << std::endl; } public: std::vector result; }; /* end struct Accumulator */ 

The execution results:

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 * Accumulator::outer begins * Accumulator::outer loop it=0 begins ** Accumulator::inner2 begins with 0 Data #0 constructed @0x7ffee47640a8 Data #0 moved to @0x7fdb66c05ab0 from @0x7ffee47640a8 Data #0 destructed @0x7ffee47640a8 * Accumulator::outer loop it=1 begins ** Accumulator::inner2 begins with 1 Data #1 constructed @0x7ffee47640a8 Data #1 moved to @0x7fdb66c05ac0 from @0x7ffee47640a8 Data #1 destructed @0x7ffee47640a8 Data #2 constructed @0x7ffee47640a8 Data #2 moved to @0x7fdb66c05ad0 from @0x7ffee47640a8 Data #2 destructed @0x7ffee47640a8 * Accumulator::outer loop it=2 begins ** Accumulator::inner2 begins with 3 Data #3 constructed @0x7ffee47640a8 Data #3 moved to @0x7fdb66c05ae0 from @0x7ffee47640a8 Data #3 destructed @0x7ffee47640a8 Data #4 constructed @0x7ffee47640a8 Data #4 moved to @0x7fdb66c05af0 from @0x7ffee47640a8 Data #4 destructed @0x7ffee47640a8 Data #5 constructed @0x7ffee47640a8 Data #5 moved to @0x7fdb66c05b00 from @0x7ffee47640a8 Data #5 destructed @0x7ffee47640a8 * Accumulator::outer result.size() = 6 Data #5 destructed @0x7fdb66c05b00 Data #4 destructed @0x7fdb66c05af0 Data #3 destructed @0x7fdb66c05ae0 Data #2 destructed @0x7fdb66c05ad0 Data #1 destructed @0x7fdb66c05ac0 Data #0 destructed @0x7fdb66c05ab0 

Now the lines of terminal prints reduced to 36 lines, from 70 and 50. We end up with a (rather) optimized class library for data processing.

Variadic template allows us to capture any number of template arguments in a function template. The full example of its use is in 01_factory.cpp.

Assuming we have 2 constructors for Data:

Constructor that takes a single serial number.
Data(size_t serial, ctor_passkey const &)
: m_serial(serial)
{
m_buffer = new int[NELEM];
initialize(0);
std::cout << "Data #" << m_serial << " constructed @" << this
<< "(serial=" << m_serial << ")" << std::endl;
}

Constructor that takes a serial number and a base number.
Data(size_t serial, int base, ctor_passkey const &)
: m_serial(serial+base)
{
m_buffer = new int[NELEM];
initialize(0);
std::cout << "Data #" << m_serial << " constructed @" << this
<< "(serial=" << m_serial << ")"
<< "(base=" << base << ")" << std::endl;
}


There should be two corresponding factory functions:

Factory function for a single serial number.
static std::shared_ptr<Data> create(size_t serial)
{
return std::make_shared<Data>(serial, ctor_passkey());
}

Factory function for a serial number and a base.
static std::shared_ptr<Data> create(size_t serial, int base)
{
return std::make_shared<Data>(serial, int, ctor_passkey());
}


It’s tedious to add the corresponding factory functions. When we add a new constructor, it is not unusually for us to forget to add the corresponding factory function in the first place. It is not too much an issue, because the compiler must find the mistake and complain.

// The factory function is available for this:
data = Data::create(it);
// The factory function is missing for this:
data = Data::create(it, base);


The compiler will issue error for it cannot find the definition of the second factory function:

Build 01_factory.cpp and show the missing factory method.
$g++ 01_factory.cpp -o 01_factory -std=c++17 -g -O3 -DUSE_CREATE 01_factory.cpp:142:37: error: too many arguments to function call, expected single argument 'serial', have 2 arguments data = Data::create(it, base); ~~~~~~~~~~~~ ^~~~ 01_factory.cpp:22:5: note: 'create' declared here static std::shared_ptr<Data> create(size_t serial) ^ 1 error generated.  Variadic template can conveniently help us organize the two overloads into one function template, and also capture every new public constructor that will be added in the future.  1 2 3 4 5 6 template < typename ... Args > static std::shared_ptr make(Args && ... args) { // Forget about the 'forward' for now. It will be discussed later. return std::make_shared(std::forward(args) ..., ctor_passkey()); }  The helper function that uses the variadic function template:   1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 std::vector> inner1(size_t base, size_t len) { std::cout << "** inner1 begins with " << base << std::endl; std::vector> ret; for (size_t it=0; it < len; ++it) { std::shared_ptr data; if (0 == base) { data = Data::make(it); } else { data = Data::make(it, base); } ret.emplace_back(data); } return ret; }  Run the following code: std::cout << "* outer1 begins" << std::endl; std::vector<std::shared_ptr<Data>> vec; for (size_t it=0; it < len; ++it) { std::cout << std::endl; std::cout << "* outer1 loop it=" << it << " begins" << std::endl; std::vector<std::shared_ptr<Data>> subvec = inner1(vec.size(), it+1); std::cout << "* outer1 obtained inner1 at " << vec.size() << std::endl; vec.insert( vec.end() , std::make_move_iterator(subvec.begin()) , std::make_move_iterator(subvec.end()) ); std::cout << "* outer1 inserted subvec.size()=" << subvec.size() << std::endl; } std::cout << "* outer1 result.size() = " << vec.size() << std::endl << std::endl; std::cout << "* outer1 end" << std::endl << std::endl;  The execution results are:   1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 * outer1 begins * outer1 loop it=0 begins ** inner1 begins with 0 Data #0 constructed @0x7ff4af405ac8(serial=0) * outer1 obtained inner1 at 0 * outer1 inserted subvec.size()=1 * outer1 loop it=1 begins ** inner1 begins with 1 Data #1 constructed @0x7ff4af405b28(serial=1)(base=1) Data #2 constructed @0x7ff4af405b68(serial=2)(base=1) * outer1 obtained inner1 at 1 * outer1 inserted subvec.size()=2 * outer1 loop it=2 begins ** inner1 begins with 3 Data #3 constructed @0x7ff4af405bf8(serial=3)(base=3) Data #4 constructed @0x7ff4af405c38(serial=4)(base=3) Data #5 constructed @0x7ff4af405c78(serial=5)(base=3) * outer1 obtained inner1 at 3 * outer1 inserted subvec.size()=3 * outer1 result.size() = 6 * outer1 end Data #5 destructed @0x7ff4af405c78 Data #4 destructed @0x7ff4af405c38 Data #3 destructed @0x7ff4af405bf8 Data #2 destructed @0x7ff4af405b68 Data #1 destructed @0x7ff4af405b28 Data #0 destructed @0x7ff4af405ac8  ## Perfect Forwarding¶ In the previous section, we used std::forward without explanation. It will be explained in this section. The template is used to enable perfect forwarding: template < typename ... Args > static std::shared_ptr<Data> make(Args && ... args) { return std::make_shared<Data>(std::forward<Args>(args) ..., ctor_passkey()); }  The template forwards the reference. Like std::move, it serves as a cast to rvalue reference. The difference is that: 1. std::move unconditionally casts the input to rvalue reference. 2. std::forward casts to rvalue reference only when it can. When we write Data &&, it is a rvalue reference. With T && as a template argument, when we write T &&, it can be either lvalue or rvalue, and is called a universal reference. The rule of thumb is that when T is a deductible type (auto && falls into this category too), T && is a universal reference rather a strict rvalue reference. So std::forward<Args>(args) preserves the type of reference of the arguments, and the pattern is called perfect forwarding. Because the arguments of Data constructors were both fundamental types, it doesn’t matter whether or not we use perfect forwarding. To demonstrate how it works, we add the two wrapper: // Proxy to copy and move constructor. Data(Data const & other, ctor_passkey const &) : Data(std::forward<Data const &>(other)) {} Data(Data && other, ctor_passkey const &) : Data(std::forward<Data &&>(other)) {}  Let us test the copy factory function: vec.emplace_back(Data::make(*vec[0]));  The execution result shows that the copy is corrected done: Data #0 copied to @0x7ff6abc05cb8 from @0x7ff6abc05ac8  Test the move factory function: vec.emplace_back(Data::make(std::move(*vec[1])));  The execution result shows that the move is correctly done: Data #1 moved to @0x7ff6abc05ba8 from @0x7ff6abc05b28  ## Lambda Expression¶ Contents in the section C++ lambda expression enables a shorthand for anonymous function. The syntax (no variable is captured) is: [] (/* arguments */) { /* body */ }  It works basically like a functor. See an example of a functor: struct Functor { bool operator()(int v) { return 0 == v % 23; } }; /* end struct Functor */  Let us see how similar that the lambda expression works like a functor. We prepare a vector of integer for later consumption: std::vector<int> data(63712); for (size_t i=0 ; i<data.size(); ++i) { data[i] = i;}  First run the functor through all the element in the vector: std::cout << "Number divisible by 23 (count by functor): " << std::count_if(data.begin(), data.end(), Functor()) << std::endl;  The execution results: Number divisible by 23 (count by functor): 2771  The run the lambda version: std::cout << "Number divisible by 23 (count by lambda): " << std::count_if(data.begin(), data.end(), [](int v){ return 0 == v%23; }) << std::endl;  The execution results are the same as the functor version: Number divisible by 23 (count by lambda): 2771  The full example code is in 01_lambda.cpp. Note Additional information for the similiarity between a functor and a lambda expression:  1 2 3 4 5 auto le = [](int v){ return 0 == v%23; }; Functor func; static_assert(sizeof(le) == sizeof(func)); static_assert(1 == sizeof(le)); static_assert(1 == sizeof(func));  ### Store Lambda in Variable¶ Lambda is considered as an anonymous function, but we can give it a “name” by assigning it to a variable. There are two choices of the type for the variable: (i) auto or (ii) std::function. First, we create a lambda and pass it to std::count_if() without storing it in a local variable: std::cout << "Number divisible by 23 (count by lambda inline): " << std::count_if(data.begin(), data.end(), [](int v){ return 0 == v%23; }) << std::endl;  Number divisible by 23 (count by lambda inline): 2771  In the second test, we store a lambda to an auto variable: auto condition = [](int v){ return 0 == v%23; }; std::cout << "Number divisible by 23 (count by lambda in auto): " << std::count_if(data.begin(), data.end(), condition) << std::endl;  The execution results are the same, as expected: Number divisible by 23 (count by lambda in auto): 2771  In the third and last test, we store it to a std::function variable: std::function<bool (int)> condition_function = [](int v){ return 0 == v%23; }; std::cout << "Number divisible by 23 (count by lambda in std::function): " << std::count_if(data.begin(), data.end(), condition_function) << std::endl;  The execution results are still the same: Number divisible by 23 (count by lambda in std::function): 2771  Note To use a std::function template, we need to specify the signature of the function in the template argument. The full example code is in 02_stored.cpp. ### Difference between auto and std::function¶ Although both auto and std::function hold a lambda, the two approaches do not work exactly the same. A lambda works like a functor and the auto type reflects that. A std::function is more versatile than it, and takes more memory as well. Note List of targets (callables) that a std::function can hold: free functions, member functions, functors, lambda expressions, and bind expressions. The types of auto and std::function are different: std::cout << std::endl << "The differences between lambda and std::function" << std::endl; std::cout << "type name of lambda: " << typeid(condition).name() << std::endl; std::cout << "type name of std::function: " << typeid(condition_function).name() << std::endl;  The execution results are: The differences between lambda and std::function type name of lambda: Z4mainE3$_1
type name of std::function: NSt3__18functionIFbiEEE


The sizes of the two types are different:

std::cout
<< "size of lambda: "
<< sizeof(condition) << std::endl;
std::cout
<< "size of std::function: "
<< sizeof(condition_function) << std::endl;


The execution results are:

size of lambda: 1
size of std::function: 48


## Closure¶

Contents in the section

So far our use of lambda expressions doesn’t capture any local variables. When it does, we call the lambda expression a closure.

We must tell the compiler what type of capture the lambda expression would like to use. Otherwise the compilation fails. For example:

std::vector<int> data(63712);
for (size_t i=0 ; i<data.size(); ++i) { data[i] = i;}

int divisor = 23;

std::cout
<< "Count (wrong capture): "
<< std::count_if(data.begin(), data.end(),
[](int v){ return 0 == v%divisor; })
<< " (divisor: " << divisor << ")"
<< std::endl;


The compiler error:

\$ g++ 03_closure.cpp -o 03_closure -std=c++17 -g -O3 -DWRONG_CAPTURE
03_closure.cpp:17:51: error: variable 'divisor' cannot be implicitly captured in a lambda with no capture-default specified
[](int v){ return 0 == v%divisor; })
^
03_closure.cpp:11:9: note: 'divisor' declared here
int divisor = 23;
^
03_closure.cpp:17:26: note: lambda expression begins here
[](int v){ return 0 == v%divisor; })
^
1 error generated.


We may explicitly tell the compiler that we want divisor to be captured by the lambda expression by value:

int divisor = 23;

std::cout
<< "Count (lambda explicitly capture by value): "
<< std::count_if(data.begin(), data.end(),
[divisor](int v){ return 0 == v%divisor; })
<< " (divisor: " << divisor << ")"
<< std::endl;


The execution result shows that the value of divisor is correctly captured:

Count (lambda explicitly capture by value): 2771 (divisor: 23)


We may also use = to implicitly capture all variables by value:

std::cout
<< "Count (lambda implicitly capture by value): "
<< std::count_if(data.begin(), data.end(),
[=](int v){ return 0 == v%divisor; })
<< " (divisor: " << divisor << ")"
<< std::endl;


The execution result shows that the value is also correctly captured:

Count (lambda implicitly capture by value): 2771 (divisor: 23)


We can also capture a variable by reference by using &. When we do it, we may change the value of the referenced variable:

std::cout
<< "Count (lambda explicitly capture by reference): "
<< std::count_if(data.begin(), data.end(),
[&divisor](int v){ divisor = 10; return 0 == v%divisor; })
<< " (divisor: " << divisor << ")"
<< std::endl;


Note

& can also be put standalone in [] to indicate that the default capture is by reference.

The execution result is:

Count (lambda explicitly capture by reference): 6372 (divisor: 10)


The full example code is in 03_closure.cpp.

The lambda expression and closure allow functional style of programming. As shown in the std::count_if example, it is a convenient tool to reduce the number of lines of code. It generally makes the code looks cleaner and easier to maintain. That buys us time to do more important things or optimize performance hotspot.

But there are times that we cannot entrust the optimization to the compiler. Lambda expressions are not the easiest place to add intrinsics or assemblies.

When working on a container object equipped with proper iterator interface, I go with the functional style. The lambda expression may help avoid expensive intermediate buffers. It works well at least for the initial prototype.

## Exercises¶

1. Measure the performance between using an output vector and returning a new vector.

## References¶

 [1] Copy elision at cppreference.com .
 [2] Lambda expressions at cppreference.com .