C++ Double-Ended Queues
优质
小牛编辑
120浏览
2023-12-01
C++ Double Ended Queues
| Operators | compare and assign dequeues |
| assign() | set the values of the dequeue |
| at() | returns a specific element |
| back() | returns the last element |
| begin() | returns an iterator to the first element |
| clear() | remove all elements |
| empty() | true if the dequeue is empty |
| end() | returns an iterator to the end of the queue |
| erase() | removes an element |
| front() | returns the first element |
| get_allocator() | returns the dequeue's allocator |
| insert() | insert elements into the dequeue |
| max_size() | returns the maximum elements that the dequeue can hold |
| pop_back() | removes the last element |
| pop_front() | removes the first element |
| push_back() | add an element to the end of the dequeue |
| push_front() | add an element to the front of the dequeue |
| rbegin() | returns a reverse iterator to the end of the dequeue |
| rend() | returns a reverse iterator to the beginning of the dequeue |
| resize() | change the size of the dequeue |
| size() | return the number of elements in the dequeue |
| swap() | swap one dequeue with another |