Iterators, Containers and Algorithms in the Standard Library

Please note the change of room!

Richard Thomson will present a review of iterators, containers and algorithms from the C++ Standard Library.

The C++ Standard Library uses the concepts of iterators, containers and algorithms to create an extensible framework for solving a wide variety of problems. These concepts are implemented with generic programming to create a powerful and expressive library without sacrificing performance.

C++11 added a few language features, such as range for (http://en.cppreference.com/w/cpp/language/range-for) loops and lambda functions (http://en.cppreference.com/w/cpp/language/lambda), that simplify the use of the standard library. C++11 added the containers array (http://en.cppreference.com/w/cpp/container/array), forward_list (http://en.cppreference.com/w/cpp/container/forward_list), and unordered versions of set (http://en.cppreference.com/w/cpp/container/unordered_set), multiset (http://en.cppreference.com/w/cpp/container/unordered_multiset), map (http://en.cppreference.com/w/cpp/container/unordered_map) and multimap (http://en.cppreference.com/w/cpp/container/unordered_multimap).

Dinner and drinks will be provided by Utah Geek Events (http://www.utahgeekevents.com/).

After a presentation, we'll do a group exercise to practice what we've learned.