Chapter Summary (cont.)

---

5. Some generic algorithms take generators or predicates as arguments. A generator is a function or function object that returns a different value each time it is called. A predicate is a function or function object that returns a Boolean value.
6. A large number of generic algorithms are provided in the standard library. Generic algorithms can be used to initialize a container, transform a collection, search for a value within a container, remove elements from a container, or other tasks.
7. Many algorithms assign values to a container using an iterator. An inserter can be used to replace this action with an insertion into a container. Inserters can use either push_front or push_back insertion.

---

prev |top