@@ -7,7 +7,7 @@ namespace Microsoft.FSharp.Collections
7
7
open Microsoft.FSharp .Collections
8
8
open System.Collections .Generic
9
9
10
- /// <summary>Basic operations on arrays.</summary>
10
+ /// <summary>Contains operations for working with arrays.</summary>
11
11
///
12
12
/// <remarks>
13
13
/// See also <a href="https://docs.microsoft.com/dotnet/fsharp/language-reference/arrays">F# Language Guide - Arrays</a>.
@@ -1033,10 +1033,10 @@ namespace Microsoft.FSharp.Collections
1033
1033
[< CompiledName ( "GetSubArray ")>]
1034
1034
val sub : array : 'T [] -> startIndex : int -> count : int -> 'T []
1035
1035
1036
- /// < summary>Sorts the elements of an array , returning a new array. Elements are compared using Operators.compare. < / summary>
1036
+ /// < summary>Sorts the elements of an array , returning a new array. Elements are compared using <see cref = " M : Microsoft.FSharp.Core. Operators.compare" /> . </ summary>
1037
1037
///
1038
1038
/// < remarks>This is not a stable sort , i.e. the original order of equal elements is not necessarily preserved.
1039
- /// For a stable sort , consider using Seq.sort .< / remarks>
1039
+ /// For a stable sort , consider using <see cref = " M : Microsoft.FSharp.Collections.SeqModule.Sort " /> .</remarks>
1040
1040
///
1041
1041
/// < param name = "array "> The input array.< / param>
1042
1042
///
@@ -1047,10 +1047,10 @@ namespace Microsoft.FSharp.Collections
1047
1047
val sort : array : 'T [] -> 'T [] when 'T : comparison
1048
1048
1049
1049
/// < summary>Sorts the elements of an array , using the given projection for the keys and returning a new array.
1050
- /// Elements are compared using Operators.compare.< / summary>
1050
+ /// Elements are compared using <see cref = " M : Microsoft.FSharp.Core. Operators.compare" /> .</summary>
1051
1051
///
1052
1052
/// < remarks>This is not a stable sort , i.e. the original order of equal elements is not necessarily preserved.
1053
- /// For a stable sort , consider using Seq.sort .< / remarks>
1053
+ /// For a stable sort , consider using <see cref = " M : Microsoft.FSharp.Collections.SeqModule.Sort " /> .</remarks>
1054
1054
///
1055
1055
/// < param name = "projection "> The function to transform array elements into the type that is compared.< / param>
1056
1056
/// < param name = "array "> The input array.< / param>
@@ -1064,7 +1064,7 @@ namespace Microsoft.FSharp.Collections
1064
1064
/// < summary>Sorts the elements of an array , using the given comparison function as the order , returning a new array.< / summary>
1065
1065
///
1066
1066
/// < remarks>This is not a stable sort , i.e. the original order of equal elements is not necessarily preserved.
1067
- /// For a stable sort , consider using Seq.sort .< / remarks>
1067
+ /// For a stable sort , consider using <see cref = " M : Microsoft.FSharp.Collections.SeqModule.Sort " /> .</remarks>
1068
1068
///
1069
1069
/// < param name = "comparer "> The function to compare pairs of array elements.< / param>
1070
1070
/// < param name = "array "> The input array.< / param>
@@ -1076,10 +1076,10 @@ namespace Microsoft.FSharp.Collections
1076
1076
val sortWith : comparer :( 'T -> 'T -> int ) -> array : 'T [] -> 'T []
1077
1077
1078
1078
/// < summary>Sorts the elements of an array by mutating the array in - place , using the given projection for the keys.
1079
- /// Elements are compared using Operators.compare.< / summary>
1079
+ /// Elements are compared using <see cref = " M : Microsoft.FSharp.Core. Operators.compare" /> .</summary>
1080
1080
///
1081
1081
/// < remarks>This is not a stable sort , i.e. the original order of equal elements is not necessarily preserved.
1082
- /// For a stable sort , consider using Seq.sort .< / remarks>
1082
+ /// For a stable sort , consider using <see cref = " M : Microsoft.FSharp.Collections.SeqModule.Sort " /> .</remarks>
1083
1083
///
1084
1084
/// < param name = "projection "> The function to transform array elements into the type that is compared.< / param>
1085
1085
/// < param name = "array "> The input array.< / param>
@@ -1100,7 +1100,7 @@ namespace Microsoft.FSharp.Collections
1100
1100
val sortInPlaceWith : comparer :( 'T -> 'T -> int ) -> array : 'T [] -> unit
1101
1101
1102
1102
/// < summary>Sorts the elements of an array by mutating the array in - place , using the given comparison function.
1103
- /// Elements are compared using Operators.compare.< / summary>
1103
+ /// Elements are compared using <see cref = " M : Microsoft.FSharp.Core. Operators.compare" /> .</summary>
1104
1104
///
1105
1105
/// < param name = "array "> The input array.< / param>
1106
1106
///
@@ -1121,10 +1121,10 @@ namespace Microsoft.FSharp.Collections
1121
1121
[< CompiledName ( "SplitAt ")>]
1122
1122
val splitAt : index : int -> array : 'T [] -> ( 'T [] * 'T [])
1123
1123
1124
- /// < summary>Sorts the elements of an array , in descending order , returning a new array. Elements are compared using Operators.compare. < / summary>
1124
+ /// < summary>Sorts the elements of an array , in descending order , returning a new array. Elements are compared using <see cref = " M : Microsoft.FSharp.Core. Operators.compare" /> . </ summary>
1125
1125
///
1126
1126
/// < remarks>This is not a stable sort , i.e. the original order of equal elements is not necessarily preserved.
1127
- /// For a stable sort , consider using Seq.sort .< / remarks>
1127
+ /// For a stable sort , consider using <see cref = " M : Microsoft.FSharp.Collections.SeqModule.Sort " /> .</remarks>
1128
1128
///
1129
1129
/// < param name = "array "> The input array.< / param>
1130
1130
///
@@ -1133,10 +1133,10 @@ namespace Microsoft.FSharp.Collections
1133
1133
val inline sortDescending : array : 'T [] -> 'T [] when 'T : comparison
1134
1134
1135
1135
/// < summary>Sorts the elements of an array , in descending order , using the given projection for the keys and returning a new array.
1136
- /// Elements are compared using Operators.compare.< / summary>
1136
+ /// Elements are compared using <see cref = " M : Microsoft.FSharp.Core. Operators.compare" /> .</summary>
1137
1137
///
1138
1138
/// < remarks>This is not a stable sort , i.e. the original order of equal elements is not necessarily preserved.
1139
- /// For a stable sort , consider using Seq.sort .< / remarks>
1139
+ /// For a stable sort , consider using <see cref = " M : Microsoft.FSharp.Collections.SeqModule.Sort " /> .</remarks>
1140
1140
///
1141
1141
/// < param name = "projection "> The function to transform array elements into the type that is compared.< / param>
1142
1142
/// < param name = "array "> The input array.< / param>
@@ -1403,21 +1403,21 @@ namespace Microsoft.FSharp.Collections
1403
1403
/// the array comprised of the results "x " for each element where
1404
1404
/// the function returns Some ( x ).</ summary>
1405
1405
///
1406
- /// < remarks>Performs the operation in parallel using System.Threading.Parallel.For.
1406
+ /// < remarks>Performs the operation in parallel using <see cref = " M : System.Threading.Parallel.For " /> .
1407
1407
/// The order in which the given function is applied to elements of the input array is not specified.< / remarks>
1408
1408
///
1409
1409
/// < param name = "chooser "> The function to generate options from the elements.< / param>
1410
1410
/// < param name = "array "> The input array.< / param>
1411
1411
///
1412
- /// < returns>'U [] </returns>
1412
+ /// < returns>The array of results. < / returns>
1413
1413
///
1414
1414
/// < exception cref = "T : System.ArgumentNullException "> Thrown when the input array is null.< / exception>
1415
1415
[< CompiledName ( "Choose ")>]
1416
1416
val choose : chooser :( 'T -> 'U option ) -> array : 'T [] -> 'U []
1417
1417
1418
1418
/// < summary>For each element of the array , apply the given function. Concatenate all the results and return the combined array.< / summary>
1419
1419
///
1420
- /// < remarks>Performs the operation in parallel using System.Threading.Parallel.For.
1420
+ /// < remarks>Performs the operation in parallel using <see cref = " M : System.Threading.Parallel.For " /> .
1421
1421
/// The order in which the given function is applied to elements of the input array is not specified.< / remarks>
1422
1422
///
1423
1423
/// < param name = "mapping "></ param>
@@ -1432,13 +1432,13 @@ namespace Microsoft.FSharp.Collections
1432
1432
/// < summary>Build a new array whose elements are the results of applying the given function
1433
1433
/// to each of the elements of the array.< / summary>
1434
1434
///
1435
- /// < remarks>Performs the operation in parallel using System.Threading.Parallel.For.
1435
+ /// < remarks>Performs the operation in parallel using <see cref = " M : System.Threading.Parallel.For " /> .
1436
1436
/// The order in which the given function is applied to elements of the input array is not specified.< / remarks>
1437
1437
///
1438
1438
/// < param name = "mapping "></ param>
1439
1439
/// < param name = "array "> The input array.< / param>
1440
1440
///
1441
- /// < returns>'U [] </returns>
1441
+ /// < returns>The array of results. < / returns>
1442
1442
///
1443
1443
/// < exception cref = "T : System.ArgumentNullException "> Thrown when the input array is null.< / exception>
1444
1444
[< CompiledName ( "Map ")>]
@@ -1448,21 +1448,21 @@ namespace Microsoft.FSharp.Collections
1448
1448
/// to each of the elements of the array. The integer index passed to the
1449
1449
/// function indicates the index of element being transformed.< / summary>
1450
1450
///
1451
- /// < remarks>Performs the operation in parallel using System.Threading.Parallel.For.
1451
+ /// < remarks>Performs the operation in parallel using <see cref = " M : System.Threading.Parallel.For " /> .
1452
1452
/// The order in which the given function is applied to elements of the input array is not specified.< / remarks>
1453
1453
///
1454
1454
/// < param name = "mapping "></ param>
1455
1455
/// < param name = "array "> The input array.< / param>
1456
1456
///
1457
- /// < returns>'U [] </returns>
1457
+ /// < returns>The array of results. < / returns>
1458
1458
///
1459
1459
/// < exception cref = "T : System.ArgumentNullException "> Thrown when the input array is null.< / exception>
1460
1460
[< CompiledName ( "MapIndexed ")>]
1461
1461
val mapi : mapping :( int -> 'T -> 'U ) -> array : 'T [] -> 'U []
1462
1462
1463
1463
/// < summary>Apply the given function to each element of the array. < / summary>
1464
1464
///
1465
- /// < remarks>Performs the operation in parallel using System.Threading.Parallel.For.
1465
+ /// < remarks>Performs the operation in parallel using <see cref = " M : System.Threading.Parallel.For " /> .
1466
1466
/// The order in which the given function is applied to elements of the input array is not specified.< / remarks>
1467
1467
///
1468
1468
/// < param name = "action "></ param>
@@ -1475,7 +1475,7 @@ namespace Microsoft.FSharp.Collections
1475
1475
/// < summary>Apply the given function to each element of the array. The integer passed to the
1476
1476
/// function indicates the index of element.< / summary>
1477
1477
///
1478
- /// < remarks>Performs the operation in parallel using System.Threading.Parallel.For.
1478
+ /// < remarks>Performs the operation in parallel using <see cref = " M : System.Threading.Parallel.For " /> .
1479
1479
/// The order in which the given function is applied to elements of the input array is not specified.< / remarks>
1480
1480
///
1481
1481
/// < param name = "action "></ param>
@@ -1487,27 +1487,27 @@ namespace Microsoft.FSharp.Collections
1487
1487
1488
1488
/// < summary>Create an array given the dimension and a generator function to compute the elements.< / summary>
1489
1489
///
1490
- /// < remarks>Performs the operation in parallel using System.Threading.Parallel.For.
1490
+ /// < remarks>Performs the operation in parallel using <see cref = " M : System.Threading.Parallel.For " /> .
1491
1491
/// The order in which the given function is applied to indices is not specified.< / remarks>
1492
1492
///
1493
1493
/// < param name = "count "></ param>
1494
1494
/// < param name = "initializer "></ param>
1495
1495
///
1496
- /// < returns>'T [] </returns>
1496
+ /// < returns>The array of results. < / returns>
1497
1497
[< CompiledName ( "Initialize ")>]
1498
1498
val init : count : int -> initializer :( int -> 'T ) -> 'T []
1499
1499
1500
1500
/// < summary>Split the collection into two collections , containing the
1501
1501
/// elements for which the given predicate returns "true " and "false "
1502
1502
/// respectively < / summary>
1503
1503
///
1504
- /// < remarks>Performs the operation in parallel using System.Threading.Parallel.For.
1504
+ /// < remarks>Performs the operation in parallel using <see cref = " M : System.Threading.Parallel.For " /> .
1505
1505
/// The order in which the given function is applied to indices is not specified.< / remarks>
1506
1506
///
1507
1507
/// < param name = "predicate "> The function to test the input elements.< / param>
1508
1508
/// < param name = "array "> The input array.< / param>
1509
1509
///
1510
- /// < returns>'T [] * ' T [] </returns>
1510
+ /// < returns>The two arrays of results. < / returns>
1511
1511
///
1512
1512
/// < exception cref = "T : System.ArgumentNullException "> Thrown when the input array is null.< / exception>
1513
1513
[< CompiledName ( "Partition ")>]
0 commit comments