cpp-2013 #9 STL Algorithms Part 1
Download as PPTX, PDF0 likes316 views
This document provides an overview of STL algorithms and their associated concepts like iterators and functors. It discusses why iterators are needed in STL, common iterator types, and the base() member. Functors are defined as function objects that can be passed to algorithms. The document outlines common non-modifying STL algorithms like for_each, count, find, equal, all_of, any_of and none_of and provides examples of their use. It promotes using STL algorithms over handwritten functions for improved code reuse and maintainability.
cpp-2013 #9 STL Algorithms Part 1
- 1. STL algorithms Part 1
- 2. Iterators
- 3. Iterators • Why we need to have iterators • Features • iterator • reverse_iterator • const_iterator • What iterator type better to use • base() member
- 4. Functors
- 5. Functor • What is functor? Function Function objects Handwritten Lambdas
- 6. Functor • operator() • unary_function, binary_function
- 7. Algorithms
- 8. Algorithms • Why it’s better to use STL algorithms • Global STL algorithms overview
- 11. count, count_if • Overview • Examples
- 12. find, find_if • Overview • Examples
- 14. all_of, any_of, none_of • Overview • Examples
- 15. Questions?