416 lines
48 KiB
HTML
416 lines
48 KiB
HTML
<!DOCTYPE html>
|
|
<html lang="zh" dir="ltr" class="client-nojs" xmlns="http://www.w3.org/1999/xhtml" xml:lang="zh">
|
|
<head><meta http-equiv="x-ua-compatible" content="ie=edge">
|
|
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
|
|
<title>std::priority_queue<T,Container,Compare>::priority_queue</title>
|
|
<link rel="stylesheet" href="ext.css" />
|
|
<link rel="stylesheet" href="site_modules.css" />
|
|
</head>
|
|
<body class="mediawiki ltr sitedir-ltr ns-0 ns-subject page-cpp_container_priority_queue_priority_queue skin-cppreference2 action-view cpp-navbar">
|
|
<div id="cpp-content-base">
|
|
<div id="content"><a id="top"></a>
|
|
<h1 id="firstHeading" class="firstHeading"><span style="font-size:0.7em; line-height:130%">std::priority_queue<T,Container,Compare>::</span>priority_queue</h1>
|
|
<div id="bodyContent">
|
|
<div id="contentSub"><span class="subpages">< <a href="cpp.html">cpp</a>‎ | <a href="cpp-container.html">container</a>‎ | <a href="cpp-container-priority_queue.html">priority queue</a></span></div>
|
|
<div id="mw-content-text" lang="zh" dir="ltr" class="mw-content-ltr" xml:lang="zh">
|
|
<table class="t-dcl-begin">
|
|
<tbody>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp">priority_queue<span class="br0">(</span><span class="br0">)</span> <span class="sy4">:</span> priority_queue<span class="br0">(</span>Compare<span class="br0">(</span><span class="br0">)</span>, Container<span class="br0">(</span><span class="br0">)</span><span class="br0">)</span> <span class="br0">{</span> <span class="br0">}</span></span></div>
|
|
</td>
|
|
<td>(1)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">explicit</span> priority_queue<span class="br0">(</span> <span class="kw4">const</span> Compare<span class="sy3">&</span> compare <span class="br0">)</span><br />
|
|
<span class="sy4">:</span> priority_queue<span class="br0">(</span>compare, Container<span class="br0">(</span><span class="br0">)</span><span class="br0">)</span> <span class="br0">{</span> <span class="br0">}</span></span></div>
|
|
</td>
|
|
<td>(2)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
</tbody>
|
|
<tbody class="t-dcl-rev t-dcl-rev-num">
|
|
<tr class="t-dcl-rev-aux">
|
|
<td></td>
|
|
<td rowspan="142">(3)</td>
|
|
<td></td>
|
|
</tr>
|
|
<tr class="t-dcl t-until-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">explicit</span> priority_queue<span class="br0">(</span> <span class="kw4">const</span> Compare<span class="sy3">&</span> compare <span class="sy1">=</span> Compare<span class="br0">(</span><span class="br0">)</span>,<br />
|
|
<span class="kw4">const</span> Container<span class="sy3">&</span> cont <span class="sy1">=</span> Container<span class="br0">(</span><span class="br0">)</span> <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-until-cxx11">(C++11 前)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp">priority_queue<span class="br0">(</span> <span class="kw4">const</span> Compare<span class="sy3">&</span> compare, <span class="kw4">const</span> Container<span class="sy3">&</span> cont <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
</tbody>
|
|
<tbody>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp">priority_queue<span class="br0">(</span> <span class="kw4">const</span> Compare<span class="sy3">&</span> compare, Container<span class="sy3">&&</span> cont <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(4)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp">priority_queue<span class="br0">(</span> <span class="kw4">const</span> priority_queue<span class="sy3">&</span> other <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(5)</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp">priority_queue<span class="br0">(</span> priority_queue<span class="sy3">&&</span> other <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(6)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> InputIt <span class="sy1">></span><br /></span>
|
|
<p>priority_queue<span class="br0">(</span> InputIt first, InputIt last,<br /></p>
|
|
<span class="kw4">const</span> Compare<span class="sy3">&</span> compare <span class="sy1">=</span> Compare<span class="br0">(</span><span class="br0">)</span> <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(7)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
</tbody>
|
|
<tbody class="t-dcl-rev t-dcl-rev-num">
|
|
<tr class="t-dcl-rev-aux">
|
|
<td></td>
|
|
<td rowspan="142">(8)</td>
|
|
<td></td>
|
|
</tr>
|
|
<tr class="t-dcl t-until-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> InputIt <span class="sy1">></span><br /></span>
|
|
<p>priority_queue<span class="br0">(</span> InputIt first, InputIt last,<br />
|
|
<span class="kw4">const</span> Compare<span class="sy3">&</span> compare <span class="sy1">=</span> Compare<span class="br0">(</span><span class="br0">)</span>,<br /></p>
|
|
<span class="kw4">const</span> Container<span class="sy3">&</span> cont <span class="sy1">=</span> Container<span class="br0">(</span><span class="br0">)</span> <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-until-cxx11">(C++11 前)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> InputIt <span class="sy1">></span><br /></span>
|
|
<p>priority_queue<span class="br0">(</span> InputIt first, InputIt last,<br /></p>
|
|
<span class="kw4">const</span> Compare<span class="sy3">&</span> compare, <span class="kw4">const</span> Container<span class="sy3">&</span> cont <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
</tbody>
|
|
<tbody>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> InputIt <span class="sy1">></span><br /></span>
|
|
<p>priority_queue<span class="br0">(</span> InputIt first, InputIt last,<br /></p>
|
|
<span class="kw4">const</span> Compare<span class="sy3">&</span> compare, Container<span class="sy3">&&</span> cont <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(9)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> Alloc <span class="sy1">></span><br />
|
|
<span class="kw1">explicit</span> priority_queue<span class="br0">(</span> <span class="kw4">const</span> Alloc<span class="sy3">&</span> alloc <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(10)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> Alloc <span class="sy1">></span><br />
|
|
priority_queue<span class="br0">(</span> <span class="kw4">const</span> Compare<span class="sy3">&</span> compare, <span class="kw4">const</span> Alloc<span class="sy3">&</span> alloc <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(11)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> Alloc <span class="sy1">></span><br /></span>
|
|
<p>priority_queue<span class="br0">(</span> <span class="kw4">const</span> Compare<span class="sy3">&</span> compare, <span class="kw4">const</span> Container<span class="sy3">&</span> cont,<br /></p>
|
|
<span class="kw4">const</span> Alloc<span class="sy3">&</span> alloc <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(12)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> Alloc <span class="sy1">></span><br /></span>
|
|
<p>priority_queue<span class="br0">(</span> <span class="kw4">const</span> Compare<span class="sy3">&</span> compare, Container<span class="sy3">&&</span> cont,<br /></p>
|
|
<span class="kw4">const</span> Alloc<span class="sy3">&</span> alloc <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(13)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> Alloc <span class="sy1">></span><br />
|
|
priority_queue<span class="br0">(</span> <span class="kw4">const</span> priority_queue<span class="sy3">&</span> other, <span class="kw4">const</span> Alloc<span class="sy3">&</span> alloc <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(14)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> Alloc <span class="sy1">></span><br />
|
|
priority_queue<span class="br0">(</span> priority_queue<span class="sy3">&&</span> other, <span class="kw4">const</span> Alloc<span class="sy3">&</span> alloc <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(15)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> InputIt, <span class="kw1">class</span> Alloc <span class="sy1">></span><br />
|
|
priority_queue<span class="br0">(</span> InputIt first, InputIt last, <span class="kw4">const</span> Alloc<span class="sy3">&</span> alloc <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(16)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> InputIt, <span class="kw1">class</span> Alloc <span class="sy1">></span><br /></span>
|
|
<p>priority_queue<span class="br0">(</span> InputIt first, InputIt last, <span class="kw4">const</span> Compare<span class="sy3">&</span> compare,<br /></p>
|
|
<span class="kw4">const</span> Alloc<span class="sy3">&</span> alloc <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(17)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> InputIt, <span class="kw1">class</span> Alloc <span class="sy1">></span><br /></span>
|
|
<p>priority_queue<span class="br0">(</span> InputIt first, InputIt last, <span class="kw4">const</span> Compare<span class="sy3">&</span> compare,<br /></p>
|
|
<span class="kw4">const</span> Container<span class="sy3">&</span> cont, <span class="kw4">const</span> Alloc<span class="sy3">&</span> alloc <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(18)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> InputIt, <span class="kw1">class</span> Alloc <span class="sy1">></span><br /></span>
|
|
<p>priority_queue<span class="br0">(</span> InputIt first, InputIt last, <span class="kw4">const</span> Compare<span class="sy3">&</span> compare,<br /></p>
|
|
Container<span class="sy3">&&</span> cont, <span class="kw4">const</span> Alloc<span class="sy3">&</span> alloc <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(19)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl-sep">
|
|
<td></td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<p>从多种数据源构造容器适配器的底层容器。</p>
|
|
<div class="t-li1"><span class="t-li">1)</span> 默认构造函数。值初始化底层容器。</div>
|
|
<div class="t-li1"><span class="t-li">2)</span> 用 <code>compare</code> 的内容复制构造比较函数对象 <code>comp</code> 。值初始化底层容器 <code>c</code> 。</div>
|
|
<div class="t-li1"><span class="t-li">3)</span> 用 <code>cont</code> 的内容复制构造底层容器 <code>c</code> 。用 <code>compare</code> 的内容复制构造比较函数对象 <code>comp</code> 。调用 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-algorithm-make_heap.html"><span class="kw1636">std::<span class="me2">make_heap</span></span></a><span class="br0">(</span>c.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, c.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, comp<span class="br0">)</span></span></span> 。<span class="t-rev-inl t-until-cxx11"><span>此亦为默认构造函数。</span> <span><span class="t-mark-rev t-until-cxx11">(C++11 前)</span></span></span></div>
|
|
<div class="t-li1"><span class="t-li">4)</span> 用 <span class="t-c"><span class="mw-geshi cpp source-cpp">std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>cont<span class="br0">)</span></span></span> 移动构造底层容器 <code>c</code> 。以 <code>compare</code> 的内容复制构造比较函数对象 <code>comp</code> 。调用 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-algorithm-make_heap.html"><span class="kw1636">std::<span class="me2">make_heap</span></span></a><span class="br0">(</span>c.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, c.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, comp<span class="br0">)</span></span></span> 。</div>
|
|
<div class="t-li1"><span class="t-li">5)</span> 复制构造函数。以 <span class="t-c"><span class="mw-geshi cpp source-cpp">other.<span class="me1">c</span></span></span> 的内容复制构造底层容器。以 <span class="t-c"><span class="mw-geshi cpp source-cpp">other.<span class="me1">comp</span></span></span> 复制构造比较函数对象。 <span class="t-mark">(隐式声明)</span></div>
|
|
<div class="t-li1"><span class="t-li">6)</span> 移动构造函数。以 <span class="t-c"><span class="mw-geshi cpp source-cpp">std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>other.<span class="me1">c</span><span class="br0">)</span></span></span> 构造底层容器。以 <span class="t-c"><span class="mw-geshi cpp source-cpp">std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>other.<span class="me1">comp</span><span class="br0">)</span></span></span> 构造比较函数对象。 <span class="t-mark">(隐式声明)</span></div>
|
|
<div class="t-li1"><span class="t-li">7-9)</span> 迭代器对构造函数。这些重载仅若 <code>InputIt</code> 满足<a href="cpp-named_req-InputIterator.html"><span style="font-style:italic">老式输入迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyInputIterator)</span></a> 才参与重载决议。</div>
|
|
<div class="t-li1"><span class="t-li">7)</span> 如同用 <span class="t-c"><span class="mw-geshi cpp source-cpp">c<span class="br0">(</span>first, last<span class="br0">)</span></span></span> 构造 <code>c</code> 并从 <code>compare</code> 构造 <code>comp</code> ，然后调用 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-algorithm-make_heap.html"><span class="kw1636">std::<span class="me2">make_heap</span></span></a><span class="br0">(</span>c.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, c.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, comp<span class="br0">)</span><span class="sy4">;</span></span></span> 。</div>
|
|
<div class="t-li1"><span class="t-li">8)</span> 从 <code>cont</code> 复制构造 <code>c</code> 并从 <code>compare</code> 复制构造 <code>comp</code> 。然后调用 <span class="t-c"><span class="mw-geshi cpp source-cpp">c.<span class="me1">insert</span><span class="br0">(</span>c.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, first, last<span class="br0">)</span><span class="sy4">;</span></span></span> ，再调用 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-algorithm-make_heap.html"><span class="kw1636">std::<span class="me2">make_heap</span></span></a><span class="br0">(</span>c.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, c.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, comp<span class="br0">)</span><span class="sy4">;</span></span></span> 。</div>
|
|
<div class="t-li1"><span class="t-li">9)</span> 从 <span class="t-c"><span class="mw-geshi cpp source-cpp">std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>cont<span class="br0">)</span></span></span> 移动构造 <code>c</code> 并从 <code>compare</code> 复制构造 <code>comp</code> 。然后调用 <span class="t-c"><span class="mw-geshi cpp source-cpp">c.<span class="me1">insert</span><span class="br0">(</span>c.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, first, last<span class="br0">)</span><span class="sy4">;</span></span></span> ，再调用 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-algorithm-make_heap.html"><span class="kw1636">std::<span class="me2">make_heap</span></span></a><span class="br0">(</span>c.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, c.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, comp<span class="br0">)</span><span class="sy4">;</span></span></span> 。</div>
|
|
<div class="t-li1"><span class="t-li">10-15)</span> 分配器扩展构造函数。这些重载仅若 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-memory-uses_allocator.html"><span class="kw704">std::<span class="me2">uses_allocator</span></span></a><span class="sy1"><</span>container_type, Alloc<span class="sy1">></span><span class="sy4">::</span><span class="me2">value</span></span></span> 为 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">true</span></span></span> ，即底层容器为知分配器容器（对所有标准库容器为真）才参与重载决议。</div>
|
|
<div class="t-li1"><span class="t-li">10)</span> 以 <code>alloc</code> 为分配器构造底层容器。等效地调用 <span class="t-c"><span class="mw-geshi cpp source-cpp">c<span class="br0">(</span>alloc<span class="br0">)</span></span></span> 。值初始化 <code>comp</code> 。</div>
|
|
<div class="t-li1"><span class="t-li">11)</span> 以 <code>alloc</code> 为分配器构造底层容器。等效地调用 <span class="t-c"><span class="mw-geshi cpp source-cpp">c<span class="br0">(</span>alloc<span class="br0">)</span></span></span> 。从 <code>compare</code> 复制构造 <code>comp</code> 。</div>
|
|
<div class="t-li1"><span class="t-li">12)</span> 用 <code>cont</code> 的内容，以 <code>alloc</code> 为分配器构造底层容器，如同用 <span class="t-c"><span class="mw-geshi cpp source-cpp">c<span class="br0">(</span>cont, alloc<span class="br0">)</span></span></span> 。从 <code>compare</code> 复制构造 <code>comp</code> 。然后调用 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-algorithm-make_heap.html"><span class="kw1636">std::<span class="me2">make_heap</span></span></a><span class="br0">(</span>c.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, c.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, comp<span class="br0">)</span></span></span> 。</div>
|
|
<div class="t-li1"><span class="t-li">13)</span> 用 <code>cont</code> 的内容，以 <code>alloc</code> 为分配器并以移动语义构造底层容器，如同用 <span class="t-c"><span class="mw-geshi cpp source-cpp">c<span class="br0">(</span>std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>cont<span class="br0">)</span>, alloc<span class="br0">)</span></span></span> 。从 <code>compare</code> 复制构造 <code>comp</code> 。然后调用 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-algorithm-make_heap.html"><span class="kw1636">std::<span class="me2">make_heap</span></span></a><span class="br0">(</span>c.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, c.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, comp<span class="br0">)</span></span></span> 。</div>
|
|
<div class="t-li1"><span class="t-li">14)</span> 用 <code>other.c</code> 的内容，以 <code>alloc</code> 为分配器构造底层容器。等效地调用 <span class="t-c"><span class="mw-geshi cpp source-cpp">c<span class="br0">(</span>other.<span class="me1">c</span>, alloc<span class="br0">)</span></span></span> 。从 <code>other.comp</code> 复制构造 <code>comp</code> 。</div>
|
|
<div class="t-li1"><span class="t-li">15)</span> 用 <code>other</code> 的内容，同时以 <code>alloc</code> 为分配器构造适配器。等效地调用 <span class="t-c"><span class="mw-geshi cpp source-cpp">c<span class="br0">(</span>std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>other.<span class="me1">c</span><span class="br0">)</span>, alloc<span class="br0">)</span></span></span> 。从 <code>other.comp</code> 移动构造 <code>comp</code> 。</div>
|
|
<div class="t-li1"><span class="t-li">16-19)</span> 分配器扩展迭代器对构造函数，同 <span class="t-v">(7-9)</span> ，除了用 <code>alloc</code> 构造底层容器。这些重载仅若 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-memory-uses_allocator.html"><span class="kw704">std::<span class="me2">uses_allocator</span></span></a><span class="sy1"><</span>container_type, Alloc<span class="sy1">></span><span class="sy4">::</span><span class="me2">value</span></span></span> 为 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">true</span></span></span> 且 <code>InputIt</code> 满足<a href="cpp-named_req-InputIterator.html"><span style="font-style:italic">老式输入迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyInputIterator)</span></a> 才参与重载决议。</div>
|
|
<h3><span class="mw-headline" id=".E5.8F.82.E6.95.B0">参数</span></h3>
|
|
<table class="t-par-begin">
|
|
<tr class="t-par">
|
|
<td>alloc</td>
|
|
<td>-</td>
|
|
<td>用于底层容器所有内存分配的分配器</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>other</td>
|
|
<td>-</td>
|
|
<td>用作源初始化底层容器的另一容器适配器</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>cont</td>
|
|
<td>-</td>
|
|
<td>用作源初始化底层容器的容器</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>compare</td>
|
|
<td>-</td>
|
|
<td>用于初始化底层比较函数对象的比较函数对象</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>first, last</td>
|
|
<td>-</td>
|
|
<td>要初始化的元素范围</td>
|
|
</tr>
|
|
<tr class="t-par-hitem">
|
|
<td colspan="3">类型要求</td>
|
|
</tr>
|
|
<tr class="t-par-req">
|
|
<td colspan="3">-
|
|
<div class="spacer"></div>
|
|
<code>Alloc</code> 必须满足<a href="cpp-named_req-Allocator.html"><span style="font-style:italic">分配器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(Allocator)</span></a> 的要求。</td>
|
|
</tr>
|
|
<tr class="t-par-req">
|
|
<td colspan="3">-
|
|
<div class="spacer"></div>
|
|
<code>Container</code> 必须满足<a href="cpp-named_req-Container.html"><span style="font-style:italic">容器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(Container)</span></a> 的要求。仅若 <code>Container</code> 满足<a href="cpp-named_req-AllocatorAwareContainer.html"><span style="font-style:italic">知分配器容器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(AllocatorAwareContainer)</span></a> 的要求才定义分配器扩展构造函数</td>
|
|
</tr>
|
|
<tr class="t-par-req">
|
|
<td colspan="3">-
|
|
<div class="spacer"></div>
|
|
<code>InputIt</code> 必须满足<a href="cpp-named_req-InputIterator.html"><span style="font-style:italic">老式输入迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyInputIterator)</span></a> 的要求。</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<div class="t-li1"><span class="t-li">1-2)</span> 常数。</div>
|
|
<div class="t-li1"><span class="t-li">3,12)</span> <span class="mjax" style="display:none">\(\scriptsize \mathcal{O}{(N)}\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">O(N)</span> 次比较和 <span class="mjax" style="display:none">\(\scriptsize \mathcal{O}{(N)}\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">O(N)</span> 次 <code>value_type</code> 构造函数调用，其中 <span class="mjax" style="display:none">\(\scriptsize N\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">N</span> 为 <span class="t-c"><span class="mw-geshi cpp source-cpp">cont.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span></span></span> 。</div>
|
|
<div class="t-li1"><span class="t-li">4)</span> <span class="mjax" style="display:none">\(\scriptsize \mathcal{O}{(N)}\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">O(N)</span> 次比较，其中 <span class="mjax" style="display:none">\(\scriptsize N\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">N</span> 为 <span class="t-c"><span class="mw-geshi cpp source-cpp">cont.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span></span></span> 。</div>
|
|
<div class="t-li1"><span class="t-li">6)</span> 常数。</div>
|
|
<div class="t-li1"><span class="t-li">7,16-17)</span> <span class="mjax" style="display:none">\(\scriptsize \mathcal{O}{(M)}\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">O(M)</span> 次比较，其中 <span class="mjax" style="display:none">\(\scriptsize M\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">M</span> 为 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>first, last<span class="br0">)</span></span></span> 。</div>
|
|
<div class="t-li1"><span class="t-li">8,18)</span> <span class="mjax" style="display:none">\(\scriptsize \mathcal{O}{(N+M)}\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">O(N+M)</span> 次比较和 <span class="mjax" style="display:none">\(\scriptsize \mathcal{O}{(N)}\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">O(N)</span> 次 <code>value_type</code> 构造函数调用，其中 <span class="mjax" style="display:none">\(\scriptsize N\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">N</span> 与 <span class="mjax" style="display:none">\(\scriptsize M\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">M</span> 分别为 <span class="t-c"><span class="mw-geshi cpp source-cpp">cont.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span></span></span> 与 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>first, last<span class="br0">)</span></span></span> 。</div>
|
|
<div class="t-li1"><span class="t-li">9)</span> <span class="mjax" style="display:none">\(\scriptsize \mathcal{O}{(N)}\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">O(N)</span> 次比较，其中 <span class="mjax" style="display:none">\(\scriptsize N\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">N</span> 为 <span class="t-c"><span class="mw-geshi cpp source-cpp">cont.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span> <span class="sy2">+</span> <a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>first, last<span class="br0">)</span></span></span> 。</div>
|
|
<div class="t-li1"><span class="t-li">10-11)</span> 常数。</div>
|
|
<div class="t-li1"><span class="t-li">12)</span> <span class="mjax" style="display:none">\(\scriptsize \mathcal{O}{(N)}\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">O(N)</span> 次比较和 <span class="mjax" style="display:none">\(\scriptsize \mathcal{O}{(N)}\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">O(N)</span> 次 <code>value_type</code> 构造函数调用，其中 <span class="mjax" style="display:none">\(\scriptsize N\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">N</span> 为 <span class="t-c"><span class="mw-geshi cpp source-cpp">cont.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span></span></span> 。</div>
|
|
<div class="t-li1"><span class="t-li">13)</span> <span class="mjax" style="display:none">\(\scriptsize \mathcal{O}{(N)}\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">O(N)</span> 次比较，其中 <span class="mjax" style="display:none">\(\scriptsize N\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">N</span> 为 <span class="t-c"><span class="mw-geshi cpp source-cpp">cont.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span></span></span> 。</div>
|
|
<div class="t-li1"><span class="t-li">14)</span> 与 <code>other</code> 的大小成线性。</div>
|
|
<div class="t-li1"><span class="t-li">15)</span> 若 <code>Alloc</code> 与 <code>other</code> 的分配器比较相等则为常数。否则与 <code>other</code> 的大小成线性。</div>
|
|
<div class="t-li1"><span class="t-li">19)</span> <span class="mjax" style="display:none">\(\scriptsize \mathcal{O}{(N+M)}\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">O(N+M)</span> 次比较与可能存在的 <span class="mjax" style="display:none">\(\scriptsize \mathcal{O}{(N)}\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">O(N)</span> 次 <code>value_type</code> 构造函数调用（若 <code>Alloc</code> 与 <code>other</code> 的分配器比较不相等则存在），其中 <span class="mjax" style="display:none">\(\scriptsize N\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">N</span> 与 <span class="mjax" style="display:none">\(\scriptsize M\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">M</span> 分别为 <span class="t-c"><span class="mw-geshi cpp source-cpp">cont.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span></span></span> 与 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>first, last<span class="br0">)</span></span></span> 。</div>
|
|
<h3><span class="mw-headline" id=".E7.A4.BA.E4.BE.8B">示例</span></h3>
|
|
<div class="t-example">
|
|
<div class="t-example-live-link"></div>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="cpp source-cpp">
|
|
<pre class="de1"><span class="co2">#include <complex></span>
|
|
<span class="co2">#include <functional></span>
|
|
<span class="co2">#include <iostream></span>
|
|
<span class="co2">#include <queue></span>
|
|
<span class="co2">#include <vector></span>
|
|
|
|
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<a href="cpp-container-priority_queue.html"><span class="kw1299">std::<span class="me2">priority_queue</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span> pq1<span class="sy4">;</span>
|
|
pq1.<span class="me1">push</span><span class="br0">(</span><span class="nu0">5</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"pq1.size() = "</span> <span class="sy1"><<</span> pq1.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
|
|
|
|
<a href="cpp-container-priority_queue.html"><span class="kw1299">std::<span class="me2">priority_queue</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span> pq2 <span class="br0">{</span>pq1<span class="br0">}</span><span class="sy4">;</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"pq2.size() = "</span> <span class="sy1"><<</span> pq2.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
|
|
|
|
<a href="cpp-container-vector.html"><span class="kw1269">std::<span class="me2">vector</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span> vec <span class="br0">{</span><span class="nu0">3</span>, <span class="nu0">1</span>, <span class="nu0">4</span>, <span class="nu0">1</span>, <span class="nu0">5</span><span class="br0">}</span><span class="sy4">;</span>
|
|
<a href="cpp-container-priority_queue.html"><span class="kw1299">std::<span class="me2">priority_queue</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span> pq3 <span class="br0">{</span><a href="cpp-utility-functional-less.html"><span class="kw1039">std::<span class="me2">less</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span><span class="br0">(</span><span class="br0">)</span>, vec<span class="br0">}</span><span class="sy4">;</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"pq3.size() = "</span> <span class="sy1"><<</span> pq3.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">for</span> <span class="br0">(</span><a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"pq3 : "</span><span class="sy4">;</span> <span class="sy3">!</span>pq3.<span class="me1">empty</span><span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span> pq3.<span class="me1">pop</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> pq3.<span class="me1">top</span><span class="br0">(</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">' '</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
|
|
|
|
|
|
<span class="co1">// 带定制比较器的演示：</span>
|
|
|
|
<span class="kw1">using</span> my_value_t <span class="sy1">=</span> <a href="cpp-numeric-complex.html"><span class="kw1472">std::<span class="me2">complex</span></span></a><span class="sy1"><</span><span class="kw4">double</span><span class="sy1">></span><span class="sy4">;</span>
|
|
<span class="kw1">using</span> my_container_t <span class="sy1">=</span> <a href="cpp-container-vector.html"><span class="kw1269">std::<span class="me2">vector</span></span></a><span class="sy1"><</span>my_value_t<span class="sy1">></span><span class="sy4">;</span>
|
|
|
|
<span class="kw4">auto</span> my_comp <span class="sy1">=</span> <span class="br0">[</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">const</span> my_value_t<span class="sy3">&</span> z1, <span class="kw4">const</span> my_value_t<span class="sy3">&</span> z2<span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="kw1">return</span> z2.<span class="me1">real</span><span class="br0">(</span><span class="br0">)</span> <span class="sy1"><</span> z1.<span class="me1">real</span><span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
<a href="cpp-container-priority_queue.html"><span class="kw1299">std::<span class="me2">priority_queue</span></span></a><span class="sy1"><</span>my_value_t,
|
|
my_container_t,
|
|
decltype<span class="br0">(</span>my_comp<span class="br0">)</span><span class="sy1">></span> pq4 <span class="br0">{</span>my_comp<span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">using</span> <span class="kw1">namespace</span> std<span class="sy4">::</span><span class="me2">complex_literals</span><span class="sy4">;</span>
|
|
pq4.<span class="me1">push</span><span class="br0">(</span><span class="nu16">5.0</span> <span class="sy2">+</span> 1i<span class="br0">)</span><span class="sy4">;</span>
|
|
pq4.<span class="me1">push</span><span class="br0">(</span><span class="nu16">3.0</span> <span class="sy2">+</span> 2i<span class="br0">)</span><span class="sy4">;</span>
|
|
pq4.<span class="me1">push</span><span class="br0">(</span><span class="nu16">7.0</span> <span class="sy2">+</span> 3i<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">for</span> <span class="br0">(</span><span class="sy4">;</span> <span class="sy3">!</span>pq4.<span class="me1">empty</span><span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span> pq4.<span class="me1">pop</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<span class="kw4">const</span> <span class="kw4">auto</span><span class="sy3">&</span> z <span class="sy1">=</span> pq4.<span class="me1">top</span><span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"pq4.top() = "</span> <span class="sy1"><<</span> z <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span></pre></div>
|
|
</div>
|
|
<p>输出：</p>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="text source-text">
|
|
<pre class="de1">pq1.size() = 1
|
|
pq2.size() = 1
|
|
pq3.size() = 5
|
|
pq3 : 5 4 3 1 1
|
|
pq4.top() = (3,2)
|
|
pq4.top() = (5,1)
|
|
pq4.top() = (7,3)</pre></div>
|
|
</div>
|
|
</div>
|
|
<h3><span class="mw-headline" id=".E7.BC.BA.E9.99.B7.E6.8A.A5.E5.91.8A">缺陷报告</span></h3>
|
|
<p>下列更改行为的缺陷报告追溯地应用于以前出版的 C++ 标准。</p>
|
|
<table class="dsctable" style="font-size:0.8em">
|
|
<tr>
|
|
<th>DR</th>
|
|
<th>应用于</th>
|
|
<th>出版时的行为</th>
|
|
<th>正确行为</th>
|
|
</tr>
|
|
<tr>
|
|
<td><a rel="nofollow" class="external text" href="https://wg21.link/P0935R0">P0935R0</a></td>
|
|
<td>C++11</td>
|
|
<td>默认构造函数和构造函数 <span class="t-v">(4)</span> 曾为 explicit</td>
|
|
<td>使之为隐式</td>
|
|
</tr>
|
|
<tr>
|
|
<td><a rel="nofollow" class="external text" href="https://cplusplus.github.io/LWG/issue3506">LWG 3506</a></td>
|
|
<td>C++11</td>
|
|
<td>分配器扩展迭代器对构造函数缺失</td>
|
|
<td>已添加</td>
|
|
</tr>
|
|
<tr>
|
|
<td><a rel="nofollow" class="external text" href="https://cplusplus.github.io/LWG/issue3522">LWG 3522</a></td>
|
|
<td>C++11</td>
|
|
<td>迭代器对构造函数上的约束缺失</td>
|
|
<td>已添加</td>
|
|
</tr>
|
|
<tr>
|
|
<td><a rel="nofollow" class="external text" href="https://cplusplus.github.io/LWG/issue3529">LWG 3529</a></td>
|
|
<td>C++11</td>
|
|
<td>从一对迭代器构造调用 <code>insert</code></td>
|
|
<td>从它们构造容器</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E5.8F.82.E9.98.85">参阅</span></h3>
|
|
<table class="t-dsc-begin">
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-container-priority_queue-operator=.html"><span class="t-lines"><span>operator=</span></span></a></div>
|
|
</div>
|
|
</td>
|
|
<td>赋值给容器适配器<br />
|
|
<span class="t-mark">(公开成员函数)</span></td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|