From the course: C++ Templates and the STL

Unlock this course with a free trial

Join today to access over 22,400 courses taught by industry experts.

Modifying algorithms

Modifying algorithms - C++ Tutorial

From the course: C++ Templates and the STL

Modifying algorithms

- The STL contains additional modifying algorithms that make changes to sequences. There are quite a few of these, so let's get started. Here I have a working copy of modify.cpp from Chapter six of the exercise files. The simplest of the modifying algorithms is the copy function. Copy makes a copy of the source range to the target, and so you give it a source range with begin and end and a target begin, and when I build and run our v1 is the prime numbers, our v2 is filled with zeros of the same size and then copy, copies v1 to v2. There's also a copy_n version, does the same thing but instead of the end iterator, you give it a number of items to copy. Let's say we're going to copy 15 of these items and you'll notice that it does exactly that. There's a copy_backward algorithm which does not do what you might think it does. This copies the elements back to front, but the result is in the original order. So, instead of a begin point for the second container, we give it an end point…

Contents