update automatically

Author: cpprefjp-autoupdate

lang/cpp20/consistent_comparison.html

@@ -346,8 +346,8 @@ <h3>operator==</h3>
   <span class="k">auto</span> <span class="k">operator</span><span class="o">&lt;=&gt;</span><span class="p">(</span><span class="k">const</span> <span class="n">not_eq_comparable</span><span class="o">&amp;</span> <span class="n">that</span><span class="p">)</span> <span class="k">const</span> <span class="o">-&gt;</span> <span class="n">std</span><span class="o">::</span><span class="n">weak_ordering</span> <span class="p">{</span>
     <span class="c1">//大文字小文字を同値として扱って比較</span>
     <span class="k">for</span> <span class="p">(</span><span class="n"><a href="../../reference/cstddef/size_t.html">std::size_t</a></span> <span class="n">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="k">sizeof</span><span class="p">(</span><span class="k">this</span><span class="o">-&gt;</span><span class="n">str</span><span class="p">);</span> <span class="o">++</span><span class="n">i</span><span class="p">)</span> <span class="p">{</span>
-      <span class="kt">char</span> <span class="n">l1</span> <span class="o">=</span> <span class="n"><a href="../../reference/cctype/tolower.html">std::tolower</a></span><span class="p">(</span><span class="k">this</span><span class="o">-&gt;</span><span class="n">str</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span>
-      <span class="kt">char</span> <span class="n">l2</span> <span class="o">=</span> <span class="n"><a href="../../reference/cctype/tolower.html">std::tolower</a></span><span class="p">(</span><span class="n">that</span><span class="p">.</span><span class="n">str</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span>
+      <span class="kt">char</span> <span class="n">l1</span> <span class="o">=</span> <span class="n">std</span><span class="o">::</span><span class="n">tolower</span><span class="p">(</span><span class="k">this</span><span class="o">-&gt;</span><span class="n">str</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span>
+      <span class="kt">char</span> <span class="n">l2</span> <span class="o">=</span> <span class="n">std</span><span class="o">::</span><span class="n">tolower</span><span class="p">(</span><span class="n">that</span><span class="p">.</span><span class="n">str</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span>
       <span class="k">if</span> <span class="p">(</span><span class="n">l1</span> <span class="o">!=</span> <span class="n">l2</span><span class="p">)</span> <span class="p">{</span>
         <span class="k">return</span> <span class="n">l1</span> <span class="o">&lt;=&gt;</span> <span class="n">l2</span><span class="p">;</span>
       <span class="p">}</span>
@@ -373,8 +373,8 @@ <h3>operator==</h3>
   <span class="k">auto</span> <span class="k">operator</span><span class="o">&lt;=&gt;</span><span class="p">(</span><span class="k">const</span> <span class="n">eq_comparable</span><span class="o">&amp;</span> <span class="n">that</span><span class="p">)</span> <span class="k">const</span> <span class="o">-&gt;</span> <span class="n">std</span><span class="o">::</span><span class="n">weak_ordering</span> <span class="p">{</span>
     <span class="c1">//大文字小文字を同値として扱って比較</span>
     <span class="k">for</span> <span class="p">(</span><span class="n"><a href="../../reference/cstddef/size_t.html">std::size_t</a></span> <span class="n">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="k">sizeof</span><span class="p">(</span><span class="k">this</span><span class="o">-&gt;</span><span class="n">str</span><span class="p">);</span> <span class="o">++</span><span class="n">i</span><span class="p">)</span> <span class="p">{</span>
-      <span class="kt">char</span> <span class="n">l1</span> <span class="o">=</span> <span class="n"><a href="../../reference/cctype/tolower.html">std::tolower</a></span><span class="p">(</span><span class="k">this</span><span class="o">-&gt;</span><span class="n">str</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span>
-      <span class="kt">char</span> <span class="n">l2</span> <span class="o">=</span> <span class="n"><a href="../../reference/cctype/tolower.html">std::tolower</a></span><span class="p">(</span><span class="n">that</span><span class="p">.</span><span class="n">str</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span>
+      <span class="kt">char</span> <span class="n">l1</span> <span class="o">=</span> <span class="n">std</span><span class="o">::</span><span class="n">tolower</span><span class="p">(</span><span class="k">this</span><span class="o">-&gt;</span><span class="n">str</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span>
+      <span class="kt">char</span> <span class="n">l2</span> <span class="o">=</span> <span class="n">std</span><span class="o">::</span><span class="n">tolower</span><span class="p">(</span><span class="n">that</span><span class="p">.</span><span class="n">str</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span>
       <span class="k">if</span> <span class="p">(</span><span class="n">l1</span> <span class="o">!=</span> <span class="n">l2</span><span class="p">)</span> <span class="p">{</span>
         <span class="k">return</span> <span class="n">l1</span> <span class="o">&lt;=&gt;</span> <span class="n">l2</span><span class="p">;</span>
       <span class="p">}</span>
@@ -385,7 +385,7 @@ <h3>operator==</h3>
   <span class="kt">bool</span> <span class="k">operator</span><span class="o">==</span><span class="p">(</span><span class="k">const</span> <span class="n">eq_comparable</span><span class="o">&amp;</span> <span class="n">that</span><span class="p">)</span> <span class="k">const</span> <span class="p">{</span>
     <span class="c1">//大文字小文字を同値として扱って比較</span>
     <span class="k">for</span> <span class="p">(</span><span class="n"><a href="../../reference/cstddef/size_t.html">std::size_t</a></span> <span class="n">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="k">sizeof</span><span class="p">(</span><span class="k">this</span><span class="o">-&gt;</span><span class="n">str</span><span class="p">);</span> <span class="o">++</span><span class="n">i</span><span class="p">)</span> <span class="p">{</span>
-      <span class="k">if</span> <span class="p">(</span><span class="n"><a href="../../reference/cctype/tolower.html">std::tolower</a></span><span class="p">(</span><span class="k">this</span><span class="o">-&gt;</span><span class="n">str</span><span class="p">[</span><span class="n">i</span><span class="p">])</span> <span class="o">!=</span> <span class="n"><a href="../../reference/cctype/tolower.html">std::tolower</a></span><span class="p">(</span><span class="n">that</span><span class="p">.</span><span class="n">str</span><span class="p">[</span><span class="n">i</span><span class="p">]))</span> <span class="k">return</span> <span class="nb">false</span><span class="p">;</span>
+      <span class="k">if</span> <span class="p">(</span><span class="n">std</span><span class="o">::</span><span class="n">tolower</span><span class="p">(</span><span class="k">this</span><span class="o">-&gt;</span><span class="n">str</span><span class="p">[</span><span class="n">i</span><span class="p">])</span> <span class="o">!=</span> <span class="n">std</span><span class="o">::</span><span class="n">tolower</span><span class="p">(</span><span class="n">that</span><span class="p">.</span><span class="n">str</span><span class="p">[</span><span class="n">i</span><span class="p">]))</span> <span class="k">return</span> <span class="nb">false</span><span class="p">;</span>
     <span class="p">}</span>
     <span class="k">return</span> <span class="nb">true</span><span class="p">;</span>
   <span class="p">}</span>

lang/cpp20/implicit_creation_of_objects_for_low-level_object_manipulation.html

@@ -323,7 +323,7 @@ <h3>動的配列の実装</h3>
 
   <span class="kt">void</span> <span class="nf">push_back</span><span class="p">(</span><span class="n">T</span> <span class="n">t</span><span class="p">)</span> <span class="p">{</span>
     <span class="k">if</span> <span class="p">(</span><span class="n">buf_end_size</span> <span class="o">==</span> <span class="n">buf_end_capacity</span><span class="p">)</span>
-      <span class="n">reserve</span><span class="p">(</span><span class="n"><a href="../../reference/algorithm/max.html">std::max</a></span><span class="o">&lt;</span><span class="n"><a href="../../reference/cstddef/size_t.html">std::size_t</a></span><span class="o">&gt;</span><span class="p">(</span><span class="n">size</span><span class="p">()</span> <span class="o">*</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">1</span><span class="p">));</span>
+      <span class="n">reserve</span><span class="p">(</span><span class="n">std</span><span class="o">::</span><span class="n">max</span><span class="o">&lt;</span><span class="n"><a href="../../reference/cstddef/size_t.html">std::size_t</a></span><span class="o">&gt;</span><span class="p">(</span><span class="n">size</span><span class="p">()</span> <span class="o">*</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">1</span><span class="p">));</span>
     <span class="k">new</span> <span class="p">(</span><span class="n">buf_end_size</span><span class="p">)</span> <span class="n">T</span><span class="p">(</span><span class="n">t</span><span class="p">);</span>
     <span class="n">buf_end_size</span> <span class="o">+=</span> <span class="k">sizeof</span><span class="p">(</span><span class="n">T</span><span class="p">);</span> <span class="c1">// #d 💀 UB</span>
   <span class="p">}</span>

lang/cpp23/literal_suffix_for_signed_size_t.html

@@ -247,10 +247,10 @@ <h3>min/maxに指定する2つの値の型</h3>
 <p><div class="codehilite"><pre><span></span><code><span class="n"><a href="../../reference/cstddef/size_t.html">std::size_t</a></span> <span class="n">size</span> <span class="o">=</span> <span class="err">…</span><span class="p">;</span>
 
 <span class="c1">// case 1</span>
-<span class="n"><a href="../../reference/cstddef/size_t.html">std::size_t</a></span> <span class="n">clamped_size</span> <span class="o">=</span> <span class="n"><a href="../../reference/algorithm/max.html">std::max</a></span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="n"><a href="../../reference/algorithm/min.html">std::min</a></span><span class="p">(</span><span class="mi">54</span><span class="p">,</span> <span class="n">size</span><span class="p">));</span>
+<span class="n"><a href="../../reference/cstddef/size_t.html">std::size_t</a></span> <span class="n">clamped_size</span> <span class="o">=</span> <span class="n">std</span><span class="o">::</span><span class="n">max</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="n">std</span><span class="o">::</span><span class="n">min</span><span class="p">(</span><span class="mi">54</span><span class="p">,</span> <span class="n">size</span><span class="p">));</span>
 
 <span class="c1">// case 2</span>
-<span class="n"><a href="../../reference/cstddef/size_t.html">std::size_t</a></span> <span class="n">clamped_size</span> <span class="o">=</span> <span class="n"><a href="../../reference/algorithm/max.html">std::max</a></span><span class="p">(</span><span class="mi">0u</span><span class="n">z</span><span class="p">,</span> <span class="n"><a href="../../reference/algorithm/min.html">std::min</a></span><span class="p">(</span><span class="mi">54u</span><span class="n">z</span><span class="p">,</span> <span class="n">size</span><span class="p">));</span>
+<span class="n"><a href="../../reference/cstddef/size_t.html">std::size_t</a></span> <span class="n">clamped_size</span> <span class="o">=</span> <span class="n">std</span><span class="o">::</span><span class="n">max</span><span class="p">(</span><span class="mi">0u</span><span class="n">z</span><span class="p">,</span> <span class="n">std</span><span class="o">::</span><span class="n">min</span><span class="p">(</span><span class="mi">54u</span><span class="n">z</span><span class="p">,</span> <span class="n">size</span><span class="p">));</span>
 </code></pre></div>
 </p>
 <p>case 1はコンパイルエラーとなる。<code><a href="../../reference/algorithm/min.html">std::min()</a></code>と<code><a href="../../reference/algorithm/max.html">std::max()</a></code>は2つの引数が同じ型であることを期待するため、<code>int</code>型の値と<code><a href="../../reference/cstddef/size_t.html">size_t</a></code>型の値の2つ渡そうとするとコンパイルエラーとなる。<code>std::max&lt;std::size_t&gt;(a, b)</code>のようにテンプレート引数を明示的に指定する回避方法もある。</p>

reference/algorithm/adjacent_find.html

@@ -284,7 +284,7 @@ <h2>例</h2>
   <span class="n"><a href="../vector/vector.html">std::vector</a></span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span> <span class="n">v</span> <span class="o">=</span> <span class="p">{</span> <span class="mi">1</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">2</span> <span class="p">};</span>
 
   <span class="c1">// 同じ値が連続している最初の要素を検索する</span>
-  <span class="k">auto</span> <span class="n">it</span> <span class="o">=</span> <span class="n"><a href="">std::adjacent_find</a></span><span class="p">(</span><span class="n"><a href="../vector/vector/begin.html">v.begin()</a></span><span class="p">,</span> <span class="n"><a href="../vector/vector/end.html">v.end()</a></span><span class="p">);</span>
+  <span class="k">auto</span> <span class="n">it</span> <span class="o">=</span> <span class="n">std</span><span class="o">::</span><span class="n"><span style="color:#ff0000">adjacent_find</span></span><span class="p">(</span><span class="n"><a href="../vector/vector/begin.html">v.begin()</a></span><span class="p">,</span> <span class="n"><a href="../vector/vector/end.html">v.end()</a></span><span class="p">);</span>
   <span class="k">if</span> <span class="p">(</span><span class="n">it</span> <span class="o">==</span> <span class="n"><a href="../vector/vector/end.html">v.end()</a></span><span class="p">)</span> <span class="p">{</span>
     <span class="n"><a href="../iostream/cout.html">std::cout</a></span> <span class="o">&lt;&lt;</span> <span class="s">"not found"</span> <span class="o">&lt;&lt;</span> <span class="n"><a href="../ostream/endl.html">std::endl</a></span><span class="p">;</span>
   <span class="p">}</span> <span class="k">else</span> <span class="p">{</span>

reference/algorithm/binary_search.html

@@ -262,7 +262,7 @@ <h2>備考</h2>
 <li>C++26 : 引数として波カッコ初期化<code>{}</code>を受け付ける
   <br />
 <div class="codehilite"><pre><span></span><code><span class="n"><a href="../vector/vector.html">std::vector</a></span><span class="o">&lt;</span><span class="n">T</span><span class="o">&gt;</span> <span class="n">v</span><span class="p">;</span>
-<span class="kt">bool</span> <span class="n">found</span> <span class="o">=</span> <span class="n"><a href="">std::binary_search</a></span><span class="p">(</span><span class="n"><a href="../vector/vector/begin.html">v.begin()</a></span><span class="p">,</span> <span class="n"><a href="../vector/vector/end.html">v.end()</a></span><span class="p">,</span> <span class="p">{</span><span class="n">a</span><span class="p">,</span> <span class="n">b</span><span class="p">});</span>
+<span class="kt">bool</span> <span class="n">found</span> <span class="o">=</span> <span class="n">std</span><span class="o">::</span><span class="n">binary_search</span><span class="p">(</span><span class="n"><a href="../vector/vector/begin.html">v.begin()</a></span><span class="p">,</span> <span class="n"><a href="../vector/vector/end.html">v.end()</a></span><span class="p">,</span> <span class="p">{</span><span class="n">a</span><span class="p">,</span> <span class="n">b</span><span class="p">});</span>
 </code></pre></div>
 </li>
 </ul>

reference/algorithm/count.html

@@ -264,7 +264,7 @@ <h2>備考</h2>
 <li>C++26 : 引数として波カッコ初期化<code>{}</code>を受け付ける
   <br />
 <div class="codehilite"><pre><span></span><code><span class="n"><a href="../vector/vector.html">std::vector</a></span><span class="o">&lt;</span><span class="n">T</span><span class="o">&gt;</span> <span class="n">v</span><span class="p">;</span>
-<span class="kt">int</span> <span class="n">n</span> <span class="o">=</span> <span class="n"><a href="">std::count</a></span><span class="p">(</span><span class="n"><a href="../vector/vector/begin.html">v.begin()</a></span><span class="p">,</span> <span class="n"><a href="../vector/vector/end.html">v.end()</a></span><span class="p">,</span> <span class="p">{</span><span class="n">a</span><span class="p">,</span> <span class="n">b</span><span class="p">});</span>
+<span class="kt">int</span> <span class="n">n</span> <span class="o">=</span> <span class="n">std</span><span class="o">::</span><span class="n">count</span><span class="p">(</span><span class="n"><a href="../vector/vector/begin.html">v.begin()</a></span><span class="p">,</span> <span class="n"><a href="../vector/vector/end.html">v.end()</a></span><span class="p">,</span> <span class="p">{</span><span class="n">a</span><span class="p">,</span> <span class="n">b</span><span class="p">});</span>
 </code></pre></div>
 </li>
 </ul>