上传cppreference
This commit is contained in:
337
web/cppreference-zh/chmhelp/cpp-container-priority_queue.html
Normal file
337
web/cppreference-zh/chmhelp/cpp-container-priority_queue.html
Normal file
@@ -0,0 +1,337 @@
|
||||
<!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</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 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::</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></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-dsc-header">
|
||||
<td>
|
||||
<div>定义于头文件 <code><a href="cpp-header-queue.html"><queue></a></code></div>
|
||||
</td>
|
||||
<td></td>
|
||||
<td></td>
|
||||
</tr>
|
||||
<tr class="t-dcl">
|
||||
<td class="t-dcl-nopad">
|
||||
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span><br /></span>
|
||||
<p> <span class="kw1">class</span> T,<br />
|
||||
<span class="kw1">class</span> Container <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>T<span class="sy1">></span>,<br />
|
||||
<span class="kw1">class</span> Compare <span class="sy1">=</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="kw1">typename</span> Container<span class="sy4">::</span><span class="me2">value_type</span><span class="sy1">></span><br /></p>
|
||||
<span class="sy1">></span> <span class="kw1">class</span> priority_queue<span class="sy4">;</span></div>
|
||||
</td>
|
||||
<td class="t-dcl-nopad"></td>
|
||||
<td class="t-dcl-nopad"></td>
|
||||
</tr>
|
||||
<tr class="t-dcl-sep">
|
||||
<td></td>
|
||||
<td></td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</tbody>
|
||||
</table>
|
||||
<p>priority_queue 是容器适配器,它提供常数时间的(默认)最大元素查找,对数代价的插入与释出。</p>
|
||||
<p>可用用户提供的 <code>Compare</code> 更改顺序,例如,用 <span class="t-lc">std::greater<T></span> 将导致最小元素作为 <span class="t-lc"><a href="cpp-container-priority_queue-top.html">top()</a></span> 出现。</p>
|
||||
<p>用 <code>priority_queue</code> 工作类似管理某些随机访问容器中的<a href="cpp-algorithm-make_heap.html">堆</a>,优势是不可能突然把堆非法化。</p>
|
||||
<h3><span class="mw-headline" id=".E6.A8.A1.E6.9D.BF.E5.BD.A2.E5.8F.82">模板形参</span></h3>
|
||||
<table class="t-par-begin">
|
||||
<tr class="t-par">
|
||||
<td>T</td>
|
||||
<td>-</td>
|
||||
<td>存储的元素类型。<span class="t-rev-inl t-since-cxx17"><span>若 <code>T</code> 与 <code>Container::value_type</code> 不是同一类型则行为未定义。</span> <span><span class="t-mark-rev t-since-cxx17">(C++17 起)</span></span></span></td>
|
||||
</tr>
|
||||
<tr class="t-par">
|
||||
<td>Container</td>
|
||||
<td>-</td>
|
||||
<td>用于存储元素的底层容器类型。容器必须满足<a href="cpp-named_req-SequenceContainer.html"><span style="font-style:italic">序列容器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(SequenceContainer)</span></a> 的要求,而其迭代器必须满足<a href="cpp-named_req-RandomAccessIterator.html"><span style="font-style:italic">老式随机访问迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyRandomAccessIterator)</span></a> 的要求。另外,它必须提供拥有通常语义的下列函数:
|
||||
<ul>
|
||||
<li><code>front()</code></li>
|
||||
<li><code>push_back()</code></li>
|
||||
<li><code>pop_back()</code></li>
|
||||
</ul>
|
||||
<p>标准容器 <span class="t-lc"><a href="cpp-container-vector.html">std::vector</a></span> 和 <span class="t-lc"><a href="cpp-container-deque.html">std::deque</a></span> 满足这些要求。</p>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="t-par">
|
||||
<td>Compare</td>
|
||||
<td>-</td>
|
||||
<td>提供严格弱序的<a href="cpp-named_req-Compare.html"><span style="font-style:italic">比较</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(Compare)</span></a> 类型。</td>
|
||||
</tr>
|
||||
</table>
|
||||
<p>注意<a href="cpp-named_req-Compare.html"><span style="font-style:italic">比较</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(Compare)</span></a> 形参的定义,使得若其第一参数在弱序中<i>先于</i>其第二参数则返回 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">true</span></span></span> 。但因为 priority_queue 首先输出最大元素,故“先来”的元素实际上最后输出。即队列头含有按照<a href="cpp-named_req-Compare.html"><span style="font-style:italic">比较</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(Compare)</span></a> 所施加弱序的“最后”元素。</p>
|
||||
<h3><span class="mw-headline" id=".E6.88.90.E5.91.98.E7.B1.BB.E5.9E.8B">成员类型</span></h3>
|
||||
<table class="t-dsc-begin">
|
||||
<tr class="t-dsc-hitem">
|
||||
<td>成员类型</td>
|
||||
<td>定义</td>
|
||||
</tr>
|
||||
<tr class="t-dsc">
|
||||
<td><code>container_type</code></td>
|
||||
<td><code>Container</code></td>
|
||||
</tr>
|
||||
<tr class="t-dsc">
|
||||
<td><code>value_compare</code></td>
|
||||
<td><code>Compare</code></td>
|
||||
</tr>
|
||||
<tr class="t-dsc">
|
||||
<td><code>value_type</code></td>
|
||||
<td><code>Container::value_type</code></td>
|
||||
</tr>
|
||||
<tr class="t-dsc">
|
||||
<td><code>size_type</code></td>
|
||||
<td><code>Container::size_type</code></td>
|
||||
</tr>
|
||||
<tr class="t-dsc">
|
||||
<td><code>reference</code></td>
|
||||
<td><code>Container::reference</code></td>
|
||||
</tr>
|
||||
<tr class="t-dsc">
|
||||
<td><code>const_reference</code></td>
|
||||
<td><code>Container::const_reference</code></td>
|
||||
</tr>
|
||||
</table>
|
||||
<h3><span class="mw-headline" id=".E6.88.90.E5.91.98.E5.87.BD.E6.95.B0">成员函数</span></h3>
|
||||
<table class="t-dsc-begin">
|
||||
<tr class="t-dsc">
|
||||
<td>
|
||||
<div class="t-dsc-member-div t-dsc-member-nobold-div">
|
||||
<div><a href="cpp-container-priority_queue-priority_queue.html"><span class="t-lines"><span>(构造函数)</span></span></a></div>
|
||||
</div>
|
||||
</td>
|
||||
<td>构造 <code>priority_queue</code><br />
|
||||
<span class="t-mark">(公开成员函数)</span></td>
|
||||
</tr>
|
||||
<tr class="t-dsc">
|
||||
<td>
|
||||
<div class="t-dsc-member-div t-dsc-member-nobold-div">
|
||||
<div><a href="cpp-container-priority_queue-~priority_queue.html"><span class="t-lines"><span>(析构函数)</span></span></a></div>
|
||||
</div>
|
||||
</td>
|
||||
<td>析构 <code>priority_queue</code><br />
|
||||
<span class="t-mark">(公开成员函数)</span></td>
|
||||
</tr>
|
||||
<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>
|
||||
<tr>
|
||||
<td colspan="2">
|
||||
<h5><span class="mw-headline" id=".E5.85.83.E7.B4.A0.E8.AE.BF.E9.97.AE">元素访问</span></h5>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="t-dsc">
|
||||
<td>
|
||||
<div class="t-dsc-member-div">
|
||||
<div><a href="cpp-container-priority_queue-top.html"><span class="t-lines"><span>top</span></span></a></div>
|
||||
</div>
|
||||
</td>
|
||||
<td>访问栈顶元素<br />
|
||||
<span class="t-mark">(公开成员函数)</span></td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td colspan="2">
|
||||
<h5><span class="mw-headline" id=".E5.AE.B9.E9.87.8F">容量</span></h5>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="t-dsc">
|
||||
<td>
|
||||
<div class="t-dsc-member-div">
|
||||
<div><a href="cpp-container-priority_queue-empty.html"><span class="t-lines"><span>empty</span></span></a></div>
|
||||
</div>
|
||||
</td>
|
||||
<td>检查底层容器是否为空<br />
|
||||
<span class="t-mark">(公开成员函数)</span></td>
|
||||
</tr>
|
||||
<tr class="t-dsc">
|
||||
<td>
|
||||
<div class="t-dsc-member-div">
|
||||
<div><a href="cpp-container-priority_queue-size.html"><span class="t-lines"><span>size</span></span></a></div>
|
||||
</div>
|
||||
</td>
|
||||
<td>返回容纳的元素数<br />
|
||||
<span class="t-mark">(公开成员函数)</span></td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td colspan="2">
|
||||
<h5><span class="mw-headline" id=".E4.BF.AE.E6.94.B9.E5.99.A8">修改器</span></h5>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="t-dsc">
|
||||
<td>
|
||||
<div class="t-dsc-member-div">
|
||||
<div><a href="cpp-container-priority_queue-push.html"><span class="t-lines"><span>push</span></span></a></div>
|
||||
</div>
|
||||
</td>
|
||||
<td>插入元素,并对底层容器排序<br />
|
||||
<span class="t-mark">(公开成员函数)</span></td>
|
||||
</tr>
|
||||
<tr class="t-dsc">
|
||||
<td>
|
||||
<div class="t-dsc-member-div">
|
||||
<div><a href="cpp-container-priority_queue-emplace.html"><span class="t-lines"><span>emplace</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>
|
||||
<tr class="t-dsc">
|
||||
<td>
|
||||
<div class="t-dsc-member-div">
|
||||
<div><a href="cpp-container-priority_queue-pop.html"><span class="t-lines"><span>pop</span></span></a></div>
|
||||
</div>
|
||||
</td>
|
||||
<td>删除队首元素<br />
|
||||
<span class="t-mark">(公开成员函数)</span></td>
|
||||
</tr>
|
||||
<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>
|
||||
<tr>
|
||||
<td colspan="2">
|
||||
<h3><span class="mw-headline" id=".E6.88.90.E5.91.98.E5.AF.B9.E8.B1.A1">成员对象</span></h3>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="t-dsc">
|
||||
<td>
|
||||
<div class="t-dsc-member-div">
|
||||
<div><span class="t-lines"><span><span class="t-dsc-small">Container</span> c</span></span></div>
|
||||
</div>
|
||||
</td>
|
||||
<td>底层容器<br />
|
||||
<span class="t-mark">(受保护成员对象)</span></td>
|
||||
</tr>
|
||||
<tr class="t-dsc">
|
||||
<td>
|
||||
<div class="t-dsc-member-div">
|
||||
<div><span class="t-lines"><span><span class="t-dsc-small">Compare</span> comp</span></span></div>
|
||||
</div>
|
||||
</td>
|
||||
<td>比较函数对象<br />
|
||||
<span class="t-mark">(受保护成员对象)</span></td>
|
||||
</tr>
|
||||
</table>
|
||||
<h3><span class="mw-headline" id=".E9.9D.9E.E6.88.90.E5.91.98.E5.87.BD.E6.95.B0">非成员函数</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-swap2.html"><span class="t-lines"><span>std::swap<span class="t-dsc-small">(std::priority_queue)</span></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>特化 <span class="t-lc"><a href="cpp-algorithm-swap.html">std::swap</a></span> 算法<br />
|
||||
<span class="t-mark">(函数模板)</span></td>
|
||||
</tr>
|
||||
</table>
|
||||
<h3><span class="mw-headline" id=".E8.BE.85.E5.8A.A9.E7.B1.BB">辅助类</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-uses_allocator.html"><span class="t-lines"><span>std::uses_allocator<span class="t-dsc-small"><std::priority_queue></span></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>特化 <span class="t-lc"><a href="cpp-memory-uses_allocator.html">std::uses_allocator</a></span> 类型特征<br />
|
||||
<span class="t-mark">(类模板特化)</span></td>
|
||||
</tr>
|
||||
</table>
|
||||
<h3><span class="mw-headline" id=".E6.8E.A8.E5.AF.BC.E6.8C.87.E5.BC.95.28C.2B.2B17_.E8.B5.B7.29"><a href="cpp-container-priority_queue-deduction_guides.html">推导指引</a><span class="t-mark-rev t-since-cxx17">(C++17 起)</span></span></h3>
|
||||
<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 <functional></span>
|
||||
<span class="co2">#include <queue></span>
|
||||
<span class="co2">#include <vector></span>
|
||||
<span class="co2">#include <iostream></span>
|
||||
|
||||
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">typename</span> T<span class="sy1">></span> <span class="kw4">void</span> print_queue<span class="br0">(</span>T<span class="sy3">&</span> q<span class="br0">)</span> <span class="br0">{</span>
|
||||
<span class="kw1">while</span><span class="br0">(</span><span class="sy3">!</span>q.<span class="me1">empty</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="kw1757">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> q.<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>
|
||||
q.<span class="me1">pop</span><span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span>
|
||||
<span class="br0">}</span>
|
||||
<a href="cpp-io-cout.html"><span class="kw1757">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="br0">}</span>
|
||||
|
||||
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span> <span class="br0">{</span>
|
||||
std<span class="sy4">::</span><span class="me2">priority_queue</span><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span> q<span class="sy4">;</span>
|
||||
|
||||
<span class="kw1">for</span><span class="br0">(</span><span class="kw4">int</span> n <span class="sy4">:</span> <span class="br0">{</span><span class="nu0">1</span>,<span class="nu0">8</span>,<span class="nu0">5</span>,<span class="nu0">6</span>,<span class="nu0">3</span>,<span class="nu0">4</span>,<span class="nu0">0</span>,<span class="nu0">9</span>,<span class="nu0">7</span>,<span class="nu0">2</span><span class="br0">}</span><span class="br0">)</span>
|
||||
q.<span class="me1">push</span><span class="br0">(</span>n<span class="br0">)</span><span class="sy4">;</span>
|
||||
|
||||
print_queue<span class="br0">(</span>q<span class="br0">)</span><span class="sy4">;</span>
|
||||
|
||||
std<span class="sy4">::</span><span class="me2">priority_queue</span><span class="sy1"><</span><span class="kw4">int</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>, <a href="cpp-utility-functional-greater.html"><span class="kw1037">std::<span class="me2">greater</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span> <span class="sy1">></span> q2<span class="sy4">;</span>
|
||||
|
||||
<span class="kw1">for</span><span class="br0">(</span><span class="kw4">int</span> n <span class="sy4">:</span> <span class="br0">{</span><span class="nu0">1</span>,<span class="nu0">8</span>,<span class="nu0">5</span>,<span class="nu0">6</span>,<span class="nu0">3</span>,<span class="nu0">4</span>,<span class="nu0">0</span>,<span class="nu0">9</span>,<span class="nu0">7</span>,<span class="nu0">2</span><span class="br0">}</span><span class="br0">)</span>
|
||||
q2.<span class="me1">push</span><span class="br0">(</span>n<span class="br0">)</span><span class="sy4">;</span>
|
||||
|
||||
print_queue<span class="br0">(</span>q2<span class="br0">)</span><span class="sy4">;</span>
|
||||
|
||||
<span class="co1">// 用 lambda 比较元素。</span>
|
||||
<span class="kw4">auto</span> cmp <span class="sy1">=</span> <span class="br0">[</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">int</span> left, <span class="kw4">int</span> right<span class="br0">)</span> <span class="br0">{</span> <span class="kw1">return</span> <span class="br0">(</span>left <span class="sy3">^</span> <span class="nu0">1</span><span class="br0">)</span> <span class="sy1"><</span> <span class="br0">(</span>right <span class="sy3">^</span> <span class="nu0">1</span><span class="br0">)</span><span class="sy4">;</span> <span class="br0">}</span><span class="sy4">;</span>
|
||||
std<span class="sy4">::</span><span class="me2">priority_queue</span><span class="sy1"><</span><span class="kw4">int</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>, decltype<span class="br0">(</span>cmp<span class="br0">)</span><span class="sy1">></span> q3<span class="br0">(</span>cmp<span class="br0">)</span><span class="sy4">;</span>
|
||||
|
||||
<span class="kw1">for</span><span class="br0">(</span><span class="kw4">int</span> n <span class="sy4">:</span> <span class="br0">{</span><span class="nu0">1</span>,<span class="nu0">8</span>,<span class="nu0">5</span>,<span class="nu0">6</span>,<span class="nu0">3</span>,<span class="nu0">4</span>,<span class="nu0">0</span>,<span class="nu0">9</span>,<span class="nu0">7</span>,<span class="nu0">2</span><span class="br0">}</span><span class="br0">)</span>
|
||||
q3.<span class="me1">push</span><span class="br0">(</span>n<span class="br0">)</span><span class="sy4">;</span>
|
||||
|
||||
print_queue<span class="br0">(</span>q3<span class="br0">)</span><span class="sy4">;</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">9 8 7 6 5 4 3 2 1 0
|
||||
0 1 2 3 4 5 6 7 8 9
|
||||
8 9 6 7 4 5 2 3 0 1</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://cplusplus.github.io/LWG/issue2684">LWG 2684</a></td>
|
||||
<td>C++98</td>
|
||||
<td><code>priority_queue</code> 接收比较器但缺少对它的成员 typedef</td>
|
||||
<td>已添加</td>
|
||||
</tr>
|
||||
</table>
|
||||
</div>
|
||||
<div class="visualClear"></div>
|
||||
</div>
|
||||
</div>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
Reference in New Issue
Block a user