Package evaluation to test MatrixNetworks on Julia 1.14.0-DEV.2309 (6e1a27e459*) started at 2026-06-06T05:54:37.735 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 16.74s ################################################################################ # Installation # Installing MatrixNetworks... Resolving package versions... Installed DelimitedFiles ───── v1.9.1 Installed Statistics ───────── v1.11.1 Installed OrderedCollections ─ v1.8.2 Installed IterTools ────────── v1.10.0 Installed Compat ───────────── v4.18.1 Installed GenericArpack ────── v0.2.1 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.2+0 [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 2.12s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling project... 6.3 s ✓ TestEnv 1 dependency successfully precompiled in 6 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,macro_source,name_val,syntax_flags,meta,scope_layer,value,jl_source,is_toplevel_thunk,source,__macro_ctx__ │ [macrocall] │ │ @doc :: Identifier │ mod │ :(#= /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,macro_source,name_val,syntax_flags,meta,scope_layer,value,jl_source,is_toplevel_thunk,source │ [block] │ │ [=] │ │ val :: Identifier │ scope_layer=3 │ [function] │ │ [where] │ │ [call] │ │ dsortr :: Identifier │ scope_layer=1 │ [::] │ │ which :: Identifier │ scope_layer=1 │ Symbol :: Identifier │ scope_layer=1 │ [::] │ │ apply :: Identifier │ scope_layer=1 │ Bool :: Identifier │ scope_layer=1 │ [::] │ │ n :: Identifier │ scope_layer=1 │ Int :: Identifier │ scope_layer=1 │ [::] │ │ x1 :: Identifier │ scope_layer=1 │ [curly] │ │ AbstractVector :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ x2 :: Identifier │ scope_layer=1 │ AbstractVecOrMat :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ AbstractFloat :: Identifier │ scope_layer=1 │ [block] │ │ [block] │ │ [if] │ │ [call] │ │ > :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ throw :: Identifier │ scope_layer=1 │ [call] │ │ ArgumentError :: Identifier │ scope_layer=1 │ [call] │ │ string :: Identifier │ scope_layer=1 │ "range 1:n=" :: Value │ macro_source=157 │ n :: Identifier │ scope_layer=1 │ " out of bounds for x1 of length " :: Value │ macro_source=157 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ [if] │ │ apply :: Identifier │ scope_layer=1 │ [block] │ │ [block] │ │ [if] │ │ [call] │ │ > :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ throw :: Identifier │ scope_layer=1 │ [call] │ │ ArgumentError :: Identifier │ scope_layer=1 │ [call] │ │ string :: Identifier │ scope_layer=1 │ "range 1:n=" :: Value │ macro_source=157 │ n :: Identifier │ scope_layer=1 │ " out of bounds for x2 of length " :: Value │ macro_source=157 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [if] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ which :: Identifier │ scope_layer=1 │ [inert] │ │ SA :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ scope_layer=1 │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ y :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ < :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ y :: Identifier │ scope_layer=1 │ apply :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [elseif] │ │ [block] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ which :: Identifier │ scope_layer=1 │ [inert] │ │ SM :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ scope_layer=1 │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ y :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ < :: Identifier │ scope_layer=1 │ [call] │ │ abs :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [call] │ │ abs :: Identifier │ scope_layer=1 │ y :: Identifier │ scope_layer=1 │ apply :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [elseif] │ │ [block] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ which :: Identifier │ scope_layer=1 │ [inert] │ │ LA :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ scope_layer=1 │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ y :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ > :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ y :: Identifier │ scope_layer=1 │ apply :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [elseif] │ │ [block] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ which :: Identifier │ scope_layer=1 │ [inert] │ │ LM :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ scope_layer=1 │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ y :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ > :: Identifier │ scope_layer=1 │ [call] │ │ abs :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [call] │ │ abs :: Identifier │ scope_layer=1 │ y :: Identifier │ scope_layer=1 │ apply :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [call] │ │ Base.Docs.doc! :: Value │ macro_source=157 │ GenericArpack :: Value │ macro_source=157 │ [call] │ │ Base.Docs.Binding :: Value │ macro_source=157 │ GenericArpack :: Value │ │ [inert] │ jl_source=L65 │ dsortr :: Identifier │ │ [call] │ macro_source=157 │ Base.Docs.docstr :: Value │ macro_source=157 │ [call] │ macro_source=157 │ Core.svec :: Value │ macro_source=157 │ "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 │ macro_source=157 │ [call] │ macro_source=157 │ Dict{Symbol, Any} :: Value │ macro_source=157 │ :path => "/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl" :: Value │ macro_source=157 │ :linenumber => 224 :: Value │ macro_source=157 │ :module => GenericArpack :: Value │ macro_source=157 │ [where] │ │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ Symbol :: Identifier │ scope_layer=1 │ Bool :: Identifier │ scope_layer=1 │ Int :: Identifier │ scope_layer=1 │ [curly] │ │ AbstractVector :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ AbstractVecOrMat :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ AbstractFloat :: Identifier │ scope_layer=1 │ val :: Identifier │ scope_layer=3 │ │ 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)))))))))  └─ @ /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:1091  [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:1156  [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:1251  [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:1281  [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:327  [7] top-level scope  @ ~/.julia/packages/GenericArpack/p8u6Z/src/GenericArpack.jl:16  [8] include(mod::Module, _path::String)  @ Base Base.jl:326  [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:3296  [10] top-level scope  @ stdin:5  [11] eval(m::Module, e::Any)  @ Core boot.jl:521  [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 0.7 s ✓ KahanSummation 401.4 s ✓ IterTools 1.1 s ✓ Statistics 154.1 s ✓ OrderedCollections 0.9 s ✓ DelimitedFiles 1.5 s ✓ Compat 42.6 s ✓ Statistics → SparseArraysExt 0.6 s ✓ Compat → CompatLinearAlgebraExt 276.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:207  [12] top-level scope  @ ~/.julia/packages/MatrixNetworks/DyXwE/src/MatrixNetworks.jl:7  [13] include(mod::Module, _path::String)  @ Base Base.jl:326  [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:3296  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core boot.jl:521  [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 1002 seconds. 16 already precompiled. Precompilation completed after 1035.04s ################################################################################ # Testing # Testing MatrixNetworks Status `/tmp/jl_lKrNGR/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_lKrNGR/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.2+0 [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,macro_source,name_val,syntax_flags,meta,scope_layer,value,jl_source,is_toplevel_thunk,source,__macro_ctx__ │ [macrocall] │ │ @doc :: Identifier │ mod │ :(#= /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,macro_source,name_val,syntax_flags,meta,scope_layer,value,jl_source,is_toplevel_thunk,source │ [block] │ │ [=] │ │ val :: Identifier │ scope_layer=3 │ [function] │ │ [where] │ │ [call] │ │ dsortr :: Identifier │ scope_layer=1 │ [::] │ │ which :: Identifier │ scope_layer=1 │ Symbol :: Identifier │ scope_layer=1 │ [::] │ │ apply :: Identifier │ scope_layer=1 │ Bool :: Identifier │ scope_layer=1 │ [::] │ │ n :: Identifier │ scope_layer=1 │ Int :: Identifier │ scope_layer=1 │ [::] │ │ x1 :: Identifier │ scope_layer=1 │ [curly] │ │ AbstractVector :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ x2 :: Identifier │ scope_layer=1 │ AbstractVecOrMat :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ AbstractFloat :: Identifier │ scope_layer=1 │ [block] │ │ [block] │ │ [if] │ │ [call] │ │ > :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ throw :: Identifier │ scope_layer=1 │ [call] │ │ ArgumentError :: Identifier │ scope_layer=1 │ [call] │ │ string :: Identifier │ scope_layer=1 │ "range 1:n=" :: Value │ macro_source=157 │ n :: Identifier │ scope_layer=1 │ " out of bounds for x1 of length " :: Value │ macro_source=157 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ [if] │ │ apply :: Identifier │ scope_layer=1 │ [block] │ │ [block] │ │ [if] │ │ [call] │ │ > :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ throw :: Identifier │ scope_layer=1 │ [call] │ │ ArgumentError :: Identifier │ scope_layer=1 │ [call] │ │ string :: Identifier │ scope_layer=1 │ "range 1:n=" :: Value │ macro_source=157 │ n :: Identifier │ scope_layer=1 │ " out of bounds for x2 of length " :: Value │ macro_source=157 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [if] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ which :: Identifier │ scope_layer=1 │ [inert] │ │ SA :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ scope_layer=1 │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ y :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ < :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ y :: Identifier │ scope_layer=1 │ apply :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [elseif] │ │ [block] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ which :: Identifier │ scope_layer=1 │ [inert] │ │ SM :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ scope_layer=1 │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ y :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ < :: Identifier │ scope_layer=1 │ [call] │ │ abs :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [call] │ │ abs :: Identifier │ scope_layer=1 │ y :: Identifier │ scope_layer=1 │ apply :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [elseif] │ │ [block] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ which :: Identifier │ scope_layer=1 │ [inert] │ │ LA :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ scope_layer=1 │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ y :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ > :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ y :: Identifier │ scope_layer=1 │ apply :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [elseif] │ │ [block] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ which :: Identifier │ scope_layer=1 │ [inert] │ │ LM :: Identifier │ │ [block] │ │ [call] │ │ _dsortr_loop :: Identifier │ scope_layer=1 │ [->] │ │ [tuple] │ │ [::] │ │ x :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ y :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ > :: Identifier │ scope_layer=1 │ [call] │ │ abs :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [call] │ │ abs :: Identifier │ scope_layer=1 │ y :: Identifier │ scope_layer=1 │ apply :: Identifier │ scope_layer=1 │ n :: Identifier │ scope_layer=1 │ x1 :: Identifier │ scope_layer=1 │ x2 :: Identifier │ scope_layer=1 │ [call] │ │ Base.Docs.doc! :: Value │ macro_source=157 │ GenericArpack :: Value │ macro_source=157 │ [call] │ │ Base.Docs.Binding :: Value │ macro_source=157 │ GenericArpack :: Value │ │ [inert] │ jl_source=L65 │ dsortr :: Identifier │ │ [call] │ macro_source=157 │ Base.Docs.docstr :: Value │ macro_source=157 │ [call] │ macro_source=157 │ Core.svec :: Value │ macro_source=157 │ "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 │ macro_source=157 │ [call] │ macro_source=157 │ Dict{Symbol, Any} :: Value │ macro_source=157 │ :path => "/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl" :: Value │ macro_source=157 │ :linenumber => 224 :: Value │ macro_source=157 │ :module => GenericArpack :: Value │ macro_source=157 │ [where] │ │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ Symbol :: Identifier │ scope_layer=1 │ Bool :: Identifier │ scope_layer=1 │ Int :: Identifier │ scope_layer=1 │ [curly] │ │ AbstractVector :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ AbstractVecOrMat :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ AbstractFloat :: Identifier │ scope_layer=1 │ val :: Identifier │ scope_layer=3 │ │ 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)))))))))  └─ @ /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:1091  [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:1156  [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:1251  [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:1281  [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:327  [7] top-level scope  @ ~/.julia/packages/GenericArpack/p8u6Z/src/GenericArpack.jl:16  [8] include(mod::Module, _path::String)  @ Base Base.jl:326  [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:3296  [10] top-level scope  @ stdin:5  [11] eval(m::Module, e::Any)  @ Core boot.jl:521  [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:207  [12] top-level scope  @ ~/.julia/packages/MatrixNetworks/DyXwE/src/MatrixNetworks.jl:7  [13] include(mod::Module, _path::String)  @ Base Base.jl:326  [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:3296  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core boot.jl:521  [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: ┌ MatrixNetworks │ [Output was shown above] └ ┌ 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,macro_source,name_val,syntax_flags,meta,scope_layer,value,jl_source,is_toplevel_thunk,source,__macro_ctx__ │ │ [macrocall] │ │ │ @doc :: Identifier │ mod │ │ :(#= /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,macro_source,name_val,syntax_flags,meta,scope_layer,value,jl_source,is_toplevel_thunk,source │ │ [block] │ │ │ [=] │ │ │ val :: Identifier │ scope_layer=3 │ │ [function] │ │ │ [where] │ │ │ [call] │ │ │ dsortr :: Identifier │ scope_layer=1 │ │ [::] │ │ │ which :: Identifier │ scope_layer=1 │ │ Symbol :: Identifier │ scope_layer=1 │ │ [::] │ │ │ apply :: Identifier │ scope_layer=1 │ │ Bool :: Identifier │ scope_layer=1 │ │ [::] │ │ │ n :: Identifier │ scope_layer=1 │ │ Int :: Identifier │ scope_layer=1 │ │ [::] │ │ │ x1 :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ AbstractVector :: Identifier │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ [::] │ │ │ x2 :: Identifier │ scope_layer=1 │ │ AbstractVecOrMat :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ AbstractFloat :: Identifier │ scope_layer=1 │ │ [block] │ │ │ [block] │ │ │ [if] │ │ │ [call] │ │ │ > :: Identifier │ scope_layer=1 │ │ n :: Identifier │ scope_layer=1 │ │ [call] │ │ │ length :: Identifier │ scope_layer=1 │ │ x1 :: Identifier │ scope_layer=1 │ │ [block] │ │ │ [call] │ │ │ throw :: Identifier │ scope_layer=1 │ │ [call] │ │ │ ArgumentError :: Identifier │ scope_layer=1 │ │ [call] │ │ │ string :: Identifier │ scope_layer=1 │ │ "range 1:n=" :: Value │ macro_source=157 │ │ n :: Identifier │ scope_layer=1 │ │ " out of bounds for x1 of length " :: Value │ macro_source=157 │ │ [call] │ │ │ length :: Identifier │ scope_layer=1 │ │ x1 :: Identifier │ scope_layer=1 │ │ [if] │ │ │ apply :: Identifier │ scope_layer=1 │ │ [block] │ │ │ [block] │ │ │ [if] │ │ │ [call] │ │ │ > :: Identifier │ scope_layer=1 │ │ n :: Identifier │ scope_layer=1 │ │ [call] │ │ │ length :: Identifier │ scope_layer=1 │ │ x2 :: Identifier │ scope_layer=1 │ │ [block] │ │ │ [call] │ │ │ throw :: Identifier │ scope_layer=1 │ │ [call] │ │ │ ArgumentError :: Identifier │ scope_layer=1 │ │ [call] │ │ │ string :: Identifier │ scope_layer=1 │ │ "range 1:n=" :: Value │ macro_source=157 │ │ n :: Identifier │ scope_layer=1 │ │ " out of bounds for x2 of length " :: Value │ macro_source=157 │ │ [call] │ │ │ length :: Identifier │ scope_layer=1 │ │ x2 :: Identifier │ scope_layer=1 │ │ [if] │ │ │ [call] │ │ │ == :: Identifier │ scope_layer=1 │ │ which :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ SA :: Identifier │ │ │ [block] │ │ │ [call] │ │ │ _dsortr_loop :: Identifier │ scope_layer=1 │ │ [->] │ │ │ [tuple] │ │ │ [::] │ │ │ x :: Identifier │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ [::] │ │ │ y :: Identifier │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ [block] │ │ │ [call] │ │ │ < :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ y :: Identifier │ scope_layer=1 │ │ apply :: Identifier │ scope_layer=1 │ │ n :: Identifier │ scope_layer=1 │ │ x1 :: Identifier │ scope_layer=1 │ │ x2 :: Identifier │ scope_layer=1 │ │ [elseif] │ │ │ [block] │ │ │ [call] │ │ │ == :: Identifier │ scope_layer=1 │ │ which :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ SM :: Identifier │ │ │ [block] │ │ │ [call] │ │ │ _dsortr_loop :: Identifier │ scope_layer=1 │ │ [->] │ │ │ [tuple] │ │ │ [::] │ │ │ x :: Identifier │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ [::] │ │ │ y :: Identifier │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ [block] │ │ │ [call] │ │ │ < :: Identifier │ scope_layer=1 │ │ [call] │ │ │ abs :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ [call] │ │ │ abs :: Identifier │ scope_layer=1 │ │ y :: Identifier │ scope_layer=1 │ │ apply :: Identifier │ scope_layer=1 │ │ n :: Identifier │ scope_layer=1 │ │ x1 :: Identifier │ scope_layer=1 │ │ x2 :: Identifier │ scope_layer=1 │ │ [elseif] │ │ │ [block] │ │ │ [call] │ │ │ == :: Identifier │ scope_layer=1 │ │ which :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ LA :: Identifier │ │ │ [block] │ │ │ [call] │ │ │ _dsortr_loop :: Identifier │ scope_layer=1 │ │ [->] │ │ │ [tuple] │ │ │ [::] │ │ │ x :: Identifier │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ [::] │ │ │ y :: Identifier │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ [block] │ │ │ [call] │ │ │ > :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ y :: Identifier │ scope_layer=1 │ │ apply :: Identifier │ scope_layer=1 │ │ n :: Identifier │ scope_layer=1 │ │ x1 :: Identifier │ scope_layer=1 │ │ x2 :: Identifier │ scope_layer=1 │ │ [elseif] │ │ │ [block] │ │ │ [call] │ │ │ == :: Identifier │ scope_layer=1 │ │ which :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ LM :: Identifier │ │ │ [block] │ │ │ [call] │ │ │ _dsortr_loop :: Identifier │ scope_layer=1 │ │ [->] │ │ │ [tuple] │ │ │ [::] │ │ │ x :: Identifier │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ [::] │ │ │ y :: Identifier │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ [block] │ │ │ [call] │ │ │ > :: Identifier │ scope_layer=1 │ │ [call] │ │ │ abs :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ [call] │ │ │ abs :: Identifier │ scope_layer=1 │ │ y :: Identifier │ scope_layer=1 │ │ apply :: Identifier │ scope_layer=1 │ │ n :: Identifier │ scope_layer=1 │ │ x1 :: Identifier │ scope_layer=1 │ │ x2 :: Identifier │ scope_layer=1 │ │ [call] │ │ │ Base.Docs.doc! :: Value │ macro_source=157 │ │ GenericArpack :: Value │ macro_source=157 │ │ [call] │ │ │ Base.Docs.Binding :: Value │ macro_source=157 │ │ GenericArpack :: Value │ │ │ [inert] │ jl_source=L65 │ │ dsortr :: Identifier │ │ │ [call] │ macro_source=157 │ │ Base.Docs.docstr :: Value │ macro_source=157 │ │ [call] │ macro_source=157 │ │ Core.svec :: Value │ macro_source=157 │ │ "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 │ macro_source=157 │ │ [call] │ macro_source=157 │ │ Dict{Symbol, Any} :: Value │ macro_source=157 │ │ :path => "/home/pkgeval/.julia/packages/GenericArpack/p8u6Z/src/simple.jl" :: Value │ macro_source=157 │ │ :linenumber => 224 :: Value │ macro_source=157 │ │ :module => GenericArpack :: Value │ macro_source=157 │ │ [where] │ │ │ [curly] │ │ │ Union :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ Symbol :: Identifier │ scope_layer=1 │ │ Bool :: Identifier │ scope_layer=1 │ │ Int :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ AbstractVector :: Identifier │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ AbstractVecOrMat :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ AbstractFloat :: Identifier │ scope_layer=1 │ │ val :: Identifier │ scope_layer=3 │ │ │ │ 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))))))))) │ └─ @ /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:1091 │ [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:1156 │ [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:1251 │ [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:1281 │ [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:327 │ [7] top-level scope │ @ ~/.julia/packages/GenericArpack/p8u6Z/src/GenericArpack.jl:16 │ [8] include(mod::Module, _path::String) │ @ Base Base.jl:326 │ [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:3296 │ [10] top-level scope │ @ stdin:5 │ [11] eval(m::Module, e::Any) │ @ Core boot.jl:521 │ [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: The following 2 packages failed to precompile: MatrixNetworks Failed to precompile MatrixNetworks [4f449596-a032-5618-b826-5a251cb6dc11] to "/home/pkgeval/.julia/compiled/v1.14/MatrixNetworks/jl_hPh58T" (ProcessExited(1)). GenericArpack Failed to precompile GenericArpack [408c25d7-97fa-4992-8bd9-ce15f1a09fe9] to "/home/pkgeval/.julia/compiled/v1.14/GenericArpack/jl_GPL16v" (ProcessExited(1)). in expression starting at /home/pkgeval/.julia/packages/MatrixNetworks/DyXwE/test/runtests.jl:1 Testing failed after 136.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:326 [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 1212.32s: package fails to precompile