update automatically

Author: cpprefjp-autoupdate

reference/flat_map/flat_map.html

@@ -188,8 +188,8 @@
 
     <p class="text-right"><small>
       最終更新日時(UTC):
-      <span itemprop="datePublished" content="2025-10-14T02:34:00">
-        2025年10月14日 02時34分00秒
+      <span itemprop="datePublished" content="2026-03-13T02:25:45">
+        2026年03月13日 02時25分45秒
       </span>
       <br/>
       <span itemprop="author" itemscope itemtype="http://schema.org/Person">
@@ -243,7 +243,7 @@ <h3>ほかの連想コンテナとの要件の違い</h3>
 </ul>
 <p>また、このコンテナはメモリアロケータを指定できない設計にもなっている。</p>
 <p><code>value_type</code>は、<code><a href="../map/map.html">std::map</a></code>では<code><a href="../utility/pair.html">std::pair</a>&lt;const Key, T&gt;</code>だが、このクラスは<code><a href="../utility/pair.html">std::pair</a>&lt;Key, T&gt;</code>である (<code>const</code>がつかない)。</p>
-<p>以下の不変条件をもち、メンバ関数のいずれかが<a class="cpprefjp-defined-word" data-desc="問題が発生したときに、現在実行位置を過去に通過・記録した位置に戻し、文脈情報を添えて紐づけられた処理(例外ハンドラー)を呼び出す仕組み。またはその事態">例外</a>によって終了した場合には不変条件の状態に復元される (ただし、その復元操作によってコンテナが空になる可能性がある)：</p>
+<p>以下の不変条件をもち、メンバ関数のいずれかが<a class="cpprefjp-defined-word" data-desc="問題が発生したときに、現在実行位置を過去に通過・記録した位置に戻し、文脈情報を添えて紐づけられた処理(例外ハンドラー)を呼び出す仕組み。またはその事態">例外</a>によって終了した場合には不変条件の状態に復元される (ただし、その復元操作によってコンテナが空になる可能性がある)。ムーブコンストラクタとムーブ代入演算子の場合、両方の引数の不変条件が復元される：</p>
 <ul>
 <li>キーの配列と値の配列が、同じ要素数をもつ</li>
 <li>キーの配列が、指定された比較関数オブジェクトを尊重してソートを行う</li>
@@ -894,6 +894,10 @@ <h2>参照</h2>
 <li>C++23で導入された<code>flat_map</code>の仕様</li>
 </ul>
 </li>
+<li><a href="https://open-std.org/jtc1/sc22/wg21/docs/papers/2025/p3567r2.html" target="_blank">P3567R2 flat_meow Fixes</a><ul>
+<li>C++26で<code>swap</code>の条件付き<code>noexcept</code>、<code>insert_range</code>のソート済み<a class="cpprefjp-defined-word" data-desc="同名の関数を異なる引数・テンプレート・制約などで複数定義すること。または同名の関数の集合">オーバーロード</a>追加などの修正が行われた</li>
+</ul>
+</li>
 </ul></div>
 
       </div>

reference/flat_map/flat_map/insert_range.html

@@ -200,8 +200,8 @@
 
     <p class="text-right"><small>
       最終更新日時(UTC):
-      <span itemprop="datePublished" content="2026-02-17T14:22:33">
-        2026年02月17日 14時22分33秒
+      <span itemprop="datePublished" content="2026-03-13T02:25:45">
+        2026年03月13日 02時25分45秒
       </span>
       <br/>
       <span itemprop="author" itemscope itemtype="http://schema.org/Person">
@@ -226,9 +226,12 @@
 
   <div class="identifier-type">function</div><div class="header">&lt;flat_map&gt;</div><h1 itemprop="name"><span class="namespace" title="namespace std">std::</span><span class="class" title="class flat_map">flat_map::</span><span class="token">insert_range</span><span class="cpp cpp23" title="C++23で追加">(C++23)</span></h1>
 <div itemprop="articleBody"><p><div class="codehilite"><pre><span></span><code><span class="k">template</span><span class="o">&lt;</span><span class="n"><a href="../../exposition-only/container-compatible-range.html">container-compatible-range</a></span><span class="o">&lt;</span><span class="n">value_type</span><span class="o">&gt;</span><span class="w"> </span><span class="n">R</span><span class="o">&gt;</span>
-<span class="kt">void</span><span class="w"> </span><span class="n">insert_range</span><span class="p">(</span><span class="n">R</span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">rg</span><span class="p">);</span><span class="w">           </span><span class="c1">// (1) C++23</span>
+<span class="kt">void</span><span class="w"> </span><span class="n">insert_range</span><span class="p">(</span><span class="n">R</span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">rg</span><span class="p">);</span><span class="w">                       </span><span class="c1">// (1) C++23</span>
 <span class="k">template</span><span class="o">&lt;</span><span class="n"><a href="../../exposition-only/container-compatible-range.html">container-compatible-range</a></span><span class="o">&lt;</span><span class="n">value_type</span><span class="o">&gt;</span><span class="w"> </span><span class="n">R</span><span class="o">&gt;</span>
-<span class="k">constexpr</span><span class="w"> </span><span class="kt">void</span><span class="w"> </span><span class="n">insert_range</span><span class="p">(</span><span class="n">R</span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">rg</span><span class="p">);</span><span class="w"> </span><span class="c1">// (1) C++26</span>
+<span class="k">constexpr</span><span class="w"> </span><span class="kt">void</span><span class="w"> </span><span class="n">insert_range</span><span class="p">(</span><span class="n">R</span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">rg</span><span class="p">);</span><span class="w">             </span><span class="c1">// (1) C++26</span>
+
+<span class="k">template</span><span class="o">&lt;</span><span class="n"><a href="../../exposition-only/container-compatible-range.html">container-compatible-range</a></span><span class="o">&lt;</span><span class="n">value_type</span><span class="o">&gt;</span><span class="w"> </span><span class="n">R</span><span class="o">&gt;</span>
+<span class="k">constexpr</span><span class="w"> </span><span class="kt">void</span><span class="w"> </span><span class="n">insert_range</span><span class="p">(</span><span class="n"><a href="../sorted_unique_t.html">sorted_unique_t</a></span><span class="p">,</span><span class="w"> </span><span class="n">R</span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">rg</span><span class="p">);</span><span class="w"> </span><span class="c1">// (2) C++26</span>
 </code></pre></div>
 </p>
 <h2>概要</h2>
@@ -240,12 +243,12 @@ <h2>概要</h2>
 <h2>効果</h2>
 <ul>
 <li>
-<p>メンバ変数として保持しているコンテナ<code>c</code>に、以下のように挿入する：
+<p>(1) : メンバ変数として保持しているコンテナ<code>c</code>に、以下のように挿入する：
   <br />
-<div class="codehilite"><pre><span></span><code><span class="k">for</span><span class="w"> </span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="k">auto</span><span class="o">&amp;</span><span class="w"> </span><span class="n">e</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="n">rg</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
-<span class="w">  </span><span class="n"><a href="containers.html">c.keys</a></span><span class="p">.</span><span class="n"><a href="../../vector/vector/insert.html">insert</a></span><span class="p">(</span><span class="n"><a href="containers.html">c.keys</a></span><span class="p">.</span><span class="n"><a href="../../vector/vector/end.html">end()</a></span><span class="p">,</span><span class="w"> </span><span class="n">e</span><span class="p">.</span><span class="n"><a href="../../utility/pair/first.html">first</a></span><span class="p">);</span>
-<span class="w">  </span><span class="n"><a href="containers.html">c.values</a></span><span class="p">.</span><span class="n"><a href="../../vector/vector/insert.html">insert</a></span><span class="p">(</span><span class="n"><a href="containers.html">c.values</a></span><span class="p">.</span><span class="n"><a href="../../vector/vector/end.html">end()</a></span><span class="p">,</span><span class="w"> </span><span class="n">e</span><span class="p">.</span><span class="n"><a href="../../utility/pair/second.html">second</a></span><span class="p">);</span>
-<span class="p">}</span>
+<div class="codehilite"><pre><span></span><code><span class="n"><a href="../../algorithm/ranges_for_each.html">ranges::for_each</a></span><span class="p">(</span><span class="n">rg</span><span class="p">,</span><span class="w"> </span><span class="p">[</span><span class="o">&amp;</span><span class="p">](</span><span class="n">value_type</span><span class="w"> </span><span class="n">e</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n"><a href="containers.html">c.keys</a></span><span class="p">.</span><span class="n"><a href="../../vector/vector/insert.html">insert</a></span><span class="p">(</span><span class="n"><a href="containers.html">c.keys</a></span><span class="p">.</span><span class="n"><a href="../../vector/vector/end.html">end()</a></span><span class="p">,</span><span class="w"> </span><span class="n"><a href="../../utility/move.html">std::move</a></span><span class="p">(</span><span class="n">e</span><span class="p">.</span><span class="n"><a href="../../utility/pair/first.html">first</a></span><span class="p">));</span>
+<span class="w">  </span><span class="n"><a href="containers.html">c.values</a></span><span class="p">.</span><span class="n"><a href="../../vector/vector/insert.html">insert</a></span><span class="p">(</span><span class="n"><a href="containers.html">c.values</a></span><span class="p">.</span><span class="n"><a href="../../vector/vector/end.html">end()</a></span><span class="p">,</span><span class="w"> </span><span class="n"><a href="../../utility/move.html">std::move</a></span><span class="p">(</span><span class="n">e</span><span class="p">.</span><span class="n"><a href="../../utility/pair/second.html">second</a></span><span class="p">));</span>
+<span class="p">});</span>
 </code></pre></div>
 </p>
 <ul>
@@ -261,12 +264,16 @@ <h2>効果</h2>
 </code></pre></div>
 </p>
 </li>
+<li>
+<p>(2) : <code>insert_range(rg)</code>と等価</p>
+</li>
 </ul>
 <h2><a class="cpprefjp-defined-word" data-desc="関数呼び出し式の評価結果となるオブジェクト・値">戻り値</a></h2>
 <p>なし</p>
 <h2><a class="cpprefjp-defined-word" data-desc="関数等の意味論を構成する要素の1つ。Complexity。関数が使うアルゴリズムの空間計算量・時間計算量">計算量</a></h2>
 <ul>
-<li>Nをこの操作の前の<code><a href="size.html">size()</a></code>、Mを<code><a href="../../iterator/ranges_distance.html">ranges::distance</a>(rg)</code>として、N + MlogM</li>
+<li>(1) : Nをこの操作の前の<code><a href="size.html">size()</a></code>、Mを<code><a href="../../iterator/ranges_distance.html">ranges::distance</a>(rg)</code>として、N + MlogM</li>
+<li>(2) : 線形</li>
 </ul>
 <h2>備考</h2>
 <ul>
@@ -341,6 +348,11 @@ <h2>関連項目</h2>
 <h2>参照</h2>
 <ul>
 <li><a href="https://open-std.org/jtc1/sc22/wg21/docs/papers/2025/p3372r3.html" target="_blank">P3372R3 constexpr containers and adaptors</a></li>
+<li><a href="https://open-std.org/jtc1/sc22/wg21/docs/papers/2025/p3567r2.html" target="_blank">P3567R2 flat_meow Fixes</a><ul>
+<li>C++26で(2)の<code>sorted_unique_t</code>をとる<a class="cpprefjp-defined-word" data-desc="同名の関数を異なる引数・テンプレート・制約などで複数定義すること。または同名の関数の集合">オーバーロード</a>が追加された</li>
+<li>C++26で(1)の効果が、要素のコピーではなくムーブを行うように修正された</li>
+</ul>
+</li>
 </ul></div>
 
       </div>

reference/flat_map/flat_map/swap.html

@@ -200,8 +200,8 @@
 
     <p class="text-right"><small>
       最終更新日時(UTC):
-      <span itemprop="datePublished" content="2026-02-17T14:22:33">
-        2026年02月17日 14時22分33秒
+      <span itemprop="datePublished" content="2026-03-13T02:25:45">
+        2026年03月13日 02時25分45秒
       </span>
       <br/>
       <span itemprop="author" itemscope itemtype="http://schema.org/Person">
@@ -225,8 +225,11 @@
       <div class="col-sm-12 content-body">
 
   <div class="identifier-type">function</div><div class="header">&lt;flat_map&gt;</div><h1 itemprop="name"><span class="namespace" title="namespace std">std::</span><span class="class" title="class flat_map">flat_map::</span><span class="token">swap</span><span class="cpp cpp23" title="C++23で追加">(C++23)</span></h1>
-<div itemprop="articleBody"><p><div class="codehilite"><pre><span></span><code><span class="kt">void</span><span class="w"> </span><span class="nf">swap</span><span class="p">(</span><span class="n">flat_map</span><span class="o">&amp;</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="k">noexcept</span><span class="p">;</span><span class="w">           </span><span class="c1">// (1) C++23</span>
-<span class="k">constexpr</span><span class="w"> </span><span class="kt">void</span><span class="w"> </span><span class="nf">swap</span><span class="p">(</span><span class="n">flat_map</span><span class="o">&amp;</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="k">noexcept</span><span class="p">;</span><span class="w"> </span><span class="c1">// (1) C++26</span>
+<div itemprop="articleBody"><p><div class="codehilite"><pre><span></span><code><span class="kt">void</span><span class="w"> </span><span class="nf">swap</span><span class="p">(</span><span class="n">flat_map</span><span class="o">&amp;</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="k">noexcept</span><span class="p">;</span><span class="w">                          </span><span class="c1">// (1) C++23</span>
+<span class="k">constexpr</span><span class="w"> </span><span class="kt">void</span><span class="w"> </span><span class="nf">swap</span><span class="p">(</span><span class="n">flat_map</span><span class="o">&amp;</span><span class="w"> </span><span class="n">y</span><span class="p">)</span>
+<span class="w">  </span><span class="k">noexcept</span><span class="p">(</span><span class="n"><a href="../../type_traits/is_nothrow_swappable.html">is_nothrow_swappable_v</a></span><span class="o">&lt;</span><span class="n">key_container_type</span><span class="o">&gt;</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">           </span><span class="n"><a href="../../type_traits/is_nothrow_swappable.html">is_nothrow_swappable_v</a></span><span class="o">&lt;</span><span class="n">mapped_container_type</span><span class="o">&gt;</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">           </span><span class="n"><a href="../../type_traits/is_nothrow_swappable.html">is_nothrow_swappable_v</a></span><span class="o">&lt;</span><span class="n">key_compare</span><span class="o">&gt;</span><span class="p">);</span><span class="w">          </span><span class="c1">// (1) C++26</span>
 </code></pre></div>
 </p>
 <h2>概要</h2>
@@ -296,6 +299,10 @@ <h3>処理系</h3>
 <h2>参照</h2>
 <ul>
 <li><a href="https://open-std.org/jtc1/sc22/wg21/docs/papers/2025/p3372r3.html" target="_blank">P3372R3 constexpr containers and adaptors</a></li>
+<li><a href="https://open-std.org/jtc1/sc22/wg21/docs/papers/2025/p3567r2.html" target="_blank">P3567R2 flat_meow Fixes</a><ul>
+<li>C++26で、<code>noexcept</code>指定が無条件から条件付きに変更された。内部コンテナと比較関数オブジェクトの<code>swap</code>が<a class="cpprefjp-defined-word" data-desc="問題が発生したときに、現在実行位置を過去に通過・記録した位置に戻し、文脈情報を添えて紐づけられた処理(例外ハンドラー)を呼び出す仕組み。またはその事態">例外</a>を送出しない場合にのみ<code>noexcept</code>となる</li>
+</ul>
+</li>
 </ul></div>
 
       </div>