The C++ Standard Template Library

The C++ Standard Template Library

3 Days course

Language: English

This course is only available on request!!

DESCRIPTION The C++ Standard Template Library is a large part of the C++ Standard Library. The course shows the programmer how to write generic programs by using the following features of the C++ Standard Template Library - containers, algorithms and iterators.	WHAT YOU WILL LEARN Use any of the data structures contained in STL Use any of the algorithms contained in STL Connect algorithms to containers using STL iterators Demonstrate the principles of generic programming Apply STL algorithms to the standard C and C++ data types
WHO SHOULD ATTEND: Programmers who have a need to write robust C++ programs in any of a wide variety of subject matter areas.	ASSUMED KNOWLEDGE Students should have a working knowledge of C++

OUTLINES

CHAPTER 1: AN OVERVIEW OF TEMPLATES
1) Templates
2) Overloading functions
3) Template functions
4) Specializing a template function
5) Disambiguation under specialization
6) Template classes
7) An array template class
8) Instantiating a template class object
9) Rules for templates
10) Non member function w/ a template argument
11) Friends of template classes
12) Templates with multiple type parameters
13) Non type parameters for template classes
14) Comments regarding templates

CHAPTER 2: OVERVIEW OF THE STANDARD TEMPLATE LIBRARY
1) Perspective
2) History and evolution
3) New features in C++
4) The Standard Template Library
5) Design goals
6) Header files
7) STL components
8) Containers
9) Algorithms
10) Iterators

CHAPTER 3: EXAMPLES FROM STL
1) Example: vectors, lists
2) Example: maps
3) Example: sets
4) Example: multiset
5) Example: find with a vector
6) Example: find with a list
7) Example: merge
8) Iterators
9) Function objects
10) Adaptors

CHAPTER 4: STL CONTAINERS
1) vector
2) vector Sample Program
3) Output of previous Program
4) vector operations - vector.h
5) deque
6) deque vs vector
7) deque as a stack
8) deque functionality - deque.h
9) list
10) The beauty of STL
11) list pros and cons
12) list memory allocation
13) list functionality - list.h
14) Associative Containers
15) Set
16) Set demonstration
17) Sets with user defined objects
18) Multiset
19) Multiset Example
20) Multiset functionality - multiset.h
21) Map
22) Multimap

CHAPTER 5: STL ITERATORS
1) Input iterators
2) Output iterators
3) Forward iterators
4) Backward iterators
CHAPTER 6: STL ALGORITHMS
1) Non-Mutating sequence algorithms
2) Mutating sequence algorithms
3) Sorting and searching algorithms
4) Numeric algorithms
5) General

CHAPTER 7: FUNCTION OBJECTS
1) Vs. function pointers
2) Predicate function objects
3) Comparison function objects
4) Numeric function objects
5) Programmer supplied function objects
6) Built-in function objects
CHAPTER 8: CONTAINER ADAPTORS
1) Wraper classes
2) Stack container adaptors
3) Queue container adaptors
4) Priority_Queue container adaptors

CHAPTER 9: ALLOCATORS
1) Rational
2) Allocator methods
3) Templates
4) Specializations

FDDI Institute
De Regenboog 11 - 2800 Mechelen - Belgium - Europe
Tel 32 15 24 50 58 - Fax 32 15 25 10 50