Package evaluation to test MatrixNetworks on Julia 1.14.0-DEV.2593 (15c2b67521*) started at 2026-07-03T17:15:36.688 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 15.27s ################################################################################ # Installation # Installing MatrixNetworks... Resolving package versions... Installed OrderedCollections ─ v1.8.2 Installed Compat ───────────── v4.18.1 Installed DelimitedFiles ───── v1.9.1 Installed Statistics ───────── v1.11.1 Installed GenericArpack ────── v0.2.1 Installed IterTools ────────── v1.10.0 Installed DataStructures ───── v0.18.22 Installed KahanSummation ───── v0.3.1 Installed MatrixNetworks ───── v1.0.4 Updating `~/.julia/environments/v1.14/Project.toml` [4f449596] + MatrixNetworks v1.0.4 Updating `~/.julia/environments/v1.14/Manifest.toml` [34da2185] + Compat v4.18.1 ⌅ [864edb3b] + DataStructures v0.18.22 [8bb1440f] + DelimitedFiles v1.9.1 [408c25d7] + GenericArpack v0.2.1 [c8e1da08] + IterTools v1.10.0 [8e2b3108] + KahanSummation v0.3.1 [4f449596] + MatrixNetworks v1.0.4 ⌅ [bac558e1] + OrderedCollections v1.8.2 [10745b16] + Statistics v1.11.1 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.14.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.13.0 [9e88b42a] + Serialization v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.0 [fa267f1f] + TOML v1.0.3 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.5.5+2 [4536629a] + OpenBLAS_jll v0.3.33+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [8e850b90] + libblastrampoline_jll v5.15.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 1.78s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling project... 8.8 s ✓ TestEnv 1 dependency successfully precompiled in 9 seconds. 27 already precompiled. Precompiling package dependencies... Precompiling project... ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =# Core.@doc "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" function dsortr(which::Symbol, apply::Bool, n::Int, x1::AbstractVector{T}, x2::AbstractVecOrMat) where T <: AbstractFloat │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:255 =# │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =# │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =# @jl_arpack_check_length x1 n │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:264 =# │ if apply │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =# │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =# @jl_arpack_check_length x2 n │ end │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:270 =# │ if which == :SA │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271 =# │ _dsortr_loop(((x::T, y::T)->begin │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271 =# │ x < y │ end), apply, n, x1, x2) │ elseif #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:272 =# which == :SM │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:273 =# │ _dsortr_loop(((x::T, y::T)->begin │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:273 =# │ abs(x) < abs(y) │ end), apply, n, x1, x2) │ elseif #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:274 =# which == :LA │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:275 =# │ _dsortr_loop(((x::T, y::T)->begin │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:275 =# │ x > y │ end), apply, n, x1, x2) │ elseif #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:276 =# which == :LM │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:277 =# │ _dsortr_loop(((x::T, y::T)->begin │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:277 =# │ abs(x) > abs(y) │ end), apply, n, x1, x2) │ end │ end) │ st0 = │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,context,syntax_flags,name_val,meta,value,jl_source,is_toplevel_thunk,source │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =#) :: Value | │ "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" :: Value | │ [function] | │ [where] | │ [call] | │ dsortr :: Identifier | │ [::] | │ which :: Identifier | │ Symbol :: Identifier | │ [::] | │ apply :: Identifier | │ Bool :: Identifier | │ [::] | │ n :: Identifier | │ Int :: Identifier | │ [::] | │ x1 :: Identifier | │ [curly] | │ AbstractVector :: Identifier | │ T :: Identifier | │ [::] | │ x2 :: Identifier | │ AbstractVecOrMat :: Identifier | │ [<:] | │ T :: Identifier | │ AbstractFloat :: Identifier | │ [block] | │ [macrocall] | │ @jl_arpack_check_length :: Identifier | │ :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =#) :: Value | │ x1 :: Identifier | │ n :: Identifier | │ [if] | │ apply :: Identifier | │ [block] | │ [macrocall] | │ @jl_arpack_check_length :: Identifier | │ :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =#) :: Value | │ x2 :: Identifier | │ n :: Identifier | │ [if] | │ [call] | │ == :: Identifier | │ which :: Identifier | │ [inert] | │ SA :: Identifier | │ [block] | │ [call] | │ _dsortr_loop :: Identifier | │ [->] | │ [tuple] | │ [::] | │ x :: Identifier | │ T :: Identifier | │ [::] | │ y :: Identifier | │ T :: Identifier | │ [block] | │ [call] | │ < :: Identifier | │ x :: Identifier | │ y :: Identifier | │ apply :: Identifier | │ n :: Identifier | │ x1 :: Identifier | │ x2 :: Identifier | │ [elseif] | │ [block] | │ [call] | │ == :: Identifier | │ which :: Identifier | │ [inert] | │ SM :: Identifier | │ [block] | │ [call] | │ _dsortr_loop :: Identifier | │ [->] | │ [tuple] | │ [::] | │ x :: Identifier | │ T :: Identifier | │ [::] | │ y :: Identifier | │ T :: Identifier | │ [block] | │ [call] | │ < :: Identifier | │ [call] | │ abs :: Identifier | │ x :: Identifier | │ [call] | │ abs :: Identifier | │ y :: Identifier | │ apply :: Identifier | │ n :: Identifier | │ x1 :: Identifier | │ x2 :: Identifier | │ [elseif] | │ [block] | │ [call] | │ == :: Identifier | │ which :: Identifier | │ [inert] | │ LA :: Identifier | │ [block] | │ [call] | │ _dsortr_loop :: Identifier | │ [->] | │ [tuple] | │ [::] | │ x :: Identifier | │ T :: Identifier | │ [::] | │ y :: Identifier | │ T :: Identifier | │ [block] | │ [call] | │ > :: Identifier | │ x :: Identifier | │ y :: Identifier | │ apply :: Identifier | │ n :: Identifier | │ x1 :: Identifier | │ x2 :: Identifier | │ [elseif] | │ [block] | │ [call] | │ == :: Identifier | │ which :: Identifier | │ [inert] | │ LM :: Identifier | │ [block] | │ [call] | │ _dsortr_loop :: Identifier | │ [->] | │ [tuple] | │ [::] | │ x :: Identifier | │ T :: Identifier | │ [::] | │ y :: Identifier | │ T :: Identifier | │ [block] | │ [call] | │ > :: Identifier | │ [call] | │ abs :: Identifier | │ x :: Identifier | │ [call] | │ abs :: Identifier | │ y :: Identifier | │ apply :: Identifier | │ n :: Identifier | │ x1 :: Identifier | │ x2 :: Identifier | │ │ st1 = │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,context,syntax_flags,name_val,meta,value,jl_source,is_toplevel_thunk,source │ [block] | [old,SL(1ZAbDCkVJoD,Base.Docs,SL(LumjVomBLei,GenericArpack,)),@doc], │ [if] | [old,SL(1ZAbDCkVJoD,Base.Docs,SL(LumjVomBLei,GenericArpack,)),@doc], │ true :: Value | [old,SL(1ZAbDCkVJoD,Base.Docs,SL(LumjVomBLei,GenericArpack,)),@doc], │ [=] | [old,SL(1ZAbDCkVJoD,Base.Docs,SL(LumjVomBLei,GenericArpack,)),@doc], │ val :: Identifier | [old,SL(1ZAbDCkVJoD,Base.Docs,SL(LumjVomBLei,GenericArpack,)),@doc], │ [function] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [where] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ dsortr :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [::] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ which :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ Symbol :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [::] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ apply :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ Bool :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [::] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ n :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ Int :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [::] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ x1 :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [curly] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ AbstractVector :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ T :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [::] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ x2 :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ AbstractVecOrMat :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [<:] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ T :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ AbstractFloat :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [block] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [block] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [if] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ > :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ n :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ length :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ x1 :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [block] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ throw :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ ArgumentError :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ string :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ "range 1:n=" :: Value | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ n :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ " out of bounds for x1 of length " :: Value | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ length :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ x1 :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [if] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ apply :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [block] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [block] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [if] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ > :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ n :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ length :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ x2 :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [block] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ throw :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ ArgumentError :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ string :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ "range 1:n=" :: Value | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ n :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ " out of bounds for x2 of length " :: Value | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ length :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ x2 :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [if] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ == :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ which :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [inert] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ SA :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [block] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ _dsortr_loop :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [->] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [tuple] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [::] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ x :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ T :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [::] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ y :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ T :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [block] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ < :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ x :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ y :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ apply :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ n :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ x1 :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ x2 :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [elseif] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [block] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ == :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ which :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [inert] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ SM :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [block] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ _dsortr_loop :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [->] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [tuple] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [::] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ x :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ T :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [::] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ y :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ T :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [block] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ < :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ abs :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ x :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ abs :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ y :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ apply :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ n :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ x1 :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ x2 :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [elseif] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [block] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ == :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ which :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [inert] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ LA :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [block] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ _dsortr_loop :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [->] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [tuple] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [::] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ x :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ T :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [::] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ y :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ T :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [block] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ > :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ x :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ y :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ apply :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ n :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ x1 :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ x2 :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [elseif] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [block] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ == :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ which :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [inert] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ LM :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [block] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ _dsortr_loop :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [->] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [tuple] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [::] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ x :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ T :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [::] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ y :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ T :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [block] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ > :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ abs :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ x :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ abs :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ y :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ apply :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ n :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ x1 :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ x2 :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(1ZAbDCkVJoD,Base.Docs,SL(LumjVomBLei,GenericArpack,)),@doc], │ Base.Docs.doc! :: Value | [old,SL(1ZAbDCkVJoD,Base.Docs,SL(LumjVomBLei,GenericArpack,)),@doc], │ GenericArpack :: Value | [old,SL(1ZAbDCkVJoD,Base.Docs,SL(LumjVomBLei,GenericArpack,)),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ Base.Docs.Binding :: Value | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ GenericArpack :: Value | [old,SL(LYn3b1IK2lu,Base,SL(LumjVomBLei,GenericArpack,)),(. Base (inert @__MODULE__))], │ [inert] | [old,SL(LumjVomBLei,GenericArpack,),@doc],jl_source=L47 │ dsortr :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ Base.Docs.docstr :: Value | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ Core.svec :: Value | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" :: Value | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [call] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ Dict{Symbol, Any} :: Value | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ :path => "/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl" :: Value | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ :linenumber => 224 :: Value | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ :module => GenericArpack :: Value | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [where] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [curly] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ Union :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [curly] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ Tuple :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ Symbol :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ Bool :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ Int :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [curly] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ AbstractVector :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ T :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ AbstractVecOrMat :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [curly] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ Tuple :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ T :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [<:] | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ T :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ AbstractFloat :: Identifier | [old,SL(LumjVomBLei,GenericArpack,),@doc], │ [if] | [old,SL(1ZAbDCkVJoD,Base.Docs,SL(LumjVomBLei,GenericArpack,)),@doc], │ true :: Value | [old,SL(1ZAbDCkVJoD,Base.Docs,SL(LumjVomBLei,GenericArpack,)),@doc], │ val :: Identifier | [old,SL(1ZAbDCkVJoD,Base.Docs,SL(LumjVomBLei,GenericArpack,)),@doc], │ │ file = "/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl" │ line = 224 └ mod = GenericArpack ERROR: LoadError: LoweringError: #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271 =# - Found unexpected binding of kind static_parameter Expression:  #₂₃/T Containing expressions:  (= #₆₇/T #₂₃/T)  (= #₃ (call core.svec (call core.svec #₅₂/#dsortr##->###0 #₂₃/T #₂₃/T) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271:0))  (= #₃ (call core.svec (call core.svec (function_type #₂₄/#->#) #₂₃/T #₂₃/T) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271:0))  Detailed provenance:  #₂₃/T  ├─ T  │ ├─ T  │ │ └─ @ /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271  │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =#) "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" (function (where (call dsortr (:: which Symbol) (:: apply Bool) (:: n Int) (:: x1 (curly AbstractVector T)) (:: x2 AbstractVecOrMat)) (<: T AbstractFloat)) (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =#) x1 n) (if apply (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =#) x2 n))) (if (call == which (inert SA)) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < x y))) apply n x1 x2)) (elseif (block (call == which (inert SM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < (call abs x) (call abs y)))) apply n x1 x2)) (elseif (block (call == which (inert LA))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > x y))) apply n x1 x2)) (elseif (block (call == which (inert LM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > (call abs x) (call abs y)))) apply n x1 x2)))))))))  │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =#) "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" (function (where (call dsortr (:: which Symbol) (:: apply Bool) (:: n Int) (:: x1 (curly AbstractVector T)) (:: x2 AbstractVecOrMat)) (<: T AbstractFloat)) (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =#) x1 n) (if apply (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =#) x2 n))) (if (call == which (inert SA)) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < x y))) apply n x1 x2)) (elseif (block (call == which (inert SM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < (call abs x) (call abs y)))) apply n x1 x2)) (elseif (block (call == which (inert LA))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > x y))) apply n x1 x2)) (elseif (block (call == which (inert LM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > (call abs x) (call abs y)))) apply n x1 x2)))))))))  │ └─ @ /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =#) "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" (function (where (call dsortr (:: which Symbol) (:: apply Bool) (:: n Int) (:: x1 (curly AbstractVector T)) (:: x2 AbstractVecOrMat)) (<: T AbstractFloat)) (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =#) x1 n) (if apply (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =#) x2 n))) (if (call == which (inert SA)) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < x y))) apply n x1 x2)) (elseif (block (call == which (inert SM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < (call abs x) (call abs y)))) apply n x1 x2)) (elseif (block (call == which (inert LA))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > x y))) apply n x1 x2)) (elseif (block (call == which (inert LM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > (call abs x) (call abs y)))) apply n x1 x2)))))))))  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =#) "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" (function (where (call dsortr (:: which Symbol) (:: apply Bool) (:: n Int) (:: x1 (curly AbstractVector T)) (:: x2 AbstractVecOrMat)) (<: T AbstractFloat)) (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =#) x1 n) (if apply (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =#) x2 n))) (if (call == which (inert SA)) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < x y))) apply n x1 x2)) (elseif (block (call == which (inert SM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < (call abs x) (call abs y)))) apply n x1 x2)) (elseif (block (call == which (inert LA))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > x y))) apply n x1 x2)) (elseif (block (call == which (inert LM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > (call abs x) (call abs y)))) apply n x1 x2)))))))))  └─ @ /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224  Stacktrace:  [1] _renumber(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ssa_rewrites::Dict{Int64, Int64}, slot_rewrites::Dict{Int64, Int64}, label_table::Dict{Int64, Int64}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1097  [2] renumber_body(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, input_code::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}, slot_rewrites::Dict{Int64, Int64})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1162  [3] compile_lambda(outer_ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1257  [4] linearize_ir(ctx::Base.JuliaLowering.ClosureConversionCtx{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1287  [5] core_lowering_hook(code::Any, mod::Module, file::String, line::UInt64, world::UInt64, _warn::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/hooks.jl:33  [6] include(mapexpr::Function, mod::Module, _path::String)  @ Base Base.jl:326  [7] top-level scope  @ ~/.julia/packages/GenericArpack/p8u6Z/src/GenericArpack.jl:16  [8] include(mod::Module, _path::String)  @ Base Base.jl:325  [9] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3303  [10] top-level scope  @ stdin:5  [11] eval(m::Module, e::Any)  @ Core boot.jl:522  [12] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [13] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [14] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [15] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 in expression starting at /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/GenericArpack.jl:1 in expression starting at stdin:5 ✗ GenericArpack 1.1 s ✓ KahanSummation 401.2 s ✓ IterTools 1.4 s ✓ Statistics 150.2 s ✓ OrderedCollections 1.6 s ✓ DelimitedFiles 2.2 s ✓ Compat 44.1 s ✓ Statistics → SparseArraysExt 0.9 s ✓ Compat → CompatLinearAlgebraExt 278.0 s ✓ DataStructures ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("408c25d7-97fa-4992-8bd9-ce15f1a09fe9"), "GenericArpack") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base loading.jl:2837  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base loading.jl:2685  [4] macro expansion  @ loading.jl:2599 [inlined]  [5] macro expansion  @ lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base loading.jl:2563  [7] require(into::Module, mod::Symbol)  @ Base loading.jl:2539 [inlined]  [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String)  @ Base module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base module.jl:60  [10] _eval_using(to::Module, path::Expr, flags::UInt8)  @ Base module.jl:137 [inlined]  [11] eval_using(to::Module, path::Expr)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/runtime.jl:130  [12] top-level scope  @ ~/.julia/packages/MatrixNetworks/DyXwE/src/MatrixNetworks.jl:7  [13] include(mod::Module, _path::String)  @ Base Base.jl:325  [14] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3303  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core boot.jl:522  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [18] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [19] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [20] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/MatrixNetworks/DyXwE/src/MatrixNetworks.jl:1 in expression starting at stdin:5 ✗ MatrixNetworks 9 dependencies successfully precompiled in 1003 seconds. 16 already precompiled. Precompilation completed after 1046.44s ################################################################################ # Testing # Testing MatrixNetworks Status `/tmp/jl_RxWumn/Project.toml` ⌅ [864edb3b] DataStructures v0.18.22 [8bb1440f] DelimitedFiles v1.9.1 [408c25d7] GenericArpack v0.2.1 [c8e1da08] IterTools v1.10.0 [8e2b3108] KahanSummation v0.3.1 [4f449596] MatrixNetworks v1.0.4 [10745b16] Statistics v1.11.1 [37e2e46d] LinearAlgebra v1.14.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_RxWumn/Manifest.toml` [34da2185] Compat v4.18.1 ⌅ [864edb3b] DataStructures v0.18.22 [8bb1440f] DelimitedFiles v1.9.1 [408c25d7] GenericArpack v0.2.1 [c8e1da08] IterTools v1.10.0 [8e2b3108] KahanSummation v0.3.1 [4f449596] MatrixNetworks v1.0.4 ⌅ [bac558e1] OrderedCollections v1.8.2 [10745b16] Statistics v1.11.1 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.14.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.13.0 [9e88b42a] Serialization v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.0 [fa267f1f] TOML v1.0.3 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.5.5+2 [4536629a] OpenBLAS_jll v0.3.33+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [8e850b90] libblastrampoline_jll v5.15.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =# Core.@doc "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" function dsortr(which::Symbol, apply::Bool, n::Int, x1::AbstractVector{T}, x2::AbstractVecOrMat) where T <: AbstractFloat │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:255 =# │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =# │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =# @jl_arpack_check_length x1 n │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:264 =# │ if apply │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =# │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =# @jl_arpack_check_length x2 n │ end │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:270 =# │ if which == :SA │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271 =# │ _dsortr_loop(((x::T, y::T)->begin │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271 =# │ x < y │ end), apply, n, x1, x2) │ elseif #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:272 =# which == :SM │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:273 =# │ _dsortr_loop(((x::T, y::T)->begin │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:273 =# │ abs(x) < abs(y) │ end), apply, n, x1, x2) │ elseif #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:274 =# which == :LA │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:275 =# │ _dsortr_loop(((x::T, y::T)->begin │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:275 =# │ x > y │ end), apply, n, x1, x2) │ elseif #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:276 =# which == :LM │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:277 =# │ _dsortr_loop(((x::T, y::T)->begin │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:277 =# │ abs(x) > abs(y) │ end), apply, n, x1, x2) │ end │ end) │ st0 = │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,context,syntax_flags,name_val,meta,value,jl_source,is_toplevel_thunk,source │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =#) :: Value | │ "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" :: Value | │ [function] | │ [where] | │ [call] | │ dsortr :: Identifier | │ [::] | │ which :: Identifier | │ Symbol :: Identifier | │ [::] | │ apply :: Identifier | │ Bool :: Identifier | │ [::] | │ n :: Identifier | │ Int :: Identifier | │ [::] | │ x1 :: Identifier | │ [curly] | │ AbstractVector :: Identifier | │ T :: Identifier | │ [::] | │ x2 :: Identifier | │ AbstractVecOrMat :: Identifier | │ [<:] | │ T :: Identifier | │ AbstractFloat :: Identifier | │ [block] | │ [macrocall] | │ @jl_arpack_check_length :: Identifier | │ :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =#) :: Value | │ x1 :: Identifier | │ n :: Identifier | │ [if] | │ apply :: Identifier | │ [block] | │ [macrocall] | │ @jl_arpack_check_length :: Identifier | │ :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =#) :: Value | │ x2 :: Identifier | │ n :: Identifier | │ [if] | │ [call] | │ == :: Identifier | │ which :: Identifier | │ [inert] | │ SA :: Identifier | │ [block] | │ [call] | │ _dsortr_loop :: Identifier | │ [->] | │ [tuple] | │ [::] | │ x :: Identifier | │ T :: Identifier | │ [::] | │ y :: Identifier | │ T :: Identifier | │ [block] | │ [call] | │ < :: Identifier | │ x :: Identifier | │ y :: Identifier | │ apply :: Identifier | │ n :: Identifier | │ x1 :: Identifier | │ x2 :: Identifier | │ [elseif] | │ [block] | │ [call] | │ == :: Identifier | │ which :: Identifier | │ [inert] | │ SM :: Identifier | │ [block] | │ [call] | │ _dsortr_loop :: Identifier | │ [->] | │ [tuple] | │ [::] | │ x :: Identifier | │ T :: Identifier | │ [::] | │ y :: Identifier | │ T :: Identifier | │ [block] | │ [call] | │ < :: Identifier | │ [call] | │ abs :: Identifier | │ x :: Identifier | │ [call] | │ abs :: Identifier | │ y :: Identifier | │ apply :: Identifier | │ n :: Identifier | │ x1 :: Identifier | │ x2 :: Identifier | │ [elseif] | │ [block] | │ [call] | │ == :: Identifier | │ which :: Identifier | │ [inert] | │ LA :: Identifier | │ [block] | │ [call] | │ _dsortr_loop :: Identifier | │ [->] | │ [tuple] | │ [::] | │ x :: Identifier | │ T :: Identifier | │ [::] | │ y :: Identifier | │ T :: Identifier | │ [block] | │ [call] | │ > :: Identifier | │ x :: Identifier | │ y :: Identifier | │ apply :: Identifier | │ n :: Identifier | │ x1 :: Identifier | │ x2 :: Identifier | │ [elseif] | │ [block] | │ [call] | │ == :: Identifier | │ which :: Identifier | │ [inert] | │ LM :: Identifier | │ [block] | │ [call] | │ _dsortr_loop :: Identifier | │ [->] | │ [tuple] | │ [::] | │ x :: Identifier | │ T :: Identifier | │ [::] | │ y :: Identifier | │ T :: Identifier | │ [block] | │ [call] | │ > :: Identifier | │ [call] | │ abs :: Identifier | │ x :: Identifier | │ [call] | │ abs :: Identifier | │ y :: Identifier | │ apply :: Identifier | │ n :: Identifier | │ x1 :: Identifier | │ x2 :: Identifier | │ │ st1 = │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,context,syntax_flags,name_val,meta,value,jl_source,is_toplevel_thunk,source │ [block] | [old,SL(DZNAFQ5V6WM,Base.Docs,SL(3mtmEU2pKdD,GenericArpack,)),@doc], │ [if] | [old,SL(DZNAFQ5V6WM,Base.Docs,SL(3mtmEU2pKdD,GenericArpack,)),@doc], │ true :: Value | [old,SL(DZNAFQ5V6WM,Base.Docs,SL(3mtmEU2pKdD,GenericArpack,)),@doc], │ [=] | [old,SL(DZNAFQ5V6WM,Base.Docs,SL(3mtmEU2pKdD,GenericArpack,)),@doc], │ val :: Identifier | [old,SL(DZNAFQ5V6WM,Base.Docs,SL(3mtmEU2pKdD,GenericArpack,)),@doc], │ [function] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [where] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ dsortr :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ which :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ Symbol :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ apply :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ Bool :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ n :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ Int :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ x1 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [curly] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ AbstractVector :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ x2 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ AbstractVecOrMat :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [<:] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ AbstractFloat :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [if] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ > :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ n :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ length :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ x1 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ throw :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ ArgumentError :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ string :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ "range 1:n=" :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ n :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ " out of bounds for x1 of length " :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ length :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ x1 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [if] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ apply :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [if] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ > :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ n :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ length :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ x2 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ throw :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ ArgumentError :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ string :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ "range 1:n=" :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ n :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ " out of bounds for x2 of length " :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ length :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ x2 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [if] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ == :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ which :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [inert] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ SA :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ _dsortr_loop :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [->] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [tuple] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ x :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ y :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ < :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ x :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ y :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ apply :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ n :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ x1 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ x2 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [elseif] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ == :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ which :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [inert] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ SM :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ _dsortr_loop :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [->] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [tuple] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ x :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ y :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ < :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ abs :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ x :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ abs :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ y :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ apply :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ n :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ x1 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ x2 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [elseif] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ == :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ which :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [inert] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ LA :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ _dsortr_loop :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [->] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [tuple] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ x :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ y :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ > :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ x :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ y :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ apply :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ n :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ x1 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ x2 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [elseif] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ == :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ which :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [inert] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ LM :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ _dsortr_loop :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [->] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [tuple] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ x :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ y :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ > :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ abs :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ x :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ abs :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ y :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ apply :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ n :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ x1 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ x2 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(DZNAFQ5V6WM,Base.Docs,SL(3mtmEU2pKdD,GenericArpack,)),@doc], │ Base.Docs.doc! :: Value | [old,SL(DZNAFQ5V6WM,Base.Docs,SL(3mtmEU2pKdD,GenericArpack,)),@doc], │ GenericArpack :: Value | [old,SL(DZNAFQ5V6WM,Base.Docs,SL(3mtmEU2pKdD,GenericArpack,)),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ Base.Docs.Binding :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ GenericArpack :: Value | [old,SL(KguZLkxklsz,Base,SL(3mtmEU2pKdD,GenericArpack,)),(. Base (inert @__MODULE__))], │ [inert] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc],jl_source=L47 │ dsortr :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ Base.Docs.docstr :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ Core.svec :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ Dict{Symbol, Any} :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ :path => "/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl" :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ :linenumber => 224 :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ :module => GenericArpack :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [where] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [curly] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ Union :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [curly] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ Tuple :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ Symbol :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ Bool :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ Int :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [curly] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ AbstractVector :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ AbstractVecOrMat :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [curly] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ Tuple :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [<:] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ AbstractFloat :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ [if] | [old,SL(DZNAFQ5V6WM,Base.Docs,SL(3mtmEU2pKdD,GenericArpack,)),@doc], │ true :: Value | [old,SL(DZNAFQ5V6WM,Base.Docs,SL(3mtmEU2pKdD,GenericArpack,)),@doc], │ val :: Identifier | [old,SL(DZNAFQ5V6WM,Base.Docs,SL(3mtmEU2pKdD,GenericArpack,)),@doc], │ │ file = "/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl" │ line = 224 └ mod = GenericArpack ERROR: LoadError: LoweringError: #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271 =# - Found unexpected binding of kind static_parameter Expression:  #₂₃/T Containing expressions:  (= #₆₇/T #₂₃/T)  (= #₃ (call core.svec (call core.svec #₅₂/#dsortr##->###0 #₂₃/T #₂₃/T) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271:0))  (= #₃ (call core.svec (call core.svec (function_type #₂₄/#->#) #₂₃/T #₂₃/T) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271:0))  Detailed provenance:  #₂₃/T  ├─ T  │ ├─ T  │ │ └─ @ /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271  │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =#) "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" (function (where (call dsortr (:: which Symbol) (:: apply Bool) (:: n Int) (:: x1 (curly AbstractVector T)) (:: x2 AbstractVecOrMat)) (<: T AbstractFloat)) (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =#) x1 n) (if apply (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =#) x2 n))) (if (call == which (inert SA)) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < x y))) apply n x1 x2)) (elseif (block (call == which (inert SM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < (call abs x) (call abs y)))) apply n x1 x2)) (elseif (block (call == which (inert LA))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > x y))) apply n x1 x2)) (elseif (block (call == which (inert LM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > (call abs x) (call abs y)))) apply n x1 x2)))))))))  │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =#) "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" (function (where (call dsortr (:: which Symbol) (:: apply Bool) (:: n Int) (:: x1 (curly AbstractVector T)) (:: x2 AbstractVecOrMat)) (<: T AbstractFloat)) (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =#) x1 n) (if apply (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =#) x2 n))) (if (call == which (inert SA)) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < x y))) apply n x1 x2)) (elseif (block (call == which (inert SM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < (call abs x) (call abs y)))) apply n x1 x2)) (elseif (block (call == which (inert LA))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > x y))) apply n x1 x2)) (elseif (block (call == which (inert LM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > (call abs x) (call abs y)))) apply n x1 x2)))))))))  │ └─ @ /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =#) "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" (function (where (call dsortr (:: which Symbol) (:: apply Bool) (:: n Int) (:: x1 (curly AbstractVector T)) (:: x2 AbstractVecOrMat)) (<: T AbstractFloat)) (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =#) x1 n) (if apply (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =#) x2 n))) (if (call == which (inert SA)) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < x y))) apply n x1 x2)) (elseif (block (call == which (inert SM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < (call abs x) (call abs y)))) apply n x1 x2)) (elseif (block (call == which (inert LA))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > x y))) apply n x1 x2)) (elseif (block (call == which (inert LM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > (call abs x) (call abs y)))) apply n x1 x2)))))))))  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =#) "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" (function (where (call dsortr (:: which Symbol) (:: apply Bool) (:: n Int) (:: x1 (curly AbstractVector T)) (:: x2 AbstractVecOrMat)) (<: T AbstractFloat)) (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =#) x1 n) (if apply (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =#) x2 n))) (if (call == which (inert SA)) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < x y))) apply n x1 x2)) (elseif (block (call == which (inert SM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < (call abs x) (call abs y)))) apply n x1 x2)) (elseif (block (call == which (inert LA))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > x y))) apply n x1 x2)) (elseif (block (call == which (inert LM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > (call abs x) (call abs y)))) apply n x1 x2)))))))))  └─ @ /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224  Stacktrace:  [1] _renumber(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ssa_rewrites::Dict{Int64, Int64}, slot_rewrites::Dict{Int64, Int64}, label_table::Dict{Int64, Int64}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1097  [2] renumber_body(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, input_code::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}, slot_rewrites::Dict{Int64, Int64})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1162  [3] compile_lambda(outer_ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1257  [4] linearize_ir(ctx::Base.JuliaLowering.ClosureConversionCtx{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1287  [5] core_lowering_hook(code::Any, mod::Module, file::String, line::UInt64, world::UInt64, _warn::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/hooks.jl:33  [6] include(mapexpr::Function, mod::Module, _path::String)  @ Base Base.jl:326  [7] top-level scope  @ ~/.julia/packages/GenericArpack/p8u6Z/src/GenericArpack.jl:16  [8] include(mod::Module, _path::String)  @ Base Base.jl:325  [9] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3303  [10] top-level scope  @ stdin:5  [11] eval(m::Module, e::Any)  @ Core boot.jl:522  [12] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [13] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [14] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [15] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 in expression starting at /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/GenericArpack.jl:1 in expression starting at stdin:5 ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("408c25d7-97fa-4992-8bd9-ce15f1a09fe9"), "GenericArpack") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base loading.jl:2837  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base loading.jl:2685  [4] macro expansion  @ loading.jl:2599 [inlined]  [5] macro expansion  @ lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base loading.jl:2563  [7] require(into::Module, mod::Symbol)  @ Base loading.jl:2539 [inlined]  [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String)  @ Base module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base module.jl:60  [10] _eval_using(to::Module, path::Expr, flags::UInt8)  @ Base module.jl:137 [inlined]  [11] eval_using(to::Module, path::Expr)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/runtime.jl:130  [12] top-level scope  @ ~/.julia/packages/MatrixNetworks/DyXwE/src/MatrixNetworks.jl:7  [13] include(mod::Module, _path::String)  @ Base Base.jl:325  [14] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3303  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core boot.jl:522  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [18] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [19] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [20] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/MatrixNetworks/DyXwE/src/MatrixNetworks.jl:1 in expression starting at stdin:5 2 dependencies had output during precompilation: ┌ GenericArpack │ ┌ Info: JuliaLowering threw given input: │ │ code = │ │ :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =# Core.@doc "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" function dsortr(which::Symbol, apply::Bool, n::Int, x1::AbstractVector{T}, x2::AbstractVecOrMat) where T <: AbstractFloat │ │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:255 =# │ │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =# │ │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =# @jl_arpack_check_length x1 n │ │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:264 =# │ │ if apply │ │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =# │ │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =# @jl_arpack_check_length x2 n │ │ end │ │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:270 =# │ │ if which == :SA │ │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271 =# │ │ _dsortr_loop(((x::T, y::T)->begin │ │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271 =# │ │ x < y │ │ end), apply, n, x1, x2) │ │ elseif #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:272 =# which == :SM │ │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:273 =# │ │ _dsortr_loop(((x::T, y::T)->begin │ │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:273 =# │ │ abs(x) < abs(y) │ │ end), apply, n, x1, x2) │ │ elseif #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:274 =# which == :LA │ │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:275 =# │ │ _dsortr_loop(((x::T, y::T)->begin │ │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:275 =# │ │ x > y │ │ end), apply, n, x1, x2) │ │ elseif #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:276 =# which == :LM │ │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:277 =# │ │ _dsortr_loop(((x::T, y::T)->begin │ │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:277 =# │ │ abs(x) > abs(y) │ │ end), apply, n, x1, x2) │ │ end │ │ end) │ │ st0 = │ │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,context,syntax_flags,name_val,meta,value,jl_source,is_toplevel_thunk,source │ │ [macrocall] | │ │ @doc :: Identifier | mod=Core │ │ :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =#) :: Value | │ │ "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" :: Value | │ │ [function] | │ │ [where] | │ │ [call] | │ │ dsortr :: Identifier | │ │ [::] | │ │ which :: Identifier | │ │ Symbol :: Identifier | │ │ [::] | │ │ apply :: Identifier | │ │ Bool :: Identifier | │ │ [::] | │ │ n :: Identifier | │ │ Int :: Identifier | │ │ [::] | │ │ x1 :: Identifier | │ │ [curly] | │ │ AbstractVector :: Identifier | │ │ T :: Identifier | │ │ [::] | │ │ x2 :: Identifier | │ │ AbstractVecOrMat :: Identifier | │ │ [<:] | │ │ T :: Identifier | │ │ AbstractFloat :: Identifier | │ │ [block] | │ │ [macrocall] | │ │ @jl_arpack_check_length :: Identifier | │ │ :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =#) :: Value | │ │ x1 :: Identifier | │ │ n :: Identifier | │ │ [if] | │ │ apply :: Identifier | │ │ [block] | │ │ [macrocall] | │ │ @jl_arpack_check_length :: Identifier | │ │ :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =#) :: Value | │ │ x2 :: Identifier | │ │ n :: Identifier | │ │ [if] | │ │ [call] | │ │ == :: Identifier | │ │ which :: Identifier | │ │ [inert] | │ │ SA :: Identifier | │ │ [block] | │ │ [call] | │ │ _dsortr_loop :: Identifier | │ │ [->] | │ │ [tuple] | │ │ [::] | │ │ x :: Identifier | │ │ T :: Identifier | │ │ [::] | │ │ y :: Identifier | │ │ T :: Identifier | │ │ [block] | │ │ [call] | │ │ < :: Identifier | │ │ x :: Identifier | │ │ y :: Identifier | │ │ apply :: Identifier | │ │ n :: Identifier | │ │ x1 :: Identifier | │ │ x2 :: Identifier | │ │ [elseif] | │ │ [block] | │ │ [call] | │ │ == :: Identifier | │ │ which :: Identifier | │ │ [inert] | │ │ SM :: Identifier | │ │ [block] | │ │ [call] | │ │ _dsortr_loop :: Identifier | │ │ [->] | │ │ [tuple] | │ │ [::] | │ │ x :: Identifier | │ │ T :: Identifier | │ │ [::] | │ │ y :: Identifier | │ │ T :: Identifier | │ │ [block] | │ │ [call] | │ │ < :: Identifier | │ │ [call] | │ │ abs :: Identifier | │ │ x :: Identifier | │ │ [call] | │ │ abs :: Identifier | │ │ y :: Identifier | │ │ apply :: Identifier | │ │ n :: Identifier | │ │ x1 :: Identifier | │ │ x2 :: Identifier | │ │ [elseif] | │ │ [block] | │ │ [call] | │ │ == :: Identifier | │ │ which :: Identifier | │ │ [inert] | │ │ LA :: Identifier | │ │ [block] | │ │ [call] | │ │ _dsortr_loop :: Identifier | │ │ [->] | │ │ [tuple] | │ │ [::] | │ │ x :: Identifier | │ │ T :: Identifier | │ │ [::] | │ │ y :: Identifier | │ │ T :: Identifier | │ │ [block] | │ │ [call] | │ │ > :: Identifier | │ │ x :: Identifier | │ │ y :: Identifier | │ │ apply :: Identifier | │ │ n :: Identifier | │ │ x1 :: Identifier | │ │ x2 :: Identifier | │ │ [elseif] | │ │ [block] | │ │ [call] | │ │ == :: Identifier | │ │ which :: Identifier | │ │ [inert] | │ │ LM :: Identifier | │ │ [block] | │ │ [call] | │ │ _dsortr_loop :: Identifier | │ │ [->] | │ │ [tuple] | │ │ [::] | │ │ x :: Identifier | │ │ T :: Identifier | │ │ [::] | │ │ y :: Identifier | │ │ T :: Identifier | │ │ [block] | │ │ [call] | │ │ > :: Identifier | │ │ [call] | │ │ abs :: Identifier | │ │ x :: Identifier | │ │ [call] | │ │ abs :: Identifier | │ │ y :: Identifier | │ │ apply :: Identifier | │ │ n :: Identifier | │ │ x1 :: Identifier | │ │ x2 :: Identifier | │ │ │ │ st1 = │ │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,context,syntax_flags,name_val,meta,value,jl_source,is_toplevel_thunk,source │ │ [block] | [old,SL(DZNAFQ5V6WM,Base.Docs,SL(3mtmEU2pKdD,GenericArpack,)),@doc], │ │ [if] | [old,SL(DZNAFQ5V6WM,Base.Docs,SL(3mtmEU2pKdD,GenericArpack,)),@doc], │ │ true :: Value | [old,SL(DZNAFQ5V6WM,Base.Docs,SL(3mtmEU2pKdD,GenericArpack,)),@doc], │ │ [=] | [old,SL(DZNAFQ5V6WM,Base.Docs,SL(3mtmEU2pKdD,GenericArpack,)),@doc], │ │ val :: Identifier | [old,SL(DZNAFQ5V6WM,Base.Docs,SL(3mtmEU2pKdD,GenericArpack,)),@doc], │ │ [function] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [where] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ dsortr :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ which :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ Symbol :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ apply :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ Bool :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ n :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ Int :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ x1 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [curly] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ AbstractVector :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ x2 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ AbstractVecOrMat :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [<:] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ AbstractFloat :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [if] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ > :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ n :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ length :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ x1 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ throw :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ ArgumentError :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ string :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ "range 1:n=" :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ n :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ " out of bounds for x1 of length " :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ length :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ x1 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [if] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ apply :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [if] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ > :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ n :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ length :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ x2 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ throw :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ ArgumentError :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ string :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ "range 1:n=" :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ n :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ " out of bounds for x2 of length " :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ length :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ x2 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [if] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ == :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ which :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [inert] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ SA :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ _dsortr_loop :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [->] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [tuple] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ x :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ y :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ < :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ x :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ y :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ apply :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ n :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ x1 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ x2 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [elseif] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ == :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ which :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [inert] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ SM :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ _dsortr_loop :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [->] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [tuple] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ x :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ y :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ < :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ abs :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ x :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ abs :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ y :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ apply :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ n :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ x1 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ x2 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [elseif] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ == :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ which :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [inert] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ LA :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ _dsortr_loop :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [->] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [tuple] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ x :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ y :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ > :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ x :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ y :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ apply :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ n :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ x1 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ x2 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [elseif] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ == :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ which :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [inert] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ LM :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ _dsortr_loop :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [->] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [tuple] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ x :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [::] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ y :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [block] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ > :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ abs :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ x :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ abs :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ y :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ apply :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ n :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ x1 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ x2 :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(DZNAFQ5V6WM,Base.Docs,SL(3mtmEU2pKdD,GenericArpack,)),@doc], │ │ Base.Docs.doc! :: Value | [old,SL(DZNAFQ5V6WM,Base.Docs,SL(3mtmEU2pKdD,GenericArpack,)),@doc], │ │ GenericArpack :: Value | [old,SL(DZNAFQ5V6WM,Base.Docs,SL(3mtmEU2pKdD,GenericArpack,)),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ Base.Docs.Binding :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ GenericArpack :: Value | [old,SL(KguZLkxklsz,Base,SL(3mtmEU2pKdD,GenericArpack,)),(. Base (inert @__MODULE__))], │ │ [inert] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc],jl_source=L47 │ │ dsortr :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ Base.Docs.docstr :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ Core.svec :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [call] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ Dict{Symbol, Any} :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ :path => "/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl" :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ :linenumber => 224 :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ :module => GenericArpack :: Value | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [where] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [curly] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ Union :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [curly] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ Tuple :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ Symbol :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ Bool :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ Int :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [curly] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ AbstractVector :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ AbstractVecOrMat :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [curly] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ Tuple :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [<:] | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ T :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ AbstractFloat :: Identifier | [old,SL(3mtmEU2pKdD,GenericArpack,),@doc], │ │ [if] | [old,SL(DZNAFQ5V6WM,Base.Docs,SL(3mtmEU2pKdD,GenericArpack,)),@doc], │ │ true :: Value | [old,SL(DZNAFQ5V6WM,Base.Docs,SL(3mtmEU2pKdD,GenericArpack,)),@doc], │ │ val :: Identifier | [old,SL(DZNAFQ5V6WM,Base.Docs,SL(3mtmEU2pKdD,GenericArpack,)),@doc], │ │ │ │ file = "/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl" │ │ line = 224 │ └ mod = GenericArpack │ ERROR: LoadError: LoweringError: │ #= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271 =# - Found unexpected binding of kind static_parameter │ Expression: │ #₂₃/T │ Containing expressions: │ (= #₆₇/T #₂₃/T) │ (= #₃ (call core.svec (call core.svec #₅₂/#dsortr##->###0 #₂₃/T #₂₃/T) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271:0)) │ (= #₃ (call core.svec (call core.svec (function_type #₂₄/#->#) #₂₃/T #₂₃/T) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271:0)) │ │ Detailed provenance: │ #₂₃/T │ ├─ T │ │ ├─ T │ │ │ └─ @ /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:271 │ │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =#) "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" (function (where (call dsortr (:: which Symbol) (:: apply Bool) (:: n Int) (:: x1 (curly AbstractVector T)) (:: x2 AbstractVecOrMat)) (<: T AbstractFloat)) (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =#) x1 n) (if apply (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =#) x2 n))) (if (call == which (inert SA)) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < x y))) apply n x1 x2)) (elseif (block (call == which (inert SM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < (call abs x) (call abs y)))) apply n x1 x2)) (elseif (block (call == which (inert LA))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > x y))) apply n x1 x2)) (elseif (block (call == which (inert LM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > (call abs x) (call abs y)))) apply n x1 x2))))))))) │ │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =#) "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" (function (where (call dsortr (:: which Symbol) (:: apply Bool) (:: n Int) (:: x1 (curly AbstractVector T)) (:: x2 AbstractVecOrMat)) (<: T AbstractFloat)) (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =#) x1 n) (if apply (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =#) x2 n))) (if (call == which (inert SA)) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < x y))) apply n x1 x2)) (elseif (block (call == which (inert SM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < (call abs x) (call abs y)))) apply n x1 x2)) (elseif (block (call == which (inert LA))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > x y))) apply n x1 x2)) (elseif (block (call == which (inert LM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > (call abs x) (call abs y)))) apply n x1 x2))))))))) │ │ └─ @ /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =#) "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" (function (where (call dsortr (:: which Symbol) (:: apply Bool) (:: n Int) (:: x1 (curly AbstractVector T)) (:: x2 AbstractVecOrMat)) (<: T AbstractFloat)) (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =#) x1 n) (if apply (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =#) x2 n))) (if (call == which (inert SA)) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < x y))) apply n x1 x2)) (elseif (block (call == which (inert SM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < (call abs x) (call abs y)))) apply n x1 x2)) (elseif (block (call == which (inert LA))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > x y))) apply n x1 x2)) (elseif (block (call == which (inert LM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > (call abs x) (call abs y)))) apply n x1 x2))))))))) │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 =#) "Sort the array X1 in the order specified by WHICH and optionally\napplies the permutation to the array X2.\n\nUsage:\ncall dsortr\n ( WHICH, APPLY, N, X1, X2 )\n\nArguments\nWHICH Character*2. (Input)\n 'LM' -> X1 is sorted into increasing order of magnitude.\n 'SM' -> X1 is sorted into decreasing order of magnitude.\n 'LA' -> X1 is sorted into increasing order of algebraic.\n 'SA' -> X1 is sorted into decreasing order of algebraic.\n\nAPPLY Logical. (Input)\n APPLY = .TRUE. -> apply the sorted order to X2.\n APPLY = .FALSE. -> do not apply the sorted order to X2.\n\nN Integer. (INPUT)\n Size of the arrays.\n\nX1 Double precision array of length N. (INPUT/OUTPUT)\n The array to be sorted.\n\nX2 Double precision array of length N. (INPUT/OUTPUT)\n Only referenced if APPLY = .TRUE.\n\nReturns: nothing\n\n" (function (where (call dsortr (:: which Symbol) (:: apply Bool) (:: n Int) (:: x1 (curly AbstractVector T)) (:: x2 AbstractVecOrMat)) (<: T AbstractFloat)) (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:263 =#) x1 n) (if apply (block (macrocall @jl_arpack_check_length :(#= /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:265 =#) x2 n))) (if (call == which (inert SA)) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < x y))) apply n x1 x2)) (elseif (block (call == which (inert SM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call < (call abs x) (call abs y)))) apply n x1 x2)) (elseif (block (call == which (inert LA))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > x y))) apply n x1 x2)) (elseif (block (call == which (inert LM))) (block (call _dsortr_loop (-> (tuple (:: x T) (:: y T)) (block (call > (call abs x) (call abs y)))) apply n x1 x2))))))))) │ └─ @ /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 │ │ Stacktrace: │ [1] _renumber(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ssa_rewrites::Dict{Int64, Int64}, slot_rewrites::Dict{Int64, Int64}, label_table::Dict{Int64, Int64}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1097 │ [2] renumber_body(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, input_code::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}, slot_rewrites::Dict{Int64, Int64}) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1162 │ [3] compile_lambda(outer_ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1257 │ [4] linearize_ir(ctx::Base.JuliaLowering.ClosureConversionCtx{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1287 │ [5] core_lowering_hook(code::Any, mod::Module, file::String, line::UInt64, world::UInt64, _warn::Bool) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/hooks.jl:33 │ [6] include(mapexpr::Function, mod::Module, _path::String) │ @ Base Base.jl:326 │ [7] top-level scope │ @ ~/.julia/packages/GenericArpack/p8u6Z/src/GenericArpack.jl:16 │ [8] include(mod::Module, _path::String) │ @ Base Base.jl:325 │ [9] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing) │ @ Base loading.jl:3303 │ [10] top-level scope │ @ stdin:5 │ [11] eval(m::Module, e::Any) │ @ Core boot.jl:522 │ [12] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String) │ @ Base loading.jl:3132 │ [13] include_string(m::Module, txt::String, fname::String) │ @ Base loading.jl:3142 [inlined] │ [14] exec_options(opts::Base.JLOptions) │ @ Base client.jl:353 │ [15] _start() │ @ Base client.jl:596 │ in expression starting at /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl:224 │ in expression starting at /home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/GenericArpack.jl:1 │ in expression starting at stdin:5 └ ┌ MatrixNetworks │ [Output was shown above] └ ERROR: LoadError: The following 2 packages failed to precompile: GenericArpack Failed to precompile GenericArpack [408c25d7-97fa-4992-8bd9-ce15f1a09fe9] to "/home/pkgeval/.julia/compiled/v1.14/GenericArpack/jl_C1mCBR" (ProcessExited(1)). MatrixNetworks Failed to precompile MatrixNetworks [4f449596-a032-5618-b826-5a251cb6dc11] to "/home/pkgeval/.julia/compiled/v1.14/MatrixNetworks/jl_nL6Dxg" (ProcessExited(1)). in expression starting at /home/pkgeval/.julia/packages/MatrixNetworks/DyXwE/test/runtests.jl:1 Testing failed after 135.92s ERROR: LoadError: Package MatrixNetworks errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.14/Pkg/src/Types.jl:68 [2] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, julia_args::Cmd, test_args::Cmd, test_fn::Nothing, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool) @ Pkg.Operations /opt/julia/share/julia/stdlib/v1.14/Pkg/src/Operations.jl:3247 [3] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, test_fn::Nothing, julia_args::Cmd, test_args::Cmd, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool, kwargs::@Kwargs{io::IOContext{IO}}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:587 [4] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:172 [5] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:160 [6] test(pkg::String; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:159 [inlined] [7] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:223 [8] include(mod::Module, _path::String) @ Base Base.jl:325 [9] exec_options(opts::Base.JLOptions) @ Base client.jl:355 [10] _start() @ Base client.jl:596 in expression starting at /PkgEval.jl/scripts/evaluate.jl:214 PkgEval failed after 1225.42s: package fails to precompile