This document discusses the Standard Template Library (STL) in C++, focusing on its various components such as algorithms, containers, and iterators. It highlights sequence containers like vectors and lists, emphasizing the dynamic resizing capability of vectors. Additionally, it references quizzes and exams based on the covered material, along with external resources for further learning.

1. Object Oriented Programming
(CSC-213)
Lecture 21: Standard Template
Library (STL)

2. STL IS A SET OF C++ TEMPLATE CLASSES
TO PROVIDE COMMON PROGRAMMING
DATA STRUCTURES AND FUNCTIONS SUCH
AS LISTS, STACKS, ARRAYS, ETC.

3. LIBRARY OF CONTAINER CLASSES,
ALGORITHMS AND ITERATORS

4. IT IS A GENERALIZED LIBRARY AND SO,
ITS COMPONENTS ARE PARAMETERIZED

5. STL Components
• Algorithms
• Containers
• Functions
• Iterators

6. Containers
• Sequence containers
– Vector
– List
– Deque
– Arrays
– Forward_list
• Container adaptors
• Associative containers

7. VECTORS ARE SAME AS DYNAMIC
ARRAYS WITH THE ABILITY TO
RESIZE ITSELF AUTOMATICALLY
WHEN AN ELEMENT IS INSERTED OR
DELETED, WITH THEIR STORAGE
BEING HANDLED AUTOMATICALLY BY
THE CONTAINER.
Vector

13. I have covered a very minimal part of the
vector stl, you can look up more details and
use in your project. Quiz and exam will
include the parts I have covered today.
https://www.learncpp.com/cpp-tutorial/introdu
ction-to-stdvector-and-list-constructors/

14. Robot Army Example: This is a partial
example giving a demo of several techniques
you can use in your project. As an exercise,
find and fix the memory leak issue.

15. Material adapted from
https://www.geeksforgeeks.org/the-c-standard-template-library-stl/
https://www.geeksforgeeks.org/vector-in-cpp-stl/