CO2402 Advanced Programming with C++ Lecture 14 Notes

CO2402: Advanced Programming
with C++ Lecture 14



Introduction to the STL Containers

1. Overview

o The Standard Template Library (STL) provides a set of generic
classes and functions, including containers, algorithms, and
iterators. These are implemented as template classes,
allowing for type-independent data structures and algorithms.

2. Advantages of Using STL

o Robust and Debugged: STL components are well-tested and
reliable.

o Efficiency: Defined as inline templates for speed.

o Time-Saving: Reduces the need for custom implementations
of data structures.

3. Disadvantages

o Complex Debugging: Especially with nested STL containers.

o Not Universally Suitable: May not fit all use cases,
particularly with specialized data structures.

The Vector Class

1. Introduction

o Vectors are dynamic arrays that can resize automatically. They
offer the benefits of arrays while providing additional
functionality, such as dynamic resizing and a range of
member functions.

, Example:




2. Key Member Functions

o size(): Returns the number of elements.

o resize(size_t n): Resizes the vector to contain n elements.

o push_back(const T& value): Adds an element to the end.

o pop_back(): Removes the last element.

o front() and back(): Access the first and last elements,
respectively.

Example:




3. Copy and Assignment

o Vectors support deep copy and assignment operations,
making it easy to copy entire vectors.

Example: