Learn how replace and remove algorithms work on a range of elements. Also, discover a function that removes duplicate values in a range.
- [Instructor] The STL has several algorithms…for replacing and removing elements in containers,…here I have a working copy of replace.cpp…from chapter six of the exercise files.…You'll notice I have a predicate function up here,…we'll use that a little later, and you'll notice…that my vector is not const, these are not…const safe functions because they…do make changes in the container.…Again I've got my prime numbers, and I have…the replace function, which takes as its first two arguments…the iterators for the beginning and just past the end…of our range, and the element to search for and the element…to replace it with, and when I build and run,…you see we have replaced 47 with 99.…
And of course, if I have a few of these 47s, let's put…one there, and let's put one there,…and I build and run, you see that all of those…occurrences of 47 get replaced with 99.…Replace if, works with a unary function,…a unary predicate function, instead of the…search parameter, and so this'll check is even,…and when I build and run you'll see that my two gets…
Author
Released
12/20/2018- Template fundamentals
- STL containers
- Accessing iterators
- Output, forward, and bidirectional iterators
- The transform function
- Transforming strings and types
- Arithmetic, relational, and logical functions
- STL algorithms
Skill Level Intermediate
Duration
Views
Related Courses
-
Learning C++ Pointers
with Peggy Fisher53m 55s Intermediate -
Learning C++
with Erin Colvin2h 26m Beginner
-
Introduction
-
1. Templates
-
What is a template?4m 43s
-
Template syntax1m 48s
-
Template specialization1m 49s
-
Template variables4m 14s
-
Impact on header files3m 13s
-
Type inference6m 45s
-
Argument deduction3m 15s
-
-
2. STL Containers
-
3. STL Iterators
-
Accessing iterators2m 28s
-
Input iterators2m 2s
-
Output iterators1m 27s
-
Forward iterators1m 58s
-
Bidirectional iterators1m 59s
-
Random access iterators2m 2s
-
-
4. Transformations
-
The transform function5m 28s
-
Lambda transformations4m 23s
-
Transforming strings2m 49s
-
Binary transformations3m 7s
-
Transforming types3m 3s
-
-
5. STL Functions
-
About functors1m 46s
-
Arithmetic functors2m 10s
-
Relational functors3m 13s
-
Logical functors1m 31s
-
-
6. STL Algorithm
-
About STL algorithms1m 42s
-
Testing conditions2m 36s
-
Searching and counting4m 38s
-
Replacing and removing4m 14s
-
Modifying algorithms5m 46s
-
Partitions2m 52s
-
Sorting3m 42s
-
Merging sequences2m 4s
-
Binary searches3m 57s
-
-
Conclusion
-
Goodbye1m 29s
-
- Mark as unwatched
- Mark all as unwatched
Are you sure you want to mark all the videos in this course as unwatched?
This will not affect your course history, your reports, or your certificates of completion for this course.
CancelTake notes with your new membership!
Type in the entry box, then click Enter to save your note.
1:30Press on any video thumbnail to jump immediately to the timecode shown.
Notes are saved with you account but can also be exported as plain text, MS Word, PDF, Google Doc, or Evernote.
Share this video
Embed this video
Video: Replacing and removing