update automatically

Author: cpprefjp-autoupdate

reference/queue/priority_queue/op_constructor.html

@@ -200,12 +200,12 @@
 
     <p class="text-right"><small>
       最終更新日時(UTC):
-      <span itemprop="datePublished" content="2024-06-11T13:45:38">
-        2024年06月11日 13時45分38秒
+      <span itemprop="datePublished" content="2024-07-28T08:03:20">
+        2024年07月28日 08時03分20秒
       </span>
       <br/>
       <span itemprop="author" itemscope itemtype="http://schema.org/Person">
-        <span itemprop="name">Akira Takahashi</span>
+        <span itemprop="name">suomesta</span>
       </span>
       が更新
     </small></p>
@@ -282,6 +282,36 @@
 <span class="k">template</span> <span class="o">&lt;</span><span class="k">class</span> <span class="nc">Alloc</span><span class="o">&gt;</span>
 <span class="n">priority_queue</span><span class="p">(</span><span class="n">priority_queue</span><span class="o">&amp;&amp;</span> <span class="n">que</span><span class="p">,</span>
                <span class="k">const</span> <span class="n">Alloc</span><span class="o">&amp;</span> <span class="n">alloc</span><span class="p">);</span>                       <span class="c1">// (14) C++11</span>
+
+<span class="k">template</span> <span class="o">&lt;</span><span class="k">class</span> <span class="nc">InputIterator</span><span class="p">,</span> <span class="k">class</span> <span class="nc">Alloc</span><span class="o">&gt;</span>
+<span class="n">priority_queue</span><span class="p">(</span><span class="n">InputIterator</span> <span class="n">first</span><span class="p">,</span> <span class="n">InputIterator</span> <span class="n">last</span><span class="p">,</span>
+               <span class="k">const</span> <span class="n">Compare</span><span class="o">&amp;</span> <span class="n">x</span><span class="p">,</span>
+               <span class="k">const</span> <span class="n">Alloc</span><span class="o">&amp;</span> <span class="n">alloc</span><span class="p">);</span>                       <span class="c1">// (15) C++23</span>
+
+<span class="k">template</span> <span class="o">&lt;</span><span class="k">class</span> <span class="nc">InputIterator</span><span class="p">,</span> <span class="k">class</span> <span class="nc">Alloc</span><span class="o">&gt;</span>
+<span class="n">priority_queue</span><span class="p">(</span><span class="n">InputIterator</span> <span class="n">first</span><span class="p">,</span> <span class="n">InputIterator</span> <span class="n">last</span><span class="p">,</span>
+               <span class="k">const</span> <span class="n">Compare</span><span class="o">&amp;</span> <span class="n">x</span><span class="p">,</span>
+               <span class="k">const</span> <span class="n">Container</span><span class="o">&amp;</span> <span class="n">other</span><span class="p">,</span>
+               <span class="k">const</span> <span class="n">Alloc</span><span class="o">&amp;</span> <span class="n">alloc</span><span class="p">);</span>                       <span class="c1">// (16) C++23</span>
+
+<span class="k">template</span> <span class="o">&lt;</span><span class="k">class</span> <span class="nc">InputIterator</span><span class="p">,</span> <span class="k">class</span> <span class="nc">Alloc</span><span class="o">&gt;</span>
+<span class="n">priority_queue</span><span class="p">(</span><span class="n">InputIterator</span> <span class="n">first</span><span class="p">,</span> <span class="n">InputIterator</span> <span class="n">last</span><span class="p">,</span>
+               <span class="k">const</span> <span class="n">Compare</span><span class="o">&amp;</span> <span class="n">x</span><span class="p">,</span>
+               <span class="n">Container</span><span class="o">&amp;&amp;</span> <span class="n">other</span><span class="p">,</span>
+               <span class="k">const</span> <span class="n">Alloc</span><span class="o">&amp;</span> <span class="n">alloc</span><span class="p">);</span>                       <span class="c1">// (17) C++23</span>
+
+<span class="k">template</span> <span class="o">&lt;</span><span class="n">container</span><span class="o">-</span><span class="n">compatible</span><span class="o">-</span><span class="n"><a href="../../ranges/range.html">range</a></span><span class="o">&lt;</span><span class="n">T</span><span class="o">&gt;</span> <span class="n">R</span><span class="o">&gt;</span>
+<span class="n">priority_queue</span><span class="p">(</span><span class="n"><a href="../../ranges/from_range_t.html">from_range_t</a></span><span class="p">,</span> <span class="n">R</span><span class="o">&amp;&amp;</span> <span class="n">rg</span><span class="p">,</span>
+               <span class="k">const</span> <span class="n">Compare</span><span class="o">&amp;</span> <span class="n">x</span> <span class="o">=</span> <span class="n">Compare</span><span class="p">());</span>             <span class="c1">// (18) C++23</span>
+
+<span class="k">template</span> <span class="o">&lt;</span><span class="n">container</span><span class="o">-</span><span class="n">compatible</span><span class="o">-</span><span class="n"><a href="../../ranges/range.html">range</a></span><span class="o">&lt;</span><span class="n">T</span><span class="o">&gt;</span> <span class="n">R</span><span class="p">,</span> <span class="k">class</span> <span class="nc">Alloc</span><span class="o">&gt;</span>
+<span class="n">priority_queue</span><span class="p">(</span><span class="n"><a href="../../ranges/from_range_t.html">from_range_t</a></span><span class="p">,</span> <span class="n">R</span><span class="o">&amp;&amp;</span> <span class="n">rg</span><span class="p">,</span>
+               <span class="k">const</span> <span class="n">Compare</span><span class="o">&amp;</span> <span class="n">x</span><span class="p">,</span>
+               <span class="k">const</span> <span class="n">Alloc</span><span class="o">&amp;</span> <span class="n">alloc</span><span class="p">);</span>                       <span class="c1">// (19) C++23</span>
+
+<span class="k">template</span> <span class="o">&lt;</span><span class="n">container</span><span class="o">-</span><span class="n">compatible</span><span class="o">-</span><span class="n"><a href="../../ranges/range.html">range</a></span><span class="o">&lt;</span><span class="n">T</span><span class="o">&gt;</span> <span class="n">R</span><span class="p">,</span> <span class="k">class</span> <span class="nc">Alloc</span><span class="o">&gt;</span>
+<span class="n">priority_queue</span><span class="p">(</span><span class="n"><a href="../../ranges/from_range_t.html">from_range_t</a></span><span class="p">,</span> <span class="n">R</span><span class="o">&amp;&amp;</span> <span class="n">rg</span><span class="p">,</span>
+               <span class="k">const</span> <span class="n">Alloc</span><span class="o">&amp;</span> <span class="n">alloc</span><span class="p">);</span>                       <span class="c1">// (20) C++23</span>
 </code></pre></div>
 </p>
 <h2>概要</h2>
@@ -303,6 +333,8 @@ <h2>概要</h2>
 <li>(12) : 比較関数、元となるコンテナの一時オブジェクト、アロケータを受け取るコンストラクタ</li>
 <li>(13) : アロケータ指定でコピー構築する</li>
 <li>(14) : アロケータ指定でムーブ構築する</li>
+<li>(15), (16), (17) : アロケータ指定で<a class="cpprefjp-defined-word" data-desc="2つのイテレータで表現される半開区間を表す。C++20からイテレータと番兵で異なる型であっても指定可能になる">イテレータ範囲</a>から優先順位付きキューを構築する</li>
+<li>(18), (19), (20) : Rangeから優先順位付きキューを構築する</li>
 </ul>
 <h2>要件</h2>
 <p><code>Compare</code>型パラメータ<code>x</code>が、<a href="../../algorithm.html#strict-weak-ordering">狭義の弱順序</a>で定義されていること。</p>
@@ -392,6 +424,49 @@ <h2>効果</h2>
 <li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
 </ol>
 </li>
+<li>(15) :<ol>
+<li>メンバ変数<code>comp</code>を<code>x</code>でコピー構築する。</li>
+<li>メンバ変数<code>c</code>のメモリアロケートに<code>alloc</code>を使用する。</li>
+<li><code>c.insert(c.end(), first, last)</code>を呼び出す。</li>
+<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
+</ol>
+</li>
+<li>(16) :<ol>
+<li>メンバ変数<code>comp</code>を<code>x</code>でコピー構築する。</li>
+<li>メンバ変数<code>c</code>を<code>other</code>でコピー構築する。</li>
+<li>メンバ変数<code>c</code>のメモリアロケートに<code>alloc</code>を使用する。</li>
+<li><code>c.insert(c.end(), first, last)</code>を呼び出す。</li>
+<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
+</ol>
+</li>
+<li>(17) :<ol>
+<li>メンバ変数<code>comp</code>を<code>x</code>でコピー構築する。</li>
+<li>メンバ変数<code>c</code>を<code>other</code>でムーブ構築する。</li>
+<li>メンバ変数<code>c</code>のメモリアロケートに<code>alloc</code>を使用する。</li>
+<li><code>c.insert(c.end(), first, last)</code>を呼び出す。</li>
+<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
+</ol>
+</li>
+<li>(18) :<ol>
+<li>メンバ変数<code>comp</code>を<code>x</code>でコピー構築する。</li>
+<li><code>c.insert(c.end(), ranges::begin(rg), ranges::end(rg))</code>を呼び出す。</li>
+<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
+</ol>
+</li>
+<li>(19) :<ol>
+<li>メンバ変数<code>comp</code>を<code>x</code>でコピー構築する。</li>
+<li>メンバ変数<code>c</code>のメモリアロケートに<code>alloc</code>を使用する。</li>
+<li><code>c.insert(c.end(), ranges::begin(rg), ranges::end(rg))</code>を呼び出す。</li>
+<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
+</ol>
+</li>
+<li>(20) :<ol>
+<li>メンバ変数<code>comp</code>を<a class="cpprefjp-defined-word" data-desc="`T x{};`構文での初期化。組み込み型の場合はゼロ相当の値で、クラス型の場合はデフォルトコンストラクタで初期化する。配列型の場合は各要素が再帰的に値初期化される">値初期化</a>する。</li>
+<li>メンバ変数<code>c</code>のメモリアロケートに<code>alloc</code>を使用する。</li>
+<li><code>c.insert(c.end(), ranges::begin(rg), ranges::end(rg))</code>を呼び出す。</li>
+<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
+</ol>
+</li>
 </ul>
 <h2>例</h2>
 <p><div class="yata" id="e985ff0fc56ce4141a6aeaa8be359a6e7aef8a00"><div class="codehilite"><pre><span></span><code><span class="cp">#include</span> <span class="cpf"><a href="../../iostream.html">&lt;iostream&gt;</a></span><span class="cp"></span>

reference/queue/queue/op_constructor.html

@@ -200,12 +200,12 @@
 
     <p class="text-right"><small>
       最終更新日時(UTC):
-      <span itemprop="datePublished" content="2021-08-26T08:40:52">
-        2021年08月26日 08時40分52秒
+      <span itemprop="datePublished" content="2024-07-28T08:03:20">
+        2024年07月28日 08時03分20秒
       </span>
       <br/>
       <span itemprop="author" itemscope itemtype="http://schema.org/Person">
-        <span itemprop="name">onihusube</span>
+        <span itemprop="name">suomesta</span>
       </span>
       が更新
     </small></p>
@@ -253,6 +253,11 @@
 
 <span class="k">template</span><span class="o">&lt;</span><span class="k">class</span> <span class="nc">InputIterator</span><span class="p">,</span> <span class="k">class</span> <span class="nc">Alloc</span><span class="o">&gt;</span>
 <span class="n">queue</span><span class="p">(</span><span class="n">InputIterator</span> <span class="n">first</span><span class="p">,</span> <span class="n">InputIterator</span> <span class="n">last</span><span class="p">,</span> <span class="k">const</span> <span class="n">Alloc</span><span class="o">&amp;</span><span class="p">);</span>  <span class="c1">// (10) C++23</span>
+
+<span class="k">template</span> <span class="o">&lt;</span><span class="n">container</span><span class="o">-</span><span class="n">compatible</span><span class="o">-</span><span class="n"><a href="../../ranges/range.html">range</a></span><span class="o">&lt;</span><span class="n">T</span><span class="o">&gt;</span> <span class="n">R</span><span class="o">&gt;</span>
+<span class="n">queue</span><span class="p">(</span><span class="n"><a href="../../ranges/from_range_t.html">from_range_t</a></span><span class="p">,</span> <span class="n">R</span><span class="o">&amp;&amp;</span> <span class="n">rg</span><span class="p">);</span>                       <span class="c1">// (11) C++23</span>
+<span class="k">template</span> <span class="o">&lt;</span><span class="n">container</span><span class="o">-</span><span class="n">compatible</span><span class="o">-</span><span class="n"><a href="../../ranges/range.html">range</a></span><span class="o">&lt;</span><span class="n">T</span><span class="o">&gt;</span> <span class="n">R</span><span class="p">,</span> <span class="k">class</span> <span class="nc">Alloc</span><span class="o">&gt;</span>
+<span class="n">queue</span><span class="p">(</span><span class="n"><a href="../../ranges/from_range_t.html">from_range_t</a></span><span class="p">,</span> <span class="n">R</span><span class="o">&amp;&amp;</span> <span class="n">rg</span><span class="p">,</span> <span class="k">const</span> <span class="n">Alloc</span><span class="o">&amp;</span> <span class="n">alloc</span><span class="p">);</span>   <span class="c1">// (12) C++23</span>
 </code></pre></div>
 </p>
 <h2>概要</h2>
@@ -263,7 +268,8 @@ <h2>引数</h2>
 <p><code>other</code>: 初期化に用いるコンテナオブジェクト
 <code>alloc</code>: 内部のコンテナで使用するアロケータオブジェクト
 <code>que</code>: コピー・ムーブ元の<code>queue</code>オブジェクト
-<code>first</code>, <code>last</code>: 初期化に用いるイテレータのペア</p>
+<code>first</code>, <code>last</code>: 初期化に用いるイテレータのペア
+<code>rg</code>: 初期化に用いるRange</p>
 <h2>計算量</h2>
 <p>線形 O(n)。</p>
 <h2>例</h2>