Nonmodifying

Overview

Nonmodifying Algorithms neither change the order nor the value of the elements they process. They operate with input and forward iterators; therefore, you can call them for all standard containers.

Section Pages

for each

unknown, for_each, unknown, unknown, unknown, unknown, \\, unknown, \\, unknown, \\, unknown, \\, unknown

Performs an operation for each element

find

Searches for the first element with the passed value

find if

Searches for the first element that matches a criterion

adjacent find

Searches for two adjacent elements that are equal (by some criterion)

find first of

Searches the first of several possible elements

count

Count appearances of value in range

mismatch

unknown, InputIterator1, InputIterator1, unknown, unknown, unknown, unknown, \\, \\, \\, \\, \\, unknown

Return first position where two ranges differ

equal

Test whether two ranges are equal

search

unknown, search, search, unknown, unknown, unknown, unknown, \\, \\, \\, \\, \\, \\, unknown

Searches for the first occurrence of a subrange

search n

unknown, search_n, search_n, unknown, unknown, unknown, unknown, \\, \\, \\, \\, \\, \\, unknown

Searches for the first n consecutive elements with certain properties

count if

unknown, count_if, unknown, unknown, unknown, unknown, \\, \\, \\, \\, unknown

Returns the number of elements that match a criterion

find end

unknown, find_end, find_end, unknown, unknown, unknown, unknown, \\, \\, \\, \\, \\, \\, unknown

Searches for the last occurrence of a subrang