What are some examples of using std::deque in C++11?

Can you give me some examples of using std::deque in C++11?

Sure! The std::deque is a double-ended queue that allows fast insertions and deletions at both ends. Here's a simple example:

#include <iostream>
#include <deque>

int main() {
    std::deque<int> d;
    d.push_back(1);  // Add to the back
    d.push_front(2); // Add to the front
    d.push_back(3);

    std::cout << "Deque elements: ";
    for (int n : d) {
        std::cout << n << ' '; // Output: 2 1 3
    }
    return 0;
}

What are the advantages of using std::deque over std::vector?

The main advantages of std::deque over std::vector are:

1. Fast insertions and deletions at both ends.
2. No need to reallocate memory when adding elements at the front.
3. Better performance for certain use cases where frequent additions/removals occur at both ends.

Can you show me how to iterate through a std::deque?

Certainly! You can iterate through a std::deque using a range-based for loop or an iterator. Here's an example using a range-based for loop:

for (const auto& elem : d) {
    std::cout << elem << ' ';
}

Are there any specific use cases where std::deque is preferred?

Yes, std::deque is preferred in scenarios where you need to frequently add or remove elements from both ends, such as implementing a queue or a double-ended queue. It's also useful in applications where you need to maintain a list of items that can grow and shrink dynamically.