{"title":"cpprefjp - C++\u65e5\u672c\u8a9e\u30ea\u30d5\u30a1\u30ec\u30f3\u30b9","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io"}},"updated":"2026-04-17T15:39:02.698632","id":"ece5432b-5dab-4138-9f1c-02aa8438a359","entry":[{"title":"adjacent_find -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/adjacent_find.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/adjacent_find.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/adjacent_find.md b\/reference\/algorithm\/adjacent_find.md\nindex fe20630d8..50b87f554 100644\n--- a\/reference\/algorithm\/adjacent_find.md\n+++ b\/reference\/algorithm\/adjacent_find.md\n@@ -157,6 +157,11 @@ ForwardIterator adjacent_find(ForwardIterator first, ForwardIterator last, Binar\n - [ICC](\/implementation.md#icc): ??\n - [Visual C++](\/implementation.md#visual_cpp): ??\n \n+\n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::adjacent_find`](\/reference\/algorithm\/ranges_adjacent_find.md)\n+\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P0574R1 Algorithm Complexity Constraints and Parallel Overloads](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0574r1.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"all_of -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/all_of.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/all_of.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/all_of.md b\/reference\/algorithm\/all_of.md\nindex 120a26102..3479a06d5 100644\n--- a\/reference\/algorithm\/all_of.md\n+++ b\/reference\/algorithm\/all_of.md\n@@ -88,6 +88,7 @@ bool all_of(InputIterator first, InputIterator last, Predicate pred) {\n ## \u95a2\u9023\u9805\u76ee\n - [`any_of`](\/reference\/algorithm\/any_of.md)\n - [`none_of`](\/reference\/algorithm\/none_of.md)\n+- [`ranges::all_of`](\/reference\/algorithm\/ranges_all_of.md)\n \n \n ## \u53c2\u7167\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"any_of -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/any_of.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/any_of.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/any_of.md b\/reference\/algorithm\/any_of.md\nindex 1923e1dbe..a0f9beeff 100644\n--- a\/reference\/algorithm\/any_of.md\n+++ b\/reference\/algorithm\/any_of.md\n@@ -89,6 +89,7 @@ bool any_of(InputIterator first, InputIterator last, Predicate pred) {\n ## \u95a2\u9023\u9805\u76ee\n - [`all_of`](\/reference\/algorithm\/all_of.md)\n - [`none_of`](\/reference\/algorithm\/none_of.md)\n+- [`ranges::any_of`](\/reference\/algorithm\/ranges_any_of.md)\n \n \n ## \u53c2\u7167\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"binary_search -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/binary_search.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/binary_search.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/binary_search.md b\/reference\/algorithm\/binary_search.md\nindex a1c10635e..6ce083c7b 100644\n--- a\/reference\/algorithm\/binary_search.md\n+++ b\/reference\/algorithm\/binary_search.md\n@@ -163,6 +163,11 @@ bool binary_search(ForwardIterator first, ForwardIterator last,\n - [ICC](\/implementation.md#icc): ??\n - [Visual C++](\/implementation.md#visual_cpp): ??\n \n+\n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::binary_search`](\/reference\/algorithm\/ranges_binary_search.md)\n+\n+\n ## \u53c2\u7167\n - [LWG Issue 787. complexity of `binary_search`](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/lwg-defects.html#787)\n     - C++03\u307e\u3067\u306e\u8a08\u7b97\u91cf\u304c\u9593\u9055\u3063\u3066\u3044\u305f\u306e\u3067\u3001C++11\u3067\u4fee\u6b63\u3002\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"clamp -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/clamp.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/clamp.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/clamp.md b\/reference\/algorithm\/clamp.md\nindex 1500a095f..f54883f9c 100644\n--- a\/reference\/algorithm\/clamp.md\n+++ b\/reference\/algorithm\/clamp.md\n@@ -78,6 +78,10 @@ int main()\n - [Visual C++](\/implementation.md#visual_cpp): ??\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::clamp`](\/reference\/algorithm\/ranges_clamp.md)\n+\n+\n ## \u53c2\u7167\n - [N4536 An algorithm to "clamp" a value between a pair of boundary values](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2015\/n4536.html)\n - [P0025R0 An algorithm to "clamp" a value between a pair of boundary values (revision 1)](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2015\/p0025r0.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"copy -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/copy.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/copy.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/copy.md b\/reference\/algorithm\/copy.md\nindex b2a8fdc65..1cce8b180 100644\n--- a\/reference\/algorithm\/copy.md\n+++ b\/reference\/algorithm\/copy.md\n@@ -102,6 +102,11 @@ OutputIterator copy(InputIterator first, InputIterator last, OutputIterator resu\n - [ICC](\/implementation.md#icc): ??\n - [Visual C++](\/implementation.md#visual_cpp): ??\n \n+\n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::copy`](\/reference\/algorithm\/ranges_copy.md)\n+\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P0467R2 Iterator Concerns for Parallel Algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0467r2.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"copy_backward -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/copy_backward.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/copy_backward.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/copy_backward.md b\/reference\/algorithm\/copy_backward.md\nindex 5c1fc81de..91e72f01f 100644\n--- a\/reference\/algorithm\/copy_backward.md\n+++ b\/reference\/algorithm\/copy_backward.md\n@@ -95,5 +95,9 @@ BidirectionalIterator2 copy_backward(BidirectionalIterator1 first,\n - [Visual C++](\/implementation.md#visual_cpp): ??\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::copy_backward`](\/reference\/algorithm\/ranges_copy_backward.md)\n+\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"copy_if -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/copy_if.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/copy_if.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/copy_if.md b\/reference\/algorithm\/copy_if.md\nindex fae041b1d..1a2fb6c24 100644\n--- a\/reference\/algorithm\/copy_if.md\n+++ b\/reference\/algorithm\/copy_if.md\n@@ -112,6 +112,10 @@ OutputIterator copy_if(InputIterator first, InputIterator last,\n - [Visual C++](\/implementation.md#visual_cpp): 2010 [mark verified], 2012 [mark verified], 2013 [mark verified], 2015 [mark verified]\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::copy_if`](\/reference\/algorithm\/ranges_copy_if.md)\n+\n+\n ## \u53c2\u7167\n - [N2569 More STL algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2008\/n2569.pdf)\n - [N2666 More STL algorithms (revision 2)](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2008\/n2666.pdf)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"copy_n -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/copy_n.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/copy_n.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/copy_n.md b\/reference\/algorithm\/copy_n.md\nindex 4e495dcde..a742b094c 100644\n--- a\/reference\/algorithm\/copy_n.md\n+++ b\/reference\/algorithm\/copy_n.md\n@@ -89,6 +89,10 @@ OutputIterator copy_n(InputIterator first, Size n, OutputIterator result) {\n - [Visual C++](\/implementation.md#visual_cpp): 2010 [mark verified], 2012 [mark verified], 2013 [mark verified], 2015 [mark verified]\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::copy_n`](\/reference\/algorithm\/ranges_copy_n.md)\n+\n+\n ## \u53c2\u7167\n - [N2569 More STL algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2008\/n2569.pdf)\n - [N2666 More STL algorithms (revision 2)](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2008\/n2666.pdf)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"count -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/count.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/count.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/count.md b\/reference\/algorithm\/count.md\nindex 324da12ef..673b89b14 100644\n--- a\/reference\/algorithm\/count.md\n+++ b\/reference\/algorithm\/count.md\n@@ -141,6 +141,11 @@ typename iterator_traits<InputIterator>::difference_type\n - [ICC](\/implementation.md#icc): ??\n - [Visual C++](\/implementation.md#visual_cpp): ??\n \n+\n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::count`](\/reference\/algorithm\/ranges_count.md)\n+\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P0467R2 Iterator Concerns for Parallel Algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0467r2.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"count_if -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/count_if.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/count_if.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/count_if.md b\/reference\/algorithm\/count_if.md\nindex 1f3e8983e..56181fd2c 100644\n--- a\/reference\/algorithm\/count_if.md\n+++ b\/reference\/algorithm\/count_if.md\n@@ -83,6 +83,10 @@ typename iterator_traits<InputIterator>::difference_type\n - [Visual C++](\/implementation.md#visual_cpp): ??\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::count_if`](\/reference\/algorithm\/ranges_count_if.md)\n+\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P0467R2 Iterator Concerns for Parallel Algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0467r2.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"equal -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/equal.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/equal.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/equal.md b\/reference\/algorithm\/equal.md\nindex 9723fa313..9ba94dc1d 100644\n--- a\/reference\/algorithm\/equal.md\n+++ b\/reference\/algorithm\/equal.md\n@@ -219,6 +219,10 @@ inline bool equal(InputIterator1 first1, InputIterator1 last1,\n - [Visual C++](\/implementation.md#visual_cpp): 2015 [mark verified]\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::equal`](\/reference\/algorithm\/ranges_equal.md)\n+\n+\n ## \u53c2\u7167\n - [N3671 Making non-modifying sequence operations more robust: Revision 2](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2013\/n3671.html)\n     - C++14\u304b\u3089\u8ffd\u52a0\u3055\u308c\u305f\u3001`last2`\u3092\u53d7\u3051\u53d6\u308b\u30aa\u30fc\u30d0\u30fc\u30ed\u30fc\u30c9\u306e\u63d0\u6848\u6587\u66f8\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"equal_range -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/equal_range.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/equal_range.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/equal_range.md b\/reference\/algorithm\/equal_range.md\nindex 0b6d04030..c7a2a6ed2 100644\n--- a\/reference\/algorithm\/equal_range.md\n+++ b\/reference\/algorithm\/equal_range.md\n@@ -147,6 +147,11 @@ int main() {\n 3,4\n ```\n \n+\n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::equal_range`](\/reference\/algorithm\/ranges_equal_range.md)\n+\n+\n ## \u53c2\u7167\n - [LWG Issue 384. `equal_range` has unimplementable runtime complexity](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/lwg-defects.html#384)\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"fill -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/fill.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/fill.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/fill.md b\/reference\/algorithm\/fill.md\nindex 80b66018c..c345c7dac 100644\n--- a\/reference\/algorithm\/fill.md\n+++ b\/reference\/algorithm\/fill.md\n@@ -136,6 +136,10 @@ void fill(ForwardIterator first, ForwardIterator last, const T& value) {\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::fill`](\/reference\/algorithm\/ranges_fill.md)\n+\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P2248R8 Enabling list-initialization for algorithms](https:\/\/open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2024\/p2248r8.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"fill_n -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/fill_n.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/fill_n.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/fill_n.md b\/reference\/algorithm\/fill_n.md\nindex 5eb8a5bd5..b89314d47 100644\n--- a\/reference\/algorithm\/fill_n.md\n+++ b\/reference\/algorithm\/fill_n.md\n@@ -169,6 +169,10 @@ fill_n(OutputIterator first, Size n, const T& value) {\n \t- C++11\u3078\u306e\u5bfe\u5fdc\uff08\u623b\u308a\u5024\u306e\u5909\u66f4\uff09\u306f2012\u304b\u3089\u3002\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::fill_n`](\/reference\/algorithm\/ranges_fill_n.md)\n+\n+\n ## \u53c2\u7167\n - [LWG DR865. More algorithms that throw away information](http:\/\/cplusplus.github.io\/LWG\/lwg-defects.html#865)  \n \t\u623b\u308a\u5024\u304c\u8ffd\u52a0\u3055\u308c\u308b\u304d\u3063\u304b\u3051\u3068\u306a\u3063\u305f\u30ec\u30dd\u30fc\u30c8\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"find -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/find.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/find.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/find.md b\/reference\/algorithm\/find.md\nindex 2eb04c2dd..7cab0e39a 100644\n--- a\/reference\/algorithm\/find.md\n+++ b\/reference\/algorithm\/find.md\n@@ -134,6 +134,10 @@ InputIterator find(InputIterator first, InputIterator last, const T& value) {\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::find`](\/reference\/algorithm\/ranges_find.md)\n+\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P0467R2 Iterator Concerns for Parallel Algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0467r2.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"find_end -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/find_end.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/find_end.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/find_end.md b\/reference\/algorithm\/find_end.md\nindex 1998bcd9a..196d52b41 100644\n--- a\/reference\/algorithm\/find_end.md\n+++ b\/reference\/algorithm\/find_end.md\n@@ -136,6 +136,10 @@ ForwardIterator1 find_end(ForwardIterator1 first1, ForwardIterator1 last1,\n * std::search[link search.md]\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::find_end`](\/reference\/algorithm\/ranges_find_end.md)\n+\n+\n ## \u53c2\u7167\n - [LWG Issue 2150. Unclear specification of `find_end`](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/lwg-defects.html#2150)\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"find_first_of -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/find_first_of.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/find_first_of.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/find_first_of.md b\/reference\/algorithm\/find_first_of.md\nindex ba3158c38..bc766dc3d 100644\n--- a\/reference\/algorithm\/find_first_of.md\n+++ b\/reference\/algorithm\/find_first_of.md\n@@ -136,6 +136,10 @@ InputIterator find_first_of(InputIterator first1, InputIterator last1,\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::find_first_of`](\/reference\/algorithm\/ranges_find_first_of.md)\n+\n+\n ## \u53c2\u7167\n - [LWG Issue 576. `find_first_of` is overconstrained](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/lwg-defects.html#576)\n     - C++11\u304b\u3089\u3001\u30d1\u30e9\u30e1\u30fc\u30bf\u306e\u30a4\u30c6\u30ec\u30fc\u30bf\u578b\u306b\u5bfe\u3059\u308b\u5236\u7d04\u304c\u7de9\u548c\u3055\u308c\u3001`ForwardIterator`\u304b\u3089`InputIterator`\u306b\u5909\u66f4\u306b\u306a\u3063\u305f\u7d4c\u7def\u306e\u30ec\u30dd\u30fc\u30c8\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"find_if -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/find_if.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/find_if.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/find_if.md b\/reference\/algorithm\/find_if.md\nindex c3cb3a8ad..fcb6e1ec4 100644\n--- a\/reference\/algorithm\/find_if.md\n+++ b\/reference\/algorithm\/find_if.md\n@@ -71,6 +71,10 @@ InputIterator find_if(InputIterator first, InputIterator last, Predicate pred) {\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::find_if`](\/reference\/algorithm\/ranges_find_if.md)\n+\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P0467R2 Iterator Concerns for Parallel Algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0467r2.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"find_if_not -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/find_if_not.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/find_if_not.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/find_if_not.md b\/reference\/algorithm\/find_if_not.md\nindex 352e17c24..42c217779 100644\n--- a\/reference\/algorithm\/find_if_not.md\n+++ b\/reference\/algorithm\/find_if_not.md\n@@ -72,6 +72,10 @@ InputIterator find_if_not(InputIterator first, InputIterator last, Predicate pre\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::find_if_not`](\/reference\/algorithm\/ranges_find_if_not.md)\n+\n+\n ## \u53c2\u7167\n - [N2569 More STL algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2008\/n2569.pdf)\n - [N2666 More STL algorithms (revision 2)](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2008\/n2666.pdf)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"for_each -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/for_each.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/for_each.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/for_each.md b\/reference\/algorithm\/for_each.md\nindex 1dace0823..dc270b172 100644\n--- a\/reference\/algorithm\/for_each.md\n+++ b\/reference\/algorithm\/for_each.md\n@@ -157,6 +157,10 @@ Function for_each(InputIterator first, InputIterator last, Function f) {\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::for_each`](\/reference\/algorithm\/ranges_for_each.md)\n+\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P0467R2 Iterator Concerns for Parallel Algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0467r2.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"for_each_n -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/for_each_n.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/for_each_n.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/for_each_n.md b\/reference\/algorithm\/for_each_n.md\nindex 452705bc0..a175ce6ae 100644\n--- a\/reference\/algorithm\/for_each_n.md\n+++ b\/reference\/algorithm\/for_each_n.md\n@@ -94,6 +94,10 @@ int main()\n - [Visual C++](\/implementation.md#visual_cpp): ??\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::for_each_n`](\/reference\/algorithm\/ranges_for_each_n.md)\n+\n+\n ## \u53c2\u7167\n - [P0024R2 The Parallelism TS Should be Standardized](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2016\/p0024r2.html)\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"generate -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/generate.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/generate.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/generate.md b\/reference\/algorithm\/generate.md\nindex 17aacb71a..5687804b6 100644\n--- a\/reference\/algorithm\/generate.md\n+++ b\/reference\/algorithm\/generate.md\n@@ -73,5 +73,9 @@ void generate(ForwardIterator first, ForwardIterator last, Generator gen) {\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::generate`](\/reference\/algorithm\/ranges_generate.md)\n+\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"generate_n -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/generate_n.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/generate_n.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/generate_n.md b\/reference\/algorithm\/generate_n.md\nindex b911b527d..c044fdd1d 100644\n--- a\/reference\/algorithm\/generate_n.md\n+++ b\/reference\/algorithm\/generate_n.md\n@@ -108,6 +108,10 @@ generate_n(OutputIterator first, Size n, Generator gen) {\n     - C++11\u3078\u306e\u5bfe\u5fdc\uff08\u623b\u308a\u5024\u306e\u5909\u66f4\uff09\u306f2012\u304b\u3089\u3002\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::generate_n`](\/reference\/algorithm\/ranges_generate_n.md)\n+\n+\n ## \u53c2\u7167\n - [LWG DR865. More algorithms that throw away information](http:\/\/cplusplus.github.io\/LWG\/lwg-defects.html#865)  \n \t\u623b\u308a\u5024\u304c\u8ffd\u52a0\u3055\u308c\u308b\u304d\u3063\u304b\u3051\u3068\u306a\u3063\u305f\u30ec\u30dd\u30fc\u30c8\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"includes -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/includes.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/includes.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/includes.md b\/reference\/algorithm\/includes.md\nindex 82b393e2c..e32059813 100644\n--- a\/reference\/algorithm\/includes.md\n+++ b\/reference\/algorithm\/includes.md\n@@ -121,6 +121,10 @@ bool includes(InputIterator1 first1, InputIterator1 last1,\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::includes`](\/reference\/algorithm\/ranges_includes.md)\n+\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P0467R2 Iterator Concerns for Parallel Algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0467r2.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"inplace_merge -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/inplace_merge.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/inplace_merge.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/inplace_merge.md b\/reference\/algorithm\/inplace_merge.md\nindex 2af32581f..865b27241 100644\n--- a\/reference\/algorithm\/inplace_merge.md\n+++ b\/reference\/algorithm\/inplace_merge.md\n@@ -108,6 +108,10 @@ int main()\n - [`inplace_merge` \u3092\u8aad\u3093\u3067\u307f\u305f](http:\/\/www.kmonos.net\/wlog\/115.html#_2300101215)\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::inplace_merge`](\/reference\/algorithm\/ranges_inplace_merge.md)\n+\n+\n ## \u53c2\u7167\n - [P2562R1 `constexpr` Stable Sorting](https:\/\/open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2022\/p2562r1.pdf)\n     - C++26\u304b\u3089`constexpr`\u306b\u5bfe\u5fdc\u3057\u305f\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"is_heap -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/is_heap.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/is_heap.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/is_heap.md b\/reference\/algorithm\/is_heap.md\nindex 6498b559b..d6395da0a 100644\n--- a\/reference\/algorithm\/is_heap.md\n+++ b\/reference\/algorithm\/is_heap.md\n@@ -89,6 +89,10 @@ before: is heap? false\n     - 2008\u3067\u306f\u3001`_HAS_TRADITIONAL_STL`\u30921\u306b\u5b9a\u7fa9\u3057\u3066\u304b\u3089`<algorithm>`\u3092\u30a4\u30f3\u30af\u30eb\u30fc\u30c9\u3059\u308b\u3068\u3001`stdext`\u540d\u524d\u7a7a\u9593\u3067`is_heap`\u304c\u5b9a\u7fa9\u3055\u308c\u308b\u3002\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::is_heap`](\/reference\/algorithm\/ranges_is_heap.md)\n+\n+\n ## \u53c2\u7167\n - [N2246 2 of the least crazy ideas for the standard library in C++0x](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2007\/n2246.html)\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"is_heap_until -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/is_heap_until.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/is_heap_until.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/is_heap_until.md b\/reference\/algorithm\/is_heap_until.md\nindex 094cb609c..d433e7d8d 100644\n--- a\/reference\/algorithm\/is_heap_until.md\n+++ b\/reference\/algorithm\/is_heap_until.md\n@@ -129,6 +129,10 @@ RandomAccessIterator is_heap_until(RandomAccessIterator first, RandomAccessItera\n - [Visual C++](\/implementation.md#visual_cpp): 2010 [mark verified], 2012 [mark verified], 2013 [mark verified], 2015 [mark verified]\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::is_heap_until`](\/reference\/algorithm\/ranges_is_heap_until.md)\n+\n+\n ## \u53c2\u7167\n - [N2246 2 of the least crazy ideas for the standard library in C++0x](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2007\/n2246.html)\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"is_partitioned -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/is_partitioned.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/is_partitioned.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/is_partitioned.md b\/reference\/algorithm\/is_partitioned.md\nindex 94506f950..81e331724 100644\n--- a\/reference\/algorithm\/is_partitioned.md\n+++ b\/reference\/algorithm\/is_partitioned.md\n@@ -110,6 +110,10 @@ bool is_partitioned(InputIterator first, InputIterator last, Predicate pred)\n - [Visual C++](\/implementation.md#visual_cpp): 2010 [mark verified], 2012 [mark verified], 2013 [mark verified], 2015 [mark verified]\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::is_partitioned`](\/reference\/algorithm\/ranges_is_partitioned.md)\n+\n+\n ## \u53c2\u7167\n - [N2569 More STL algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2008\/n2569.pdf)\n - [N2666 More STL algorithms (revision 2)](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2008\/n2666.pdf)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"is_permutation -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/is_permutation.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/is_permutation.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/is_permutation.md b\/reference\/algorithm\/is_permutation.md\nindex 62f24efd4..aac5049d1 100644\n--- a\/reference\/algorithm\/is_permutation.md\n+++ b\/reference\/algorithm\/is_permutation.md\n@@ -222,6 +222,11 @@ bool is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,\n - [Visual C++](\/implementation.md#visual_cpp): 2010 [mark verified], 2012 [mark verified], 2013 [mark verified], 2015 [mark verified]\n     - C++14\u3067\u8ffd\u52a0\u3055\u308c\u305f\u30aa\u30fc\u30d0\u30fc\u30ed\u30fc\u30c9\u306f2015\u304b\u3089\u5b9f\u88c5\u3055\u308c\u3066\u3044\u308b\u3002\n \n+\n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::is_permutation`](\/reference\/algorithm\/ranges_is_permutation.md)\n+\n+\n ## \u53c2\u7167\n - [N3671 Making non-modifying sequence operations more robust: Revision 2](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2013\/n3671.html)\n     - C++14\u304b\u3089\u8ffd\u52a0\u3055\u308c\u305f\u3001`last2`\u3092\u53d7\u3051\u53d6\u308b\u30aa\u30fc\u30d0\u30fc\u30ed\u30fc\u30c9\u306e\u63d0\u6848\u6587\u66f8\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"is_sorted -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/is_sorted.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/is_sorted.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/is_sorted.md b\/reference\/algorithm\/is_sorted.md\nindex f0c2de657..0779ec462 100644\n--- a\/reference\/algorithm\/is_sorted.md\n+++ b\/reference\/algorithm\/is_sorted.md\n@@ -83,6 +83,10 @@ before: is sorted? false\n     - 2008\u3067\u306f\u3001`_HAS_TRADITIONAL_STL`\u30921\u306b\u5b9a\u7fa9\u3057\u3066\u304b\u3089`<algorithm>`\u3092\u30a4\u30f3\u30af\u30eb\u30fc\u30c9\u3059\u308b\u3068\u3001`stdext`\u540d\u524d\u7a7a\u9593\u3067`is_sorted`\u304c\u5b9a\u7fa9\u3055\u308c\u308b\u3002\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::is_sorted`](\/reference\/algorithm\/ranges_is_sorted.md)\n+\n+\n ## \u53c2\u7167\n - [N2246 2 of the least crazy ideas for the standard library in C++0x](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2007\/n2246.html)\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"is_sorted_until -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/is_sorted_until.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/is_sorted_until.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/is_sorted_until.md b\/reference\/algorithm\/is_sorted_until.md\nindex 621f615d0..7965bb8b7 100644\n--- a\/reference\/algorithm\/is_sorted_until.md\n+++ b\/reference\/algorithm\/is_sorted_until.md\n@@ -111,6 +111,10 @@ ForwardIterator is_sorted_until(ForwardIterator first, ForwardIterator last)\n - [Visual C++](\/implementation.md#visual_cpp): 2010 [mark verified], 2012 [mark verified], 2013 [mark verified], 2015 [mark verified]\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::is_sorted_until`](\/reference\/algorithm\/ranges_is_sorted_until.md)\n+\n+\n ## \u53c2\u7167\n - [N2246 2 of the least crazy ideas for the standard library in C++0x](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2007\/n2246.html)\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"lexicographical_compare -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/lexicographical_compare.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/lexicographical_compare.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/lexicographical_compare.md b\/reference\/algorithm\/lexicographical_compare.md\nindex b486aed5d..35096690c 100644\n--- a\/reference\/algorithm\/lexicographical_compare.md\n+++ b\/reference\/algorithm\/lexicographical_compare.md\n@@ -181,6 +181,10 @@ bool lexicographical_compare(InputIterator1 first1, InputIterator1 last1,\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::lexicographical_compare`](\/reference\/algorithm\/ranges_lexicographical_compare.md)\n+\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P0467R2 Iterator Concerns for Parallel Algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0467r2.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"lower_bound -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/lower_bound.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/lower_bound.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/lower_bound.md b\/reference\/algorithm\/lower_bound.md\nindex 7b3b2e2f0..25716af75 100644\n--- a\/reference\/algorithm\/lower_bound.md\n+++ b\/reference\/algorithm\/lower_bound.md\n@@ -262,6 +262,11 @@ lower_bound(ForwardIterator first, ForwardIterator last, const T& value)\n * std::advance[link \/reference\/iterator\/advance.md]\n * std::iterator_traits[link \/reference\/iterator\/iterator_traits.md]\n \n+\n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::lower_bound`](\/reference\/algorithm\/ranges_lower_bound.md)\n+\n+\n ## \u53c2\u7167\n - [LWG Issue 384. `equal_range` has unimplementable runtime complexity](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/lwg-defects.html#384)\n - [LWG Issue 2150. Unclear specification of `find_end`](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/lwg-defects.html#2150)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"make_heap -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/make_heap.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/make_heap.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/make_heap.md b\/reference\/algorithm\/make_heap.md\nindex a57a55f69..5779fabe1 100644\n--- a\/reference\/algorithm\/make_heap.md\n+++ b\/reference\/algorithm\/make_heap.md\n@@ -144,5 +144,9 @@ void make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare co\n * std::push_heap[link push_heap.md]\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::make_heap`](\/reference\/algorithm\/ranges_make_heap.md)\n+\n+\n ## \u53c2\u7167\n - [P0879R0 Constexpr for `swap` and `swap` related functions](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2018\/p0879r0.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"max -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/max.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/max.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/max.md b\/reference\/algorithm\/max.md\nindex 1366d76d3..27d11bf56 100644\n--- a\/reference\/algorithm\/max.md\n+++ b\/reference\/algorithm\/max.md\n@@ -127,6 +127,10 @@ Windows\u74b0\u5883\u306b\u304a\u3044\u3066\u306f\u3001`<windows.h>`\u3092\u30a4\u30f3\u30af\u30eb\u30fc\u30c9\u3059\u308b\u3068`max`\n - `std::max()`\u3092\u547c\u3073\u51fa\u3059\u969b\u306b\u3001`(std::max)(a, b);`\u306e\u3088\u3046\u306b\u95a2\u6570\u540d\u3092\u30ab\u30c3\u30b3\u3067\u56f2\u3093\u3067\u4f7f\u7528\u3059\u308b\u3002\u3053\u308c\u3067\u3001\u540d\u524d\u89e3\u6c7a\u306b\u304a\u3044\u3066`std::max()`\u95a2\u6570\u304c\u5fc5\u305a\u4f7f\u7528\u3055\u308c\u308b\u3002\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::max`](\/reference\/algorithm\/ranges_max.md)\n+\n+\n ## \u53c2\u7167\n - [N2551 A Variadic `std::min(T, ...)` for the C++ Standard Library](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2008\/n2551.pdf)\n - [N2772 Variadic functions: Variadic templates or initializer lists? -- Revision 1](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2008\/n2772.pdf)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"max_element -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/max_element.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/max_element.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/max_element.md b\/reference\/algorithm\/max_element.md\nindex 5b042cb16..e8d4f7fb1 100644\n--- a\/reference\/algorithm\/max_element.md\n+++ b\/reference\/algorithm\/max_element.md\n@@ -111,5 +111,9 @@ ForwardIterator max_element(ForwardIterator first, ForwardIterator last, Compare\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::max_element`](\/reference\/algorithm\/ranges_max_element.md)\n+\n+\n ## \u53c2\u7167\n - [LWG Issue 2150. Unclear specification of `find_end`](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/lwg-defects.html#2150)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"merge -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/merge.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/merge.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/merge.md b\/reference\/algorithm\/merge.md\nindex 933045f7b..d8977c8aa 100644\n--- a\/reference\/algorithm\/merge.md\n+++ b\/reference\/algorithm\/merge.md\n@@ -174,6 +174,7 @@ OutputIterator merge(InputIterator1 first1, InputIterator1 last1,\n ## \u95a2\u9023\u9805\u76ee\n - [`std::set::merge()`](\/reference\/set\/set\/merge.md)\n - [`std::set_union()`](set_union.md)\n+- [`ranges::merge`](\/reference\/algorithm\/ranges_merge.md)\n \n \n ## \u53c2\u7167\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"min -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/min.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/min.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/min.md b\/reference\/algorithm\/min.md\nindex a80955dab..8ed16614b 100644\n--- a\/reference\/algorithm\/min.md\n+++ b\/reference\/algorithm\/min.md\n@@ -127,6 +127,10 @@ Windows\u74b0\u5883\u306b\u304a\u3044\u3066\u306f\u3001`<windows.h>`\u3092\u30a4\u30f3\u30af\u30eb\u30fc\u30c9\u3059\u308b\u3068`min`\n - `std::min()`\u3092\u547c\u3073\u51fa\u3059\u969b\u306b\u3001`(std::min)(a, b);`\u306e\u3088\u3046\u306b\u95a2\u6570\u540d\u3092\u30ab\u30c3\u30b3\u3067\u56f2\u3093\u3067\u4f7f\u7528\u3059\u308b\u3002\u3053\u308c\u3067\u3001\u540d\u524d\u89e3\u6c7a\u306b\u304a\u3044\u3066`std::min()`\u95a2\u6570\u304c\u5fc5\u305a\u4f7f\u7528\u3055\u308c\u308b\u3002\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::min`](\/reference\/algorithm\/ranges_min.md)\n+\n+\n ## \u53c2\u7167\n - [N2551 A Variadic `std::min(T, ...)` for the C++ Standard Library](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2008\/n2551.pdf)\n - [N2772 Variadic functions: Variadic templates or initializer lists? -- Revision 1](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2008\/n2772.pdf)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"min_element -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/min_element.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/min_element.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/min_element.md b\/reference\/algorithm\/min_element.md\nindex 988a553d9..456885302 100644\n--- a\/reference\/algorithm\/min_element.md\n+++ b\/reference\/algorithm\/min_element.md\n@@ -110,5 +110,10 @@ ForwardIterator min_element(ForwardIterator first, ForwardIterator last, Compare\n }\n ```\n \n+\n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::min_element`](\/reference\/algorithm\/ranges_min_element.md)\n+\n+\n ## \u53c2\u7167\n - [LWG Issue 2150. Unclear specification of `find_end`](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/lwg-defects.html#2150)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"minmax -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/minmax.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/minmax.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/minmax.md b\/reference\/algorithm\/minmax.md\nindex 10c14e2e4..d49debc30 100644\n--- a\/reference\/algorithm\/minmax.md\n+++ b\/reference\/algorithm\/minmax.md\n@@ -158,6 +158,10 @@ std::pair<T, T> minmax(std::initializer_list<T> init, Compare comp)\n - [Visual C++](\/implementation.md#visual_cpp): 2013 [mark verified], 2015 [mark verified]\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::minmax`](\/reference\/algorithm\/ranges_minmax.md)\n+\n+\n ## \u53c2\u7167\n - [N1840 C++0x Proposal: Function template `std::minmax` and \/ or algorithm `std::minmax_element`](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2005\/n1840.pdf)\n - [N1990 Proposed Text for `minmax` (N1840)](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2006\/n1990.htm)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"minmax_element -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/minmax_element.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/minmax_element.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/minmax_element.md b\/reference\/algorithm\/minmax_element.md\nindex b839bc566..351deb163 100644\n--- a\/reference\/algorithm\/minmax_element.md\n+++ b\/reference\/algorithm\/minmax_element.md\n@@ -162,6 +162,10 @@ minmax_element(ForwardIterator first, ForwardIterator last)\n - [Visual C++](\/implementation.md#visual_cpp): 2010 [mark verified], 2012 [mark verified], 2013 [mark verified], 2015 [mark verified]\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::minmax_element`](\/reference\/algorithm\/ranges_minmax_element.md)\n+\n+\n ## \u53c2\u7167\n - [N1840 C++0x Proposal: Function template `std::minmax` and \/ or algorithm `std::minmax_element`](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2005\/n1840.pdf)\n - [N1990 Proposed Text for `minmax` (N1840)](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2006\/n1990.htm)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"mismatch -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/mismatch.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/mismatch.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/mismatch.md b\/reference\/algorithm\/mismatch.md\nindex 3e2634534..ac0abd33f 100644\n--- a\/reference\/algorithm\/mismatch.md\n+++ b\/reference\/algorithm\/mismatch.md\n@@ -192,6 +192,11 @@ std::pair<InputIterator1, InputIterator2> mismatch(\n - [Visual C++](\/implementation.md#visual_cpp): 2005 [mark verified], 2008 [mark verified], 2010 [mark verified], 2012 [mark verified], 2013 [mark verified], 2015 [mark verified]\n     - C++14\u3067\u8ffd\u52a0\u3055\u308c\u305f\u30aa\u30fc\u30d0\u30fc\u30ed\u30fc\u30c9\u306f2015\u304b\u3089\u5b9f\u88c5\u3055\u308c\u3066\u3044\u308b\u3002\n \n+\n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::mismatch`](\/reference\/algorithm\/ranges_mismatch.md)\n+\n+\n ## \u53c2\u7167\n - [N3671 Making non-modifying sequence operations more robust: Revision 2](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2013\/n3671.html)\n     - C++14\u304b\u3089\u3001`last2`\u3092\u53d7\u3051\u53d6\u308b\u30aa\u30fc\u30d0\u30fc\u30ed\u30fc\u30c9\u3092\u8ffd\u52a0\u3002\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"move -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/move.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/move.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/move.md b\/reference\/algorithm\/move.md\nindex a52904c38..a86948a17 100644\n--- a\/reference\/algorithm\/move.md\n+++ b\/reference\/algorithm\/move.md\n@@ -110,6 +110,7 @@ OutputIterator move(InputIterator first, InputIterator last, OutputIterator resu\n \n ## \u95a2\u9023\u9805\u76ee\n - [C++11 \u53f3\u8fba\u5024\u53c2\u7167\u30fb\u30e0\u30fc\u30d6\u30bb\u30de\u30f3\u30c6\u30a3\u30af\u30b9](\/lang\/cpp11\/rvalue_ref_and_move_semantics.md)\n+- [`ranges::move`](\/reference\/algorithm\/ranges_move.md)\n \n \n ## \u53c2\u7167\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"move_backward -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/move_backward.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/move_backward.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/move_backward.md b\/reference\/algorithm\/move_backward.md\nindex 460289ed1..b761f32b2 100644\n--- a\/reference\/algorithm\/move_backward.md\n+++ b\/reference\/algorithm\/move_backward.md\n@@ -115,6 +115,7 @@ BidirectionalIterator2 move_backward(BidirectionalIterator1 first, Bidirectional\n \n ## \u95a2\u9023\u9805\u76ee\n - [C++11 \u53f3\u8fba\u5024\u53c2\u7167\u30fb\u30e0\u30fc\u30d6\u30bb\u30de\u30f3\u30c6\u30a3\u30af\u30b9](\/lang\/cpp11\/rvalue_ref_and_move_semantics.md)\n+- [`ranges::move_backward`](\/reference\/algorithm\/ranges_move_backward.md)\n \n \n ## \u53c2\u7167\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"next_permutation -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/next_permutation.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/next_permutation.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/next_permutation.md b\/reference\/algorithm\/next_permutation.md\nindex c1938dfe8..0b09dc03f 100644\n--- a\/reference\/algorithm\/next_permutation.md\n+++ b\/reference\/algorithm\/next_permutation.md\n@@ -144,6 +144,7 @@ bool next_permutation(BidirectionalIterator first, BidirectionalIterator last)\n \n ## \u95a2\u9023\u9805\u76ee\n - [`std::prev_permutation()`](prev_permutation.md)\n+- [`ranges::next_permutation`](\/reference\/algorithm\/ranges_next_permutation.md)\n \n \n ## \u53c2\u7167\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"none_of -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/none_of.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/none_of.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/none_of.md b\/reference\/algorithm\/none_of.md\nindex 77520c8ad..b9635f740 100644\n--- a\/reference\/algorithm\/none_of.md\n+++ b\/reference\/algorithm\/none_of.md\n@@ -99,6 +99,7 @@ bool none_of(InputIterator first, InputIterator last, Predicate pred) {\n ## \u95a2\u9023\u9805\u76ee\n - [`all_of`](\/reference\/algorithm\/all_of.md)\n - [`any_of`](\/reference\/algorithm\/any_of.md)\n+- [`ranges::none_of`](\/reference\/algorithm\/ranges_none_of.md)\n \n \n ## \u53c2\u7167\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"nth_element -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/nth_element.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/nth_element.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/nth_element.md b\/reference\/algorithm\/nth_element.md\nindex 6c8890ac7..fe4a9de50 100644\n--- a\/reference\/algorithm\/nth_element.md\n+++ b\/reference\/algorithm\/nth_element.md\n@@ -100,6 +100,11 @@ int main()\n 7\n ```\n \n+\n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::nth_element`](\/reference\/algorithm\/ranges_nth_element.md)\n+\n+\n ## \u53c2\u7167\n - [LWG Issue 2163. `nth_element` requires inconsistent post-conditions](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/lwg-defects.html#2163)\n     - C++11\u307e\u3067\u3001\u3053\u306e\u95a2\u6570\u3092\u547c\u3073\u51fa\u3057\u305f\u3042\u3068\u306e\u72b6\u614b\u306b\u3064\u3044\u3066\u300c`!(*i > *j)`\u300d\u3068\u8a18\u8f09\u3057\u3066\u3044\u305f\u304c\u3001\u4e26\u3079\u66ff\u3048\u306b\u306f`operator<()`\u3092\u4f7f\u7528\u3059\u308b\u306e\u3067\u3001C++14\u3067\u300c`!(*j < *i)`\u300d\u306b\u8a02\u6b63\u3002\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"partial_sort -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/partial_sort.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/partial_sort.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/partial_sort.md b\/reference\/algorithm\/partial_sort.md\nindex 4c0d67336..ce1554292 100644\n--- a\/reference\/algorithm\/partial_sort.md\n+++ b\/reference\/algorithm\/partial_sort.md\n@@ -96,5 +96,9 @@ int main()\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::partial_sort`](\/reference\/algorithm\/ranges_partial_sort.md)\n+\n+\n ## \u53c2\u7167\n - [P0879R0 Constexpr for `swap` and `swap` related functions](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2018\/p0879r0.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"partial_sort_copy -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/partial_sort_copy.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/partial_sort_copy.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/partial_sort_copy.md b\/reference\/algorithm\/partial_sort_copy.md\nindex f70f56d01..c3b534ed7 100644\n--- a\/reference\/algorithm\/partial_sort_copy.md\n+++ b\/reference\/algorithm\/partial_sort_copy.md\n@@ -105,6 +105,10 @@ int main()\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::partial_sort_copy`](\/reference\/algorithm\/ranges_partial_sort_copy.md)\n+\n+\n ## \u53c2\u7167\n - [P0879R0 Constexpr for `swap` and `swap` related functions](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2018\/p0879r0.html)\n - [P0467R2 Iterator Concerns for Parallel Algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0467r2.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"partition -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/partition.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/partition.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/partition.md b\/reference\/algorithm\/partition.md\nindex f58de2d53..0906277f5 100644\n--- a\/reference\/algorithm\/partition.md\n+++ b\/reference\/algorithm\/partition.md\n@@ -113,6 +113,10 @@ ForwardIterator partition(ForwardIterator first, ForwardIterator last, Predicate\n * std::iter_swap[link iter_swap.md]\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::partition`](\/reference\/algorithm\/ranges_partition.md)\n+\n+\n ## \u53c2\u7167\n - [LWG Issue 2150. Unclear specification of `find_end`](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/lwg-defects.html#2150)\n - [P0574R1 Algorithm Complexity Constraints and Parallel Overloads](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0574r1.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"partition_copy -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/partition_copy.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/partition_copy.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/partition_copy.md b\/reference\/algorithm\/partition_copy.md\nindex 01c505ee2..2f36bfeba 100644\n--- a\/reference\/algorithm\/partition_copy.md\n+++ b\/reference\/algorithm\/partition_copy.md\n@@ -125,6 +125,10 @@ odds : 1,3,5,\n - [Visual C++](\/implementation.md#visual_cpp): 2010 [mark verified], 2012 [mark verified], 2013 [mark verified], 2015 [mark verified]\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::partition_copy`](\/reference\/algorithm\/ranges_partition_copy.md)\n+\n+\n ## \u53c2\u7167\n - [N2569 More STL algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2008\/n2569.pdf)\n - [N2666 More STL algorithms (revision 2)](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2008\/n2666.pdf)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"partition_point -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/partition_point.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/partition_point.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/partition_point.md b\/reference\/algorithm\/partition_point.md\nindex 49ad6ac36..e9834f228 100644\n--- a\/reference\/algorithm\/partition_point.md\n+++ b\/reference\/algorithm\/partition_point.md\n@@ -112,6 +112,10 @@ partition_point(ForwardIterator first, ForwardIterator last, Predicate pred)\n - [Visual C++](\/implementation.md#visual_cpp): 2010 [mark verified], 2012 [mark verified], 2013 [mark verified], 2015 [mark verified]\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::partition_point`](\/reference\/algorithm\/ranges_partition_point.md)\n+\n+\n ## \u53c2\u7167\n - [N2569 More STL algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2008\/n2569.pdf)\n - [N2666 More STL algorithms (revision 2)](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2008\/n2666.pdf)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"pop_heap -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/pop_heap.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/pop_heap.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/pop_heap.md b\/reference\/algorithm\/pop_heap.md\nindex 56cb4179d..dd1ca84dd 100644\n--- a\/reference\/algorithm\/pop_heap.md\n+++ b\/reference\/algorithm\/pop_heap.md\n@@ -137,5 +137,9 @@ void pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare com\n * std::move[link \/reference\/utility\/move.md]\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::pop_heap`](\/reference\/algorithm\/ranges_pop_heap.md)\n+\n+\n ## \u53c2\u7167\n - [P0879R0 Constexpr for `swap` and `swap` related functions](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2018\/p0879r0.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"prev_permutation -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/prev_permutation.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/prev_permutation.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/prev_permutation.md b\/reference\/algorithm\/prev_permutation.md\nindex dbdea5b98..57d81d224 100644\n--- a\/reference\/algorithm\/prev_permutation.md\n+++ b\/reference\/algorithm\/prev_permutation.md\n@@ -138,6 +138,7 @@ bool prev_permutation(BidirectionalIterator first, BidirectionalIterator last)\n \n ## \u95a2\u9023\u9805\u76ee\n - [`std::next_permutation()`](next_permutation.md)\n+- [`ranges::prev_permutation`](\/reference\/algorithm\/ranges_prev_permutation.md)\n \n \n ## \u53c2\u7167\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"push_heap -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/push_heap.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/push_heap.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/push_heap.md b\/reference\/algorithm\/push_heap.md\nindex 3e1cdf5f7..98b172743 100644\n--- a\/reference\/algorithm\/push_heap.md\n+++ b\/reference\/algorithm\/push_heap.md\n@@ -129,5 +129,9 @@ void push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare co\n * std::iterator_traits[link \/reference\/iterator\/iterator_traits.md]\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::push_heap`](\/reference\/algorithm\/ranges_push_heap.md)\n+\n+\n ## \u53c2\u7167\n - [P0879R0 Constexpr for `swap` and `swap` related functions](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2018\/p0879r0.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"remove -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/remove.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/remove.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/remove.md b\/reference\/algorithm\/remove.md\nindex 425eb8894..8449bd078 100644\n--- a\/reference\/algorithm\/remove.md\n+++ b\/reference\/algorithm\/remove.md\n@@ -170,6 +170,10 @@ ForwardIterator remove(ForwardIterator first, ForwardIterator last, const T& val\n * std::move[link \/reference\/utility\/move.md]\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::remove`](\/reference\/algorithm\/ranges_remove.md)\n+\n+\n ## \u53c2\u7167\n - [More C++ Idioms\/\u6d88\u53bb\u30fb\u524a\u9664(Erase-Remove)](https:\/\/ja.wikibooks.org\/wiki\/More_C%2B%2B_Idioms\/%E6%B6%88%E5%8E%BB%E3%83%BB%E5%89%8A%E9%99%A4(Erase-Remove))\n - [LWG Issue 2110. `remove` can't swap but note says it might](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/lwg-defects.html#2110)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"remove_copy -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/remove_copy.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/remove_copy.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/remove_copy.md b\/reference\/algorithm\/remove_copy.md\nindex 0d68759f1..ef2a302ee 100644\n--- a\/reference\/algorithm\/remove_copy.md\n+++ b\/reference\/algorithm\/remove_copy.md\n@@ -167,6 +167,10 @@ OutputIterator remove_copy(InputIterator first, InputIterator last,\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::remove_copy`](\/reference\/algorithm\/ranges_remove_copy.md)\n+\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P0467R2 Iterator Concerns for Parallel Algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0467r2.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"remove_copy_if -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/remove_copy_if.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/remove_copy_if.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/remove_copy_if.md b\/reference\/algorithm\/remove_copy_if.md\nindex 02d1c216b..413a92ff2 100644\n--- a\/reference\/algorithm\/remove_copy_if.md\n+++ b\/reference\/algorithm\/remove_copy_if.md\n@@ -95,6 +95,10 @@ OutputIterator remove_copy_if(InputIterator first, InputIterator last,\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::remove_copy_if`](\/reference\/algorithm\/ranges_remove_copy_if.md)\n+\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P0467R2 Iterator Concerns for Parallel Algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0467r2.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"remove_if -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/remove_if.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/remove_if.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/remove_if.md b\/reference\/algorithm\/remove_if.md\nindex 3f1ecb2d9..9ec8e63d1 100644\n--- a\/reference\/algorithm\/remove_if.md\n+++ b\/reference\/algorithm\/remove_if.md\n@@ -112,6 +112,10 @@ ForwardIterator remove_if(ForwardIterator first, ForwardIterator last, Predicate\n * std::move[link \/reference\/utility\/move.md]\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::remove_if`](\/reference\/algorithm\/ranges_remove_if.md)\n+\n+\n ## \u53c2\u7167\n - [More C++ Idioms\/\u6d88\u53bb\u30fb\u524a\u9664(Erase-Remove)](https:\/\/ja.wikibooks.org\/wiki\/More_C%2B%2B_Idioms\/%E6%B6%88%E5%8E%BB%E3%83%BB%E5%89%8A%E9%99%A4(Erase-Remove))\n - [LWG Issue 2110. `remove` can't swap but note says it might](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/lwg-defects.html#2110)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"replace -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/replace.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/replace.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/replace.md b\/reference\/algorithm\/replace.md\nindex a53b7d086..998b1ffe0 100644\n--- a\/reference\/algorithm\/replace.md\n+++ b\/reference\/algorithm\/replace.md\n@@ -149,6 +149,10 @@ void replace(ForwardIterator first, ForwardIterator last,\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::replace`](\/reference\/algorithm\/ranges_replace.md)\n+\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P2248R8 Enabling list-initialization for algorithms](https:\/\/open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2024\/p2248r8.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"replace_copy -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/replace_copy.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/replace_copy.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/replace_copy.md b\/reference\/algorithm\/replace_copy.md\nindex 9b8e28518..5002d1fbe 100644\n--- a\/reference\/algorithm\/replace_copy.md\n+++ b\/reference\/algorithm\/replace_copy.md\n@@ -91,6 +91,10 @@ OutputIterator replace_copy(InputIterator first, InputIterator last, OutputItera\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::replace_copy`](\/reference\/algorithm\/ranges_replace_copy.md)\n+\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P0467R2 Iterator Concerns for Parallel Algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0467r2.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"replace_copy_if -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/replace_copy_if.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/replace_copy_if.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/replace_copy_if.md b\/reference\/algorithm\/replace_copy_if.md\nindex 39692570c..21bbeadea 100644\n--- a\/reference\/algorithm\/replace_copy_if.md\n+++ b\/reference\/algorithm\/replace_copy_if.md\n@@ -178,6 +178,10 @@ OutputIterator replace_copy_if(InputIterator first, InputIterator last, OutputIt\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::replace_copy_if`](\/reference\/algorithm\/ranges_replace_copy_if.md)\n+\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P0467R2 Iterator Concerns for Parallel Algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0467r2.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"replace_if -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/replace_if.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/replace_if.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/replace_if.md b\/reference\/algorithm\/replace_if.md\nindex b0eabae70..49ca83a87 100644\n--- a\/reference\/algorithm\/replace_if.md\n+++ b\/reference\/algorithm\/replace_if.md\n@@ -159,6 +159,10 @@ void replace_if(ForwardIterator first, ForwardIterator last,\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::replace_if`](\/reference\/algorithm\/ranges_replace_if.md)\n+\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P2248R8 Enabling list-initialization for algorithms](https:\/\/open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2024\/p2248r8.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"reverse -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/reverse.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/reverse.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/reverse.md b\/reference\/algorithm\/reverse.md\nindex 2aa609858..15bbb5379 100644\n--- a\/reference\/algorithm\/reverse.md\n+++ b\/reference\/algorithm\/reverse.md\n@@ -70,6 +70,10 @@ void reverse(BidirectionalIterator first, BidirectionalIterator last) {\n * std::iter_swap[link iter_swap.md]\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::reverse`](\/reference\/algorithm\/ranges_reverse.md)\n+\n+\n ## \u53c2\u7167\n - [LWG Issue 2039. Issues with `std::reverse` and `std::copy_if`](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/lwg-defects.html#2039)\n     - C++11\u307e\u3067\u3001\u52b9\u679c\u3092\u300c0 \u4ee5\u4e0a `(last - first) \/ 2` **\u4ee5\u4e0b**\u306e\u6574\u6570 `i` \u306b\u3064\u3044\u3066\u3001\u300d\u3068\u8a18\u8f09\u3057\u3066\u3044\u305f\u304c\u3001\u3053\u308c\u306f\u9593\u9055\u3044\u306a\u306e\u3067\u3001C++14\u3067\u300c0 \u4ee5\u4e0a `(last - first) \/ 2` **\u672a\u6e80**\u306e\u6574\u6570 `i` \u306b\u3064\u3044\u3066\u3001\u300d\u3068\u4fee\u6b63\u3002\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"reverse_copy -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/reverse_copy.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/reverse_copy.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/reverse_copy.md b\/reference\/algorithm\/reverse_copy.md\nindex 18dbbb6f9..8b5eab01e 100644\n--- a\/reference\/algorithm\/reverse_copy.md\n+++ b\/reference\/algorithm\/reverse_copy.md\n@@ -88,3 +88,7 @@ OutputIterator reverse_copy(BidirectionalIterator first,\n - [LWG Issue 2150. Unclear specification of `find_end`](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/lwg-defects.html#2150)\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P0467R2 Iterator Concerns for Parallel Algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0467r2.html)\n+\n+\n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::reverse_copy`](\/reference\/algorithm\/ranges_reverse_copy.md)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"rotate -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/rotate.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/rotate.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/rotate.md b\/reference\/algorithm\/rotate.md\nindex 43c432500..0d3a68fa8 100644\n--- a\/reference\/algorithm\/rotate.md\n+++ b\/reference\/algorithm\/rotate.md\n@@ -160,6 +160,9 @@ swapping 0x1806043(1) <-> 0x1806045(5)\n     - C++11\u3078\u306e\u5bfe\u5fdc\uff08\u623b\u308a\u5024\u306e\u5909\u66f4\uff09\u306f2010\u304b\u3089\u3002\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::rotate`](\/reference\/algorithm\/ranges_rotate.md)\n+\n ## \u53c2\u7167\n - [LWG DR488. rotate throws away useful information](http:\/\/cplusplus.github.io\/LWG\/lwg-defects.html#488)  \n \t\u623b\u308a\u5024\u304c\u8ffd\u52a0\u3055\u308c\u308b\u304d\u3063\u304b\u3051\u3068\u306a\u3063\u305f\u30ec\u30dd\u30fc\u30c8\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"rotate_copy -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/rotate_copy.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/rotate_copy.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/rotate_copy.md b\/reference\/algorithm\/rotate_copy.md\nindex f7c3e7c03..2fbf8e515 100644\n--- a\/reference\/algorithm\/rotate_copy.md\n+++ b\/reference\/algorithm\/rotate_copy.md\n@@ -88,6 +88,9 @@ OutputIterator rotate_copy(ForwardIterator first,\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::rotate_copy`](\/reference\/algorithm\/ranges_rotate_copy.md)\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P0467R2 Iterator Concerns for Parallel Algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0467r2.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"sample -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/sample.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/sample.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/sample.md b\/reference\/algorithm\/sample.md\nindex ebca486d3..3fe6a35c5 100644\n--- a\/reference\/algorithm\/sample.md\n+++ b\/reference\/algorithm\/sample.md\n@@ -123,6 +123,9 @@ bcd\n - [Visual C++](\/implementation.md#visual_cpp): ??\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::sample`](\/reference\/algorithm\/ranges_sample.md)\n+\n ## \u53c2\u7167\n - [N3547 Three `<random>`-related Proposals](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2013\/n3547.pdf)\n - [Three `<random>`-related Proposals, v2](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2013\/n3742.pdf)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"search -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/search.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/search.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/search.md b\/reference\/algorithm\/search.md\nindex a131fca3f..51746f78b 100644\n--- a\/reference\/algorithm\/search.md\n+++ b\/reference\/algorithm\/search.md\n@@ -219,6 +219,9 @@ ForwardIterator1 search(ForwardIterator1 first1, ForwardIterator1 last1,\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::search`](\/reference\/algorithm\/ranges_search.md)\n+\n ## \u53c2\u7167\n - [LWG Issue 2150. Unclear specification of `find_end`](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/lwg-defects.html#2150)\n - [N3905 Extending `std::search` to use Additional Searching Algorithms (Version 4)](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2014\/n3905.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"search_n -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/search_n.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/search_n.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/search_n.md b\/reference\/algorithm\/search_n.md\nindex 14ed10727..7d1f70ffc 100644\n--- a\/reference\/algorithm\/search_n.md\n+++ b\/reference\/algorithm\/search_n.md\n@@ -272,6 +272,9 @@ ForwardIterator search_n(ForwardIterator first, ForwardIterator last,\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::search_n`](\/reference\/algorithm\/ranges_search_n.md)\n+\n ## \u53c2\u7167\n - [LWG Issue 714. `search_n` complexity is too lax](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/lwg-defects.html#714)\n - [LWG Issue 2150. Unclear specification of `find_end`](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/lwg-defects.html#2150)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"set_difference -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/set_difference.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/set_difference.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/set_difference.md b\/reference\/algorithm\/set_difference.md\nindex 453f1e21a..b4b43579c 100644\n--- a\/reference\/algorithm\/set_difference.md\n+++ b\/reference\/algorithm\/set_difference.md\n@@ -125,6 +125,9 @@ int main()\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::set_difference`](\/reference\/algorithm\/ranges_set_difference.md)\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P0467R2 Iterator Concerns for Parallel Algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0467r2.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"set_intersection -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/set_intersection.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/set_intersection.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/set_intersection.md b\/reference\/algorithm\/set_intersection.md\nindex 413e91de6..5470a9068 100644\n--- a\/reference\/algorithm\/set_intersection.md\n+++ b\/reference\/algorithm\/set_intersection.md\n@@ -124,6 +124,9 @@ int main()\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::set_intersection`](\/reference\/algorithm\/ranges_set_intersection.md)\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P0467R2 Iterator Concerns for Parallel Algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0467r2.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"set_symmetric_difference -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/set_symmetric_difference.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/set_symmetric_difference.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/set_symmetric_difference.md b\/reference\/algorithm\/set_symmetric_difference.md\nindex 3e5cd1a0f..ce7e0a8ba 100644\n--- a\/reference\/algorithm\/set_symmetric_difference.md\n+++ b\/reference\/algorithm\/set_symmetric_difference.md\n@@ -132,6 +132,9 @@ int main()\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::set_symmetric_difference`](\/reference\/algorithm\/ranges_set_symmetric_difference.md)\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P0467R2 Iterator Concerns for Parallel Algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0467r2.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"set_union -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/set_union.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/set_union.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/set_union.md b\/reference\/algorithm\/set_union.md\nindex 981418c3b..1a2ca583c 100644\n--- a\/reference\/algorithm\/set_union.md\n+++ b\/reference\/algorithm\/set_union.md\n@@ -169,6 +169,9 @@ OutputIterator set_union(InputIterator1 first1, InputIterator1 last1,\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::set_union`](\/reference\/algorithm\/ranges_set_union.md)\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P0467R2 Iterator Concerns for Parallel Algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0467r2.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"shift_left -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/shift_left.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/shift_left.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/shift_left.md b\/reference\/algorithm\/shift_left.md\nindex b0c5e19e1..cb63a2697 100644\n--- a\/reference\/algorithm\/shift_left.md\n+++ b\/reference\/algorithm\/shift_left.md\n@@ -96,6 +96,7 @@ int main()\n ## \u95a2\u9023\u9805\u76ee\n - [`shift_right`](shift_right.md)\n - [`rotate`](rotate.md)\n+- [`ranges::shift_left`](\/reference\/algorithm\/ranges_shift_left.md)\n \n ## \u53c2\u7167\n - [P1243R4 Rangify New Algorithms](https:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2020\/p1243r4.pdf)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"shift_right -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/shift_right.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/shift_right.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/shift_right.md b\/reference\/algorithm\/shift_right.md\nindex c7f0d71d3..4a4766f5c 100644\n--- a\/reference\/algorithm\/shift_right.md\n+++ b\/reference\/algorithm\/shift_right.md\n@@ -97,6 +97,7 @@ int main()\n ## \u95a2\u9023\u9805\u76ee\n - [`shift_left`](shift_left.md)\n - [`rotate`](rotate.md)\n+- [`ranges::shift_right`](\/reference\/algorithm\/ranges_shift_right.md)\n \n ## \u53c2\u7167\n - [P1243R4 Rangify New Algorithms](https:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2020\/p1243r4.pdf)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"shuffle -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/shuffle.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/shuffle.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/shuffle.md b\/reference\/algorithm\/shuffle.md\nindex 73d432cbf..3a4dcac90 100644\n--- a\/reference\/algorithm\/shuffle.md\n+++ b\/reference\/algorithm\/shuffle.md\n@@ -125,6 +125,9 @@ void shuffle(RandomAccessIterator first, RandomAccessIterator last, UniformRando\n * iter_swap[link iter_swap.md]\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::shuffle`](\/reference\/algorithm\/ranges_shuffle.md)\n+\n ## \u53c2\u7167\n - [P0346R1 A `<random>` Nomenclature Tweak](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2016\/p0346r1.pdf)\n     - URNG\u3092URBG\u306b\u5909\u66f4\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"sort -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/sort.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/sort.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/sort.md b\/reference\/algorithm\/sort.md\nindex d06ec0b0a..b5022f5b7 100644\n--- a\/reference\/algorithm\/sort.md\n+++ b\/reference\/algorithm\/sort.md\n@@ -234,6 +234,7 @@ int main() {\n \n ## \u95a2\u9023\u9805\u76ee\n - [C++20 `<=>`\/`==`\u306b\u3088\u308b\u6bd4\u8f03\u6f14\u7b97\u5b50\u306e\u81ea\u52d5\u5b9a\u7fa9](\/lang\/cpp20\/consistent_comparison.md)\n+- [`ranges::sort`](\/reference\/algorithm\/ranges_sort.md)\n \n ## \u53c2\u7167\n - [LWG Issue 713. `sort()` complexity is too lax](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/lwg-defects.html#713)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"sort_heap -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/sort_heap.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/sort_heap.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/sort_heap.md b\/reference\/algorithm\/sort_heap.md\nindex 1d9fdf81a..be74bcd79 100644\n--- a\/reference\/algorithm\/sort_heap.md\n+++ b\/reference\/algorithm\/sort_heap.md\n@@ -80,5 +80,8 @@ int main()\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::sort_heap`](\/reference\/algorithm\/ranges_sort_heap.md)\n+\n ## \u53c2\u7167\n - [P0879R0 Constexpr for `swap` and `swap` related functions](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2018\/p0879r0.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"stable_partition -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/stable_partition.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/stable_partition.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/stable_partition.md b\/reference\/algorithm\/stable_partition.md\nindex 1ab0fc7da..1f56fb03c 100644\n--- a\/reference\/algorithm\/stable_partition.md\n+++ b\/reference\/algorithm\/stable_partition.md\n@@ -83,6 +83,9 @@ int main()\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::stable_partition`](\/reference\/algorithm\/ranges_stable_partition.md)\n+\n ## \u53c2\u7167\n - [LWG Issue 2150. Unclear specification of `find_end`](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/lwg-defects.html#2150)\n - [P0574R1 Algorithm Complexity Constraints and Parallel Overloads](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0574r1.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"stable_sort -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/stable_sort.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/stable_sort.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/stable_sort.md b\/reference\/algorithm\/stable_sort.md\nindex f66fe2166..c4b945e1e 100644\n--- a\/reference\/algorithm\/stable_sort.md\n+++ b\/reference\/algorithm\/stable_sort.md\n@@ -92,6 +92,9 @@ int main()\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::stable_sort`](\/reference\/algorithm\/ranges_stable_sort.md)\n+\n ## \u53c2\u7167\n - [P2562R1 `constexpr` Stable Sorting](https:\/\/open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2022\/p2562r1.pdf)\n     - C++26\u304b\u3089`constexpr`\u306b\u5bfe\u5fdc\u3057\u305f\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"swap_ranges -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/swap_ranges.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/swap_ranges.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/swap_ranges.md b\/reference\/algorithm\/swap_ranges.md\nindex 5d8650d26..027c30677 100644\n--- a\/reference\/algorithm\/swap_ranges.md\n+++ b\/reference\/algorithm\/swap_ranges.md\n@@ -92,5 +92,8 @@ ForwardIterator2 swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1,\n * iter_swap[link iter_swap.md]\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::swap_ranges`](\/reference\/algorithm\/ranges_swap_ranges.md)\n+\n ## \u53c2\u7167\n - [P0879R0 Constexpr for `swap` and `swap` related functions](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2018\/p0879r0.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"transform -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/transform.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/transform.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/transform.md b\/reference\/algorithm\/transform.md\nindex 425eb2087..d7fcc26e0 100644\n--- a\/reference\/algorithm\/transform.md\n+++ b\/reference\/algorithm\/transform.md\n@@ -178,6 +178,9 @@ OutputIterator transform(InputIterator1 first1,\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::transform`](\/reference\/algorithm\/ranges_transform.md)\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P0467R2 Iterator Concerns for Parallel Algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0467r2.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"unique -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/unique.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/unique.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/unique.md b\/reference\/algorithm\/unique.md\nindex 0a4a38adb..39967d590 100644\n--- a\/reference\/algorithm\/unique.md\n+++ b\/reference\/algorithm\/unique.md\n@@ -175,5 +175,8 @@ ForwardIterator unique(ForwardIterator first, ForwardIterator last, BinaryPredic\n * std::move[link \/reference\/utility\/move.md]\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::unique`](\/reference\/algorithm\/ranges_unique.md)\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"unique_copy -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/unique_copy.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/unique_copy.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/unique_copy.md b\/reference\/algorithm\/unique_copy.md\nindex 4ad197b38..8a621dfdd 100644\n--- a\/reference\/algorithm\/unique_copy.md\n+++ b\/reference\/algorithm\/unique_copy.md\n@@ -177,6 +177,9 @@ OutputIterator unique_copy(InputIterator first, InputIterator last,\n ```\n \n \n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::unique_copy`](\/reference\/algorithm\/ranges_unique_copy.md)\n+\n ## \u53c2\u7167\n - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0202r3.html)\n - [P0467R2 Iterator Concerns for Parallel Algorithms](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2017\/p0467r2.html)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"upper_bound -- feat(algorithm): ranges\u306b\u5bfe\u3059\u308b\u95a2\u9023\u9805\u76ee\u3092\u8ffd\u52a0 (#1611)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/algorithm\/upper_bound.html"}},"id":"c531e9a59af86bff92322a272db39679c6b212d9:reference\/algorithm\/upper_bound.md","updated":"2026-04-13T15:17:49+09:00","summary":"
diff --git a\/reference\/algorithm\/upper_bound.md b\/reference\/algorithm\/upper_bound.md\nindex 2f86c5121..c4ffe7cc4 100644\n--- a\/reference\/algorithm\/upper_bound.md\n+++ b\/reference\/algorithm\/upper_bound.md\n@@ -245,6 +245,11 @@ upper_bound(ForwardIterator first, ForwardIterator last, const T& value)\n * std::advance[link \/reference\/iterator\/advance.md]\n * std::iterator_traits[link \/reference\/iterator\/iterator_traits.md]\n \n+\n+## \u95a2\u9023\u9805\u76ee\n+- [`ranges::upper_bound`](\/reference\/algorithm\/ranges_upper_bound.md)\n+\n+\n ## \u53c2\u7167\n - [LWG Issue 384. `equal_range` has unimplementable runtime complexity](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/lwg-defects.html#384)\n - [LWG Issue 2150. Unclear specification of `find_end`](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/lwg-defects.html#2150)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"\u30b3\u30f3\u30bb\u30d7\u30c8\u3068\u5909\u6570\u30c6\u30f3\u30d7\u30ec\u30fc\u30c8\u3092\u30c6\u30f3\u30d7\u30ec\u30fc\u30c8\u5f15\u6570\u3068\u3057\u3066\u6e21\u305b\u308b\u3088\u3046\u306b\u3059\u308b [P2841R7] -- \u30ea\u30f3\u30af\u30df\u30b9\u3092\u4fee\u6b63 #1609","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/lang\/cpp26\/concept_and_variable-template_template-parameters.html"}},"id":"33bac4efcd70c7e2cfa6a03e8f8a8350e41598af:lang\/cpp26\/concept_and_variable-template_template-parameters.md","updated":"2026-04-13T13:57:54+09:00","summary":"
diff --git a\/lang\/cpp26\/concept_and_variable-template_template-parameters.md b\/lang\/cpp26\/concept_and_variable-template_template-parameters.md\nindex 6775b7bcb..01bacb7be 100644\n--- a\/lang\/cpp26\/concept_and_variable-template_template-parameters.md\n+++ b\/lang\/cpp26\/concept_and_variable-template_template-parameters.md\n@@ -86,7 +86,7 @@ C++23\u3067\u3053\u308c\u3089\u3092\u30c6\u30f3\u30d7\u30ec\u30fc\u30c8\u5f15\u6570\u3068\u3057\u3066\u6e21\u3059\u305f\u3081\u306b\u306f\u3001`stati\n - \u30b3\u30f3\u30bb\u30d7\u30c8\u306e\u7c21\u7565\u69cb\u6587 (terse syntax) \u3084\u5305\u6442 (subsumption) \u306e\u6069\u6075\u3092\u53d7\u3051\u3089\u308c\u306a\u3044\n - API\u306b\u4e0d\u5fc5\u8981\u306a\u8907\u96d1\u6027\u3092\u8ffd\u52a0\u3059\u308b\n \n-\u3053\u306e\u63d0\u6848\u306f\u3001[P1985R3 Universal Template Parameters](https:\/\/open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2020\/p1985r3.pdf)\u306e\u30b5\u30d6\u30bb\u30c3\u30c8\u3068\u3057\u3066\u3001\u30b3\u30f3\u30bb\u30d7\u30c8\u3068\u5909\u6570\u30c6\u30f3\u30d7\u30ec\u30fc\u30c8\u306b\u5bfe\u3059\u308b\u30c6\u30f3\u30d7\u30ec\u30fc\u30c8\u30c6\u30f3\u30d7\u30ec\u30fc\u30c8\u30d1\u30e9\u30e1\u30fc\u30bf\u306e\u30b5\u30dd\u30fc\u30c8\u3092\u5148\u884c\u3057\u3066\u8ffd\u52a0\u3059\u308b\u3082\u306e\u3067\u3042\u308b\u3002\n+\u3053\u306e\u63d0\u6848\u306f\u3001[P1985R3 Universal Template Parameters](https:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2022\/p1985r3.pdf)\u306e\u30b5\u30d6\u30bb\u30c3\u30c8\u3068\u3057\u3066\u3001\u30b3\u30f3\u30bb\u30d7\u30c8\u3068\u5909\u6570\u30c6\u30f3\u30d7\u30ec\u30fc\u30c8\u306b\u5bfe\u3059\u308b\u30c6\u30f3\u30d7\u30ec\u30fc\u30c8\u30c6\u30f3\u30d7\u30ec\u30fc\u30c8\u30d1\u30e9\u30e1\u30fc\u30bf\u306e\u30b5\u30dd\u30fc\u30c8\u3092\u5148\u884c\u3057\u3066\u8ffd\u52a0\u3059\u308b\u3082\u306e\u3067\u3042\u308b\u3002\n \n \n ## <a id="relative-page" href="#relative-page">\u95a2\u9023\u9805\u76ee<\/a>\n<\/code><\/pre>","author":{"name":"Akira Takahashi","email":"faithandbrave@gmail.com"}},{"title":"integer_sequence -- feat(integer_sequence): integer_sequence\u306b\u95a2\u3059\u308b\u9069\u683c\u8981\u4ef6\u3068\u5099\u8003\u3092\u8ffd\u52a0 (#1610)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/utility\/integer_sequence.html"}},"id":"0c7655d689e2bbf7ec77326e1acf7a099e88163f:reference\/utility\/integer_sequence.md","updated":"2026-04-13T12:56:56+09:00","summary":"
diff --git a\/reference\/utility\/integer_sequence.md b\/reference\/utility\/integer_sequence.md\nindex 3bea2e25d..ee2f39938 100644\n--- a\/reference\/utility\/integer_sequence.md\n+++ b\/reference\/utility\/integer_sequence.md\n@@ -20,6 +20,15 @@ namespace std {\n \u3053\u306e\u30af\u30e9\u30b9\u306f\u3001[`tuple`](\/reference\/tuple\/tuple.md)\u30aa\u30d6\u30b8\u30a7\u30af\u30c8\u3092\u5c55\u958b\u3057\u3066\u3001\u5f15\u6570\u30d1\u30c3\u30af\u3068\u3057\u3066\u4ed6\u306e\u95a2\u6570\u306b\u8ee2\u9001\u3059\u308b\u3053\u3068\u3092\u4e3b\u76ee\u7684\u3068\u3057\u3066\u4f5c\u3089\u308c\u305f\u3002\n \n \n+## \u9069\u683c\u8981\u4ef6\n+- `T` \u306f\u6574\u6570\u578b\u3067\u3042\u308b\u3053\u3068\u3002\n+\n+\n+## \u5099\u8003\n+- C++17\u307e\u3067 : \u30c6\u30f3\u30d7\u30ec\u30fc\u30c8\u30d1\u30e9\u30e1\u30fc\u30bf `T` \u304c\u6574\u6570\u578b\u3067\u306a\u3044\u5834\u5408\u306e\u52d5\u4f5c\u306f\u672a\u5b9a\u7fa9\u3002\n+- C++20\u304b\u3089 : `T` \u304c\u6574\u6570\u578b\u3067\u306a\u3044\u5834\u5408\u3001\u30d7\u30ed\u30b0\u30e9\u30e0\u306f\u4e0d\u9069\u683c\u3068\u306a\u308a\u3001\u30b3\u30f3\u30d1\u30a4\u30eb\u30a8\u30e9\u30fc\u3068\u306a\u308b\u3053\u3068\u304c\u8981\u6c42\u3055\u308c\u308b\u3088\u3046\u306b\u306a\u3063\u305f\u3002\n+\n+\n ## \u4f8b\n ```cpp example\n #include <iostream>\n@@ -61,3 +70,4 @@ int main()\n \n ## \u53c2\u7167\n - [N3658 Compile-time integer sequences](http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2013\/n3658.html)\n+- [P1460R1 Mandating the Standard Library: Clause 20 - Utilities library](https:\/\/wg21.link\/p1460r1)\n<\/code><\/pre>","author":{"name":"teruyamato0731","email":"77840326+teruyamato0731@users.noreply.github.com"}},{"title":"\u53ef\u5909\u5f15\u6570\u30c6\u30f3\u30d7\u30ec\u30fc\u30c8 [N2242] -- \u30b0\u30ed\u30fc\u30d0\u30eb\u4fee\u98fe : std::make_tuple\u3092\u767b\u9332","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/lang\/cpp11\/variadic_templates.html"}},"id":"c8f0f3f63e70b87bf9b9d66a9344525331eafa1f:lang\/cpp11\/variadic_templates.md","updated":"2026-04-09T08:58:08+09:00","summary":"
diff --git a\/lang\/cpp11\/variadic_templates.md b\/lang\/cpp11\/variadic_templates.md\nindex 697de6eb4..33fb8393c 100644\n--- a\/lang\/cpp11\/variadic_templates.md\n+++ b\/lang\/cpp11\/variadic_templates.md\n@@ -207,8 +207,7 @@ hello\n       f(a, b);\n     }\n     ```\n-    * std::make_tuple[link \/reference\/tuple\/make_tuple.md]\n-\n+    \n - \u30c6\u30f3\u30d7\u30ec\u30fc\u30c8\u30d1\u30e9\u30e1\u30fc\u30bf\n \n     ```cpp\n<\/code><\/pre>","author":{"name":"Akira Takahashi","email":"faithandbrave@gmail.com"}},{"title":"\u30af\u30e9\u30b9\u30c6\u30f3\u30d7\u30ec\u30fc\u30c8\u306e\u30c6\u30f3\u30d7\u30ec\u30fc\u30c8\u5f15\u6570\u63a8\u8ad6 [P0091R3] -- \u30b0\u30ed\u30fc\u30d0\u30eb\u4fee\u98fe : std::make_tuple\u3092\u767b\u9332","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/lang\/cpp17\/type_deduction_for_class_templates.html"}},"id":"c8f0f3f63e70b87bf9b9d66a9344525331eafa1f:lang\/cpp17\/type_deduction_for_class_templates.md","updated":"2026-04-09T08:58:08+09:00","summary":"
diff --git a\/lang\/cpp17\/type_deduction_for_class_templates.md b\/lang\/cpp17\/type_deduction_for_class_templates.md\nindex 4da28689c..58b994566 100644\n--- a\/lang\/cpp17\/type_deduction_for_class_templates.md\n+++ b\/lang\/cpp17\/type_deduction_for_class_templates.md\n@@ -199,7 +199,6 @@ int main()\n * std::function[link \/reference\/functional\/function.md]\n * std::weak_ptr[link \/reference\/memory\/weak_ptr.md]\n * wp.lock()[link \/reference\/memory\/weak_ptr\/lock.md]\n-* std::make_tuple[link \/reference\/tuple\/make_tuple.md]\n * std::promise[link \/reference\/future\/promise.md]\n * pro.get_future()[link \/reference\/future\/promise\/get_future.md]\n * std::future[link \/reference\/future\/future.md]\n<\/code><\/pre>","author":{"name":"Akira Takahashi","email":"faithandbrave@gmail.com"}},{"title":"\u30b3\u30f3\u30d1\u30a4\u30eb\u6642\u306e\u30bf\u30d7\u30eb\u3084\u30ea\u30b9\u30c8\u3092\u5c55\u958b\u51e6\u7406\u3059\u308btemplate for\u6587 [P1306R5] -- \u30b0\u30ed\u30fc\u30d0\u30eb\u4fee\u98fe : std::make_tuple\u3092\u767b\u9332","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/lang\/cpp26\/expansion_statements.html"}},"id":"c8f0f3f63e70b87bf9b9d66a9344525331eafa1f:lang\/cpp26\/expansion_statements.md","updated":"2026-04-09T08:58:08+09:00","summary":"
diff --git a\/lang\/cpp26\/expansion_statements.md b\/lang\/cpp26\/expansion_statements.md\nindex 8bab5d2c9..c6fc6a598 100644\n--- a\/lang\/cpp26\/expansion_statements.md\n+++ b\/lang\/cpp26\/expansion_statements.md\n@@ -18,7 +18,6 @@ template for (auto elem : tup) {\n   std::println("{}", elem);\n }\n ```\n-* std::make_tuple[link \/reference\/tuple\/make_tuple.md]\n \n \u51fa\u529b\uff1a\n \n@@ -162,7 +161,6 @@ auto result = find_first_int(tup);  \/\/ 42\n ```\n * std::is_integral_v[link \/reference\/type_traits\/is_integral.md]\n * std::remove_cvref_t[link \/reference\/type_traits\/remove_cvref.md]\n-* std::make_tuple[link \/reference\/tuple\/make_tuple.md]\n \n \n ## `co_await`\n<\/code><\/pre>","author":{"name":"Akira Takahashi","email":"faithandbrave@gmail.com"}},{"title":"construct -- \u30b0\u30ed\u30fc\u30d0\u30eb\u4fee\u98fe : std::make_tuple\u3092\u767b\u9332","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/memory_resource\/polymorphic_allocator\/construct.html"}},"id":"c8f0f3f63e70b87bf9b9d66a9344525331eafa1f:reference\/memory_resource\/polymorphic_allocator\/construct.md","updated":"2026-04-09T08:58:08+09:00","summary":"
diff --git a\/reference\/memory_resource\/polymorphic_allocator\/construct.md b\/reference\/memory_resource\/polymorphic_allocator\/construct.md\nindex c45a7860b..cdc61d8b6 100644\n--- a\/reference\/memory_resource\/polymorphic_allocator\/construct.md\n+++ b\/reference\/memory_resource\/polymorphic_allocator\/construct.md\n@@ -270,7 +270,6 @@ int main()\n * std::pmr::monotonic_buffer_resource[link \/reference\/memory_resource\/monotonic_buffer_resource.md]\n * std::pmr::string[link \/reference\/string\/basic_string.md]\n * std::piecewise_construct[link \/reference\/utility\/piecewise_construct_t.md]\n-* std::make_tuple[link \/reference\/tuple\/make_tuple.md]\n \n ### \u51fa\u529b\n ```\n<\/code><\/pre>","author":{"name":"Akira Takahashi","email":"faithandbrave@gmail.com"}},{"title":"swap -- \u30b0\u30ed\u30fc\u30d0\u30eb\u4fee\u98fe : std::make_tuple\u3092\u767b\u9332","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/tuple\/tuple\/swap.html"}},"id":"c8f0f3f63e70b87bf9b9d66a9344525331eafa1f:reference\/tuple\/tuple\/swap.md","updated":"2026-04-09T08:58:08+09:00","summary":"
diff --git a\/reference\/tuple\/tuple\/swap.md b\/reference\/tuple\/tuple\/swap.md\nindex 304750f7c..cf470662a 100644\n--- a\/reference\/tuple\/tuple\/swap.md\n+++ b\/reference\/tuple\/tuple\/swap.md\n@@ -55,7 +55,6 @@ int main()\n }\n ```\n * swap[color ff0000]\n-* std::make_tuple[link \/reference\/tuple\/make_tuple.md]\n \n ### \u51fa\u529b\n ```\n<\/code><\/pre>","author":{"name":"Akira Takahashi","email":"faithandbrave@gmail.com"}},{"title":"swap (\u975e\u30e1\u30f3\u30d0\u95a2\u6570) -- \u30b0\u30ed\u30fc\u30d0\u30eb\u4fee\u98fe : std::make_tuple\u3092\u767b\u9332","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/tuple\/tuple\/swap_free.html"}},"id":"c8f0f3f63e70b87bf9b9d66a9344525331eafa1f:reference\/tuple\/tuple\/swap_free.md","updated":"2026-04-09T08:58:08+09:00","summary":"
diff --git a\/reference\/tuple\/tuple\/swap_free.md b\/reference\/tuple\/tuple\/swap_free.md\nindex 73e82a782..084d53d00 100644\n--- a\/reference\/tuple\/tuple\/swap_free.md\n+++ b\/reference\/tuple\/tuple\/swap_free.md\n@@ -62,7 +62,6 @@ int main()\n }\n ```\n * std::swap[color ff0000]\n-* std::make_tuple[link \/reference\/tuple\/make_tuple.md]\n \n ### \u51fa\u529b\n ```\n<\/code><\/pre>","author":{"name":"Akira Takahashi","email":"faithandbrave@gmail.com"}},{"title":"index_sequence_for -- \u30b0\u30ed\u30fc\u30d0\u30eb\u4fee\u98fe : std::make_tuple\u3092\u767b\u9332","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/utility\/index_sequence_for.html"}},"id":"c8f0f3f63e70b87bf9b9d66a9344525331eafa1f:reference\/utility\/index_sequence_for.md","updated":"2026-04-09T08:58:08+09:00","summary":"
diff --git a\/reference\/utility\/index_sequence_for.md b\/reference\/utility\/index_sequence_for.md\nindex b4b8c66f2..d69891c29 100644\n--- a\/reference\/utility\/index_sequence_for.md\n+++ b\/reference\/utility\/index_sequence_for.md\n@@ -53,7 +53,6 @@ int main()\n ```\n * std::index_sequence_for[color ff0000]\n * std::integer_sequence[link integer_sequence.md]\n-* std::make_tuple[link \/reference\/tuple\/make_tuple.md]\n \n ## \u51fa\u529b\n ```\n<\/code><\/pre>","author":{"name":"Akira Takahashi","email":"faithandbrave@gmail.com"}},{"title":"\u30b3\u30f3\u30b9\u30c8\u30e9\u30af\u30bf -- \u30b0\u30ed\u30fc\u30d0\u30eb\u4fee\u98fe : std::make_tuple\u3092\u767b\u9332","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/utility\/pair\/op_constructor.html"}},"id":"c8f0f3f63e70b87bf9b9d66a9344525331eafa1f:reference\/utility\/pair\/op_constructor.md","updated":"2026-04-09T08:58:08+09:00","summary":"
diff --git a\/reference\/utility\/pair\/op_constructor.md b\/reference\/utility\/pair\/op_constructor.md\nindex ad0a5cdf4..5b7c28c1a 100644\n--- a\/reference\/utility\/pair\/op_constructor.md\n+++ b\/reference\/utility\/pair\/op_constructor.md\n@@ -256,7 +256,6 @@ int main()\n ```\n * std::move[link \/reference\/utility\/move.md]\n * std::piecewise_construct[link \/reference\/utility\/piecewise_construct_t.md]\n-* std::make_tuple[link \/reference\/tuple\/make_tuple.md]\n \n ### \u51fa\u529b\n ```\n<\/code><\/pre>","author":{"name":"Akira Takahashi","email":"faithandbrave@gmail.com"}},{"title":"piecewise_construct -- \u30b0\u30ed\u30fc\u30d0\u30eb\u4fee\u98fe : std::make_tuple\u3092\u767b\u9332","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/reference\/utility\/piecewise_construct_t.html"}},"id":"c8f0f3f63e70b87bf9b9d66a9344525331eafa1f:reference\/utility\/piecewise_construct_t.md","updated":"2026-04-09T08:58:08+09:00","summary":"
diff --git a\/reference\/utility\/piecewise_construct_t.md b\/reference\/utility\/piecewise_construct_t.md\nindex c6ccf8947..8e64d9a56 100644\n--- a\/reference\/utility\/piecewise_construct_t.md\n+++ b\/reference\/utility\/piecewise_construct_t.md\n@@ -47,7 +47,6 @@ int main()\n }\n ```\n * std::piecewise_construct[color ff0000]\n-* std::make_tuple[link \/reference\/tuple\/make_tuple.md]\n \n ### \u51fa\u529b\n ```\n<\/code><\/pre>","author":{"name":"Akira Takahashi","email":"faithandbrave@gmail.com"}},{"title":"\u30b3\u30f3\u30d1\u30a4\u30e9\u306e\u5b9f\u88c5\u72b6\u6cc1 -- C++26: template for\u6587\u3092\u8ffd\u52a0 (close #1494)","link":{"@attributes":{"href":"https:\/\/cpprefjp.github.io\/implementation-status.html"}},"id":"c7f3ae1d8baa4b7d683506d7bec5c4a3c417a45c:implementation-status.md","updated":"2026-04-09T08:44:02+09:00","content":"
\u30b3\u30f3\u30d1\u30a4\u30e9\u306e\u5b9f\u88c5\u72b6\u6cc1<\/span><\/h1>\n
\u3053\u306e\u30da\u30fc\u30b8\u3067\u306f\u3001C++\u306e\u30d0\u30fc\u30b8\u30e7\u30f3\u3054\u3068\u306e\u8a00\u8a9e\u6a5f\u80fd\u3092\u3001\u3069\u306e\u30b3\u30f3\u30d1\u30a4\u30e9\u304c\u3069\u306e\u30d0\u30fc\u30b8\u30e7\u30f3\u304b\u3089\u30b5\u30dd\u30fc\u30c8\u3057\u3066\u3044\u308b\u304b\u3092\u307e\u3068\u3081\u308b\u3002<\/p>\n
\u30e9\u30a4\u30d6\u30e9\u30ea\u6a5f\u80fd\u306b\u3064\u3044\u3066\u306f\u3001\u672c\u30b5\u30a4\u30c8\u306e\u30ea\u30d5\u30a1\u30ec\u30f3\u30b9\u3067\u5404\u6a5f\u80fd\u3092\u53c2\u7167\u3057\u3066\u3082\u3089\u3044\u305f\u3044\u3002<\/p>\n