1055
(E"I/O",E"Base",E"stdout_stream",E"stdout_stream
1056
(E"Strings",E"Base",E"charwidth",E"charwidth(c)
1058
Gives the number of columns needed to print a character.
1062
(E"Strings",E"Base",E"strwidth",E"strwidth(s)
1064
Gives the number of columns needed to print a string.
1068
(E"I/O",E"Base",E"STDOUT",E"STDOUT
1057
1070
Global variable referring to the standard out stream.
1061
(E"I/O",E"Base",E"stderr_stream",E"stderr_stream
1074
(E"I/O",E"Base",E"STDERR",E"STDERR
1063
1076
Global variable referring to the standard error stream.
1067
(E"I/O",E"Base",E"stdin_stream",E"stdin_stream
1080
(E"I/O",E"Base",E"STDIN",E"STDIN
1069
1082
Global variable referring to the standard input stream.
1264
(E"Text I/O",E"Base",E"dlmwrite",E"dlmwrite(filename, array, delim::Char)
1286
(E"Text I/O",E"Base",E"writedlm",E"writedlm(filename, array, delim::Char)
1266
1288
Write an array to a text file using the given delimeter (defaults
1271
(E"Text I/O",E"Base",E"csvread",E"csvread(filename[, T::Type])
1293
(E"Text I/O",E"Base",E"readcsv",E"readcsv(filename[, T::Type])
1273
Equivalent to \"dlmread\" with \"delim\" set to comma.
1295
Equivalent to \"readdlm\" with \"delim\" set to comma.
1277
(E"Text I/O",E"Base",E"csvwrite",E"csvwrite(filename, array)
1299
(E"Text I/O",E"Base",E"writecsv",E"writecsv(filename, array)
1279
Equivalent to \"dlmwrite\" with \"delim\" set to comma.
1301
Equivalent to \"writedlm\" with \"delim\" set to comma.
1424
1471
(E"Mathematical Functions",E"Base",E"sin",E"sin(x)
1426
Compute sine of \"x\"
1473
Compute sine of \"x\", where \"x\" is in radians
1430
1477
(E"Mathematical Functions",E"Base",E"cos",E"cos(x)
1432
Compute cosine of \"x\"
1479
Compute cosine of \"x\", where \"x\" is in radians
1436
1483
(E"Mathematical Functions",E"Base",E"tan",E"tan(x)
1438
Compute tangent of \"x\"
1485
Compute tangent of \"x\", where \"x\" is in radians
1489
(E"Mathematical Functions",E"Base",E"sind",E"sind(x)
1491
Compute sine of \"x\", where \"x\" is in degrees
1495
(E"Mathematical Functions",E"Base",E"cosd",E"cosd(x)
1497
Compute cosine of \"x\", where \"x\" is in degrees
1501
(E"Mathematical Functions",E"Base",E"tand",E"tand(x)
1503
Compute tangent of \"x\", where \"x\" is in degrees
1442
1507
(E"Mathematical Functions",E"Base",E"sinh",E"sinh(x)
1444
Compute hyperbolic sine of \"x\" specified in radians
1509
Compute hyperbolic sine of \"x\"
1448
1513
(E"Mathematical Functions",E"Base",E"cosh",E"cosh(x)
1450
Compute hyperbolic cosine of \"x\" specified in radians
1515
Compute hyperbolic cosine of \"x\"
1454
1519
(E"Mathematical Functions",E"Base",E"tanh",E"tanh(x)
1456
Compute hyperbolic tangent of \"x\" specified in radians
1521
Compute hyperbolic tangent of \"x\"
1460
1525
(E"Mathematical Functions",E"Base",E"asin",E"asin(x)
1462
Compute the inverse sine of \"x\" specified in radians
1527
Compute the inverse sine of \"x\", where the output is in radians
1466
1531
(E"Mathematical Functions",E"Base",E"acos",E"acos(x)
1468
Compute the inverse cosine of \"x\" specified in radians
1533
Compute the inverse cosine of \"x\", where the output is in radians
1472
1537
(E"Mathematical Functions",E"Base",E"atan",E"atan(x)
1474
Compute the inverse tangent of \"x\" specified in radians
1539
Compute the inverse tangent of \"x\", where the output is in
1551
(E"Mathematical Functions",E"Base",E"asind",E"asind(x)
1553
Compute the inverse sine of \"x\", where the output is in degrees
1557
(E"Mathematical Functions",E"Base",E"acosd",E"acosd(x)
1559
Compute the inverse cosine of \"x\", where the output is in degrees
1563
(E"Mathematical Functions",E"Base",E"atand",E"atand(x)
1565
Compute the inverse tangent of \"x\", where the output is in
1485
1570
(E"Mathematical Functions",E"Base",E"sec",E"sec(x)
1487
Compute the secant of \"x\" specified in radians
1572
Compute the secant of \"x\", where \"x\" is in radians
1491
1576
(E"Mathematical Functions",E"Base",E"csc",E"csc(x)
1493
Compute the cosecant of \"x\" specified in radians
1578
Compute the cosecant of \"x\", where \"x\" is in radians
1497
1582
(E"Mathematical Functions",E"Base",E"cot",E"cot(x)
1499
Compute the cotangent of \"x\" specified in radians
1584
Compute the cotangent of \"x\", where \"x\" is in radians
1588
(E"Mathematical Functions",E"Base",E"secd",E"secd(x)
1590
Compute the secant of \"x\", where \"x\" is in degrees
1594
(E"Mathematical Functions",E"Base",E"cscd",E"cscd(x)
1596
Compute the cosecant of \"x\", where \"x\" is in degrees
1600
(E"Mathematical Functions",E"Base",E"cotd",E"cotd(x)
1602
Compute the cotangent of \"x\", where \"x\" is in degrees
1503
1606
(E"Mathematical Functions",E"Base",E"asec",E"asec(x)
1505
Compute the inverse secant of \"x\" specified in radians
1608
Compute the inverse secant of \"x\", where the output is in radians
1509
1612
(E"Mathematical Functions",E"Base",E"acsc",E"acsc(x)
1511
Compute the inverse cosecant of \"x\" specified in radians
1614
Compute the inverse cosecant of \"x\", where the output is in
1515
1619
(E"Mathematical Functions",E"Base",E"acot",E"acot(x)
1517
Compute the inverse cotangent of \"x\" specified in radians
1621
Compute the inverse cotangent of \"x\", where the output is in
1626
(E"Mathematical Functions",E"Base",E"asecd",E"asecd(x)
1628
Compute the inverse secant of \"x\", where the output is in degrees
1632
(E"Mathematical Functions",E"Base",E"acscd",E"acscd(x)
1634
Compute the inverse cosecant of \"x\", where the output is in
1639
(E"Mathematical Functions",E"Base",E"acotd",E"acotd(x)
1641
Compute the inverse cotangent of \"x\", where the output is in
1521
1646
(E"Mathematical Functions",E"Base",E"sech",E"sech(x)
1523
Compute the hyperbolic secant of \"x\" specified in radians
1648
Compute the hyperbolic secant of \"x\"
1527
1652
(E"Mathematical Functions",E"Base",E"csch",E"csch(x)
1529
Compute the hyperbolic cosecant of \"x\" specified in radians
1654
Compute the hyperbolic cosecant of \"x\"
1533
1658
(E"Mathematical Functions",E"Base",E"coth",E"coth(x)
1535
Compute the hyperbolic cotangent of \"x\" specified in radians
1660
Compute the hyperbolic cotangent of \"x\"
1539
1664
(E"Mathematical Functions",E"Base",E"asinh",E"asinh(x)
1541
Compute the inverse hyperbolic sine of \"x\" specified in radians
1666
Compute the inverse hyperbolic sine of \"x\"
1545
1670
(E"Mathematical Functions",E"Base",E"acosh",E"acosh(x)
1547
Compute the inverse hyperbolic cosine of \"x\" specified in radians
1672
Compute the inverse hyperbolic cosine of \"x\"
1551
1676
(E"Mathematical Functions",E"Base",E"atanh",E"atanh(x)
1553
Compute the inverse hyperbolic cotangent of \"x\" specified in
1678
Compute the inverse hyperbolic cotangent of \"x\"
1558
1682
(E"Mathematical Functions",E"Base",E"asech",E"asech(x)
1560
Compute the inverse hyperbolic secant of \"x\" specified in radians
1684
Compute the inverse hyperbolic secant of \"x\"
1564
1688
(E"Mathematical Functions",E"Base",E"acsch",E"acsch(x)
1566
Compute the inverse hyperbolic cosecant of \"x\" specified in
1690
Compute the inverse hyperbolic cosecant of \"x\"
1571
1694
(E"Mathematical Functions",E"Base",E"acoth",E"acoth(x)
1573
Compute the inverse hyperbolic cotangent of \"x\" specified in
1696
Compute the inverse hyperbolic cotangent of \"x\"
2570
(E"Numbers",E"Base",E"count_ones",E"count_ones(x::Integer) -> Integer
2572
Number of ones in the binary representation of \"x\".
2574
**Example**: \"count_ones(7) -> 3\"
2578
(E"Numbers",E"Base",E"count_zeros",E"count_zeros(x::Integer) -> Integer
2580
Number of zeros in the binary representation of \"x\".
2582
**Example**: \"count_zeros(int32(2 ^ 16 - 1)) -> 16\"
2586
(E"Numbers",E"Base",E"leading_zeros",E"leading_zeros(x::Integer) -> Integer
2588
Number of zeros leading the binary representation of \"x\".
2590
**Example**: \"leading_zeros(int32(1)) -> 31\"
2594
(E"Numbers",E"Base",E"leading_ones",E"leading_ones(x::Integer) -> Integer
2596
Number of ones leading the binary representation of \"x\".
2598
**Example**: \"leading_ones(int32(2 ^ 32 - 2)) -> 31\"
2602
(E"Numbers",E"Base",E"trailing_zeros",E"trailing_zeros(x::Integer) -> Integer
2604
Number of zeros trailing the binary representation of \"x\".
2606
**Example**: \"trailing_zeros(2) -> 1\"
2610
(E"Numbers",E"Base",E"trailing_ones",E"trailing_ones(x::Integer) -> Integer
2612
Number of ones trailing the binary representation of \"x\".
2614
**Example**: \"trailing_ones(3) -> 2\"
2618
(E"Numbers",E"Base",E"isprime",E"isprime(x::Integer) -> Bool
2620
Returns \"true\" if \"x\" is prime, and \"false\" otherwise.
2622
**Example**: \"isprime(3) -> true\"
2305
2626
(E"Random Numbers",E"Base",E"srand",E"srand([rng], seed)
2307
2628
Seed the RNG with a \"seed\", which may be an unsigned integer or a
2851
(E"Linear Algebra",E"Base",E"lu",E"lu(A) -> LU
2853
Compute LU factorization. LU is an \"LU factorization\" type that
2854
can be used as an ordinary matrix.
2858
(E"Linear Algebra",E"Base",E"chol",E"chol(A)
2860
Compute Cholesky factorization
2864
(E"Linear Algebra",E"Base",E"qr",E"qr(A)
2866
Compute QR factorization
2870
(E"Linear Algebra",E"Base",E"qrp",E"qrp(A)
2872
Compute QR factorization with pivoting
2876
(E"Linear Algebra",E"Base",E"factors",E"factors(D)
2878
Return the factors of a decomposition D. For an LU decomposition,
2879
factors(LU) -> L, U, p
3165
(E"Linear Algebra",E"Base",E"factors",E"factors(F)
3167
Return the factors of a factorization \"F\". For example, in the
3168
case of an LU decomposition, factors(LU) -> L, U, P
3172
(E"Linear Algebra",E"Base",E"lu",E"lu(A) -> L, U, P
3174
Compute the LU factorization of \"A\", such that \"A[P,:] = L*U\".
3178
(E"Linear Algebra",E"Base",E"lufact",E"lufact(A) -> LUDense
3180
Compute the LU factorization of \"A\" and return a \"LUDense\"
3181
object. \"factors(lufact(A))\" returns the triangular matrices
3182
containing the factorization. The following functions are available
3183
for \"LUDense\" objects: \"size\", \"factors\", \"\\\", \"inv\",
3188
(E"Linear Algebra",E"Base",E"lufact!",E"lufact!(A) -> LUDense
3190
\"lufact!\" is the same as \"lufact\" but saves space by
3191
overwriting the input A, instead of creating a copy.
3195
(E"Linear Algebra",E"Base",E"chol",E"chol(A[, LU]) -> F
3197
Compute Cholesky factorization of a symmetric positive-definite
3198
matrix \"A\" and return the matrix \"F\". If \"LU\" is \"L\"
3199
(Lower), \"A = L*L'\". If \"LU\" is \"U\" (Upper), \"A = R'*R\".
3203
(E"Linear Algebra",E"Base",E"cholfact",E"cholfact(A[, LU]) -> CholeskyDense
3205
Compute the Cholesky factorization of a symmetric positive-definite
3206
matrix \"A\" and return a \"CholeskyDense\" object. \"LU\" may be
3207
'L' for using the lower part or 'U' for the upper part. The default
3208
is to use 'U'. \"factors(cholfact(A))\" returns the triangular
3209
matrix containing the factorization. The following functions are
3210
available for \"CholeskyDense\" objects: \"size\", \"factors\",
3211
\"\\\", \"inv\", \"det\". A \"LAPACK.PosDefException\" error is
3212
thrown in case the matrix is not positive definite.
3216
(E"Linear Algebra",E"Base",E"cholpfact",E"cholpfact(A[, LU]) -> CholeskyPivotedDense
3218
Compute the pivoted Cholesky factorization of a symmetric positive
3219
semi-definite matrix \"A\" and return a \"CholeskyDensePivoted\"
3220
object. \"LU\" may be 'L' for using the lower part or 'U' for the
3221
upper part. The default is to use 'U'. \"factors(cholpfact(A))\"
3222
returns the triangular matrix containing the factorization. The
3223
following functions are available for \"CholeskyDensePivoted\"
3224
objects: \"size\", \"factors\", \"\\\", \"inv\", \"det\". A
3225
\"LAPACK.RankDeficientException\" error is thrown in case the
3226
matrix is rank deficient.
3230
(E"Linear Algebra",E"Base",E"cholpfact!",E"cholpfact!(A[, LU]) -> CholeskyPivotedDense
3232
\"cholpfact!\" is the same as \"cholpfact\" but saves space by
3233
overwriting the input A, instead of creating a copy.
3237
(E"Linear Algebra",E"Base",E"qr",E"qr(A) -> Q, R
3239
Compute the QR factorization of \"A\" such that \"A = Q*R\". Also
3244
(E"Linear Algebra",E"Base",E"qrfact",E"qrfact(A)
3246
Compute the QR factorization of \"A\" and return a \"QRDense\"
3247
object. \"factors(qrfact(A))\" returns \"Q\" and \"R\". The
3248
following functions are available for \"QRDense\" objects:
3249
\"size\", \"factors\", \"qmulQR\", \"qTmulQR\", \"\\\".
3253
(E"Linear Algebra",E"Base",E"qrfact!",E"qrfact!(A)
3255
\"qrfact!\" is the same as \"qrfact\" but saves space by
3256
overwriting the input A, instead of creating a copy.
3260
(E"Linear Algebra",E"Base",E"qrp",E"qrp(A) -> Q, R, P
3262
Compute the QR factorization of \"A\" with pivoting, such that
3263
\"A*I[:,P] = Q*R\", where \"I\" is the identity matrix. Also see
3268
(E"Linear Algebra",E"Base",E"qrpfact",E"qrpfact(A) -> QRPivotedDense
3270
Compute the QR factorization of \"A\" with pivoting and return a
3271
\"QRDensePivoted\" object. \"factors(qrpfact(A))\" returns \"Q\"
3272
and \"R\". The following functions are available for
3273
\"QRDensePivoted\" objects: \"size\", \"factors\", \"qmulQR\",
3274
\"qTmulQR\", \"\\\".
3278
(E"Linear Algebra",E"Base",E"qrpfact!",E"qrpfact!(A) -> QRPivotedDense
3280
\"qrpfact!\" is the same as \"qrpfact\" but saves space by
3281
overwriting the input A, instead of creating a copy.
3285
(E"Linear Algebra",E"Base",E"qmulQR",E"qmulQR(QR, A)
3287
Perform Q*A efficiently, where Q is a an orthogonal matrix defined
3288
as the product of k elementary reflectors from the QR
3293
(E"Linear Algebra",E"Base",E"qTmulQR",E"qTmulQR(QR, A)
3295
Perform Q'>>*<<A efficiently, where Q is a an orthogonal matrix
3296
defined as the product of k elementary reflectors from the QR
2895
(E"Linear Algebra",E"Base",E"svd",E"svd(A) -> U, S, V
3313
(E"Linear Algebra",E"Base",E"svdfact",E"svdfact(A[, thin]) -> SVDDense
3315
Compute the Singular Value Decomposition (SVD) of \"A\" and return
3316
an \"SVDDense\" object. \"factors(svdfact(A))\" returns \"U\",
3317
\"S\", and \"Vt\", such that \"A = U*diagm(S)*Vt\". If \"thin\" is
3318
\"true\", an economy mode decomposition is returned.
3322
(E"Linear Algebra",E"Base",E"svdfact!",E"svdfact!(A[, thin]) -> SVDDense
3324
\"svdfact!\" is the same as \"svdfact\" but saves space by
3325
overwriting the input A, instead of creating a copy. If \"thin\" is
3326
\"true\", an economy mode decomposition is returned.
3330
(E"Linear Algebra",E"Base",E"svd",E"svd(A[, thin]) -> U, S, V
2897
3332
Compute the SVD of A, returning \"U\", \"S\", and \"V\" such that
3333
\"A = U*S*V'\". If \"thin\" is \"true\", an economy mode
3334
decomposition is returned.
2902
(E"Linear Algebra",E"Base",E"svdt",E"svdt(A) -> U, S, Vt
3338
(E"Linear Algebra",E"Base",E"svdt",E"svdt(A[, thin]) -> U, S, Vt
2904
3340
Compute the SVD of A, returning \"U\", \"S\", and \"Vt\" such that
3341
\"A = U*S*Vt\". If \"thin\" is \"true\", an economy mode
3342
decomposition is returned.
3352
(E"Linear Algebra",E"Base",E"svdvals!",E"svdvals!(A)
3354
Returns the singular values of \"A\", while saving space by
3355
overwriting the input.
3359
(E"Linear Algebra",E"Base",E"svdfact",E"svdfact(A, B) -> GSVDDense
3361
Compute the generalized SVD of \"A\" and \"B\", returning a
3362
\"GSVDDense\" Factorization object.
3366
(E"Linear Algebra",E"Base",E"svd",E"svd(A, B) -> U, V, X, C, S
3368
Compute the generalized SVD of \"A\" and \"B\".
3372
(E"Linear Algebra",E"Base",E"svdvals",E"svdvals(A, B)
3374
Return only the singular values from the generalized singular value
3375
decomposition of \"A\" and \"B\".
2915
3379
(E"Linear Algebra",E"Base",E"triu",E"triu(M)
2917
3381
Upper triangle of a matrix
3789
(E"Distributed Arrays",E"Base",E"darray",E"darray(init, type, dims[, distdim, procs, dist])
3791
Construct a distributed array. \"init\" is a function of three
3792
arguments that will run on each processor, and should return an
3793
\"Array\" holding the local data for the current processor. Its
3794
arguments are \"(T,d,da)\" where \"T\" is the element type, \"d\"
3795
is the dimensions of the needed local piece, and \"da\" is the new
3796
\"DArray\" being constructed (though, of course, it is not fully
3797
initialized). \"type\" is the element type. \"dims\" is the
3798
dimensions of the entire \"DArray\". \"distdim\" is the dimension
3799
to distribute in. \"procs\" is a vector of processor ids to use.
3800
\"dist\" is a vector giving the first index of each contiguous
3801
distributed piece, such that the nth piece consists of indexes
3802
\"dist[n]\" through \"dist[n+1]-1\". If you have a vector \"v\" of
3803
the sizes of the pieces, \"dist\" can be computed as
3804
\"cumsum([1,v])\". Fortunately, all arguments after \"dims\" are
3809
(E"Distributed Arrays",E"Base",E"darray",E"darray(f, A)
3811
Transform \"DArray\" \"A\" to another of the same type and
3812
distribution by applying function \"f\" to each block of \"A\".
3816
(E"Distributed Arrays",E"Base",E"dzeros",E"dzeros([type], dims, ...)
4269
(E"Distributed Arrays",E"Base",E"DArray",E"DArray(init, dims[, procs, dist])
4271
Construct a distributed array. \"init\" is a function accepting a
4272
tuple of index ranges. This function should return a chunk of the
4273
distributed array for the specified indexes. \"dims\" is the
4274
overall size of the distributed array. \"procs\" optionally
4275
specifies a vector of processor IDs to use. \"dist\" is an integer
4276
vector specifying how many chunks the distributed array should be
4277
divided into in each dimension.
4281
(E"Distributed Arrays",E"Base",E"dzeros",E"dzeros(dims, ...)
3818
4283
Construct a distributed array of zeros. Trailing arguments are the
3819
4284
same as those accepted by \"darray\".
3823
(E"Distributed Arrays",E"Base",E"dones",E"dones([type], dims, ...)
4288
(E"Distributed Arrays",E"Base",E"dones",E"dones(dims, ...)
3825
4290
Construct a distributed array of ones. Trailing arguments are the
3826
4291
same as those accepted by \"darray\".
3870
(E"Distributed Arrays",E"Base",E"changedist",E"changedist(d, distdim)
3872
Change the distributed dimension of a \"DArray\"
3876
4328
(E"Distributed Arrays",E"Base",E"myindexes",E"myindexes(d)
3878
4330
A tuple describing the indexes owned by the local processor
3882
(E"Distributed Arrays",E"Base",E"owner",E"owner(d, i)
3884
Get the id of the processor holding index \"i\" in the distributed
3889
4334
(E"Distributed Arrays",E"Base",E"procs",E"procs(d)
3891
4336
Get the vector of processors storing pieces of \"d\"
3895
(E"Distributed Arrays",E"Base",E"distdim",E"distdim(d)
3897
Get the distributed dimension of \"d\"
3901
(E"System",E"Base",E"system",E"system(\"command\")
3903
Run a shell command.
4340
(E"System",E"Base",E"run",E"run(command)
4342
Run a command object, constructed with backticks. Throws an error
4343
if anything goes wrong, including the process exiting with a non-
4348
(E"System",E"Base",E"success",E"success(command)
4350
Run a command object, constructed with backticks, and tell whether
4351
it was successful (exited with a code of 0).
4355
(E"System",E"Base",E"readsfrom",E"readsfrom(command)
4357
Starts running a command asynchronously, and returns a tuple
4358
(stream,process). The first value is a stream reading from the
4359
process' standard output.
4363
(E"System",E"Base",E"writesto",E"writesto(command)
4365
Starts running a command asynchronously, and returns a tuple
4366
(stream,process). The first value is a stream writing to the
4367
process' standard input.
5938
(E"Base.Sort",E"Base.Sort",E"sortperm",E"sortperm(v) -> s,p
5940
Sort a vector in ascending order, also constructing the permutation
5941
that sorts the vector.
5945
(E"Base.Sort",E"Base.Sort",E"sortperm",E"sortperm(lessthan, v) -> s,p
5947
Sort a vector with a custom comparison function, also constructing
5948
the permutation that sorts the vector.
5952
(E"Base.Sort",E"Base.Sort",E"sortperm",E"sortperm(alg, ...) -> s,p
6382
(E"Base.Sort",E"Base.Sort",E"sortperm",E"sortperm(v)
6384
Return a permutation vector, which when applied to the input vector
6389
(E"Base.Sort",E"Base.Sort",E"sortperm",E"sortperm(lessthan, v)
6391
Return a permutation vector, which when applied to the input vector
6392
\"v\" will sort it, using the specified \"lessthan\" comparison
6397
(E"Base.Sort",E"Base.Sort",E"sortperm",E"sortperm(alg, ...)
5954
6399
\"sortperm\" using a specific sorting algorithm (\"InsertionSort\",
5955
6400
\"QuickSort\", \"MergeSort\", or \"TimSort\").
5959
(E"Base.Sort",E"Base.Sort",E"sortperm!",E"sortperm!(...) -> s,p
6404
(E"Base.Sort",E"Base.Sort",E"sortperm!",E"sortperm!(...)
5961
6406
In-place \"sortperm\".
5965
(E"Base.Sort",E"Base.Sort",E"sortpermr",E"sortpermr(v) -> s,p
5967
Sort a vector in descending order, also constructing the
5968
permutation that sorts the vector!
5972
(E"Base.Sort",E"Base.Sort",E"sortpermr",E"sortpermr(alg, ...) -> s,p
5974
\"sortpermr\" using a specific sorting algorithm
5975
(\"InsertionSort\", \"QuickSort\", \"MergeSort\", or \"TimSort\").
5979
(E"Base.Sort",E"Base.Sort",E"sortpermr!",E"sortpermr!(v) -> s,p
5981
In-place \"sortpermr\".
5985
(E"Base.Sort",E"Base.Sort",E"sortpermby",E"sortpermby(by, v) -> s,p
5987
Sort a vector according to the result of function \"by\" applied to
5988
all values, also constructing the permutation that sorts the
5993
(E"Base.Sort",E"Base.Sort",E"sortpermby",E"sortpermby(alg, ...) -> s,p
5995
\"sortpermby\" using a specific sorting algorithm
5996
(\"InsertionSort\", \"QuickSort\", \"MergeSort\", or \"TimSort\").
6000
(E"Base.Sort",E"Base.Sort",E"sortpermby!",E"sortpermby!(...) -> s,p
6002
In-place \"sortpermby\".
6006
6410
(E"Base.Sort",E"Base.Sort",E"issorted",E"issorted(v)
6008
6412
Test whether a vector is in ascending sorted order