You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: docs/standard-library/algorithm.md
+2-2Lines changed: 2 additions & 2 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -40,7 +40,7 @@ The C++ Standard Library numeric algorithms that are provided for numerical proc
40
40
|Name|Description|
41
41
|-|-|
42
42
|[`adjacent_find`](algorithm-functions.md#adjacent_find)|Searches for two adjacent elements that are either equal or satisfy a specified condition.|
43
-
|[`all_o`f`](algorithm-functions.md#all_of)|Returns **`true`** when a condition is present at each element in the given range.|
43
+
|[`all_of`](algorithm-functions.md#all_of)|Returns **`true`** when a condition is present at each element in the given range.|
44
44
|[`any_of`](algorithm-functions.md#any_of)|Returns **`true`** when a condition is present at least once in the specified range of elements.|
45
45
|[`binary_search`](algorithm-functions.md#binary_search)|Tests whether there is an element in a sorted range that is equal to a specified value or that is equivalent to it in a sense specified by a binary predicate.|
46
46
|[`clamp`](algorithm-functions.md#clamp)||
@@ -120,7 +120,7 @@ The C++ Standard Library numeric algorithms that are provided for numerical proc
120
120
|[`shuffle`](algorithm-functions.md#shuffle)|Shuffles (rearranges) elements for a given range using a random number generator.|
121
121
|[`sort_heap`](algorithm-functions.md#sort_heap)|Converts a heap into a sorted range.|
122
122
|[`stable_partition`](algorithm-functions.md#stable_partition)|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.|
123
-
|[`stable_sort](algorithm-functions.md#stable_sort)|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.|
123
+
|[`stable_sort`](algorithm-functions.md#stable_sort)|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.|
124
124
|[`swap`](algorithm-functions.md#swap)|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.|
125
125
|[`swap_ranges`](algorithm-functions.md#swap_ranges)|Exchanges the elements of one range with the elements of another, equal sized range.|
126
126
|[`transform`](algorithm-functions.md#transform)|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.|
0 commit comments