algorithm

# algorithm (STL/CLR)

Visual Studio 2013

Defines STL/CLR container template functions that perform algorithms.

```#include <cliext/algorithm>
```

## Functions

Function

Description

Searches for two adjacent elements that are equal.

Tests whether a sorted sequence contains a given value.

Copies values from a source range to a destination range, iterating in the forward direction.

Copies values from a source range to a destination range, iterating in the backward direction.

Returns the number of elements in a range whose values match a specified value.

Returns the number of elements in a range whose values match a specified condition.

Compares two ranges, element by element.

Searches an ordered sequence of values and returns two positions that delimit a subsequence of values that are all equal to a given element.

Assigns the same new value to every element in a specified range.

Assigns a new value to a specified number of elements in a range beginning with a particular element.

Returns the position of the first occurrence of a specified value.

Returns the last subsequence in a range that is identical to a specified sequence.

Searches a range for the first occurrence of any one of a given range of elements.

Returns the position of the first element in a sequence of values where the element satisfies a specified condition.

Applies a specified function object to each element in a sequence of values and returns the function object.

Assigns the values generated by a function object to each element in a sequence of values.

Assigns the values generated by a function object to a specified number of elements.

Tests whether one sorted range contains all the elements in a second sorted range.

Combines the elements from two consecutive sorted ranges into a single sorted range.

Exchanges two values referred to by a pair of specified iterators.

Compares two sequences, element by element, identifying which sequence is the lesser of the two.

Finds the position of the first element in an ordered sequence of values that has a value greater than or equal to a specified value.

Converts elements from a specified range into a heap where the first element on the heap is the largest.

Compares two objects and returns the greater of the two.

Finds the largest element in a specified sequence of values.

Combines all the elements from two sorted source ranges into a single, sorted destination range.

Compares two objects and returns the lesser of the two.

Finds the smallest element in a specified sequence of values.

Compares two ranges element by element and returns the first position where a difference occurs.

Reorders the elements in a range so that the original ordering is replaced by the lexicographically next greater permutation if it exists.

Partitions a sequence of elements, correctly locating the nth element of the sequence so that all the elements in front of it are less than or equal to it and all the elements that follow it are greater than or equal to it.

Arranges a specified number of the smaller elements in a range into nondescending order.

Copies elements from a source range into a destination range such that the elements from the source range are ordered.

Arranges elements in a range such that those elements that satisfy a unary predicate precede those that fail to satisfy it.

Moves the largest element from the front of a heap to the end and then forms a new heap from the remaining elements.

Reorders a sequence of elements so that the original ordering is replaced by the lexicographically previous greater permutation if it exists.

Adds an element that is at the end of a range to an existing heap consisting of the prior elements in the range.

Rearranges a sequence of N elements in a range into one of N! possible arrangements selected at random.

Deletes a specified value from a given range without disturbing the order of the remaining elements and returns the end of a new range free of the specified value.

Copies elements from a source range to a destination range, except that elements of a specified value are not copied, without disturbing the order of the remaining elements.

Copies elements from a source range to a destination range, except those that satisfy a predicate, without disturbing the order of the remaining elements.

Deletes elements that satisfy a predicate from a given range without disturbing the order of the remaining elements. .

Replaces elements in a range that match a specified value with a new value.

Copies elements from a source range to a destination range, replacing elements that match a specified value with a new value.

Examines each element in a source range and replaces it if it satisfies a specified predicate while copying the result into a new destination range.

Examines each element in a range and replaces it if it satisfies a specified predicate.

Reverses the order of the elements within a range.

Reverses the order of the elements within a source range while copying them into a destination range.

Exchanges the elements in two adjacent ranges.

Exchanges the elements in two adjacent ranges within a source range and copies the result to a destination range.

Searches for the first occurrence of a sequence within a target range whose elements are equal to those in a given sequence of elements or whose elements are equivalent in a sense specified by a binary predicate to the elements in the given sequence.

Searches for the first subsequence in a range that of a specified number of elements having a particular value or a relation to that value as specified by a binary predicate.

Unites all of the elements that belong to one sorted source range, but not to a second sorted source range, into a single, sorted destination range, where the ordering criterion may be specified by a binary predicate.

Unites all of the elements that belong to both sorted source ranges into a single, sorted destination range, where the ordering criterion may be specified by a binary predicate.

Unites all of the elements that belong to one, but not both, of the sorted source ranges into a single, sorted destination range, where the ordering criterion may be specified by a binary predicate.

Unites all of the elements that belong to at least one of two sorted source ranges into a single, sorted destination range, where the ordering criterion may be specified by a binary predicate.

Arranges the elements in a specified range into a nondescending order or according to an ordering criterion specified by a binary predicate.

Converts a heap into a sorted range.

Classifies elements in a range into two disjoint sets, with those elements satisfying a unary predicate preceding those that fail to satisfy it, preserving the relative order of equivalent elements.

Arranges the elements in a specified range into a nondescending order or according to an ordering criterion specified by a binary predicate and preserves the relative ordering of equivalent elements.

Exchanges the values of the elements between two types of objects, assigning the contents of the first object to the second object and the contents of the second to the first.

Exchanges the elements of one range with the elements of another, equal sized range.

Applies a specified function object to each element in a source range or to a pair of elements from two source ranges and copies the return values of the function object into a destination range.

Removes duplicate elements that are adjacent to each other in a specified range.

Copies elements from a source range into a destination range except for the duplicate elements that are adjacent to each other.

Finds the position of the first element in an ordered range that has a value that is greater than a specified value, where the ordering criterion may be specified by a binary predicate.

## Requirements

Header: <cliext/algorithm>

Namespace: cliext

ADD
Show:
© 2016 Microsoft