^#

inner_product

2↓I Arg Value A, bT plus, multiplies Unspc. Fwd. transform_reduce 10

^#

adjacent_reduce▸

1s↓F Arg Value A, bT Unspc. Fwd. inner_product 10

^#

transform_reduce

1↓I,∥F / 2↓I,∥F Arg Value acR, uT / bT plus, multiplies O(N) ∥ 20

^#

find

1↓I,∥F+Value Position equal_to O(N) S/C, ∥ 70

^#

find_if, find_if_not

1↓I,∥F Position uP O(N) S/C, ∥ 70

^#

find_first_of

1↓I,∥F + 1↓F Position bP equal_to O(S×N) S/C, ∥ find_if 70

^#

min_element, max_element

1↓F First Position bP less O(N), =(max(N-1, 0)) Fwd., ∥ 72

^#

minmax_element

1↓F First 2 Positions⌖ bP less O(N), ≤(max(floor((3/2)*(N−1)), 0)) Fwd., ∥ 72

^#

lower_bound, upper_bound

1↓F+Value Position bP less O(log N) + O(1)↓R; O(N) B/S 75

^#

equal_range

1↓F+Value Range⌖ bP less O(log N) + O(1)↓R; O(N) B/S 75

^#

search

2↓F Position bP equal_to ≤(S×N) ∥ 80

^#

find_end

2↓F Position bP equal_to ≤(S×(N-S+1)) ∥ search 80

^#

starts_with

2↓F bool bP equal_to N > S ? O(S) : O(1)↓R; O(min(S, N))↓F Fwd. 80

^#

ends_with

2↓B bool bP equal_to N > S ? O(S) : O(1)↓R; O(min(S, N))↓B 80

^#

ranges::starts_with

2↓I bool bP, uT, uTΔ equal_to, identity, identity ≤(min(S, N)) 80

^#

ranges::ends_with

2↓F bool bP, uT, uTΔ equal_to, identity, identity ≤(min(S, N)) 80

^#

search (C++17)

1↓F Position Searcher Depends on Searcher 85

^#

find_match

2↓I Position⌖ bP equal_to O(N), O(min(N, M)) S/C 90

^#

mismatch

2↓I,∥F Position⌖ bP equal_to O(N), O(min(N, M)) S/C, ∥ find_match 90

^#

adjacent_find

1s↓F Position bP equal_to =(min((result-first)+1, (last-first)-1)); O(N)↓∥ S/C, ∥ find_match 90

^#

is_sorted_until

1s↓F Position bP less O(N) S/C, ∥ find_match 90

^#

search_n

1↓F + Count + Value Position bP equal_to ≤(N) ∥ adjacent_find 95

^#

accumulate

1↓I Arg Value A plus Unspc.; O(N) Fwd. 110

^#

sum

1↓I First Value R plus O(N) Fwd. accumulate 110

^#

reduce

1↓I,∥F Arg Value acR plus O(N) ∥ 110

^#

count

1↓I,∥F+Value 0 size_t equal_to =(N) Fwd., ∥ accumulate 110

^#

count_if

1↓I,∥F 0 size_t uP =(N) Fwd., ∥ accumulate 110

^#

binary_search

1↓F+Value bool bP less O(log N) + O(1)↓R; O(N) B/S 110

^#

is_partitioned

1↓I,∥F bool uP O(N) Fwd., ∥ 120

^#

is_sorted

1↓F bool bP less O(N) Fwd., ∥ 120

^#

is_heap

1↓R bool bP less O(N) ∥ 120

^#

is_permutation

2↓F bool bP equal_to N==M ? O(N²) : O(1)↓R; O(N²) 120

^#

includes

2↓I,∥F bool bP less O(N+M), ≤(2×(N+M-1)) Fwd., ∥ 120

^#

first_result

1↓I+Value / 2↓I+Value Arg Value uT / bT O(N) S/C 125

^#

first_result_if

1↓I / 2↓I Value uT / bT, uP / bP O(N) S/C 125

^#

all_of, none_of

1↓I,∥F true bool uP O(N) S/C, ∥ first_result 125

^#

any_of

1↓I,∥F false bool uP O(N) S/C, ∥ first_result 125

^#

contains

1↓I+Value false bool equal_to O(N) S/C first_result 125

^#

contains_any

2↓I false bool contains O(S×N) S/C first_result 125

^#

equal

2↓I,∥F bool bP equal_to N==M ? ≤(N) : O(1)↓R; ≤(N); O(N)↓∥ Fwd., ∥ first_result 125

^#

lexicographical_compare

2↓I,∥F bool bP less ≤(2×min(N, M)) Fwd., ∥ first_result 125

^#

lexicographical_compare_three_way

2↓I ordering CompareΔ compare_three_way <(min(N, M)) Fwd. first_result 125

^#

partition_point

1↓F Position uP O(log N)↓R; O(N) B/S 130

^#

is_heap_until

1↓R Position bP less O(N) ∥ 130