|
68 | 68 |
|
69 | 69 | </head> |
70 | 70 | <body> |
71 | | -<header data-kunai-mdinfo="{"meta": {"header": ["algorithm"], "namespace": ["std::ranges"], "id-type": ["function template"], "cpp": ["cpp20"]}, "sources": [{"id": "fbc2d6b086358b45b97e6152fcddb5794f3db28b", "source": "#include <algorithm>\n#include <iostream>\n#include <list>\n\nint main() {\n std::list<int> ls = { 1,2,3,4,5 };\n // 1,2,3 \u306e\u7bc4\u56f2\u3092\u30013,4,5 \u306e\u5024\u306e\u3042\u308b\u7bc4\u56f2\u3078\u30b3\u30d4\u30fc\u3059\u308b\n std::ranges::copy_backward(ls.begin(), std::next(ls.begin(), 3), ls.end());\n\n // \u4ee5\u4e0b\u306e\u30b3\u30fc\u30c9\u3060\u3068\u671f\u5f85\u3057\u305f\u7d50\u679c\u306b\u306a\u3089\u306a\u3044\u3053\u3068\u3092\u78ba\u8a8d\u3057\u3088\u3046\n // std::ranges::copy(ls.begin(), std::next(ls.begin(), 3), std::next(ls.begin(), 2));\n\n std::ranges::copy(ls.begin(), ls.end(), std::ostream_iterator<int>(std::cout, \",\"));\n}\n"}], "page_id": ["reference", "algorithm", "ranges_copy_backward"]}"> |
| 71 | +<header data-kunai-mdinfo="{"meta": {"header": ["algorithm"], "namespace": ["std::ranges"], "id-type": ["function template"], "cpp": ["cpp20"]}, "sources": [{"id": "0e229b9a9ae52b9f3926d5440f9eb7df73bdbeea", "source": "#include <algorithm>\n#include <iostream>\n#include <list>\n#include <iterator>\n\nint main() {\n std::list<int> ls = { 1,2,3,4,5 };\n // 1,2,3 \u306e\u7bc4\u56f2\u3092\u30013,4,5 \u306e\u5024\u306e\u3042\u308b\u7bc4\u56f2\u3078\u30b3\u30d4\u30fc\u3059\u308b\n std::ranges::copy_backward(ls.begin(), std::next(ls.begin(), 3), ls.end());\n\n // \u4ee5\u4e0b\u306e\u30b3\u30fc\u30c9\u3060\u3068\u671f\u5f85\u3057\u305f\u7d50\u679c\u306b\u306a\u3089\u306a\u3044\u3053\u3068\u3092\u78ba\u8a8d\u3057\u3088\u3046\n // std::ranges::copy(ls.begin(), std::next(ls.begin(), 3), std::next(ls.begin(), 2));\n\n std::ranges::copy(ls.begin(), ls.end(), std::ostream_iterator<int>(std::cout, \",\"));\n}\n"}], "page_id": ["reference", "algorithm", "ranges_copy_backward"]}"> |
72 | 72 | <nav class="navbar navbar-default" role="navigation"> |
73 | 73 | <div class="container-fluid"> |
74 | 74 | <div class="navbar-header"> |
|
188 | 188 |
|
189 | 189 | <p class="text-right"><small> |
190 | 190 | 最終更新日時(UTC): |
191 | | - <span itemprop="datePublished" content="2025-07-08T15:33:39"> |
192 | | - 2025年07月08日 15時33分39秒 |
| 191 | + <span itemprop="datePublished" content="2025-09-25T15:38:13"> |
| 192 | + 2025年09月25日 15時38分13秒 |
193 | 193 | </span> |
194 | 194 | <br/> |
195 | 195 | <span itemprop="author" itemscope itemtype="http://schema.org/Person"> |
196 | | - <span itemprop="name">Akira Takahashi</span> |
| 196 | + <span itemprop="name">Raclamusi</span> |
197 | 197 | </span> |
198 | 198 | が更新 |
199 | 199 | </small></p> |
@@ -252,9 +252,10 @@ <h2><a class="cpprefjp-defined-word" data-desc="関数等の意味論を構成 |
252 | 252 | <h2>備考</h2> |
253 | 253 | <p><code>last</code> が <code>[result - (last-first), result)</code> の範囲内にあるときには、<code>copy()</code> の代わりに <code>copy_backward()</code> を使うべきである。</p> |
254 | 254 | <h2>例</h2> |
255 | | -<p><div class="yata" id="fbc2d6b086358b45b97e6152fcddb5794f3db28b"><div class="codehilite"><pre><span></span><code><span class="cp">#include</span> <span class="cpf"><a href="../algorithm.html"><algorithm></a></span><span class="cp"></span> |
| 255 | +<p><div class="yata" id="0e229b9a9ae52b9f3926d5440f9eb7df73bdbeea"><div class="codehilite"><pre><span></span><code><span class="cp">#include</span> <span class="cpf"><a href="../algorithm.html"><algorithm></a></span><span class="cp"></span> |
256 | 256 | <span class="cp">#include</span> <span class="cpf"><a href="../iostream.html"><iostream></a></span><span class="cp"></span> |
257 | 257 | <span class="cp">#include</span> <span class="cpf"><a href="../list.html"><list></a></span><span class="cp"></span> |
| 258 | +<span class="cp">#include</span> <span class="cpf"><a href="../iterator.html"><iterator></a></span><span class="cp"></span> |
258 | 259 |
|
259 | 260 | <span class="kt">int</span> <span class="nf">main</span><span class="p">()</span> <span class="p">{</span> |
260 | 261 | <span class="n"><a href="../list/list.html">std::list</a></span><span class="o"><</span><span class="kt">int</span><span class="o">></span> <span class="n">ls</span> <span class="o">=</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">3</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">5</span> <span class="p">};</span> |
|
0 commit comments