HP Integrity NonStop H-Series - Manual (Page 141)

Click on the banner to return to the user guide home page.
©Copyright 1996 Rogue Wave Software
Overview
In this chapter and in Chapter 14 we will examine and illustrate each of the generic algorithms
provided by the standard library. The names and a short description of each of the algorithms in
this chapter are given in the following table. We have divided the algorithms into several
categories, based on how they are typically used. This division differs from the categories used
in the C++ standard definition, which is based upon which algorithms modify their arguments
and which do not.
Name Purpose
algorithms used to initialize a sequence
Chapter 13 ( Initialization Algorithms )
fill fill a sequence with an initial value
fill_n fill n positions with an initial value
copy copy sequence into another sequence
copy_backward copy sequence into another sequence
generate initialize a sequence using a generator
generate_n initialize n positions using a generator
swap_ranges swap values from two parallel sequences
searching algorithms
Chapter 13 ( Searching Algorithms )
find find an element matching the argument
find_if find an element satisfying a condition
adjacent_find find consecutive duplicate elements
search match a subsequence within a sequence
max_element find the maximum value in a sequence
min_element find the minimum value in a sequence