C++11: std::deque vs std::vector

What are the main differences between std::deque and std::vector in C++11?

The main differences include memory allocation, performance for insertions/deletions, and access patterns. std::vector is better for contiguous memory and random access, while std::deque allows efficient insertions and deletions at both ends.

When should I use std::deque instead of std::vector?

Use std::deque when you need to frequently add or remove elements from both ends of the container. It's optimized for such operations.

Are there any performance trade-offs I should be aware of?

Yes, std::vector generally has better cache performance due to contiguous memory, while std::deque may have overhead due to its segmented structure.

Can you give an example of when to choose one over the other?

Sure! If you're implementing a queue where you need to add and remove elements from both ends, std::deque is ideal. For a simple list of items where you mostly access elements by index, std::vector is preferable.