-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathrss.xml
More file actions
6878 lines (6376 loc) · 416 KB
/
rss.xml
File metadata and controls
6878 lines (6376 loc) · 416 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
<title>cpprefjp - C++日本語リファレンス</title>
<link href="https://cpprefjp.github.io" />
<updated>2026-04-14T15:52:03.730517</updated>
<id>d9983977-13e3-4987-9017-8c0ef449423c</id>
<entry>
<title>adjacent_find -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/adjacent_find.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/adjacent_find.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/adjacent_find.md b/reference/algorithm/adjacent_find.md
index fe20630d8..50b87f554 100644
--- a/reference/algorithm/adjacent_find.md
+++ b/reference/algorithm/adjacent_find.md
@@ -157,6 +157,11 @@ ForwardIterator adjacent_find(ForwardIterator first, ForwardIterator last, Binar
- [ICC](/implementation.md#icc): ??
- [Visual C++](/implementation.md#visual_cpp): ??
+
+## 関連項目
+- [`ranges::adjacent_find`](/reference/algorithm/ranges_adjacent_find.md)
+
+
## 参照
- [P0202R3 Add Constexpr Modifiers to Functions in `&lt;algorithm&gt;` and `&lt;utility&gt;` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
- [P0574R1 Algorithm Complexity Constraints and Parallel Overloads](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0574r1.html)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>all_of -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/all_of.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/all_of.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/all_of.md b/reference/algorithm/all_of.md
index 120a26102..3479a06d5 100644
--- a/reference/algorithm/all_of.md
+++ b/reference/algorithm/all_of.md
@@ -88,6 +88,7 @@ bool all_of(InputIterator first, InputIterator last, Predicate pred) {
## 関連項目
- [`any_of`](/reference/algorithm/any_of.md)
- [`none_of`](/reference/algorithm/none_of.md)
+- [`ranges::all_of`](/reference/algorithm/ranges_all_of.md)
## 参照
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>any_of -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/any_of.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/any_of.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/any_of.md b/reference/algorithm/any_of.md
index 1923e1dbe..a0f9beeff 100644
--- a/reference/algorithm/any_of.md
+++ b/reference/algorithm/any_of.md
@@ -89,6 +89,7 @@ bool any_of(InputIterator first, InputIterator last, Predicate pred) {
## 関連項目
- [`all_of`](/reference/algorithm/all_of.md)
- [`none_of`](/reference/algorithm/none_of.md)
+- [`ranges::any_of`](/reference/algorithm/ranges_any_of.md)
## 参照
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>binary_search -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/binary_search.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/binary_search.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/binary_search.md b/reference/algorithm/binary_search.md
index a1c10635e..6ce083c7b 100644
--- a/reference/algorithm/binary_search.md
+++ b/reference/algorithm/binary_search.md
@@ -163,6 +163,11 @@ bool binary_search(ForwardIterator first, ForwardIterator last,
- [ICC](/implementation.md#icc): ??
- [Visual C++](/implementation.md#visual_cpp): ??
+
+## 関連項目
+- [`ranges::binary_search`](/reference/algorithm/ranges_binary_search.md)
+
+
## 参照
- [LWG Issue 787. complexity of `binary_search`](http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#787)
- C++03までの計算量が間違っていたので、C++11で修正。
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>clamp -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/clamp.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/clamp.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/clamp.md b/reference/algorithm/clamp.md
index 1500a095f..f54883f9c 100644
--- a/reference/algorithm/clamp.md
+++ b/reference/algorithm/clamp.md
@@ -78,6 +78,10 @@ int main()
- [Visual C++](/implementation.md#visual_cpp): ??
+## 関連項目
+- [`ranges::clamp`](/reference/algorithm/ranges_clamp.md)
+
+
## 参照
- [N4536 An algorithm to &#34;clamp&#34; a value between a pair of boundary values](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/n4536.html)
- [P0025R0 An algorithm to &#34;clamp&#34; a value between a pair of boundary values (revision 1)](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/p0025r0.html)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>copy -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/copy.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/copy.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/copy.md b/reference/algorithm/copy.md
index b2a8fdc65..1cce8b180 100644
--- a/reference/algorithm/copy.md
+++ b/reference/algorithm/copy.md
@@ -102,6 +102,11 @@ OutputIterator copy(InputIterator first, InputIterator last, OutputIterator resu
- [ICC](/implementation.md#icc): ??
- [Visual C++](/implementation.md#visual_cpp): ??
+
+## 関連項目
+- [`ranges::copy`](/reference/algorithm/ranges_copy.md)
+
+
## 参照
- [P0202R3 Add Constexpr Modifiers to Functions in `&lt;algorithm&gt;` and `&lt;utility&gt;` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
- [P0467R2 Iterator Concerns for Parallel Algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0467r2.html)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>copy_backward -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/copy_backward.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/copy_backward.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/copy_backward.md b/reference/algorithm/copy_backward.md
index 5c1fc81de..91e72f01f 100644
--- a/reference/algorithm/copy_backward.md
+++ b/reference/algorithm/copy_backward.md
@@ -95,5 +95,9 @@ BidirectionalIterator2 copy_backward(BidirectionalIterator1 first,
- [Visual C++](/implementation.md#visual_cpp): ??
+## 関連項目
+- [`ranges::copy_backward`](/reference/algorithm/ranges_copy_backward.md)
+
+
## 参照
- [P0202R3 Add Constexpr Modifiers to Functions in `&lt;algorithm&gt;` and `&lt;utility&gt;` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>copy_if -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/copy_if.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/copy_if.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/copy_if.md b/reference/algorithm/copy_if.md
index fae041b1d..1a2fb6c24 100644
--- a/reference/algorithm/copy_if.md
+++ b/reference/algorithm/copy_if.md
@@ -112,6 +112,10 @@ OutputIterator copy_if(InputIterator first, InputIterator last,
- [Visual C++](/implementation.md#visual_cpp): 2010 [mark verified], 2012 [mark verified], 2013 [mark verified], 2015 [mark verified]
+## 関連項目
+- [`ranges::copy_if`](/reference/algorithm/ranges_copy_if.md)
+
+
## 参照
- [N2569 More STL algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2569.pdf)
- [N2666 More STL algorithms (revision 2)](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2666.pdf)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>copy_n -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/copy_n.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/copy_n.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/copy_n.md b/reference/algorithm/copy_n.md
index 4e495dcde..a742b094c 100644
--- a/reference/algorithm/copy_n.md
+++ b/reference/algorithm/copy_n.md
@@ -89,6 +89,10 @@ OutputIterator copy_n(InputIterator first, Size n, OutputIterator result) {
- [Visual C++](/implementation.md#visual_cpp): 2010 [mark verified], 2012 [mark verified], 2013 [mark verified], 2015 [mark verified]
+## 関連項目
+- [`ranges::copy_n`](/reference/algorithm/ranges_copy_n.md)
+
+
## 参照
- [N2569 More STL algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2569.pdf)
- [N2666 More STL algorithms (revision 2)](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2666.pdf)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>count -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/count.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/count.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/count.md b/reference/algorithm/count.md
index 324da12ef..673b89b14 100644
--- a/reference/algorithm/count.md
+++ b/reference/algorithm/count.md
@@ -141,6 +141,11 @@ typename iterator_traits&lt;InputIterator&gt;::difference_type
- [ICC](/implementation.md#icc): ??
- [Visual C++](/implementation.md#visual_cpp): ??
+
+## 関連項目
+- [`ranges::count`](/reference/algorithm/ranges_count.md)
+
+
## 参照
- [P0202R3 Add Constexpr Modifiers to Functions in `&lt;algorithm&gt;` and `&lt;utility&gt;` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
- [P0467R2 Iterator Concerns for Parallel Algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0467r2.html)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>count_if -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/count_if.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/count_if.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/count_if.md b/reference/algorithm/count_if.md
index 1f3e8983e..56181fd2c 100644
--- a/reference/algorithm/count_if.md
+++ b/reference/algorithm/count_if.md
@@ -83,6 +83,10 @@ typename iterator_traits&lt;InputIterator&gt;::difference_type
- [Visual C++](/implementation.md#visual_cpp): ??
+## 関連項目
+- [`ranges::count_if`](/reference/algorithm/ranges_count_if.md)
+
+
## 参照
- [P0202R3 Add Constexpr Modifiers to Functions in `&lt;algorithm&gt;` and `&lt;utility&gt;` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
- [P0467R2 Iterator Concerns for Parallel Algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0467r2.html)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>equal -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/equal.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/equal.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/equal.md b/reference/algorithm/equal.md
index 9723fa313..9ba94dc1d 100644
--- a/reference/algorithm/equal.md
+++ b/reference/algorithm/equal.md
@@ -219,6 +219,10 @@ inline bool equal(InputIterator1 first1, InputIterator1 last1,
- [Visual C++](/implementation.md#visual_cpp): 2015 [mark verified]
+## 関連項目
+- [`ranges::equal`](/reference/algorithm/ranges_equal.md)
+
+
## 参照
- [N3671 Making non-modifying sequence operations more robust: Revision 2](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3671.html)
- C++14から追加された、`last2`を受け取るオーバーロードの提案文書
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>equal_range -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/equal_range.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/equal_range.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/equal_range.md b/reference/algorithm/equal_range.md
index 0b6d04030..c7a2a6ed2 100644
--- a/reference/algorithm/equal_range.md
+++ b/reference/algorithm/equal_range.md
@@ -147,6 +147,11 @@ int main() {
3,4
```
+
+## 関連項目
+- [`ranges::equal_range`](/reference/algorithm/ranges_equal_range.md)
+
+
## 参照
- [LWG Issue 384. `equal_range` has unimplementable runtime complexity](http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#384)
- [P0202R3 Add Constexpr Modifiers to Functions in `&lt;algorithm&gt;` and `&lt;utility&gt;` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>fill -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/fill.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/fill.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/fill.md b/reference/algorithm/fill.md
index 80b66018c..c345c7dac 100644
--- a/reference/algorithm/fill.md
+++ b/reference/algorithm/fill.md
@@ -136,6 +136,10 @@ void fill(ForwardIterator first, ForwardIterator last, const T&amp; value) {
```
+## 関連項目
+- [`ranges::fill`](/reference/algorithm/ranges_fill.md)
+
+
## 参照
- [P0202R3 Add Constexpr Modifiers to Functions in `&lt;algorithm&gt;` and `&lt;utility&gt;` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
- [P2248R8 Enabling list-initialization for algorithms](https://open-std.org/jtc1/sc22/wg21/docs/papers/2024/p2248r8.html)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>fill_n -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/fill_n.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/fill_n.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/fill_n.md b/reference/algorithm/fill_n.md
index 5eb8a5bd5..b89314d47 100644
--- a/reference/algorithm/fill_n.md
+++ b/reference/algorithm/fill_n.md
@@ -169,6 +169,10 @@ fill_n(OutputIterator first, Size n, const T&amp; value) {
- C++11への対応(戻り値の変更)は2012から。
+## 関連項目
+- [`ranges::fill_n`](/reference/algorithm/ranges_fill_n.md)
+
+
## 参照
- [LWG DR865. More algorithms that throw away information](http://cplusplus.github.io/LWG/lwg-defects.html#865)
戻り値が追加されるきっかけとなったレポート
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>find -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/find.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/find.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/find.md b/reference/algorithm/find.md
index 2eb04c2dd..7cab0e39a 100644
--- a/reference/algorithm/find.md
+++ b/reference/algorithm/find.md
@@ -134,6 +134,10 @@ InputIterator find(InputIterator first, InputIterator last, const T&amp; value) {
```
+## 関連項目
+- [`ranges::find`](/reference/algorithm/ranges_find.md)
+
+
## 参照
- [P0202R3 Add Constexpr Modifiers to Functions in `&lt;algorithm&gt;` and `&lt;utility&gt;` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
- [P0467R2 Iterator Concerns for Parallel Algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0467r2.html)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>find_end -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/find_end.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/find_end.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/find_end.md b/reference/algorithm/find_end.md
index 1998bcd9a..196d52b41 100644
--- a/reference/algorithm/find_end.md
+++ b/reference/algorithm/find_end.md
@@ -136,6 +136,10 @@ ForwardIterator1 find_end(ForwardIterator1 first1, ForwardIterator1 last1,
* std::search[link search.md]
+## 関連項目
+- [`ranges::find_end`](/reference/algorithm/ranges_find_end.md)
+
+
## 参照
- [LWG Issue 2150. Unclear specification of `find_end`](http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#2150)
- [P0202R3 Add Constexpr Modifiers to Functions in `&lt;algorithm&gt;` and `&lt;utility&gt;` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>find_first_of -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/find_first_of.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/find_first_of.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/find_first_of.md b/reference/algorithm/find_first_of.md
index ba3158c38..bc766dc3d 100644
--- a/reference/algorithm/find_first_of.md
+++ b/reference/algorithm/find_first_of.md
@@ -136,6 +136,10 @@ InputIterator find_first_of(InputIterator first1, InputIterator last1,
```
+## 関連項目
+- [`ranges::find_first_of`](/reference/algorithm/ranges_find_first_of.md)
+
+
## 参照
- [LWG Issue 576. `find_first_of` is overconstrained](http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#576)
- C++11から、パラメータのイテレータ型に対する制約が緩和され、`ForwardIterator`から`InputIterator`に変更になった経緯のレポート
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>find_if -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/find_if.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/find_if.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/find_if.md b/reference/algorithm/find_if.md
index c3cb3a8ad..fcb6e1ec4 100644
--- a/reference/algorithm/find_if.md
+++ b/reference/algorithm/find_if.md
@@ -71,6 +71,10 @@ InputIterator find_if(InputIterator first, InputIterator last, Predicate pred) {
```
+## 関連項目
+- [`ranges::find_if`](/reference/algorithm/ranges_find_if.md)
+
+
## 参照
- [P0202R3 Add Constexpr Modifiers to Functions in `&lt;algorithm&gt;` and `&lt;utility&gt;` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
- [P0467R2 Iterator Concerns for Parallel Algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0467r2.html)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>find_if_not -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/find_if_not.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/find_if_not.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/find_if_not.md b/reference/algorithm/find_if_not.md
index 352e17c24..42c217779 100644
--- a/reference/algorithm/find_if_not.md
+++ b/reference/algorithm/find_if_not.md
@@ -72,6 +72,10 @@ InputIterator find_if_not(InputIterator first, InputIterator last, Predicate pre
```
+## 関連項目
+- [`ranges::find_if_not`](/reference/algorithm/ranges_find_if_not.md)
+
+
## 参照
- [N2569 More STL algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2569.pdf)
- [N2666 More STL algorithms (revision 2)](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2666.pdf)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>for_each -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/for_each.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/for_each.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/for_each.md b/reference/algorithm/for_each.md
index 1dace0823..dc270b172 100644
--- a/reference/algorithm/for_each.md
+++ b/reference/algorithm/for_each.md
@@ -157,6 +157,10 @@ Function for_each(InputIterator first, InputIterator last, Function f) {
```
+## 関連項目
+- [`ranges::for_each`](/reference/algorithm/ranges_for_each.md)
+
+
## 参照
- [P0202R3 Add Constexpr Modifiers to Functions in `&lt;algorithm&gt;` and `&lt;utility&gt;` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
- [P0467R2 Iterator Concerns for Parallel Algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0467r2.html)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>for_each_n -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/for_each_n.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/for_each_n.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/for_each_n.md b/reference/algorithm/for_each_n.md
index 452705bc0..a175ce6ae 100644
--- a/reference/algorithm/for_each_n.md
+++ b/reference/algorithm/for_each_n.md
@@ -94,6 +94,10 @@ int main()
- [Visual C++](/implementation.md#visual_cpp): ??
+## 関連項目
+- [`ranges::for_each_n`](/reference/algorithm/ranges_for_each_n.md)
+
+
## 参照
- [P0024R2 The Parallelism TS Should be Standardized](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2016/p0024r2.html)
- [P0202R3 Add Constexpr Modifiers to Functions in `&lt;algorithm&gt;` and `&lt;utility&gt;` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>generate -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/generate.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/generate.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/generate.md b/reference/algorithm/generate.md
index 17aacb71a..5687804b6 100644
--- a/reference/algorithm/generate.md
+++ b/reference/algorithm/generate.md
@@ -73,5 +73,9 @@ void generate(ForwardIterator first, ForwardIterator last, Generator gen) {
```
+## 関連項目
+- [`ranges::generate`](/reference/algorithm/ranges_generate.md)
+
+
## 参照
- [P0202R3 Add Constexpr Modifiers to Functions in `&lt;algorithm&gt;` and `&lt;utility&gt;` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>generate_n -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/generate_n.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/generate_n.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/generate_n.md b/reference/algorithm/generate_n.md
index b911b527d..c044fdd1d 100644
--- a/reference/algorithm/generate_n.md
+++ b/reference/algorithm/generate_n.md
@@ -108,6 +108,10 @@ generate_n(OutputIterator first, Size n, Generator gen) {
- C++11への対応(戻り値の変更)は2012から。
+## 関連項目
+- [`ranges::generate_n`](/reference/algorithm/ranges_generate_n.md)
+
+
## 参照
- [LWG DR865. More algorithms that throw away information](http://cplusplus.github.io/LWG/lwg-defects.html#865)
戻り値が追加されるきっかけとなったレポート
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>includes -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/includes.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/includes.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/includes.md b/reference/algorithm/includes.md
index 82b393e2c..e32059813 100644
--- a/reference/algorithm/includes.md
+++ b/reference/algorithm/includes.md
@@ -121,6 +121,10 @@ bool includes(InputIterator1 first1, InputIterator1 last1,
```
+## 関連項目
+- [`ranges::includes`](/reference/algorithm/ranges_includes.md)
+
+
## 参照
- [P0202R3 Add Constexpr Modifiers to Functions in `&lt;algorithm&gt;` and `&lt;utility&gt;` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
- [P0467R2 Iterator Concerns for Parallel Algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0467r2.html)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>inplace_merge -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/inplace_merge.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/inplace_merge.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/inplace_merge.md b/reference/algorithm/inplace_merge.md
index 2af32581f..865b27241 100644
--- a/reference/algorithm/inplace_merge.md
+++ b/reference/algorithm/inplace_merge.md
@@ -108,6 +108,10 @@ int main()
- [`inplace_merge` を読んでみた](http://www.kmonos.net/wlog/115.html#_2300101215)
+## 関連項目
+- [`ranges::inplace_merge`](/reference/algorithm/ranges_inplace_merge.md)
+
+
## 参照
- [P2562R1 `constexpr` Stable Sorting](https://open-std.org/jtc1/sc22/wg21/docs/papers/2022/p2562r1.pdf)
- C++26から`constexpr`に対応した
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>is_heap -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/is_heap.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/is_heap.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/is_heap.md b/reference/algorithm/is_heap.md
index 6498b559b..d6395da0a 100644
--- a/reference/algorithm/is_heap.md
+++ b/reference/algorithm/is_heap.md
@@ -89,6 +89,10 @@ before: is heap? false
- 2008では、`_HAS_TRADITIONAL_STL`を1に定義してから`&lt;algorithm&gt;`をインクルードすると、`stdext`名前空間で`is_heap`が定義される。
+## 関連項目
+- [`ranges::is_heap`](/reference/algorithm/ranges_is_heap.md)
+
+
## 参照
- [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)
- [P0202R3 Add Constexpr Modifiers to Functions in `&lt;algorithm&gt;` and `&lt;utility&gt;` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>is_heap_until -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/is_heap_until.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/is_heap_until.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/is_heap_until.md b/reference/algorithm/is_heap_until.md
index 094cb609c..d433e7d8d 100644
--- a/reference/algorithm/is_heap_until.md
+++ b/reference/algorithm/is_heap_until.md
@@ -129,6 +129,10 @@ RandomAccessIterator is_heap_until(RandomAccessIterator first, RandomAccessItera
- [Visual C++](/implementation.md#visual_cpp): 2010 [mark verified], 2012 [mark verified], 2013 [mark verified], 2015 [mark verified]
+## 関連項目
+- [`ranges::is_heap_until`](/reference/algorithm/ranges_is_heap_until.md)
+
+
## 参照
- [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)
- [P0202R3 Add Constexpr Modifiers to Functions in `&lt;algorithm&gt;` and `&lt;utility&gt;` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>is_partitioned -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/is_partitioned.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/is_partitioned.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/is_partitioned.md b/reference/algorithm/is_partitioned.md
index 94506f950..81e331724 100644
--- a/reference/algorithm/is_partitioned.md
+++ b/reference/algorithm/is_partitioned.md
@@ -110,6 +110,10 @@ bool is_partitioned(InputIterator first, InputIterator last, Predicate pred)
- [Visual C++](/implementation.md#visual_cpp): 2010 [mark verified], 2012 [mark verified], 2013 [mark verified], 2015 [mark verified]
+## 関連項目
+- [`ranges::is_partitioned`](/reference/algorithm/ranges_is_partitioned.md)
+
+
## 参照
- [N2569 More STL algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2569.pdf)
- [N2666 More STL algorithms (revision 2)](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2666.pdf)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>is_permutation -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/is_permutation.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/is_permutation.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/is_permutation.md b/reference/algorithm/is_permutation.md
index 62f24efd4..aac5049d1 100644
--- a/reference/algorithm/is_permutation.md
+++ b/reference/algorithm/is_permutation.md
@@ -222,6 +222,11 @@ bool is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
- [Visual C++](/implementation.md#visual_cpp): 2010 [mark verified], 2012 [mark verified], 2013 [mark verified], 2015 [mark verified]
- C++14で追加されたオーバーロードは2015から実装されている。
+
+## 関連項目
+- [`ranges::is_permutation`](/reference/algorithm/ranges_is_permutation.md)
+
+
## 参照
- [N3671 Making non-modifying sequence operations more robust: Revision 2](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3671.html)
- C++14から追加された、`last2`を受け取るオーバーロードの提案文書
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>is_sorted -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/is_sorted.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/is_sorted.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/is_sorted.md b/reference/algorithm/is_sorted.md
index f0c2de657..0779ec462 100644
--- a/reference/algorithm/is_sorted.md
+++ b/reference/algorithm/is_sorted.md
@@ -83,6 +83,10 @@ before: is sorted? false
- 2008では、`_HAS_TRADITIONAL_STL`を1に定義してから`&lt;algorithm&gt;`をインクルードすると、`stdext`名前空間で`is_sorted`が定義される。
+## 関連項目
+- [`ranges::is_sorted`](/reference/algorithm/ranges_is_sorted.md)
+
+
## 参照
- [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)
- [P0202R3 Add Constexpr Modifiers to Functions in `&lt;algorithm&gt;` and `&lt;utility&gt;` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>is_sorted_until -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/is_sorted_until.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/is_sorted_until.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/is_sorted_until.md b/reference/algorithm/is_sorted_until.md
index 621f615d0..7965bb8b7 100644
--- a/reference/algorithm/is_sorted_until.md
+++ b/reference/algorithm/is_sorted_until.md
@@ -111,6 +111,10 @@ ForwardIterator is_sorted_until(ForwardIterator first, ForwardIterator last)
- [Visual C++](/implementation.md#visual_cpp): 2010 [mark verified], 2012 [mark verified], 2013 [mark verified], 2015 [mark verified]
+## 関連項目
+- [`ranges::is_sorted_until`](/reference/algorithm/ranges_is_sorted_until.md)
+
+
## 参照
- [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)
- [P0202R3 Add Constexpr Modifiers to Functions in `&lt;algorithm&gt;` and `&lt;utility&gt;` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>lexicographical_compare -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/lexicographical_compare.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/lexicographical_compare.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/lexicographical_compare.md b/reference/algorithm/lexicographical_compare.md
index b486aed5d..35096690c 100644
--- a/reference/algorithm/lexicographical_compare.md
+++ b/reference/algorithm/lexicographical_compare.md
@@ -181,6 +181,10 @@ bool lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
```
+## 関連項目
+- [`ranges::lexicographical_compare`](/reference/algorithm/ranges_lexicographical_compare.md)
+
+
## 参照
- [P0202R3 Add Constexpr Modifiers to Functions in `&lt;algorithm&gt;` and `&lt;utility&gt;` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
- [P0467R2 Iterator Concerns for Parallel Algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0467r2.html)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>lower_bound -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/lower_bound.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/lower_bound.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/lower_bound.md b/reference/algorithm/lower_bound.md
index 7b3b2e2f0..25716af75 100644
--- a/reference/algorithm/lower_bound.md
+++ b/reference/algorithm/lower_bound.md
@@ -262,6 +262,11 @@ lower_bound(ForwardIterator first, ForwardIterator last, const T&amp; value)
* std::advance[link /reference/iterator/advance.md]
* std::iterator_traits[link /reference/iterator/iterator_traits.md]
+
+## 関連項目
+- [`ranges::lower_bound`](/reference/algorithm/ranges_lower_bound.md)
+
+
## 参照
- [LWG Issue 384. `equal_range` has unimplementable runtime complexity](http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#384)
- [LWG Issue 2150. Unclear specification of `find_end`](http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#2150)
</code></pre></summary>
<author>
<name>teruyamato0731</name>
<email>77840326+teruyamato0731@users.noreply.github.com</email>
</author>
</entry>
<entry>
<title>make_heap -- feat(algorithm): rangesに対する関連項目を追加 (#1611)</title>
<link href="https://cpprefjp.github.io/reference/algorithm/make_heap.html"/>
<id>c531e9a59af86bff92322a272db39679c6b212d9:reference/algorithm/make_heap.md</id>
<updated>2026-04-13T15:17:49+09:00</updated>
<summary type="html"><pre><code>diff --git a/reference/algorithm/make_heap.md b/reference/algorithm/make_heap.md