What are the key features of std::list in C++11?

What are the key features of std::list in C++11?

std::list in C++11 is a doubly linked list that allows for efficient insertions and deletions. It supports dynamic size and provides iterators.

How does std::list differ from std::vector?

Unlike std::vector, std::list allows for constant time insertions and deletions from anywhere in the list, but it does not provide random access.

Can you give an example of how to use std::list?

Sure! Here's a simple example:

#include <list>
#include <iostream>

int main() {
    std::list<int> myList = {1, 2, 3};
    myList.push_back(4);
    for (int n : myList) {
        std::cout << n << ' ';
    }
}

This code initializes a list and adds an element to it.

What are some common use cases for std::list?

Common use cases include scenarios where frequent insertions and deletions are required, such as implementing queues or stacks.