C++ STL Containers Reference 🎯

Welcome to this comprehensive guide on C++ Standard Template Library (STL) Containers! In this lesson, we'll dive deep into the world of data structures, exploring various container types, their use cases, and practical examples.

By the end of this lesson, you'll have a solid understanding of C++ STL containers, enabling you to write efficient, scalable, and real-world code. Let's get started! 🚀

Understanding Containers 📝

Containers are essential data structures that store collections of objects. In C++ STL, there are five main container types:

Sequence Containers (vector, list, deque, array)
Associative Containers (set, multiset, map, multimap)
Unordered Associative Containers (unordered_set, unordered_multiset, unordered_map, unordered_multimap)
Container Adapters (stack, queue, priority_queue)
Other Containers (bitset)

Sequence Containers 📝

Sequence containers store elements in a linear, ordered fashion. Here, we will cover the most common ones: vector, list, and deque.

Vector 📝

A vector is a dynamic array that resizes itself automatically as elements are added or removed. It offers constant-time, random access to its elements.

Example:

cpp

#include <iostream>
#include <vector>

int main() {
    std::vector<int> v = {1, 2, 3, 4, 5};

    std::cout << "Initial vector: ";
    for (const auto& element : v) {
        std::cout << element << " ";
    }

    // Insert an element at the beginning of the vector
    v.insert(v.begin(), 0);

    std::cout << "\nVector after inserting 0: ";
    for (const auto& element : v) {
        std::cout << element << " ";
    }

    return 0;
}

List 📝

A list is a double-ended, dynamic sequence container that allows fast insertion and deletion of elements at any position.

Example:

cpp

#include <iostream>
#include <list>

int main() {
    std::list<int> l = {1, 2, 3, 4, 5};

    std::cout << "Initial list: ";
    for (const auto& element : l) {
        std::cout << element << " ";
    }

    // Insert an element at position 3
    l.insert(l.begin() + 3, 100);

    std::cout << "\nList after inserting 100: ";
    for (const auto& element : l) {
        std::cout << element << " ";
    }

    return 0;
}

Deque 📝

A deque (double-ended queue) is a sequence container that offers fast insertion and deletion at both ends. It is particularly useful when dealing with data structures that require frequent additions and removals from the front and back.

Example:

cpp

#include <iostream>
#include <deque>

int main() {
    std::deque<int> d = {1, 2, 3, 4, 5};

    std::cout << "Initial deque: ";
    for (const auto& element : d) {
        std::cout << element << " ";
    }

    // Insert an element at the back of the deque
    d.push_back(100);

    std::cout << "\nDeque after inserting 100: ";
    for (const auto& element : d) {
        std::cout << element << " ";
    }

    return 0;
}

Quiz:

Stay tuned for the next part of this lesson, where we will explore associative containers and container adapters! 🤖🎯

Remember to come back to CodeYourCraft for more educational content on C++ STL containers. Happy learning, and see you soon! 🚀💪💻