Open KristofferC opened 6 years ago
From NEWS.md
...
Not a final list, but rather to start weeding them out.
stdlib
deprecations.using Base.Test
-> using Test
LinAlg
-> LinearAlgebra
bits
-> bitstring
search
and rsearch
have been deprecated in favor of findfirst
/findnext
and findlast
/findprev
respectively, in combination with curried isequal
and in
predicates for some methods Random.dSFMT
-> Random.DSFMT
gc
and gc_enable
and Base.@gc_preserve
-> GC.gc
and GC.enable
and GC.@preserve
LinSpace
-> LinRange
endof
-> lastindex
DateTime()
, Date()
, Time()
, -> DateTime(1)
, Date(1)
, Time(1)
isupper
, islower
, ucfirst
, lcfirst
-> isuppercase
, islowercase
, uppercasefirst
, lowercasefirst
Base.IntSet
-> Base.BitSet
linearindices
-> new LinearIndices
type.LinAlg.fillslots!
-> LinAlg.fillstored!
cfunction
-> @cfunction
GMP.gmp_version()
, GMP.GMP_VERSION
, GMP.gmp_bits_per_limb()
, and GMP.GMP_BITS_PER_LIBM
-> GMP.version()
, GMP.VERSION
, GMP.bits_per_limb()
, and GMP.BITS_PER_LIMB
. MPFR.get_version()
-> MPFR.version()
Libdl
exports need using Libdl
using SparseArrays
is_assigned_char
and normalize_string
-> isassigned
and normalize
need a using Unicode
, as well as graphemes
eigs
and svds
need using IterativeEigensolvers
stringmime
needs using Base64
module_name
, Base.function_name
, and Base.datatype_name
-> nameof
Associative
-> AbstractDict
module_parent
, Base.datatype_module
, Base.funciton_module
-> parentmodule
EnvHash
-> EnvDict
nb_available
-> bytesavailable
issubtype
-> <:
ctranspose
and ctranspose!
-> adjoint
and adjoint!
select
, select!
, selectperm
, selectperm!
-> partialsort
, partialsort!
, partialsortperm
, partialsortperm
LinAlg.LAPACK.laver()
-> LinAlg.LAPACK.version()
indices(a)
and indices(a,d)
-> axes(a)
, axes(a,d)
getindex(F::Factorization, s::Symbol)
(usually seen as e.g.F[:Q]
) is deprecated in favor of dot overloading (getproperty
) so factors should now be accessed as e.g. F.Q
instead of F[:Q]
search(buf :: IOBuffer, delim :: UInt8) ->
occursin(delim, buf)to test containment or
readuntil(buf,delim)`ismatch(regex, str)
-> contains(str,regex)
matchall
-> collect(m.match for m in eachamtch(r,s))
similar(::Associative)
-> empty(::Associative),
similar(::Associative, Pair{K,V})->
empty(::Associative, K,V)`findin(a,b)
-> `findall(in(b), a)Random.RandomDevice(; unlimited = unlimited)
rand(t :: Tuple{VarArg{Int}})
-> rand(Float64, t)
or rand(t...)
ObjectIdDict
- > IdDict{Any, Any}scale!
-> mul!
, lmul!
, rmul!
contains
-> occursin
, as well as reversing the order of the args.contains
logspace
signif
-> sigdigits
kw argument to roundsetrounding
-> Float32
, Float64
, as it was too unreliable.gamma
, lgamma
, beta
, lbeta
, lfact
-> using SpecialFunctions
atan
is now a 2 arg method of atan
undef
&
in ccall
now need Ref
argument typesfindn(x :: AbstractArray)
-> findall(!iszero, x)
eye(::Type{Diagonal{T{{, m:: Integer)
-> Diagonal{T}(I, m)
eig(A[, args...])
-> (eigen(A[, args...])...,)
eig( A :: AbstractMatrix, B :: AbstractMatrix)
and eig(A :: Number, B :: Number)
-> eigen(A, B)
, and also (eigen(A,B)...,)
fill!(A :: Diagonal, x)
and fill!(A::AbstractTriangular, x)
-> Base.LinAlg.fillstored!(A,x)
eye
sliceddim(A, d, i)
-> copy(selectdim(A, d,i))
writecsv(io, a; opts...)
-> `writedlm(io, a, ','; opts...)srand(rng, filename, n=4)
has been deprecatedreadcsv(io[, T::Type]; opts...)
-> readdlm(io, ','[, T]; opts...)
sparse(s::UniformScaling, m::Integer)
-> sparse(s::UniformScaling, m, n)
expand(ex)
and expand(module,ex)
-> `Meta.lower(module,ex)corrected
positional argument to cov
replace(s::AbstractString, pat, r, [count])
-> replace(s::AbstractString, pat => r; [count])
. count
must use typemax(Int)
read(io, type, dims)
-> read!(io, Array{type}(undef, dims))
read(::IO, ::Ref)
-> now a method of read!
->
skipchars(predicate, io :: IO; linecommet = nothing)Bidiagonal
uses a symbol nownfields
on a type -> fieldcount
write
on non-isbits -> explicit loops or serialize
readstring
-> read(io, String)
flipbits!(B)
--> B .= .!B
spdiagm(x::AbstractVector)
has been deprecated in favor of sparse(Diagonal(x))
alternatively spdiagm(0 => x)
(#23757).spdiagm(x::AbstractVector, d::Integer)
and spdiagm(x::Tuple{<:AbstractVector}, d::Tuple{<:Integer})
have been deprecated in favor of spdiagm(d => x)
and spdiagm(d[1] => x[1], d[2] => x[2], ...)
+1 for auto-fixing a positional dimensions argument!
ismatch -> contains can be checked off this list
Will keep adding to this:
Ptr{Void} -> Ptr{Cvoid}
Void
->Nothing
unshift!
->pushfirst!
,shift!
->popfirst!
CartesianRange
->CartesianIndices
sub2ind
->CartesianIndices
,ind2sub
->LinearIndices
JULIA_HOME
->Sys.BINDIR
ipermute!
->invpermute!
spones(A)
->fillstored!(copy(A), 1)
info, warn
to macro versions (might be a bit tricky).Display
->AbstractDisplay
linspace(a, b)
->linspace(a, b, 50)
,logspace(a, b)
->logspace(a, b, 50)
.(x...)
->(x...,)
strwidth
,charwidth
->textwidth
Array{T, N}(m::Int, ...::Int)
->Array{T, N}(uninitialized, m, ...)
logm
->log
,expm
->exp
,sqrtm
->sqrt
union()
->Set()
.A_mul_B!
->mul!
and coisleaftype
->isconcretetype
https://github.com/JuliaLang/julia/pull/25496isabstract
->isabstracttype
https://github.com/JuliaLang/julia/pull/25496doc" "
->@doc doc""
iteratorsize
->IteratorSize
digits
keyword argument toround
.parse
->Meta.parse
prod
,sum
needs to takedims
keywordlinspace
torange
with keyword argumentseval
-> Core.evalatan2
->atan
Compat.@__MODULE__
->@__MODULE__
parse(Int, s, b)
->parse(Int, s, base=b)
.is_unix
->Sys.isunix
Some of these might be unsafe to do without semantic analysis. Look into using https://github.com/ZacLN/StaticLint.jl and see how well it can be used to figure out where the binding originate from.