pop_heap.html

来自「从www.CppReference.com打包的C++参考手册」· HTML 代码 · 共 65 行

HTML
65 行
字号 
<!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>pop_heap</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++ Algorithms</a> &gt; <a href=    "pop_heap.html">pop_heap</a>  </div>  <div class="name-format">    pop_heap  </div>  <div class="syntax-name-format">    Syntax:  </div>  <pre class="syntax-box">  #include &lt;algorithm&gt;  void pop_heap( iterator start, iterator end );  void pop_heap( iterator start, iterator end, StrictWeakOrdering cmp );</pre>  <p>The pop_heap() function removes the larges element (defined as the  element at the front of the heap) from the given heap.</p>  <p>If the strict weak ordering comparison function object  <em>cmp</em> is given, then it is used instead of the &lt; operator  to compare elements.</p>  <p>pop_heap() runs in <a href="../complexity.html">logarithmic  time</a>.</p>  <div class="related-name-format">    Related topics:  </div>  <div class="related-content">    <a href="is_heap.html">is_heap</a><br>    <a href="make_heap.html">make_heap</a><br>    <a href="push_heap.html">push_heap</a><br>    <a href="sort_heap.html">sort_heap</a>  </div>  </div>  </td>    </tr>  </table></body></html>

pop_heap.html - 源码说明

本页面展示了「从www.CppReference.com打包的C++参考手册」中的 pop_heap.html 源码文件，采用 HTML 编程语言编写，共 65 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与CppReference相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

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