|Lecture 6 - Slide 6 : 40|
Many algorithms overwrite existing elements
It is also necessary to be able to insert new elements
Insertion is normally done by the container operations push_back(), push_front(), and insert()
Insertion can also be accomplished via insert-iterators, which are output iterators
Using these, assignments are used for insertion of new elements
Insertion iterators can be created by the template (factory) functions back_inserter, front_inserter, and inserter.