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

📄 priority_queue_contstruct.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>Priority queue constructors</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++ Priority Queues</a> &gt; <a href=    "priority_queue_contstruct.html">Priority queue constructors</a>  </div>  <div class="name-format">    Priority queue constructors  </div>  <div class="syntax-name-format">    Syntax:  </div>  <pre class="syntax-box">  #include &lt;queue&gt;  priority_queue( const Compare&amp; cmp = Compare(), const Container&amp; c = Container() );  priority_queue( <a href="../iterators.html">input_iterator</a> start, <a href="../iterators.html">input_iterator</a> end, const Compare&amp; comp = Compare(), const Container&amp; c = Container() );</pre>  <p>Priority queues can be constructed with an optional compare  function <em>cmp</em> and an optional container <em>c</em>. If  <em>start</em> and <em>end</em> are specified, the priority queue  will be constructed with the elements between <em>start</em> and  <em>end</em>.</p>  </div>  </td>    </tr>  </table></body></html>

⌨️ 快捷键说明

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