| 3 | #include <deque> |
| 4 | |
| 5 | int main() |
| 6 | { |
| 7 | std::deque<int> my_deque; // A deque<> allows efficient insertions |
| 8 | my_deque.push_back(2); // to both ends of the sequence |
| 9 | my_deque.push_back(4); |
| 10 | my_deque.push_front(1); |
| 11 | |
| 12 | my_deque[2] = 3; // A deque<> is a random-access sequence container |
| 13 | |
| 14 | std::cout << "There are " << my_deque.size() << " elements in my_deque: "; |
| 15 | |
| 16 | for (int element : my_deque) // A deque<>, like all containers, is a range |
| 17 | std::cout << element << ' '; |
| 18 | std::cout << std::endl; |
| 19 | } |
nothing calls this directly
no test coverage detected