📄 cppdeque.html
字号:
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html> <head> <meta name="generator" content="HTML Tidy for Linux/x86 (vers 1st October 2002), see www.w3.org"> <title>C++ Double-Ended Queues</title> </head> <body bgcolor="#ffffff"> <table width="100%" bgcolor="#eeeeff"> <tr> <td><a href="index.html">cppreference.com</a> -> C++ Double-Ended Queues</td> </tr> </table> <h3>C++ Double Ended Queues</h3> <p>Double-ended queues are like <a href="cppvector.html">vectors</a>, except that they allow fast insertions and deletions at the beginning (as well as the end) of the container.</p> <table> <tr> <td><a href="cppdeque_details.html#Constructors">Constructors</a></td> <td>create new deques</td> </tr> <tr bgcolor="#eeeeff"> <td><a href="cppdeque_details.html#Operators">Operators</a></td> <td>compare and assign deques</td> </tr> <tr> <td><a href="cppdeque_details.html#assign">assign()</a></td> <td>set the values of the deque</td> </tr> <tr bgcolor="#eeeeff"> <td><a href="cppdeque_details.html#at">at()</a></td> <td>returns a specific element</td> </tr> <tr> <td><a href="cppdeque_details.html#back">back()</a></td> <td>returns the last element</td> </tr> <tr bgcolor="#eeeeff"> <td><a href="cppdeque_details.html#begin">begin()</a></td> <td>returns an iterator to the first element</td> </tr> <tr> <td><a href="cppdeque_details.html#clear">clear()</a></td> <td>remove all elements</td> </tr> <tr bgcolor="#eeeeff"> <td><a href="cppdeque_details.html#empty">empty()</a></td> <td>true if the deque is empty</td> </tr> <tr> <td><a href="cppdeque_details.html#end">end()</a></td> <td>returns an iterator to the end of the queue</td> </tr> <tr bgcolor="#eeeeff"> <td><a href="cppdeque_details.html#erase">erase()</a></td> <td>removes an element</td> </tr> <tr> <td><a href="cppdeque_details.html#front">front()</a></td> <td>returns the first element</td> </tr> <tr bgcolor="#eeeeff"> <td><a href="cppdeque_details.html#get_allocator">get_allocator()</a></td> <td>returns the deque's allocator</td> </tr> <tr> <td><a href="cppdeque_details.html#insert">insert()</a></td> <td>insert elements into the deque</td> </tr> <tr bgcolor="#eeeeff"> <td><a href="cppdeque_details.html#max_size">max_size()</a></td> <td>returns the maximum elements that the deque can hold</td> </tr> <tr> <td><a href="cppdeque_details.html#pop_back">pop_back()</a></td> <td>removes the last element</td> </tr> <tr bgcolor="#eeeeff"> <td><a href="cppdeque_details.html#pop_front">pop_front()</a></td> <td>removes the first element</td> </tr> <tr> <td><a href="cppdeque_details.html#push_back">push_back()</a></td> <td>add an element to the end of the deque</td> </tr> <tr bgcolor="#eeeeff"> <td><a href="cppdeque_details.html#push_front">push_front()</a></td> <td>add an element to the front of the deque</td> </tr> <tr> <td><a href="cppdeque_details.html#rbegin">rbegin()</a></td> <td>returns a reverse iterator to the end of the deque</td> </tr> <tr bgcolor="#eeeeff"> <td><a href="cppdeque_details.html#rend">rend()</a></td> <td>returns a reverse iterator to the beginning of the deque</td> </tr> <tr> <td><a href="cppdeque_details.html#resize">resize()</a></td> <td>change the size of the deque</td> </tr> <tr bgcolor="#eeeeff"> <td><a href="cppdeque_details.html#size">size()</a></td> <td>return the number of elements in the deque</td> </tr> <tr> <td><a href="cppdeque_details.html#swap">swap()</a></td> <td>swap one deque with another</td> </tr> </table> </body></html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -