Personal tools
Document Actions
Chapter 13: Generic Algorithms
Click on the banner to return to the user guide home page.
Chapter 13: Generic Algorithms
- 13.1 Overview
- 13.1.1 Include Files
- 13.2 Initialization Algorithms
- 13.2.1 Fill a Sequence with An Initial Value
- 13.2.2 Copy One Sequence Into Another Sequence
- 13.2.3 Initialize a Sequence with Generated Values
- 13.2.4 Swap Values from Two Parallel Ranges
- 13.3 Searching Operations
- 13.3.1 Find an Element Satisfying a Condition
- 13.3.2 Find Consecutive Duplicate Elements
- 13.3.3 Find the first occurrence of any value from a sequence
- 13.3.4 Find a Sub-sequence within a Sequence
- 13.3.5 Find the last occurrence of a Sub-sequence
- 13.3.6 Locate Maximum or Minimum Element
- 13.3.7 Locate the First Mismatched Elements in Parallel Sequences
- 13.4 In-Place Transformations
- 13.4.1 Reverse Elements in a Sequence
- 13.4.2 Replace Certain Elements With Fixed Value
- 13.4.3 Rotate Elements Around a Midpoint
- 13.4.4 Partition a Sequence into Two Groups
- 13.4.5 Generate Permutations in Sequence
- 13.4.6 Merge Two Adjacent Sequences into One
- 13.4.7 Randomly Rearrange Elements in a Sequence
- 13.5 Removal Algorithms
- 13.5.1 Remove Unwanted Elements
- 13.5.2 Remove Runs of Similar Values
- 13.6 Scalar-Producing Algorithms
- 13.6.1 Count the Number of Elements that Satisfy a Condition
- 13.6.2 Reduce Sequence to a Single Value
- 13.6.3 Generalized Inner Product
- 13.6.4 Test Two Sequences for Pairwise Equality
- 13.6.5 Lexical Comparison
- 13.7 Sequence-Generating Algorithms
- 13.7.1 Transform One or Two Sequences
- 13.7.2 Partial Sums
- 13.7.3 Adjacent Differences
- 13.8 Miscellaneous Algorithms
- 13.8.1 Apply a Function to All Elements in a Collection
©Copyright 1996, Rogue Wave Software, Inc.
