inner_product2ArgValueA, bTplus, multipliesFwd.10 adjacent_reduce1sArgValueA, bTFwd.inner_product10 transform_reduce1,2ArgValueacR, uT/bTplus, multiplies∥20 transform_inclusive_scan1First, ArgRangeaR, uT∥20 transform_exclusive_scan1ArgRangeaR, uT∥20 partial_sum1FirstRangeAplusFwd.30 inclusive_scan1First, ArgRangeaRplus∥30 exclusive_scan1ArgRangeaRplus∥30 adjacent_difference1sQuasiRangefDminusFwd.∥adjacent_transform40 adjacent_transform1sQuasiRangeDFwd.∥adjacent_difference40 adjacent_inclusive_scan1sFirstRangeA, DFwd.50 transform1,2RangeuT / bTFwd.60 copy1RangeFwd.transform60 copy_backward1RangeRev.60 move1RangeFwd.transform60 move_backward1RangeRev.shift_right60 replace_copy1+ValueArgRangeequal_toFwd.transform60 replace_copy_if1ArgRangeuPFwd.transform60 reverse_copy1Range∥transform60 rotate_copy1dRange∥60 sample1ArgRange / Fwd.60 partial_sort_copy1RangebPless∥60 merge2RangebPlessFwd.∥60 transform_if1RangeuP, uTFwd.65 copy_if1RangeuPFwd.transform_if65 remove_copy1+ValueRangeequal_toFwd.transform_if65 remove_copy_if1RangeuPFwd.transform_if65 unique_copy1FirstRangebPequal_toFwd.65 set_difference2RangebPlessFwd.∥65 set_intersection2RangebPlessFwd.∥65 set_symmetric_difference2RangebPlessFwd.∥65 set_union2RangebPlessFwd.∥65 partition_copy12 RangesuPY/N67 find1+ValuePositionequal_toS/C∥70 find_if1PositionuPS/C∥70 find_if_not1PositionuPS/C∥find_if70 find_first_of2PositionbPequal_toS/C∥find_if70 max_element1FirstPositionbPless, maxFwd.72 min_element1FirstPositionbPless, minFwd.72 minmax_element1First2 PositionsbPless, minmaxFwd.72 lower_bound1+ValuePositionbPlessB/S75 upper_bound1+ValuePositionbPlessB/S75 equal_range1+Value2 PositionsbPlessB/S75 search2PositionbPequal_to∥80 search_n2PositionbPequal_to∥80 find_end2PositionbPequal_to∥search80 starts_with2boolbPequal_toFwd.80 ends_with2boolbPequal_to80 ranges::starts_withΔ2boolbP, uT, uTequal_to, identity, identity80 ranges::ends_withΔ2boolbP, uT, uTequal_to, identity, identity80 search (C++17)1PositionSearcher85 adjacent_find1sPositionbPequal_toS/C∥?90 iota0ArgRange++Fwd.generate100 iota0ArgRangeuT++Fwd.generate100 generate0RangeGFwd.∥100 generate_n0RangeGFwd.∥100 fill0ArgRangeFwd.∥generate100 fill_n0ArgRangeFwd.∥generate_n100 accumulate1ArgValueAplusFwd.110 sum1FirstValueAplusFwd.accumulate110 reduce1ArgValueacRplus∥110 any_of1falsebooluPS/C∥110 all_of1truebooluPS/C∥110 none_of1truebooluPS/C∥110 contains1+Valuefalseboolequal_toS/Cany_of110 count1+Value0size_tequal_toFwd.∥accumulate110 count_if10size_tuPFwd.∥accumulate110 binary_search1+ValueboolbPlessB/S110 is_partitioned1booluPFwd.∥120 is_sorted1boolbPlessFwd.∥120 is_heap1boolbPless∥120 is_permutation2boolbPequal_to120 includes2boolbPlessFwd.∥120 equal2boolbPequal_toFwd.∥?120 lexicographical_compare2boolbPlessFwd.∥?120 lexicographical_compare_three_way2orderingCompareΔcompare_three_wayFwd.?120 mismatch2PositionbPequal_toFwd.∥?130 partition_point1PositionuPB/S130 is_sorted_until1PositionbPlessFwd.∥130 is_heap_until1PositionbPless∥130 for_each1opmuTFwd.∥140 for_each_n1opmuTFwd.∥140 for_each1,2opmuT/mbTFwd.140 for_each_n1,2opmuT/mbTFwd.140 swap_ranges2PositionswapFwd.∥for_each140 remove1+ValuePositionequal_toFwd.∥150 remove_if1PositionuPFwd.∥150 unique1PositionbPequal_toFwd.∥150 replace1+Valuevoidequal_toFwd.∥transform160 replace_if1voiduPFwd.∥transform160 reverse1voidYes∥swap_ranges170 rotate1dPositionYes∥170 shift_left1dPositionFwd.∥move170 shift_right1dPositionYes∥move_backward170 shuffle1Argvoid170 next_permutation1bool170 prev_permutation1bool170 partition1PositionuP∥170 stable_partition1PositionuP∥170 sort1voidbPless∥170 partial_sort1voidbPless∥170 stable_sort1voidbPless∥170 nth_element1voidbPless∥170 inplace_merge1dvoidbPless∥170 make_heap1voidbPless170 push_heap1voidbPless170 pop_heap1voidbPless170 sort_heap1voidbPless170