120 lines
8.2 KiB
HTML
120 lines
8.2 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::swap(std::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_swap2 skin-cppreference2 action-view cpp-page-template 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::</span>swap<small>(std::priority_queue)</small></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">
|
|
<div class="t-page-template" style="">
|
|
<p></p>
|
|
</div>
|
|
<table class="t-dcl-begin">
|
|
<tbody>
|
|
<tr class="t-dsc-header">
|
|
<td>
|
|
<div>定义于头文件 <code><a href="cpp-header-queue.html"><queue></a></code></div>
|
|
</td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
</tbody>
|
|
<tbody class="t-dcl-rev">
|
|
<tr class="t-dcl t-since-cxx11 t-until-cxx17">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> T, <span class="kw1">class</span> Container, <span class="kw1">class</span> Compare <span class="sy1">></span><br /></span>
|
|
<p><span class="kw4">void</span> swap<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>T,Container,Compare<span class="sy1">></span><span class="sy3">&</span> lhs,<br /></p>
|
|
<a href="cpp-container-priority_queue.html"><span class="kw1299">std::<span class="me2">priority_queue</span></span></a><span class="sy1"><</span>T,Container,Compare<span class="sy1">></span><span class="sy3">&</span> rhs <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><br />
|
|
<span class="t-mark-rev t-until-cxx17">(C++17 前)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx17">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> T, <span class="kw1">class</span> Container, <span class="kw1">class</span> Compare <span class="sy1">></span><br /></span>
|
|
<p><span class="kw4">void</span> swap<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>T,Container,Compare<span class="sy1">></span><span class="sy3">&</span> lhs,<br /></p>
|
|
<a href="cpp-container-priority_queue.html"><span class="kw1299">std::<span class="me2">priority_queue</span></span></a><span class="sy1"><</span>T,Container,Compare<span class="sy1">></span><span class="sy3">&</span> rhs <span class="br0">)</span> <span class="kw1">noexcept</span><span class="br0">(</span><span class="coMULTI">/* see below */</span><span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-since-cxx17">(C++17 起)</span></td>
|
|
</tr>
|
|
</tbody>
|
|
<tbody>
|
|
<tr class="t-dcl-sep">
|
|
<td></td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<p>为 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-container-priority_queue.html"><span class="kw1299">std::<span class="me2">priority_queue</span></span></a></span></span> 特化 <span class="t-lc"><a href="cpp-algorithm-swap.html">std::swap</a></span> 算法。交换 <code>lhs</code> 与 <code>rhs</code> 的内容。调用 <span class="t-c"><span class="mw-geshi cpp source-cpp">lhs.<span class="me1">swap</span><span class="br0">(</span>rhs<span class="br0">)</span></span></span> 。</p>
|
|
<table class="t-rev-begin">
|
|
<tr class="t-rev t-since-cxx17">
|
|
<td>
|
|
<p>此重载仅若 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-types-is_swappable.html"><span class="kw573">std::<span class="me2">is_swappable_v</span></span></a><span class="sy1"><</span>Container<span class="sy1">></span></span></span> 与 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-types-is_swappable.html"><span class="kw573">std::<span class="me2">is_swappable_v</span></span></a><span class="sy1"><</span>Compare<span class="sy1">></span></span></span> 均为 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">true</span></span></span> 才参与重载决议。</p>
|
|
</td>
|
|
<td><span class="t-mark-rev t-since-cxx17">(C++17 起)</span></td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E5.8F.82.E6.95.B0">参数</span></h3>
|
|
<table class="t-par-begin">
|
|
<tr class="t-par">
|
|
<td>lhs, rhs</td>
|
|
<td>-</td>
|
|
<td>要交换内容的容器</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E8.BF.94.E5.9B.9E.E5.80.BC">返回值</span></h3>
|
|
<p>（无）</p>
|
|
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<p>与交换底层容器相同。</p>
|
|
<h3><span class="mw-headline" id=".E5.BC.82.E5.B8.B8">异常</span></h3>
|
|
<table class="t-rev-begin">
|
|
<tr class="t-rev t-since-cxx17">
|
|
<td>
|
|
<div class="t-noexcept-full"><a href="cpp-language-noexcept_spec.html"><tt>noexcept</tt></a> 说明：
|
|
<div class="t-noexcept-box"><span class="t-cc"><span class="mw-geshi cpp source-cpp"><span class="kw1">noexcept</span><span class="br0">(</span><span class="kw1">noexcept</span><span class="br0">(</span>lhs.<span class="me1">swap</span><span class="br0">(</span>rhs<span class="br0">)</span><span class="br0">)</span><span class="br0">)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td><span class="t-mark-rev t-since-cxx17">(C++17 起)</span></td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E6.B3.A8.E8.A7.A3">注解</span></h3>
|
|
<p>尽管 <span class="t-lc"><a href="cpp-algorithm-swap.html">std::swap</a></span> 对容器适配器的重载是在 C++11 引入的， C++98 中已能用 <span class="t-lc"><a href="cpp-algorithm-swap.html">std::swap</a></span> 交换容器适配器。这种 <span class="t-lc"><a href="cpp-algorithm-swap.html">std::swap</a></span> 调用通常拥有线性时间复杂度，但可以提供更好的复杂度。</p>
|
|
<h3><span class="mw-headline" id=".E7.A4.BA.E4.BE.8B">示例</span></h3>
|
|
<table class="metadata plainlinks ambox mbox-small-left ambox-notice" style="">
|
|
<tr>
|
|
<td class="mbox-empty-cell"></td>
|
|
<td class="mbox-text" style="">本节未完成<br />
|
|
原因：暂无示例</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-swap.html"><span class="t-lines"><span>swap</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>交换内容<br />
|
|
<span class="t-mark">(公开成员函数)</span></td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|