Deque or Double ended queues are sequence containers with the feature of expansion and contraction on both the ends. They are similar to vectors, but are more efficient in case of insertion and deletion of elements at the end, and also the beginning. Unlike vectors, contiguous storage allocation may not be guaranteed.
This operator is used to assign new contents to the container by replacing the existing contents.
It also modifies the size according to the new contents.
dequename1 = (dequename2) Parameters : Another container of the same type. Result : Assign the contents of the container passed as parameter to the container written on left side of the operator.
Input : mydeque1 = 1, 2, 3 mydeque2 = 3, 2, 1, 4 mydeque1 = mydeque2; Output : mydeque1 = 3, 2, 1, 4 Input : mydeque1 = 2, 6, 1, 5 mydeque2 = 3, 2 mydeque1 = mydeque2; Output : mydeque1 = 3, 2
Errors and Exceptions
1. If the containers are of different types, an error is thrown.
2. It has a basic no exception throw guarantee otherwise.
mydeque1= 3 2 1 4
This operator is used to reference the element present at position given inside the operator. It is similar to the at() function, the only difference is that the at() function throws an out-of-range exception when the position is not in the bounds of the size of deque, while this operator causes undefined behaviour.
dequename[position] Parameters : Position of the element to be fetched. Returns : Direct reference to the element at the given position.
Input : mydeque = 1, 2, 3 mydeque; Output : 3 Input : mydeque = 3, 4, 1, 7, 3 mydeque; Output : 7
Errors and Exceptions
1. If the position is not present in the deque, it shows undefined behaviour.
2. It has a no exception throw guarantee otherwise.
Given a deque of integers, print all the integers present at even positions.
Input :1, 2, 3, 4, 5, 6, 7, 8, 9 Output :1 3 5 7 9 Explanation - 1, 3, 5, 7 and 9 are at position 0, 2, 4, 6 and 8 which are even
1. Run a loop till the size of the array.
2. Check if the position is divisible by 2, if yes, print the element at that position.
1 3 5 7 9
- Level order traversal in spiral form | Using Deque
- cin get() in C++ with Examples
- Difference between Increment and Decrement Operators
- Map of Vectors in C++ STL with Examples
- Problem in comparing Floating point numbers and how to compare them correctly?
- exit(0) vs exit(1) in C/C++ with Examples
- C++ program to print all Even and Odd numbers from 1 to N
- Reverse the content of a file and store it in another
- Minimum cells to be flipped to get a 2*2 submatrix with equal elements
- Reverse a singly Linked List in groups of given size | Set 3
- Nested Loops in C++ with Examples
- _Find_first() function in C++ bitset with Examples
- _Find_next() function in C++ bitset with Examples
- Left-Right traversal of all the levels of N-ary tree
- Difference between Iterators and Pointers in C/C++ with Examples
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.