⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 container_operators.html

📁 从www.CppReference.com打包的C++参考手册
💻 HTML
字号:
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head>  <meta name="generator" content=  "HTML Tidy for Linux/x86 (vers 1 September 2005), see www.w3.org">  <title>Container operators</title>  <link href="../cppreference.css" rel="stylesheet" type="text/css"></head><body><table>  <tr>  <td>  <div class="body-content">  <div class="header-box">    <a href="../index.html">cppreference.com</a> &gt; <a href=    "index.html">C++ Double-ended Queues</a> &gt; <a href=    "container_operators.html">Container operators</a>  </div>  <div class="name-format">    Container operators  </div>  <div class="syntax-name-format">    Syntax:  </div>  <pre class="syntax-box">  #include &lt;deque&gt;  <a href="../containers.html">TYPE</a>&amp; operator[]( <strong>size_type</strong> index );  const <a href="../containers.html">TYPE</a>&amp; operator[]( <strong>size_type</strong> index ) const;  container operator=(const container&amp; c2);  bool operator==(const container&amp; c1, const container&amp; c2);  bool operator!=(const container&amp; c1, const container&amp; c2);  bool operator&lt;(const container&amp; c1, const container&amp; c2);  bool operator&gt;(const container&amp; c1, const container&amp; c2);  bool operator&lt;=(const container&amp; c1, const container&amp; c2);  bool operator&gt;=(const container&amp; c1, const container&amp; c2);</pre>  <p>All of the C++ containers can be compared and assigned with the  standard comparison operators: ==, !=, &lt;=, &gt;=, &lt;, &gt;, and  =. Individual elements of a dequeue can be examined with the []  operator.</p>  <p>Performing a comparison or assigning one dequeue to another takes  <a href="../complexity.html">linear time</a>. The [] operator runs in  <a href="../complexity.html">constant time</a>.</p>  <p>Two `containers` are equal if:</p>  <ol>    <li>Their size is the same, and</li>    <li>Each member in location i in one dequeue is equal to the the    member in location i in the other dequeue.</li>  </ol>  <p>Comparisons among dequeues are done lexicographically.</p>  <p>For example, the following code uses the [] operator to access all  of the elements of a vector:</p>  <pre class="example-code"> vector&lt;int&gt; v( 5, 1 ); for( int i = 0; i &lt; v.size(); i++ ) {   cout &lt;&lt; &quot;Element &quot; &lt;&lt; i &lt;&lt; &quot; is &quot; &lt;&lt; v[i] &lt;&lt; endl; }              </pre>  <div class="related-name-format">    Related topics:  </div>  <div class="related-content">    <a href="at.html">at</a>  </div>  </div>  </td>    </tr>  </table></body></html>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -