C++ Standard Template Library - CPP120

This course provides the student with the knowledge to improve C++ programs using generic programming, templates, and the Standard Template Library.


Course ID: CPP120
Duration: 3 days
Audience: C++ programmers who want to use the Standard Template Library
Prerequisites: c++ programming experience
Topics:

Basic Concepts

  • Origin and History of the Standard Template Library
  • Why use the STL?
  • What is the Standard Template Library?
  • Foundation C++ Concepts

Generic Programming with Templates

  • Why Templates?
  • Function Templates
  • Class Templates
  • Template Specialization
  • Default Template Parameters
  • Non-Type Template Parameters
  • Template Template Parameters
  • Other Template Related Topics
  • Using Templates
  • Components of the STL

Sequential Containers

  • Containers
  • Sequential Containers
  • The vector Container
  • The deque Container
  • The list Container
  • The string Class
  • The bitset Container
  • The valarray Container

Iterators

  • What is an Iterator?
  • Iterators in the STL
  • Random Access Iterators
  • Bidrectional Iterators
  • Forward Iterators
  • Input Iterators
  • Output Iterators

Associative Containers

  • What is an Associative Container?
  • The pair Container
  • The set Container
  • The multiset Container
  • The map Container
  • The multimap Container
  • The Hashed Associative Container

Adapted Iterators

  • What are Iterator Adaptors?
  • The inserter Iterator Adaptor
  • The reverse Iterator Adaptor
  • The stream Iterator Adaptor

Adapted Containers

  • What are Container Adaptors?
  • The stack Container Adaptor
  • The queue Container Adaptor
  • The priority_que Container Adaptor

Functors

  • What is a Functor?
  • Classifying Functors
  • Functions Pointers Review
  • Arithmetic Functors
  • Relational Functors
  • Logical Functors

Function Adaptors

  • What are Function Adaptors?
  • The Binder Function Adaptors
  • The Negator Function Adaptors
  • Member Function Adaptors
  • Pointers to Functions
  • User Defined Functors

Non-Mutating Algorithms

  • Algorithms
  • Non-Mutating Algorithms
  • Searching
  • Counting
  • Max and Min
  • Comparing Ranges

Mutating Algorithms

  • Mutating Algorithms
  • Filling and Generating
  • Manipulating Sequences
  • Remove
  • Replace
  • Sort and Merge

Other Algorithms

  • set Algorithms
  • heap Algorithms
  • numeric Algorithms

Utilities

  • Memory Allocators
  • The Smart Pointer: auto_ptr
  • The Raw Storage Iterator
  • Some Relational Operators

Appendix – Resources

  • Optimization
  • Extensions
  • Books
  • Websites
 

Call Toll-free 877-245-6815 or 303-416-3056 to set up your IT Training today.