Package evaluation to test PowerDynData on Julia 1.14.0-DEV.2226 (797a5ef2b0*) started at 2026-05-23T22:12:54.980 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 16.84s ################################################################################ # Installation # Installing PowerDynData... Resolving package versions... Installed IteratorInterfaceExtensions ─ v1.0.0 Installed DataAPI ───────────────────── v1.16.0 Installed TableTraits ───────────────── v1.0.1 Installed Libiconv_jll ──────────────── v1.18.0+0 Installed StringEncodings ───────────── v0.3.7 Installed JLLWrappers ───────────────── v1.8.0 Installed DataValueInterfaces ───────── v1.0.0 Installed YAML ──────────────────────── v0.4.16 Installed StructArrays ──────────────── v0.7.3 Installed Preferences ───────────────── v1.5.2 Installed InlineStrings ─────────────── v1.4.5 Installed PrecompileTools ───────────── v1.3.4 Installed Parsers ───────────────────── v2.8.4 Installed ConstructionBase ──────────── v1.6.0 Installed Tables ────────────────────── v1.12.1 Installed OrderedCollections ────────── v1.8.1 Installed DocStringExtensions ───────── v0.9.5 Installed PowerDynData ──────────────── v0.3.0 Installing 1 artifacts Installed artifact Libiconv 1.9 MiB Updating `~/.julia/environments/v1.14/Project.toml` [8af9307f] + PowerDynData v0.3.0 Updating `~/.julia/environments/v1.14/Manifest.toml` [187b0558] + ConstructionBase v1.6.0 [9a962f9c] + DataAPI v1.16.0 [e2d170a0] + DataValueInterfaces v1.0.0 [ffbed154] + DocStringExtensions v0.9.5 [842dd82b] + InlineStrings v1.4.5 [82899510] + IteratorInterfaceExtensions v1.0.0 [692b3bcd] + JLLWrappers v1.8.0 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.4 [8af9307f] + PowerDynData v0.3.0 [aea7be01] + PrecompileTools v1.3.4 [21216c6a] + Preferences v1.5.2 [69024149] + StringEncodings v0.3.7 [09ab397b] + StructArrays v0.7.3 [3783bdb8] + TableTraits v1.0.1 [bd369af6] + Tables v1.12.1 [ddb6d928] + YAML v0.4.16 [94ce4f54] + Libiconv_jll v1.18.0+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8f399da3] + Libdl v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.13.0 [fa267f1f] + TOML v1.0.3 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 Installation completed after 8.33s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling project... 5.6 s ✓ TestEnv 1 dependency successfully precompiled in 6 seconds. 27 already precompiled. Precompiling package dependencies... Precompiling project... 2.0 s ✓ Crayons 308.1 s ✓ InlineStrings 0.5 s ✓ Reexport 1.0 s ✓ Statistics 1.0 s ✓ DataAPI 1.0 s ✓ ConstructionBase 0.5 s ✓ DataValueInterfaces 150.7 s ✓ OrderedCollections 39.1 s ✓ InvertedIndices 1.0 s ✓ DocStringExtensions 1.2 s ✓ IteratorInterfaceExtensions 41.1 s ✓ LaTeXStrings 155.5 s ✓ SentinelArrays 1.4 s ✓ Compat 2.3 s ✓ Preferences 62.5 s ✓ Missings ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =# Core.@doc " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" function (Base.map(f, x::PooledArray{<:Any, R, N, RA}; pure::Bool = false)::Union{PooledArray{<:Any, R, N, RA}, PooledArray{<:Any, Int, N, typeof(similar(x.refs, Int, ntuple((i->begin │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:338 =# │ 0 │ end), ndims(x.refs))))}}) where {R, N, RA} │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:339 =# │ pure && return _map_pure(f, x) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:340 =# │ length(x) == 0 && return PooledArray([f(v) for v = x]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:341 =# │ v1 = f(x[1]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:342 =# │ invpool = Dict(v1 => one(eltype(x.refs))) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:343 =# │ pool = [v1] │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:344 =# │ labels = similar(x.refs) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:345 =# │ labels[1] = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:346 =# │ nlabels = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:347 =# │ return _map_notpure(f, x, 2, invpool, pool, labels, nlabels) │ 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/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) :: Value │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ │ [function] │ │ [where] │ │ [::] │ │ [call] │ │ [.] │ │ Base :: Identifier │ │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ │ Bool :: Identifier │ │ false :: Value │ │ f :: Identifier │ │ [::] │ │ x :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ Union :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ Int :: Identifier │ │ N :: Identifier │ │ [call] │ │ typeof :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ │ [call] │ │ ntuple :: Identifier │ │ [->] │ │ i :: Identifier │ │ [block] │ │ 0 :: Value │ │ [call] │ │ ndims :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [block] │ │ [&&] │ │ pure :: Identifier │ │ [return] │ │ [call] │ │ _map_pure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ [&&] │ │ [call] │ │ == :: Identifier │ │ [call] │ │ length :: Identifier │ │ x :: Identifier │ │ 0 :: Value │ │ [return] │ │ [call] │ │ PooledArray :: Identifier │ │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ │ v :: Identifier │ │ [=] │ │ v :: Identifier │ │ x :: Identifier │ │ [=] │ │ v1 :: Identifier │ │ [call] │ │ f :: Identifier │ │ [ref] │ │ x :: Identifier │ │ 1 :: Value │ │ [=] │ │ invpool :: Identifier │ │ [call] │ │ Dict :: Identifier │ │ [call] │ │ => :: Identifier │ │ v1 :: Identifier │ │ [call] │ │ one :: Identifier │ │ [call] │ │ eltype :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ │ [vect] │ │ v1 :: Identifier │ │ [=] │ │ labels :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ │ 1 :: Value │ │ 1 :: Value │ │ [=] │ │ nlabels :: Identifier │ │ 1 :: Value │ │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ 2 :: Value │ │ invpool :: Identifier │ │ pool :: Identifier │ │ labels :: Identifier │ │ nlabels :: 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] │ │ [.] │ │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ scope_layer=1 │ Bool :: Identifier │ scope_layer=1 │ false :: Value │ macro_source=145 │ f :: Identifier │ scope_layer=1 │ [::] │ │ x :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ Int :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [call] │ │ typeof :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ scope_layer=1 │ [call] │ │ ntuple :: Identifier │ scope_layer=1 │ [->] │ │ i :: Identifier │ scope_layer=1 │ [block] │ macro_source=145 │ 0 :: Value │ macro_source=145 │ [call] │ │ ndims :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [block] │ │ [&&] │ │ pure :: Identifier │ scope_layer=1 │ [return] │ │ [call] │ │ _map_pure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [&&] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 0 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ PooledArray :: Identifier │ scope_layer=1 │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ scope_layer=1 │ v :: Identifier │ scope_layer=1 │ [=] │ │ v :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [=] │ │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ f :: Identifier │ scope_layer=1 │ [ref] │ │ x :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [=] │ │ invpool :: Identifier │ scope_layer=1 │ [call] │ │ Dict :: Identifier │ scope_layer=1 │ [call] │ │ => :: Identifier │ scope_layer=1 │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ one :: Identifier │ scope_layer=1 │ [call] │ │ eltype :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ scope_layer=1 │ [vect] │ │ v1 :: Identifier │ scope_layer=1 │ [=] │ │ labels :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ 1 :: Value │ macro_source=145 │ [=] │ │ nlabels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 2 :: Value │ macro_source=145 │ invpool :: Identifier │ scope_layer=1 │ pool :: Identifier │ scope_layer=1 │ labels :: Identifier │ scope_layer=1 │ nlabels :: Identifier │ scope_layer=1 │ [call] │ │ Base.Docs.doc! :: Value │ macro_source=145 │ PooledArrays :: Value │ macro_source=145 │ [call] │ │ Base.Docs.Binding :: Value │ macro_source=145 │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [call] │ macro_source=145 │ Base.Docs.docstr :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Core.svec :: Value │ macro_source=145 │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Dict{Symbol, Any} :: Value │ macro_source=145 │ :path => "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" :: Value │ macro_source=145 │ :linenumber => 322 :: Value │ macro_source=145 │ :module => PooledArrays :: Value │ macro_source=145 │ [where] │ │ [where] │ │ [where] │ │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ val :: Identifier │ scope_layer=3 │ │ file = "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" │ line = 322 └ mod = PooledArrays ERROR: LoadError: internal lowering bug: #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# - `jl_assert(!(haskey(ssa_rewrites, lhs_id)), _)`: multiple assignments to ssavalue Expression:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) Containing expressions:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any))  Detailed provenance:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) @#= /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:366 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/closure_conversion.jl:197 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any))  └─ (call core.TypeVar :#T1 Any) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3025 =#  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  ├─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" (function (where (:: (call (. Base (inert map)) (parameters (kw (:: pure Bool) false)) f (:: x (curly PooledArray (<: Any) R N RA))) (curly Union (curly PooledArray (<: Any) R N RA) (curly PooledArray (<: Any) Int N (call typeof (call similar (. x (inert refs)) Int (call ntuple (-> i (block 0)) (call ndims (. x (inert refs))))))))) R N RA) (block (&& pure (return (call _map_pure f x))) (&& (call == (call length x) 0) (return (call PooledArray (comprehension (generator (call f v) (= v x)))))) (= v1 (call f (ref x 1))) (= invpool (call Dict (call => v1 (call one (call eltype (. x (inert refs))))))) (= pool (vect v1)) (= labels (call similar (. x (inert refs)))) (= (ref labels 1) 1) (= nlabels 1) (return (call _map_notpure f x 2 invpool pool labels nlabels)))))  └─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322  Stacktrace:  [1] iterate(A::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}})  @ Base /source/usr/share/julia/JuliaLowering/src/ast.jl:23 [inlined]  [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:1106  [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:1223  [4] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:851  [5] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:712  [6] compile_body(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:1007  [7] 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:1163  [8] 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:1253  [9] 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  [10] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [11] 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:3271  [12] top-level scope  @ stdin:5  [13] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [14] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [15] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [inlined]  [16] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:353  [17] _start()  @ Base ./client.jl:596 in expression starting at /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:1 in expression starting at stdin:5 ✗ PooledArrays 0.5 s ✓ ConstructionBase → ConstructionBaseLinearAlgebraExt 182.9 s ✓ DataStructures 0.5 s ✓ TableTraits 0.6 s ✓ Compat → CompatLinearAlgebraExt 2.7 s ✓ JLLWrappers 2.5 s ✓ PrecompileTools 38.7 s ✓ SortingAlgorithms 166.4 s ✓ Tables 3.0 s ✓ Libiconv_jll 71.4 s ✓ StringManipulation 26.2 s ✓ Parsers 119.9 s ✓ StructArrays 50.2 s ✓ StringEncodings 196.2 s ✓ PrettyTables 43.8 s ✓ InlineStrings → ParsersExt 38.5 s ✓ StructArrays → StructArraysLinearAlgebraExt 72.5 s ✓ YAML ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("2dfb63ee-cc39-5dd5-95bd-886bf059d720"), "PooledArrays") 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:2818  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2672  [4] macro expansion  @ ./loading.jl:2599 [inlined]  [5] string(::String, ::Union{Char, SubString{String}, String, Symbol}, ::Symbol, ::String)  @ Base ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2563  [7] require  @ ./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/DataFrames/0Y1g5/src/DataFrames.jl:3  [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:3271  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [18] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [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/DataFrames/0Y1g5/src/DataFrames.jl:1 in expression starting at stdin:5 ✗ DataFrames 164.8 s ✓ PowerDynData 34 dependencies successfully precompiled in 1959 seconds. 15 already precompiled. Precompilation completed after 1978.81s ################################################################################ # Testing # Testing PowerDynData Status `/tmp/jl_C6JGKB/Project.toml` [a93c6f00] DataFrames v1.8.2 [ffbed154] DocStringExtensions v0.9.5 [842dd82b] InlineStrings v1.4.5 [69de0a69] Parsers v2.8.4 [8af9307f] PowerDynData v0.3.0 [aea7be01] PrecompileTools v1.3.4 [09ab397b] StructArrays v0.7.3 [bd369af6] Tables v1.12.1 [ddb6d928] YAML v0.4.16 [fa267f1f] TOML v1.0.3 [8dfed614] Test v1.11.0 Status `/tmp/jl_C6JGKB/Manifest.toml` [34da2185] Compat v4.18.1 [187b0558] ConstructionBase v1.6.0 [a8cc5b0e] Crayons v4.1.1 [9a962f9c] DataAPI v1.16.0 [a93c6f00] DataFrames v1.8.2 [864edb3b] DataStructures v0.19.4 [e2d170a0] DataValueInterfaces v1.0.0 [ffbed154] DocStringExtensions v0.9.5 [842dd82b] InlineStrings v1.4.5 [41ab1584] InvertedIndices v1.3.1 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.8.0 [b964fa9f] LaTeXStrings v1.4.0 [e1d29d7a] Missings v1.2.0 [bac558e1] OrderedCollections v1.8.1 [69de0a69] Parsers v2.8.4 [2dfb63ee] PooledArrays v1.4.3 [8af9307f] PowerDynData v0.3.0 [aea7be01] PrecompileTools v1.3.4 [21216c6a] Preferences v1.5.2 [08abe8d2] PrettyTables v3.3.2 [189a3867] Reexport v1.2.2 [91c51154] SentinelArrays v1.4.10 [a2af1166] SortingAlgorithms v1.2.2 [10745b16] Statistics v1.11.1 [69024149] StringEncodings v0.3.7 [892a3eda] StringManipulation v0.4.4 [09ab397b] StructArrays v0.7.3 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [ddb6d928] YAML v0.4.16 [94ce4f54] Libiconv_jll v1.18.0+0 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [de0858da] Printf v1.11.0 [3fa0cd96] REPL v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.13.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.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.1+0 [4536629a] OpenBLAS_jll v0.3.33+0 [8e850b90] libblastrampoline_jll v5.15.0+0 Testing Running tests... ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =# Core.@doc " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" function (Base.map(f, x::PooledArray{<:Any, R, N, RA}; pure::Bool = false)::Union{PooledArray{<:Any, R, N, RA}, PooledArray{<:Any, Int, N, typeof(similar(x.refs, Int, ntuple((i->begin │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:338 =# │ 0 │ end), ndims(x.refs))))}}) where {R, N, RA} │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:339 =# │ pure && return _map_pure(f, x) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:340 =# │ length(x) == 0 && return PooledArray([f(v) for v = x]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:341 =# │ v1 = f(x[1]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:342 =# │ invpool = Dict(v1 => one(eltype(x.refs))) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:343 =# │ pool = [v1] │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:344 =# │ labels = similar(x.refs) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:345 =# │ labels[1] = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:346 =# │ nlabels = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:347 =# │ return _map_notpure(f, x, 2, invpool, pool, labels, nlabels) │ 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/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) :: Value │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ │ [function] │ │ [where] │ │ [::] │ │ [call] │ │ [.] │ │ Base :: Identifier │ │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ │ Bool :: Identifier │ │ false :: Value │ │ f :: Identifier │ │ [::] │ │ x :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ Union :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ Int :: Identifier │ │ N :: Identifier │ │ [call] │ │ typeof :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ │ [call] │ │ ntuple :: Identifier │ │ [->] │ │ i :: Identifier │ │ [block] │ │ 0 :: Value │ │ [call] │ │ ndims :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [block] │ │ [&&] │ │ pure :: Identifier │ │ [return] │ │ [call] │ │ _map_pure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ [&&] │ │ [call] │ │ == :: Identifier │ │ [call] │ │ length :: Identifier │ │ x :: Identifier │ │ 0 :: Value │ │ [return] │ │ [call] │ │ PooledArray :: Identifier │ │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ │ v :: Identifier │ │ [=] │ │ v :: Identifier │ │ x :: Identifier │ │ [=] │ │ v1 :: Identifier │ │ [call] │ │ f :: Identifier │ │ [ref] │ │ x :: Identifier │ │ 1 :: Value │ │ [=] │ │ invpool :: Identifier │ │ [call] │ │ Dict :: Identifier │ │ [call] │ │ => :: Identifier │ │ v1 :: Identifier │ │ [call] │ │ one :: Identifier │ │ [call] │ │ eltype :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ │ [vect] │ │ v1 :: Identifier │ │ [=] │ │ labels :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ │ 1 :: Value │ │ 1 :: Value │ │ [=] │ │ nlabels :: Identifier │ │ 1 :: Value │ │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ 2 :: Value │ │ invpool :: Identifier │ │ pool :: Identifier │ │ labels :: Identifier │ │ nlabels :: 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] │ │ [.] │ │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ scope_layer=1 │ Bool :: Identifier │ scope_layer=1 │ false :: Value │ macro_source=145 │ f :: Identifier │ scope_layer=1 │ [::] │ │ x :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ Int :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [call] │ │ typeof :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ scope_layer=1 │ [call] │ │ ntuple :: Identifier │ scope_layer=1 │ [->] │ │ i :: Identifier │ scope_layer=1 │ [block] │ macro_source=145 │ 0 :: Value │ macro_source=145 │ [call] │ │ ndims :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [block] │ │ [&&] │ │ pure :: Identifier │ scope_layer=1 │ [return] │ │ [call] │ │ _map_pure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [&&] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 0 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ PooledArray :: Identifier │ scope_layer=1 │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ scope_layer=1 │ v :: Identifier │ scope_layer=1 │ [=] │ │ v :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [=] │ │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ f :: Identifier │ scope_layer=1 │ [ref] │ │ x :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [=] │ │ invpool :: Identifier │ scope_layer=1 │ [call] │ │ Dict :: Identifier │ scope_layer=1 │ [call] │ │ => :: Identifier │ scope_layer=1 │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ one :: Identifier │ scope_layer=1 │ [call] │ │ eltype :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ scope_layer=1 │ [vect] │ │ v1 :: Identifier │ scope_layer=1 │ [=] │ │ labels :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ 1 :: Value │ macro_source=145 │ [=] │ │ nlabels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 2 :: Value │ macro_source=145 │ invpool :: Identifier │ scope_layer=1 │ pool :: Identifier │ scope_layer=1 │ labels :: Identifier │ scope_layer=1 │ nlabels :: Identifier │ scope_layer=1 │ [call] │ │ Base.Docs.doc! :: Value │ macro_source=145 │ PooledArrays :: Value │ macro_source=145 │ [call] │ │ Base.Docs.Binding :: Value │ macro_source=145 │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [call] │ macro_source=145 │ Base.Docs.docstr :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Core.svec :: Value │ macro_source=145 │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Dict{Symbol, Any} :: Value │ macro_source=145 │ :path => "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" :: Value │ macro_source=145 │ :linenumber => 322 :: Value │ macro_source=145 │ :module => PooledArrays :: Value │ macro_source=145 │ [where] │ │ [where] │ │ [where] │ │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ val :: Identifier │ scope_layer=3 │ │ file = "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" │ line = 322 └ mod = PooledArrays ERROR: LoadError: internal lowering bug: #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# - `jl_assert(!(haskey(ssa_rewrites, lhs_id)), _)`: multiple assignments to ssavalue Expression:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) Containing expressions:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any))  Detailed provenance:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) @#= /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:366 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/closure_conversion.jl:197 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any))  └─ (call core.TypeVar :#T1 Any) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3025 =#  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  ├─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" (function (where (:: (call (. Base (inert map)) (parameters (kw (:: pure Bool) false)) f (:: x (curly PooledArray (<: Any) R N RA))) (curly Union (curly PooledArray (<: Any) R N RA) (curly PooledArray (<: Any) Int N (call typeof (call similar (. x (inert refs)) Int (call ntuple (-> i (block 0)) (call ndims (. x (inert refs))))))))) R N RA) (block (&& pure (return (call _map_pure f x))) (&& (call == (call length x) 0) (return (call PooledArray (comprehension (generator (call f v) (= v x)))))) (= v1 (call f (ref x 1))) (= invpool (call Dict (call => v1 (call one (call eltype (. x (inert refs))))))) (= pool (vect v1)) (= labels (call similar (. x (inert refs)))) (= (ref labels 1) 1) (= nlabels 1) (return (call _map_notpure f x 2 invpool pool labels nlabels)))))  └─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322  Stacktrace:  [1] iterate(A::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}})  @ Base /source/usr/share/julia/JuliaLowering/src/ast.jl:23 [inlined]  [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:1106  [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:1223  [4] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:851  [5] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:712  [6] compile_body(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:1007  [7] 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:1163  [8] 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:1253  [9] 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  [10] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [11] 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:3271  [12] top-level scope  @ stdin:5  [13] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [14] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [15] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [inlined]  [16] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:353  [17] _start()  @ Base ./client.jl:596 in expression starting at /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:1 in expression starting at stdin:5 ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("2dfb63ee-cc39-5dd5-95bd-886bf059d720"), "PooledArrays") 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:2818  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2672  [4] macro expansion  @ ./loading.jl:2599 [inlined]  [5] string(::String, ::Union{Char, SubString{String}, String, Symbol}, ::Symbol, ::String)  @ Base ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2563  [7] require  @ ./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/DataFrames/0Y1g5/src/DataFrames.jl:3  [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:3271  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [18] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [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/DataFrames/0Y1g5/src/DataFrames.jl:1 in expression starting at stdin:5 2 dependencies had output during precompilation: ┌ PooledArrays │ ┌ Info: JuliaLowering threw given input: │ │ code = │ │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =# Core.@doc " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" function (Base.map(f, x::PooledArray{<:Any, R, N, RA}; pure::Bool = false)::Union{PooledArray{<:Any, R, N, RA}, PooledArray{<:Any, Int, N, typeof(similar(x.refs, Int, ntuple((i->begin │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:338 =# │ │ 0 │ │ end), ndims(x.refs))))}}) where {R, N, RA} │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:339 =# │ │ pure && return _map_pure(f, x) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:340 =# │ │ length(x) == 0 && return PooledArray([f(v) for v = x]) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:341 =# │ │ v1 = f(x[1]) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:342 =# │ │ invpool = Dict(v1 => one(eltype(x.refs))) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:343 =# │ │ pool = [v1] │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:344 =# │ │ labels = similar(x.refs) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:345 =# │ │ labels[1] = 1 │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:346 =# │ │ nlabels = 1 │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:347 =# │ │ return _map_notpure(f, x, 2, invpool, pool, labels, nlabels) │ │ 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/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) :: Value │ │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ │ │ [function] │ │ │ [where] │ │ │ [::] │ │ │ [call] │ │ │ [.] │ │ │ Base :: Identifier │ │ │ [inert] │ │ │ map :: Identifier │ │ │ [parameters] │ │ │ [kw] │ │ │ [::] │ │ │ pure :: Identifier │ │ │ Bool :: Identifier │ │ │ false :: Value │ │ │ f :: Identifier │ │ │ [::] │ │ │ x :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [curly] │ │ │ Union :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ Int :: Identifier │ │ │ N :: Identifier │ │ │ [call] │ │ │ typeof :: Identifier │ │ │ [call] │ │ │ similar :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ Int :: Identifier │ │ │ [call] │ │ │ ntuple :: Identifier │ │ │ [->] │ │ │ i :: Identifier │ │ │ [block] │ │ │ 0 :: Value │ │ │ [call] │ │ │ ndims :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [block] │ │ │ [&&] │ │ │ pure :: Identifier │ │ │ [return] │ │ │ [call] │ │ │ _map_pure :: Identifier │ │ │ f :: Identifier │ │ │ x :: Identifier │ │ │ [&&] │ │ │ [call] │ │ │ == :: Identifier │ │ │ [call] │ │ │ length :: Identifier │ │ │ x :: Identifier │ │ │ 0 :: Value │ │ │ [return] │ │ │ [call] │ │ │ PooledArray :: Identifier │ │ │ [comprehension] │ │ │ [generator] │ │ │ [call] │ │ │ f :: Identifier │ │ │ v :: Identifier │ │ │ [=] │ │ │ v :: Identifier │ │ │ x :: Identifier │ │ │ [=] │ │ │ v1 :: Identifier │ │ │ [call] │ │ │ f :: Identifier │ │ │ [ref] │ │ │ x :: Identifier │ │ │ 1 :: Value │ │ │ [=] │ │ │ invpool :: Identifier │ │ │ [call] │ │ │ Dict :: Identifier │ │ │ [call] │ │ │ => :: Identifier │ │ │ v1 :: Identifier │ │ │ [call] │ │ │ one :: Identifier │ │ │ [call] │ │ │ eltype :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ pool :: Identifier │ │ │ [vect] │ │ │ v1 :: Identifier │ │ │ [=] │ │ │ labels :: Identifier │ │ │ [call] │ │ │ similar :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ [ref] │ │ │ labels :: Identifier │ │ │ 1 :: Value │ │ │ 1 :: Value │ │ │ [=] │ │ │ nlabels :: Identifier │ │ │ 1 :: Value │ │ │ [return] │ │ │ [call] │ │ │ _map_notpure :: Identifier │ │ │ f :: Identifier │ │ │ x :: Identifier │ │ │ 2 :: Value │ │ │ invpool :: Identifier │ │ │ pool :: Identifier │ │ │ labels :: Identifier │ │ │ nlabels :: 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] │ │ │ [.] │ │ │ Base :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ map :: Identifier │ │ │ [parameters] │ │ │ [kw] │ │ │ [::] │ │ │ pure :: Identifier │ scope_layer=1 │ │ Bool :: Identifier │ scope_layer=1 │ │ false :: Value │ macro_source=145 │ │ f :: Identifier │ scope_layer=1 │ │ [::] │ │ │ x :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Union :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ Int :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ [call] │ │ │ typeof :: Identifier │ scope_layer=1 │ │ [call] │ │ │ similar :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ Int :: Identifier │ scope_layer=1 │ │ [call] │ │ │ ntuple :: Identifier │ scope_layer=1 │ │ [->] │ │ │ i :: Identifier │ scope_layer=1 │ │ [block] │ macro_source=145 │ │ 0 :: Value │ macro_source=145 │ │ [call] │ │ │ ndims :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [block] │ │ │ [&&] │ │ │ pure :: Identifier │ scope_layer=1 │ │ [return] │ │ │ [call] │ │ │ _map_pure :: Identifier │ scope_layer=1 │ │ f :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ [&&] │ │ │ [call] │ │ │ == :: Identifier │ scope_layer=1 │ │ [call] │ │ │ length :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ 0 :: Value │ macro_source=145 │ │ [return] │ │ │ [call] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [comprehension] │ │ │ [generator] │ │ │ [call] │ │ │ f :: Identifier │ scope_layer=1 │ │ v :: Identifier │ scope_layer=1 │ │ [=] │ │ │ v :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ [=] │ │ │ v1 :: Identifier │ scope_layer=1 │ │ [call] │ │ │ f :: Identifier │ scope_layer=1 │ │ [ref] │ │ │ x :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ [=] │ │ │ invpool :: Identifier │ scope_layer=1 │ │ [call] │ │ │ Dict :: Identifier │ scope_layer=1 │ │ [call] │ │ │ => :: Identifier │ scope_layer=1 │ │ v1 :: Identifier │ scope_layer=1 │ │ [call] │ │ │ one :: Identifier │ scope_layer=1 │ │ [call] │ │ │ eltype :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ pool :: Identifier │ scope_layer=1 │ │ [vect] │ │ │ v1 :: Identifier │ scope_layer=1 │ │ [=] │ │ │ labels :: Identifier │ scope_layer=1 │ │ [call] │ │ │ similar :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ [ref] │ │ │ labels :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ 1 :: Value │ macro_source=145 │ │ [=] │ │ │ nlabels :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ [return] │ │ │ [call] │ │ │ _map_notpure :: Identifier │ scope_layer=1 │ │ f :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ 2 :: Value │ macro_source=145 │ │ invpool :: Identifier │ scope_layer=1 │ │ pool :: Identifier │ scope_layer=1 │ │ labels :: Identifier │ scope_layer=1 │ │ nlabels :: Identifier │ scope_layer=1 │ │ [call] │ │ │ Base.Docs.doc! :: Value │ macro_source=145 │ │ PooledArrays :: Value │ macro_source=145 │ │ [call] │ │ │ Base.Docs.Binding :: Value │ macro_source=145 │ │ Base :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ map :: Identifier │ │ │ [call] │ macro_source=145 │ │ Base.Docs.docstr :: Value │ macro_source=145 │ │ [call] │ macro_source=145 │ │ Core.svec :: Value │ macro_source=145 │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ macro_source=145 │ │ [call] │ macro_source=145 │ │ Dict{Symbol, Any} :: Value │ macro_source=145 │ │ :path => "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" :: Value │ macro_source=145 │ │ :linenumber => 322 :: Value │ macro_source=145 │ │ :module => PooledArrays :: Value │ macro_source=145 │ │ [where] │ │ │ [where] │ │ │ [where] │ │ │ [curly] │ │ │ Union :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ val :: Identifier │ scope_layer=3 │ │ │ │ file = "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" │ │ line = 322 │ └ mod = PooledArrays │ ERROR: LoadError: internal lowering bug: │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# - `jl_assert(!(haskey(ssa_rewrites, lhs_id)), _)`: multiple assignments to ssavalue │ Expression: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) │ Containing expressions: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) │ │ Detailed provenance: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) @#= /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:366 =# │ └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/closure_conversion.jl:197 =# │ └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =# │ └─ (= #₅ (call core.TypeVar :#T1 Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =# │ └─ (= #₅ (call core.TypeVar :#T1 Any)) │ └─ (call core.TypeVar :#T1 Any) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3025 =# │ └─ (<: Any) │ └─ (<: Any) │ └─ (<: Any) │ └─ (<: Any) │ ├─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" (function (where (:: (call (. Base (inert map)) (parameters (kw (:: pure Bool) false)) f (:: x (curly PooledArray (<: Any) R N RA))) (curly Union (curly PooledArray (<: Any) R N RA) (curly PooledArray (<: Any) Int N (call typeof (call similar (. x (inert refs)) Int (call ntuple (-> i (block 0)) (call ndims (. x (inert refs))))))))) R N RA) (block (&& pure (return (call _map_pure f x))) (&& (call == (call length x) 0) (return (call PooledArray (comprehension (generator (call f v) (= v x)))))) (= v1 (call f (ref x 1))) (= invpool (call Dict (call => v1 (call one (call eltype (. x (inert refs))))))) (= pool (vect v1)) (= labels (call similar (. x (inert refs)))) (= (ref labels 1) 1) (= nlabels 1) (return (call _map_notpure f x 2 invpool pool labels nlabels))))) │ └─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 │ │ Stacktrace: │ [1] iterate(A::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}) │ @ Base /source/usr/share/julia/JuliaLowering/src/ast.jl:23 [inlined] │ [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:1106 │ [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:1223 │ [4] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:851 │ [5] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:712 │ [6] compile_body(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:1007 │ [7] 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:1163 │ [8] 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:1253 │ [9] 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 │ [10] include(mod::Module, _path::String) │ @ Base ./Base.jl:326 │ [11] 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:3271 │ [12] top-level scope │ @ stdin:5 │ [13] eval(m::Module, e::Any) │ @ Core ./boot.jl:517 │ [14] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String) │ @ Base ./loading.jl:3113 │ [15] push!(a::Vector{SubString{String}}, item::String) │ @ Base ./loading.jl:3123 [inlined] │ [16] exec_options(opts::Base.JLOptions) │ @ Base ./client.jl:353 │ [17] _start() │ @ Base ./client.jl:596 │ in expression starting at /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:1 │ in expression starting at stdin:5 └ ┌ DataFrames │ [Output was shown above] └ DYR file parsing (with metadata): Error During Test at /home/pkgeval/.julia/packages/PowerDynData/91X2a/test/runtests.jl:81 Got exception outside of a @test The following 2 packages failed to precompile: PooledArrays Failed to precompile PooledArrays [2dfb63ee-cc39-5dd5-95bd-886bf059d720] to "/home/pkgeval/.julia/compiled/v1.14/PooledArrays/jl_WPcJM3" (ProcessExited(1)). DataFrames Failed to precompile DataFrames [a93c6f00-e57d-5684-b7b6-d8193f3e46c0] to "/home/pkgeval/.julia/compiled/v1.14/DataFrames/jl_S3PTqX" (ProcessExited(1)). ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =# Core.@doc " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" function (Base.map(f, x::PooledArray{<:Any, R, N, RA}; pure::Bool = false)::Union{PooledArray{<:Any, R, N, RA}, PooledArray{<:Any, Int, N, typeof(similar(x.refs, Int, ntuple((i->begin │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:338 =# │ 0 │ end), ndims(x.refs))))}}) where {R, N, RA} │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:339 =# │ pure && return _map_pure(f, x) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:340 =# │ length(x) == 0 && return PooledArray([f(v) for v = x]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:341 =# │ v1 = f(x[1]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:342 =# │ invpool = Dict(v1 => one(eltype(x.refs))) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:343 =# │ pool = [v1] │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:344 =# │ labels = similar(x.refs) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:345 =# │ labels[1] = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:346 =# │ nlabels = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:347 =# │ return _map_notpure(f, x, 2, invpool, pool, labels, nlabels) │ 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/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) :: Value │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ │ [function] │ │ [where] │ │ [::] │ │ [call] │ │ [.] │ │ Base :: Identifier │ │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ │ Bool :: Identifier │ │ false :: Value │ │ f :: Identifier │ │ [::] │ │ x :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ Union :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ Int :: Identifier │ │ N :: Identifier │ │ [call] │ │ typeof :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ │ [call] │ │ ntuple :: Identifier │ │ [->] │ │ i :: Identifier │ │ [block] │ │ 0 :: Value │ │ [call] │ │ ndims :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [block] │ │ [&&] │ │ pure :: Identifier │ │ [return] │ │ [call] │ │ _map_pure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ [&&] │ │ [call] │ │ == :: Identifier │ │ [call] │ │ length :: Identifier │ │ x :: Identifier │ │ 0 :: Value │ │ [return] │ │ [call] │ │ PooledArray :: Identifier │ │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ │ v :: Identifier │ │ [=] │ │ v :: Identifier │ │ x :: Identifier │ │ [=] │ │ v1 :: Identifier │ │ [call] │ │ f :: Identifier │ │ [ref] │ │ x :: Identifier │ │ 1 :: Value │ │ [=] │ │ invpool :: Identifier │ │ [call] │ │ Dict :: Identifier │ │ [call] │ │ => :: Identifier │ │ v1 :: Identifier │ │ [call] │ │ one :: Identifier │ │ [call] │ │ eltype :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ │ [vect] │ │ v1 :: Identifier │ │ [=] │ │ labels :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ │ 1 :: Value │ │ 1 :: Value │ │ [=] │ │ nlabels :: Identifier │ │ 1 :: Value │ │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ 2 :: Value │ │ invpool :: Identifier │ │ pool :: Identifier │ │ labels :: Identifier │ │ nlabels :: 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] │ │ [.] │ │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ scope_layer=1 │ Bool :: Identifier │ scope_layer=1 │ false :: Value │ macro_source=145 │ f :: Identifier │ scope_layer=1 │ [::] │ │ x :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ Int :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [call] │ │ typeof :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ scope_layer=1 │ [call] │ │ ntuple :: Identifier │ scope_layer=1 │ [->] │ │ i :: Identifier │ scope_layer=1 │ [block] │ macro_source=145 │ 0 :: Value │ macro_source=145 │ [call] │ │ ndims :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [block] │ │ [&&] │ │ pure :: Identifier │ scope_layer=1 │ [return] │ │ [call] │ │ _map_pure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [&&] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 0 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ PooledArray :: Identifier │ scope_layer=1 │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ scope_layer=1 │ v :: Identifier │ scope_layer=1 │ [=] │ │ v :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [=] │ │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ f :: Identifier │ scope_layer=1 │ [ref] │ │ x :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [=] │ │ invpool :: Identifier │ scope_layer=1 │ [call] │ │ Dict :: Identifier │ scope_layer=1 │ [call] │ │ => :: Identifier │ scope_layer=1 │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ one :: Identifier │ scope_layer=1 │ [call] │ │ eltype :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ scope_layer=1 │ [vect] │ │ v1 :: Identifier │ scope_layer=1 │ [=] │ │ labels :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ 1 :: Value │ macro_source=145 │ [=] │ │ nlabels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 2 :: Value │ macro_source=145 │ invpool :: Identifier │ scope_layer=1 │ pool :: Identifier │ scope_layer=1 │ labels :: Identifier │ scope_layer=1 │ nlabels :: Identifier │ scope_layer=1 │ [call] │ │ Base.Docs.doc! :: Value │ macro_source=145 │ PooledArrays :: Value │ macro_source=145 │ [call] │ │ Base.Docs.Binding :: Value │ macro_source=145 │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [call] │ macro_source=145 │ Base.Docs.docstr :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Core.svec :: Value │ macro_source=145 │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Dict{Symbol, Any} :: Value │ macro_source=145 │ :path => "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" :: Value │ macro_source=145 │ :linenumber => 322 :: Value │ macro_source=145 │ :module => PooledArrays :: Value │ macro_source=145 │ [where] │ │ [where] │ │ [where] │ │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ val :: Identifier │ scope_layer=3 │ │ file = "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" │ line = 322 └ mod = PooledArrays ERROR: LoadError: internal lowering bug: #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# - `jl_assert(!(haskey(ssa_rewrites, lhs_id)), _)`: multiple assignments to ssavalue Expression:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) Containing expressions:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any))  Detailed provenance:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) @#= /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:366 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/closure_conversion.jl:197 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any))  └─ (call core.TypeVar :#T1 Any) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3025 =#  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  ├─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" (function (where (:: (call (. Base (inert map)) (parameters (kw (:: pure Bool) false)) f (:: x (curly PooledArray (<: Any) R N RA))) (curly Union (curly PooledArray (<: Any) R N RA) (curly PooledArray (<: Any) Int N (call typeof (call similar (. x (inert refs)) Int (call ntuple (-> i (block 0)) (call ndims (. x (inert refs))))))))) R N RA) (block (&& pure (return (call _map_pure f x))) (&& (call == (call length x) 0) (return (call PooledArray (comprehension (generator (call f v) (= v x)))))) (= v1 (call f (ref x 1))) (= invpool (call Dict (call => v1 (call one (call eltype (. x (inert refs))))))) (= pool (vect v1)) (= labels (call similar (. x (inert refs)))) (= (ref labels 1) 1) (= nlabels 1) (return (call _map_notpure f x 2 invpool pool labels nlabels)))))  └─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322  Stacktrace:  [1] iterate(A::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}})  @ Base /source/usr/share/julia/JuliaLowering/src/ast.jl:23 [inlined]  [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:1106  [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:1223  [4] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:851  [5] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:712  [6] compile_body(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:1007  [7] 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:1163  [8] 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:1253  [9] 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  [10] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [11] 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:3271  [12] top-level scope  @ stdin:5  [13] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [14] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [15] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [inlined]  [16] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:353  [17] _start()  @ Base ./client.jl:596 in expression starting at /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:1 in expression starting at stdin:5 ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("2dfb63ee-cc39-5dd5-95bd-886bf059d720"), "PooledArrays") 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:2818  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2672  [4] macro expansion  @ ./loading.jl:2599 [inlined]  [5] string(::String, ::Union{Char, SubString{String}, String, Symbol}, ::Symbol, ::String)  @ Base ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2563  [7] require  @ ./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/DataFrames/0Y1g5/src/DataFrames.jl:3  [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:3271  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [18] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [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/DataFrames/0Y1g5/src/DataFrames.jl:1 in expression starting at stdin:5 2 dependencies had output during precompilation: ┌ PooledArrays │ ┌ Info: JuliaLowering threw given input: │ │ code = │ │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =# Core.@doc " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" function (Base.map(f, x::PooledArray{<:Any, R, N, RA}; pure::Bool = false)::Union{PooledArray{<:Any, R, N, RA}, PooledArray{<:Any, Int, N, typeof(similar(x.refs, Int, ntuple((i->begin │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:338 =# │ │ 0 │ │ end), ndims(x.refs))))}}) where {R, N, RA} │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:339 =# │ │ pure && return _map_pure(f, x) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:340 =# │ │ length(x) == 0 && return PooledArray([f(v) for v = x]) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:341 =# │ │ v1 = f(x[1]) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:342 =# │ │ invpool = Dict(v1 => one(eltype(x.refs))) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:343 =# │ │ pool = [v1] │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:344 =# │ │ labels = similar(x.refs) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:345 =# │ │ labels[1] = 1 │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:346 =# │ │ nlabels = 1 │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:347 =# │ │ return _map_notpure(f, x, 2, invpool, pool, labels, nlabels) │ │ 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/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) :: Value │ │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ │ │ [function] │ │ │ [where] │ │ │ [::] │ │ │ [call] │ │ │ [.] │ │ │ Base :: Identifier │ │ │ [inert] │ │ │ map :: Identifier │ │ │ [parameters] │ │ │ [kw] │ │ │ [::] │ │ │ pure :: Identifier │ │ │ Bool :: Identifier │ │ │ false :: Value │ │ │ f :: Identifier │ │ │ [::] │ │ │ x :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [curly] │ │ │ Union :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ Int :: Identifier │ │ │ N :: Identifier │ │ │ [call] │ │ │ typeof :: Identifier │ │ │ [call] │ │ │ similar :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ Int :: Identifier │ │ │ [call] │ │ │ ntuple :: Identifier │ │ │ [->] │ │ │ i :: Identifier │ │ │ [block] │ │ │ 0 :: Value │ │ │ [call] │ │ │ ndims :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [block] │ │ │ [&&] │ │ │ pure :: Identifier │ │ │ [return] │ │ │ [call] │ │ │ _map_pure :: Identifier │ │ │ f :: Identifier │ │ │ x :: Identifier │ │ │ [&&] │ │ │ [call] │ │ │ == :: Identifier │ │ │ [call] │ │ │ length :: Identifier │ │ │ x :: Identifier │ │ │ 0 :: Value │ │ │ [return] │ │ │ [call] │ │ │ PooledArray :: Identifier │ │ │ [comprehension] │ │ │ [generator] │ │ │ [call] │ │ │ f :: Identifier │ │ │ v :: Identifier │ │ │ [=] │ │ │ v :: Identifier │ │ │ x :: Identifier │ │ │ [=] │ │ │ v1 :: Identifier │ │ │ [call] │ │ │ f :: Identifier │ │ │ [ref] │ │ │ x :: Identifier │ │ │ 1 :: Value │ │ │ [=] │ │ │ invpool :: Identifier │ │ │ [call] │ │ │ Dict :: Identifier │ │ │ [call] │ │ │ => :: Identifier │ │ │ v1 :: Identifier │ │ │ [call] │ │ │ one :: Identifier │ │ │ [call] │ │ │ eltype :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ pool :: Identifier │ │ │ [vect] │ │ │ v1 :: Identifier │ │ │ [=] │ │ │ labels :: Identifier │ │ │ [call] │ │ │ similar :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ [ref] │ │ │ labels :: Identifier │ │ │ 1 :: Value │ │ │ 1 :: Value │ │ │ [=] │ │ │ nlabels :: Identifier │ │ │ 1 :: Value │ │ │ [return] │ │ │ [call] │ │ │ _map_notpure :: Identifier │ │ │ f :: Identifier │ │ │ x :: Identifier │ │ │ 2 :: Value │ │ │ invpool :: Identifier │ │ │ pool :: Identifier │ │ │ labels :: Identifier │ │ │ nlabels :: 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] │ │ │ [.] │ │ │ Base :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ map :: Identifier │ │ │ [parameters] │ │ │ [kw] │ │ │ [::] │ │ │ pure :: Identifier │ scope_layer=1 │ │ Bool :: Identifier │ scope_layer=1 │ │ false :: Value │ macro_source=145 │ │ f :: Identifier │ scope_layer=1 │ │ [::] │ │ │ x :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Union :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ Int :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ [call] │ │ │ typeof :: Identifier │ scope_layer=1 │ │ [call] │ │ │ similar :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ Int :: Identifier │ scope_layer=1 │ │ [call] │ │ │ ntuple :: Identifier │ scope_layer=1 │ │ [->] │ │ │ i :: Identifier │ scope_layer=1 │ │ [block] │ macro_source=145 │ │ 0 :: Value │ macro_source=145 │ │ [call] │ │ │ ndims :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [block] │ │ │ [&&] │ │ │ pure :: Identifier │ scope_layer=1 │ │ [return] │ │ │ [call] │ │ │ _map_pure :: Identifier │ scope_layer=1 │ │ f :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ [&&] │ │ │ [call] │ │ │ == :: Identifier │ scope_layer=1 │ │ [call] │ │ │ length :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ 0 :: Value │ macro_source=145 │ │ [return] │ │ │ [call] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [comprehension] │ │ │ [generator] │ │ │ [call] │ │ │ f :: Identifier │ scope_layer=1 │ │ v :: Identifier │ scope_layer=1 │ │ [=] │ │ │ v :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ [=] │ │ │ v1 :: Identifier │ scope_layer=1 │ │ [call] │ │ │ f :: Identifier │ scope_layer=1 │ │ [ref] │ │ │ x :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ [=] │ │ │ invpool :: Identifier │ scope_layer=1 │ │ [call] │ │ │ Dict :: Identifier │ scope_layer=1 │ │ [call] │ │ │ => :: Identifier │ scope_layer=1 │ │ v1 :: Identifier │ scope_layer=1 │ │ [call] │ │ │ one :: Identifier │ scope_layer=1 │ │ [call] │ │ │ eltype :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ pool :: Identifier │ scope_layer=1 │ │ [vect] │ │ │ v1 :: Identifier │ scope_layer=1 │ │ [=] │ │ │ labels :: Identifier │ scope_layer=1 │ │ [call] │ │ │ similar :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ [ref] │ │ │ labels :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ 1 :: Value │ macro_source=145 │ │ [=] │ │ │ nlabels :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ [return] │ │ │ [call] │ │ │ _map_notpure :: Identifier │ scope_layer=1 │ │ f :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ 2 :: Value │ macro_source=145 │ │ invpool :: Identifier │ scope_layer=1 │ │ pool :: Identifier │ scope_layer=1 │ │ labels :: Identifier │ scope_layer=1 │ │ nlabels :: Identifier │ scope_layer=1 │ │ [call] │ │ │ Base.Docs.doc! :: Value │ macro_source=145 │ │ PooledArrays :: Value │ macro_source=145 │ │ [call] │ │ │ Base.Docs.Binding :: Value │ macro_source=145 │ │ Base :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ map :: Identifier │ │ │ [call] │ macro_source=145 │ │ Base.Docs.docstr :: Value │ macro_source=145 │ │ [call] │ macro_source=145 │ │ Core.svec :: Value │ macro_source=145 │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ macro_source=145 │ │ [call] │ macro_source=145 │ │ Dict{Symbol, Any} :: Value │ macro_source=145 │ │ :path => "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" :: Value │ macro_source=145 │ │ :linenumber => 322 :: Value │ macro_source=145 │ │ :module => PooledArrays :: Value │ macro_source=145 │ │ [where] │ │ │ [where] │ │ │ [where] │ │ │ [curly] │ │ │ Union :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ val :: Identifier │ scope_layer=3 │ │ │ │ file = "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" │ │ line = 322 │ └ mod = PooledArrays │ ERROR: LoadError: internal lowering bug: │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# - `jl_assert(!(haskey(ssa_rewrites, lhs_id)), _)`: multiple assignments to ssavalue │ Expression: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) │ Containing expressions: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) │ │ Detailed provenance: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) @#= /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:366 =# │ └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/closure_conversion.jl:197 =# │ └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =# │ └─ (= #₅ (call core.TypeVar :#T1 Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =# │ └─ (= #₅ (call core.TypeVar :#T1 Any)) │ └─ (call core.TypeVar :#T1 Any) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3025 =# │ └─ (<: Any) │ └─ (<: Any) │ └─ (<: Any) │ └─ (<: Any) │ ├─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" (function (where (:: (call (. Base (inert map)) (parameters (kw (:: pure Bool) false)) f (:: x (curly PooledArray (<: Any) R N RA))) (curly Union (curly PooledArray (<: Any) R N RA) (curly PooledArray (<: Any) Int N (call typeof (call similar (. x (inert refs)) Int (call ntuple (-> i (block 0)) (call ndims (. x (inert refs))))))))) R N RA) (block (&& pure (return (call _map_pure f x))) (&& (call == (call length x) 0) (return (call PooledArray (comprehension (generator (call f v) (= v x)))))) (= v1 (call f (ref x 1))) (= invpool (call Dict (call => v1 (call one (call eltype (. x (inert refs))))))) (= pool (vect v1)) (= labels (call similar (. x (inert refs)))) (= (ref labels 1) 1) (= nlabels 1) (return (call _map_notpure f x 2 invpool pool labels nlabels))))) │ └─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 │ │ Stacktrace: │ [1] iterate(A::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}) │ @ Base /source/usr/share/julia/JuliaLowering/src/ast.jl:23 [inlined] │ [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:1106 │ [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:1223 │ [4] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:851 │ [5] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:712 │ [6] compile_body(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:1007 │ [7] 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:1163 │ [8] 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:1253 │ [9] 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 │ [10] include(mod::Module, _path::String) │ @ Base ./Base.jl:326 │ [11] 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:3271 │ [12] top-level scope │ @ stdin:5 │ [13] eval(m::Module, e::Any) │ @ Core ./boot.jl:517 │ [14] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String) │ @ Base ./loading.jl:3113 │ [15] push!(a::Vector{SubString{String}}, item::String) │ @ Base ./loading.jl:3123 [inlined] │ [16] exec_options(opts::Base.JLOptions) │ @ Base ./client.jl:353 │ [17] _start() │ @ Base ./client.jl:596 │ in expression starting at /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:1 │ in expression starting at stdin:5 └ ┌ DataFrames │ [Output was shown above] └ NPCC full dynamics: Error During Test at /home/pkgeval/.julia/packages/PowerDynData/91X2a/test/runtests.jl:181 Got exception outside of a @test The following 2 packages failed to precompile: PooledArrays Failed to precompile PooledArrays [2dfb63ee-cc39-5dd5-95bd-886bf059d720] to "/home/pkgeval/.julia/compiled/v1.14/PooledArrays/jl_lMyd1l" (ProcessExited(1)). DataFrames Failed to precompile DataFrames [a93c6f00-e57d-5684-b7b6-d8193f3e46c0] to "/home/pkgeval/.julia/compiled/v1.14/DataFrames/jl_Ik9PyF" (ProcessExited(1)). ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =# Core.@doc " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" function (Base.map(f, x::PooledArray{<:Any, R, N, RA}; pure::Bool = false)::Union{PooledArray{<:Any, R, N, RA}, PooledArray{<:Any, Int, N, typeof(similar(x.refs, Int, ntuple((i->begin │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:338 =# │ 0 │ end), ndims(x.refs))))}}) where {R, N, RA} │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:339 =# │ pure && return _map_pure(f, x) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:340 =# │ length(x) == 0 && return PooledArray([f(v) for v = x]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:341 =# │ v1 = f(x[1]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:342 =# │ invpool = Dict(v1 => one(eltype(x.refs))) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:343 =# │ pool = [v1] │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:344 =# │ labels = similar(x.refs) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:345 =# │ labels[1] = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:346 =# │ nlabels = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:347 =# │ return _map_notpure(f, x, 2, invpool, pool, labels, nlabels) │ 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/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) :: Value │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ │ [function] │ │ [where] │ │ [::] │ │ [call] │ │ [.] │ │ Base :: Identifier │ │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ │ Bool :: Identifier │ │ false :: Value │ │ f :: Identifier │ │ [::] │ │ x :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ Union :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ Int :: Identifier │ │ N :: Identifier │ │ [call] │ │ typeof :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ │ [call] │ │ ntuple :: Identifier │ │ [->] │ │ i :: Identifier │ │ [block] │ │ 0 :: Value │ │ [call] │ │ ndims :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [block] │ │ [&&] │ │ pure :: Identifier │ │ [return] │ │ [call] │ │ _map_pure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ [&&] │ │ [call] │ │ == :: Identifier │ │ [call] │ │ length :: Identifier │ │ x :: Identifier │ │ 0 :: Value │ │ [return] │ │ [call] │ │ PooledArray :: Identifier │ │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ │ v :: Identifier │ │ [=] │ │ v :: Identifier │ │ x :: Identifier │ │ [=] │ │ v1 :: Identifier │ │ [call] │ │ f :: Identifier │ │ [ref] │ │ x :: Identifier │ │ 1 :: Value │ │ [=] │ │ invpool :: Identifier │ │ [call] │ │ Dict :: Identifier │ │ [call] │ │ => :: Identifier │ │ v1 :: Identifier │ │ [call] │ │ one :: Identifier │ │ [call] │ │ eltype :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ │ [vect] │ │ v1 :: Identifier │ │ [=] │ │ labels :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ │ 1 :: Value │ │ 1 :: Value │ │ [=] │ │ nlabels :: Identifier │ │ 1 :: Value │ │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ 2 :: Value │ │ invpool :: Identifier │ │ pool :: Identifier │ │ labels :: Identifier │ │ nlabels :: 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] │ │ [.] │ │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ scope_layer=1 │ Bool :: Identifier │ scope_layer=1 │ false :: Value │ macro_source=145 │ f :: Identifier │ scope_layer=1 │ [::] │ │ x :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ Int :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [call] │ │ typeof :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ scope_layer=1 │ [call] │ │ ntuple :: Identifier │ scope_layer=1 │ [->] │ │ i :: Identifier │ scope_layer=1 │ [block] │ macro_source=145 │ 0 :: Value │ macro_source=145 │ [call] │ │ ndims :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [block] │ │ [&&] │ │ pure :: Identifier │ scope_layer=1 │ [return] │ │ [call] │ │ _map_pure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [&&] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 0 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ PooledArray :: Identifier │ scope_layer=1 │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ scope_layer=1 │ v :: Identifier │ scope_layer=1 │ [=] │ │ v :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [=] │ │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ f :: Identifier │ scope_layer=1 │ [ref] │ │ x :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [=] │ │ invpool :: Identifier │ scope_layer=1 │ [call] │ │ Dict :: Identifier │ scope_layer=1 │ [call] │ │ => :: Identifier │ scope_layer=1 │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ one :: Identifier │ scope_layer=1 │ [call] │ │ eltype :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ scope_layer=1 │ [vect] │ │ v1 :: Identifier │ scope_layer=1 │ [=] │ │ labels :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ 1 :: Value │ macro_source=145 │ [=] │ │ nlabels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 2 :: Value │ macro_source=145 │ invpool :: Identifier │ scope_layer=1 │ pool :: Identifier │ scope_layer=1 │ labels :: Identifier │ scope_layer=1 │ nlabels :: Identifier │ scope_layer=1 │ [call] │ │ Base.Docs.doc! :: Value │ macro_source=145 │ PooledArrays :: Value │ macro_source=145 │ [call] │ │ Base.Docs.Binding :: Value │ macro_source=145 │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [call] │ macro_source=145 │ Base.Docs.docstr :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Core.svec :: Value │ macro_source=145 │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Dict{Symbol, Any} :: Value │ macro_source=145 │ :path => "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" :: Value │ macro_source=145 │ :linenumber => 322 :: Value │ macro_source=145 │ :module => PooledArrays :: Value │ macro_source=145 │ [where] │ │ [where] │ │ [where] │ │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ val :: Identifier │ scope_layer=3 │ │ file = "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" │ line = 322 └ mod = PooledArrays ERROR: LoadError: internal lowering bug: #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# - `jl_assert(!(haskey(ssa_rewrites, lhs_id)), _)`: multiple assignments to ssavalue Expression:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) Containing expressions:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any))  Detailed provenance:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) @#= /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:366 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/closure_conversion.jl:197 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any))  └─ (call core.TypeVar :#T1 Any) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3025 =#  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  ├─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" (function (where (:: (call (. Base (inert map)) (parameters (kw (:: pure Bool) false)) f (:: x (curly PooledArray (<: Any) R N RA))) (curly Union (curly PooledArray (<: Any) R N RA) (curly PooledArray (<: Any) Int N (call typeof (call similar (. x (inert refs)) Int (call ntuple (-> i (block 0)) (call ndims (. x (inert refs))))))))) R N RA) (block (&& pure (return (call _map_pure f x))) (&& (call == (call length x) 0) (return (call PooledArray (comprehension (generator (call f v) (= v x)))))) (= v1 (call f (ref x 1))) (= invpool (call Dict (call => v1 (call one (call eltype (. x (inert refs))))))) (= pool (vect v1)) (= labels (call similar (. x (inert refs)))) (= (ref labels 1) 1) (= nlabels 1) (return (call _map_notpure f x 2 invpool pool labels nlabels)))))  └─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322  Stacktrace:  [1] iterate(A::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}})  @ Base /source/usr/share/julia/JuliaLowering/src/ast.jl:23 [inlined]  [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:1106  [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:1223  [4] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:851  [5] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:712  [6] compile_body(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:1007  [7] 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:1163  [8] 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:1253  [9] 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  [10] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [11] 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:3271  [12] top-level scope  @ stdin:5  [13] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [14] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [15] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [inlined]  [16] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:353  [17] _start()  @ Base ./client.jl:596 in expression starting at /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:1 in expression starting at stdin:5 ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("2dfb63ee-cc39-5dd5-95bd-886bf059d720"), "PooledArrays") 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:2818  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2672  [4] macro expansion  @ ./loading.jl:2599 [inlined]  [5] string(::String, ::Union{Char, SubString{String}, String, Symbol}, ::Symbol, ::String)  @ Base ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2563  [7] require  @ ./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/DataFrames/0Y1g5/src/DataFrames.jl:3  [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:3271  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [18] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [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/DataFrames/0Y1g5/src/DataFrames.jl:1 in expression starting at stdin:5 2 dependencies had output during precompilation: ┌ PooledArrays │ ┌ Info: JuliaLowering threw given input: │ │ code = │ │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =# Core.@doc " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" function (Base.map(f, x::PooledArray{<:Any, R, N, RA}; pure::Bool = false)::Union{PooledArray{<:Any, R, N, RA}, PooledArray{<:Any, Int, N, typeof(similar(x.refs, Int, ntuple((i->begin │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:338 =# │ │ 0 │ │ end), ndims(x.refs))))}}) where {R, N, RA} │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:339 =# │ │ pure && return _map_pure(f, x) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:340 =# │ │ length(x) == 0 && return PooledArray([f(v) for v = x]) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:341 =# │ │ v1 = f(x[1]) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:342 =# │ │ invpool = Dict(v1 => one(eltype(x.refs))) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:343 =# │ │ pool = [v1] │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:344 =# │ │ labels = similar(x.refs) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:345 =# │ │ labels[1] = 1 │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:346 =# │ │ nlabels = 1 │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:347 =# │ │ return _map_notpure(f, x, 2, invpool, pool, labels, nlabels) │ │ 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/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) :: Value │ │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ │ │ [function] │ │ │ [where] │ │ │ [::] │ │ │ [call] │ │ │ [.] │ │ │ Base :: Identifier │ │ │ [inert] │ │ │ map :: Identifier │ │ │ [parameters] │ │ │ [kw] │ │ │ [::] │ │ │ pure :: Identifier │ │ │ Bool :: Identifier │ │ │ false :: Value │ │ │ f :: Identifier │ │ │ [::] │ │ │ x :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [curly] │ │ │ Union :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ Int :: Identifier │ │ │ N :: Identifier │ │ │ [call] │ │ │ typeof :: Identifier │ │ │ [call] │ │ │ similar :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ Int :: Identifier │ │ │ [call] │ │ │ ntuple :: Identifier │ │ │ [->] │ │ │ i :: Identifier │ │ │ [block] │ │ │ 0 :: Value │ │ │ [call] │ │ │ ndims :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [block] │ │ │ [&&] │ │ │ pure :: Identifier │ │ │ [return] │ │ │ [call] │ │ │ _map_pure :: Identifier │ │ │ f :: Identifier │ │ │ x :: Identifier │ │ │ [&&] │ │ │ [call] │ │ │ == :: Identifier │ │ │ [call] │ │ │ length :: Identifier │ │ │ x :: Identifier │ │ │ 0 :: Value │ │ │ [return] │ │ │ [call] │ │ │ PooledArray :: Identifier │ │ │ [comprehension] │ │ │ [generator] │ │ │ [call] │ │ │ f :: Identifier │ │ │ v :: Identifier │ │ │ [=] │ │ │ v :: Identifier │ │ │ x :: Identifier │ │ │ [=] │ │ │ v1 :: Identifier │ │ │ [call] │ │ │ f :: Identifier │ │ │ [ref] │ │ │ x :: Identifier │ │ │ 1 :: Value │ │ │ [=] │ │ │ invpool :: Identifier │ │ │ [call] │ │ │ Dict :: Identifier │ │ │ [call] │ │ │ => :: Identifier │ │ │ v1 :: Identifier │ │ │ [call] │ │ │ one :: Identifier │ │ │ [call] │ │ │ eltype :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ pool :: Identifier │ │ │ [vect] │ │ │ v1 :: Identifier │ │ │ [=] │ │ │ labels :: Identifier │ │ │ [call] │ │ │ similar :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ [ref] │ │ │ labels :: Identifier │ │ │ 1 :: Value │ │ │ 1 :: Value │ │ │ [=] │ │ │ nlabels :: Identifier │ │ │ 1 :: Value │ │ │ [return] │ │ │ [call] │ │ │ _map_notpure :: Identifier │ │ │ f :: Identifier │ │ │ x :: Identifier │ │ │ 2 :: Value │ │ │ invpool :: Identifier │ │ │ pool :: Identifier │ │ │ labels :: Identifier │ │ │ nlabels :: 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] │ │ │ [.] │ │ │ Base :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ map :: Identifier │ │ │ [parameters] │ │ │ [kw] │ │ │ [::] │ │ │ pure :: Identifier │ scope_layer=1 │ │ Bool :: Identifier │ scope_layer=1 │ │ false :: Value │ macro_source=145 │ │ f :: Identifier │ scope_layer=1 │ │ [::] │ │ │ x :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Union :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ Int :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ [call] │ │ │ typeof :: Identifier │ scope_layer=1 │ │ [call] │ │ │ similar :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ Int :: Identifier │ scope_layer=1 │ │ [call] │ │ │ ntuple :: Identifier │ scope_layer=1 │ │ [->] │ │ │ i :: Identifier │ scope_layer=1 │ │ [block] │ macro_source=145 │ │ 0 :: Value │ macro_source=145 │ │ [call] │ │ │ ndims :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [block] │ │ │ [&&] │ │ │ pure :: Identifier │ scope_layer=1 │ │ [return] │ │ │ [call] │ │ │ _map_pure :: Identifier │ scope_layer=1 │ │ f :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ [&&] │ │ │ [call] │ │ │ == :: Identifier │ scope_layer=1 │ │ [call] │ │ │ length :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ 0 :: Value │ macro_source=145 │ │ [return] │ │ │ [call] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [comprehension] │ │ │ [generator] │ │ │ [call] │ │ │ f :: Identifier │ scope_layer=1 │ │ v :: Identifier │ scope_layer=1 │ │ [=] │ │ │ v :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ [=] │ │ │ v1 :: Identifier │ scope_layer=1 │ │ [call] │ │ │ f :: Identifier │ scope_layer=1 │ │ [ref] │ │ │ x :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ [=] │ │ │ invpool :: Identifier │ scope_layer=1 │ │ [call] │ │ │ Dict :: Identifier │ scope_layer=1 │ │ [call] │ │ │ => :: Identifier │ scope_layer=1 │ │ v1 :: Identifier │ scope_layer=1 │ │ [call] │ │ │ one :: Identifier │ scope_layer=1 │ │ [call] │ │ │ eltype :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ pool :: Identifier │ scope_layer=1 │ │ [vect] │ │ │ v1 :: Identifier │ scope_layer=1 │ │ [=] │ │ │ labels :: Identifier │ scope_layer=1 │ │ [call] │ │ │ similar :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ [ref] │ │ │ labels :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ 1 :: Value │ macro_source=145 │ │ [=] │ │ │ nlabels :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ [return] │ │ │ [call] │ │ │ _map_notpure :: Identifier │ scope_layer=1 │ │ f :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ 2 :: Value │ macro_source=145 │ │ invpool :: Identifier │ scope_layer=1 │ │ pool :: Identifier │ scope_layer=1 │ │ labels :: Identifier │ scope_layer=1 │ │ nlabels :: Identifier │ scope_layer=1 │ │ [call] │ │ │ Base.Docs.doc! :: Value │ macro_source=145 │ │ PooledArrays :: Value │ macro_source=145 │ │ [call] │ │ │ Base.Docs.Binding :: Value │ macro_source=145 │ │ Base :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ map :: Identifier │ │ │ [call] │ macro_source=145 │ │ Base.Docs.docstr :: Value │ macro_source=145 │ │ [call] │ macro_source=145 │ │ Core.svec :: Value │ macro_source=145 │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ macro_source=145 │ │ [call] │ macro_source=145 │ │ Dict{Symbol, Any} :: Value │ macro_source=145 │ │ :path => "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" :: Value │ macro_source=145 │ │ :linenumber => 322 :: Value │ macro_source=145 │ │ :module => PooledArrays :: Value │ macro_source=145 │ │ [where] │ │ │ [where] │ │ │ [where] │ │ │ [curly] │ │ │ Union :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ val :: Identifier │ scope_layer=3 │ │ │ │ file = "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" │ │ line = 322 │ └ mod = PooledArrays │ ERROR: LoadError: internal lowering bug: │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# - `jl_assert(!(haskey(ssa_rewrites, lhs_id)), _)`: multiple assignments to ssavalue │ Expression: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) │ Containing expressions: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) │ │ Detailed provenance: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) @#= /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:366 =# │ └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/closure_conversion.jl:197 =# │ └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =# │ └─ (= #₅ (call core.TypeVar :#T1 Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =# │ └─ (= #₅ (call core.TypeVar :#T1 Any)) │ └─ (call core.TypeVar :#T1 Any) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3025 =# │ └─ (<: Any) │ └─ (<: Any) │ └─ (<: Any) │ └─ (<: Any) │ ├─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" (function (where (:: (call (. Base (inert map)) (parameters (kw (:: pure Bool) false)) f (:: x (curly PooledArray (<: Any) R N RA))) (curly Union (curly PooledArray (<: Any) R N RA) (curly PooledArray (<: Any) Int N (call typeof (call similar (. x (inert refs)) Int (call ntuple (-> i (block 0)) (call ndims (. x (inert refs))))))))) R N RA) (block (&& pure (return (call _map_pure f x))) (&& (call == (call length x) 0) (return (call PooledArray (comprehension (generator (call f v) (= v x)))))) (= v1 (call f (ref x 1))) (= invpool (call Dict (call => v1 (call one (call eltype (. x (inert refs))))))) (= pool (vect v1)) (= labels (call similar (. x (inert refs)))) (= (ref labels 1) 1) (= nlabels 1) (return (call _map_notpure f x 2 invpool pool labels nlabels))))) │ └─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 │ │ Stacktrace: │ [1] iterate(A::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}) │ @ Base /source/usr/share/julia/JuliaLowering/src/ast.jl:23 [inlined] │ [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:1106 │ [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:1223 │ [4] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:851 │ [5] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:712 │ [6] compile_body(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:1007 │ [7] 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:1163 │ [8] 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:1253 │ [9] 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 │ [10] include(mod::Module, _path::String) │ @ Base ./Base.jl:326 │ [11] 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:3271 │ [12] top-level scope │ @ stdin:5 │ [13] eval(m::Module, e::Any) │ @ Core ./boot.jl:517 │ [14] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String) │ @ Base ./loading.jl:3113 │ [15] push!(a::Vector{SubString{String}}, item::String) │ @ Base ./loading.jl:3123 [inlined] │ [16] exec_options(opts::Base.JLOptions) │ @ Base ./client.jl:353 │ [17] _start() │ @ Base ./client.jl:596 │ in expression starting at /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:1 │ in expression starting at stdin:5 └ ┌ DataFrames │ [Output was shown above] └ Nordic44 base case: Error During Test at /home/pkgeval/.julia/packages/PowerDynData/91X2a/test/runtests.jl:181 Got exception outside of a @test The following 2 packages failed to precompile: PooledArrays Failed to precompile PooledArrays [2dfb63ee-cc39-5dd5-95bd-886bf059d720] to "/home/pkgeval/.julia/compiled/v1.14/PooledArrays/jl_86Fm9b" (ProcessExited(1)). DataFrames Failed to precompile DataFrames [a93c6f00-e57d-5684-b7b6-d8193f3e46c0] to "/home/pkgeval/.julia/compiled/v1.14/DataFrames/jl_74c7Rb" (ProcessExited(1)). ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =# Core.@doc " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" function (Base.map(f, x::PooledArray{<:Any, R, N, RA}; pure::Bool = false)::Union{PooledArray{<:Any, R, N, RA}, PooledArray{<:Any, Int, N, typeof(similar(x.refs, Int, ntuple((i->begin │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:338 =# │ 0 │ end), ndims(x.refs))))}}) where {R, N, RA} │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:339 =# │ pure && return _map_pure(f, x) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:340 =# │ length(x) == 0 && return PooledArray([f(v) for v = x]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:341 =# │ v1 = f(x[1]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:342 =# │ invpool = Dict(v1 => one(eltype(x.refs))) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:343 =# │ pool = [v1] │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:344 =# │ labels = similar(x.refs) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:345 =# │ labels[1] = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:346 =# │ nlabels = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:347 =# │ return _map_notpure(f, x, 2, invpool, pool, labels, nlabels) │ 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/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) :: Value │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ │ [function] │ │ [where] │ │ [::] │ │ [call] │ │ [.] │ │ Base :: Identifier │ │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ │ Bool :: Identifier │ │ false :: Value │ │ f :: Identifier │ │ [::] │ │ x :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ Union :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ Int :: Identifier │ │ N :: Identifier │ │ [call] │ │ typeof :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ │ [call] │ │ ntuple :: Identifier │ │ [->] │ │ i :: Identifier │ │ [block] │ │ 0 :: Value │ │ [call] │ │ ndims :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [block] │ │ [&&] │ │ pure :: Identifier │ │ [return] │ │ [call] │ │ _map_pure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ [&&] │ │ [call] │ │ == :: Identifier │ │ [call] │ │ length :: Identifier │ │ x :: Identifier │ │ 0 :: Value │ │ [return] │ │ [call] │ │ PooledArray :: Identifier │ │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ │ v :: Identifier │ │ [=] │ │ v :: Identifier │ │ x :: Identifier │ │ [=] │ │ v1 :: Identifier │ │ [call] │ │ f :: Identifier │ │ [ref] │ │ x :: Identifier │ │ 1 :: Value │ │ [=] │ │ invpool :: Identifier │ │ [call] │ │ Dict :: Identifier │ │ [call] │ │ => :: Identifier │ │ v1 :: Identifier │ │ [call] │ │ one :: Identifier │ │ [call] │ │ eltype :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ │ [vect] │ │ v1 :: Identifier │ │ [=] │ │ labels :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ │ 1 :: Value │ │ 1 :: Value │ │ [=] │ │ nlabels :: Identifier │ │ 1 :: Value │ │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ 2 :: Value │ │ invpool :: Identifier │ │ pool :: Identifier │ │ labels :: Identifier │ │ nlabels :: 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] │ │ [.] │ │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ scope_layer=1 │ Bool :: Identifier │ scope_layer=1 │ false :: Value │ macro_source=145 │ f :: Identifier │ scope_layer=1 │ [::] │ │ x :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ Int :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [call] │ │ typeof :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ scope_layer=1 │ [call] │ │ ntuple :: Identifier │ scope_layer=1 │ [->] │ │ i :: Identifier │ scope_layer=1 │ [block] │ macro_source=145 │ 0 :: Value │ macro_source=145 │ [call] │ │ ndims :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [block] │ │ [&&] │ │ pure :: Identifier │ scope_layer=1 │ [return] │ │ [call] │ │ _map_pure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [&&] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 0 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ PooledArray :: Identifier │ scope_layer=1 │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ scope_layer=1 │ v :: Identifier │ scope_layer=1 │ [=] │ │ v :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [=] │ │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ f :: Identifier │ scope_layer=1 │ [ref] │ │ x :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [=] │ │ invpool :: Identifier │ scope_layer=1 │ [call] │ │ Dict :: Identifier │ scope_layer=1 │ [call] │ │ => :: Identifier │ scope_layer=1 │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ one :: Identifier │ scope_layer=1 │ [call] │ │ eltype :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ scope_layer=1 │ [vect] │ │ v1 :: Identifier │ scope_layer=1 │ [=] │ │ labels :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ 1 :: Value │ macro_source=145 │ [=] │ │ nlabels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 2 :: Value │ macro_source=145 │ invpool :: Identifier │ scope_layer=1 │ pool :: Identifier │ scope_layer=1 │ labels :: Identifier │ scope_layer=1 │ nlabels :: Identifier │ scope_layer=1 │ [call] │ │ Base.Docs.doc! :: Value │ macro_source=145 │ PooledArrays :: Value │ macro_source=145 │ [call] │ │ Base.Docs.Binding :: Value │ macro_source=145 │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [call] │ macro_source=145 │ Base.Docs.docstr :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Core.svec :: Value │ macro_source=145 │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Dict{Symbol, Any} :: Value │ macro_source=145 │ :path => "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" :: Value │ macro_source=145 │ :linenumber => 322 :: Value │ macro_source=145 │ :module => PooledArrays :: Value │ macro_source=145 │ [where] │ │ [where] │ │ [where] │ │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ val :: Identifier │ scope_layer=3 │ │ file = "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" │ line = 322 └ mod = PooledArrays ERROR: LoadError: internal lowering bug: #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# - `jl_assert(!(haskey(ssa_rewrites, lhs_id)), _)`: multiple assignments to ssavalue Expression:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) Containing expressions:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any))  Detailed provenance:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) @#= /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:366 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/closure_conversion.jl:197 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any))  └─ (call core.TypeVar :#T1 Any) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3025 =#  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  ├─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" (function (where (:: (call (. Base (inert map)) (parameters (kw (:: pure Bool) false)) f (:: x (curly PooledArray (<: Any) R N RA))) (curly Union (curly PooledArray (<: Any) R N RA) (curly PooledArray (<: Any) Int N (call typeof (call similar (. x (inert refs)) Int (call ntuple (-> i (block 0)) (call ndims (. x (inert refs))))))))) R N RA) (block (&& pure (return (call _map_pure f x))) (&& (call == (call length x) 0) (return (call PooledArray (comprehension (generator (call f v) (= v x)))))) (= v1 (call f (ref x 1))) (= invpool (call Dict (call => v1 (call one (call eltype (. x (inert refs))))))) (= pool (vect v1)) (= labels (call similar (. x (inert refs)))) (= (ref labels 1) 1) (= nlabels 1) (return (call _map_notpure f x 2 invpool pool labels nlabels)))))  └─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322  Stacktrace:  [1] iterate(A::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}})  @ Base /source/usr/share/julia/JuliaLowering/src/ast.jl:23 [inlined]  [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:1106  [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:1223  [4] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:851  [5] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:712  [6] compile_body(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:1007  [7] 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:1163  [8] 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:1253  [9] 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  [10] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [11] 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:3271  [12] top-level scope  @ stdin:5  [13] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [14] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [15] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [inlined]  [16] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:353  [17] _start()  @ Base ./client.jl:596 in expression starting at /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:1 in expression starting at stdin:5 ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("2dfb63ee-cc39-5dd5-95bd-886bf059d720"), "PooledArrays") 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:2818  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2672  [4] macro expansion  @ ./loading.jl:2599 [inlined]  [5] string(::String, ::Union{Char, SubString{String}, String, Symbol}, ::Symbol, ::String)  @ Base ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2563  [7] require  @ ./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/DataFrames/0Y1g5/src/DataFrames.jl:3  [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:3271  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [18] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [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/DataFrames/0Y1g5/src/DataFrames.jl:1 in expression starting at stdin:5 2 dependencies had output during precompilation: ┌ PooledArrays │ ┌ Info: JuliaLowering threw given input: │ │ code = │ │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =# Core.@doc " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" function (Base.map(f, x::PooledArray{<:Any, R, N, RA}; pure::Bool = false)::Union{PooledArray{<:Any, R, N, RA}, PooledArray{<:Any, Int, N, typeof(similar(x.refs, Int, ntuple((i->begin │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:338 =# │ │ 0 │ │ end), ndims(x.refs))))}}) where {R, N, RA} │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:339 =# │ │ pure && return _map_pure(f, x) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:340 =# │ │ length(x) == 0 && return PooledArray([f(v) for v = x]) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:341 =# │ │ v1 = f(x[1]) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:342 =# │ │ invpool = Dict(v1 => one(eltype(x.refs))) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:343 =# │ │ pool = [v1] │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:344 =# │ │ labels = similar(x.refs) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:345 =# │ │ labels[1] = 1 │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:346 =# │ │ nlabels = 1 │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:347 =# │ │ return _map_notpure(f, x, 2, invpool, pool, labels, nlabels) │ │ 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/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) :: Value │ │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ │ │ [function] │ │ │ [where] │ │ │ [::] │ │ │ [call] │ │ │ [.] │ │ │ Base :: Identifier │ │ │ [inert] │ │ │ map :: Identifier │ │ │ [parameters] │ │ │ [kw] │ │ │ [::] │ │ │ pure :: Identifier │ │ │ Bool :: Identifier │ │ │ false :: Value │ │ │ f :: Identifier │ │ │ [::] │ │ │ x :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [curly] │ │ │ Union :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ Int :: Identifier │ │ │ N :: Identifier │ │ │ [call] │ │ │ typeof :: Identifier │ │ │ [call] │ │ │ similar :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ Int :: Identifier │ │ │ [call] │ │ │ ntuple :: Identifier │ │ │ [->] │ │ │ i :: Identifier │ │ │ [block] │ │ │ 0 :: Value │ │ │ [call] │ │ │ ndims :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [block] │ │ │ [&&] │ │ │ pure :: Identifier │ │ │ [return] │ │ │ [call] │ │ │ _map_pure :: Identifier │ │ │ f :: Identifier │ │ │ x :: Identifier │ │ │ [&&] │ │ │ [call] │ │ │ == :: Identifier │ │ │ [call] │ │ │ length :: Identifier │ │ │ x :: Identifier │ │ │ 0 :: Value │ │ │ [return] │ │ │ [call] │ │ │ PooledArray :: Identifier │ │ │ [comprehension] │ │ │ [generator] │ │ │ [call] │ │ │ f :: Identifier │ │ │ v :: Identifier │ │ │ [=] │ │ │ v :: Identifier │ │ │ x :: Identifier │ │ │ [=] │ │ │ v1 :: Identifier │ │ │ [call] │ │ │ f :: Identifier │ │ │ [ref] │ │ │ x :: Identifier │ │ │ 1 :: Value │ │ │ [=] │ │ │ invpool :: Identifier │ │ │ [call] │ │ │ Dict :: Identifier │ │ │ [call] │ │ │ => :: Identifier │ │ │ v1 :: Identifier │ │ │ [call] │ │ │ one :: Identifier │ │ │ [call] │ │ │ eltype :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ pool :: Identifier │ │ │ [vect] │ │ │ v1 :: Identifier │ │ │ [=] │ │ │ labels :: Identifier │ │ │ [call] │ │ │ similar :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ [ref] │ │ │ labels :: Identifier │ │ │ 1 :: Value │ │ │ 1 :: Value │ │ │ [=] │ │ │ nlabels :: Identifier │ │ │ 1 :: Value │ │ │ [return] │ │ │ [call] │ │ │ _map_notpure :: Identifier │ │ │ f :: Identifier │ │ │ x :: Identifier │ │ │ 2 :: Value │ │ │ invpool :: Identifier │ │ │ pool :: Identifier │ │ │ labels :: Identifier │ │ │ nlabels :: 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] │ │ │ [.] │ │ │ Base :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ map :: Identifier │ │ │ [parameters] │ │ │ [kw] │ │ │ [::] │ │ │ pure :: Identifier │ scope_layer=1 │ │ Bool :: Identifier │ scope_layer=1 │ │ false :: Value │ macro_source=145 │ │ f :: Identifier │ scope_layer=1 │ │ [::] │ │ │ x :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Union :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ Int :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ [call] │ │ │ typeof :: Identifier │ scope_layer=1 │ │ [call] │ │ │ similar :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ Int :: Identifier │ scope_layer=1 │ │ [call] │ │ │ ntuple :: Identifier │ scope_layer=1 │ │ [->] │ │ │ i :: Identifier │ scope_layer=1 │ │ [block] │ macro_source=145 │ │ 0 :: Value │ macro_source=145 │ │ [call] │ │ │ ndims :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [block] │ │ │ [&&] │ │ │ pure :: Identifier │ scope_layer=1 │ │ [return] │ │ │ [call] │ │ │ _map_pure :: Identifier │ scope_layer=1 │ │ f :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ [&&] │ │ │ [call] │ │ │ == :: Identifier │ scope_layer=1 │ │ [call] │ │ │ length :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ 0 :: Value │ macro_source=145 │ │ [return] │ │ │ [call] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [comprehension] │ │ │ [generator] │ │ │ [call] │ │ │ f :: Identifier │ scope_layer=1 │ │ v :: Identifier │ scope_layer=1 │ │ [=] │ │ │ v :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ [=] │ │ │ v1 :: Identifier │ scope_layer=1 │ │ [call] │ │ │ f :: Identifier │ scope_layer=1 │ │ [ref] │ │ │ x :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ [=] │ │ │ invpool :: Identifier │ scope_layer=1 │ │ [call] │ │ │ Dict :: Identifier │ scope_layer=1 │ │ [call] │ │ │ => :: Identifier │ scope_layer=1 │ │ v1 :: Identifier │ scope_layer=1 │ │ [call] │ │ │ one :: Identifier │ scope_layer=1 │ │ [call] │ │ │ eltype :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ pool :: Identifier │ scope_layer=1 │ │ [vect] │ │ │ v1 :: Identifier │ scope_layer=1 │ │ [=] │ │ │ labels :: Identifier │ scope_layer=1 │ │ [call] │ │ │ similar :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ [ref] │ │ │ labels :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ 1 :: Value │ macro_source=145 │ │ [=] │ │ │ nlabels :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ [return] │ │ │ [call] │ │ │ _map_notpure :: Identifier │ scope_layer=1 │ │ f :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ 2 :: Value │ macro_source=145 │ │ invpool :: Identifier │ scope_layer=1 │ │ pool :: Identifier │ scope_layer=1 │ │ labels :: Identifier │ scope_layer=1 │ │ nlabels :: Identifier │ scope_layer=1 │ │ [call] │ │ │ Base.Docs.doc! :: Value │ macro_source=145 │ │ PooledArrays :: Value │ macro_source=145 │ │ [call] │ │ │ Base.Docs.Binding :: Value │ macro_source=145 │ │ Base :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ map :: Identifier │ │ │ [call] │ macro_source=145 │ │ Base.Docs.docstr :: Value │ macro_source=145 │ │ [call] │ macro_source=145 │ │ Core.svec :: Value │ macro_source=145 │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ macro_source=145 │ │ [call] │ macro_source=145 │ │ Dict{Symbol, Any} :: Value │ macro_source=145 │ │ :path => "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" :: Value │ macro_source=145 │ │ :linenumber => 322 :: Value │ macro_source=145 │ │ :module => PooledArrays :: Value │ macro_source=145 │ │ [where] │ │ │ [where] │ │ │ [where] │ │ │ [curly] │ │ │ Union :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ val :: Identifier │ scope_layer=3 │ │ │ │ file = "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" │ │ line = 322 │ └ mod = PooledArrays │ ERROR: LoadError: internal lowering bug: │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# - `jl_assert(!(haskey(ssa_rewrites, lhs_id)), _)`: multiple assignments to ssavalue │ Expression: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) │ Containing expressions: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) │ │ Detailed provenance: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) @#= /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:366 =# │ └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/closure_conversion.jl:197 =# │ └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =# │ └─ (= #₅ (call core.TypeVar :#T1 Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =# │ └─ (= #₅ (call core.TypeVar :#T1 Any)) │ └─ (call core.TypeVar :#T1 Any) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3025 =# │ └─ (<: Any) │ └─ (<: Any) │ └─ (<: Any) │ └─ (<: Any) │ ├─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" (function (where (:: (call (. Base (inert map)) (parameters (kw (:: pure Bool) false)) f (:: x (curly PooledArray (<: Any) R N RA))) (curly Union (curly PooledArray (<: Any) R N RA) (curly PooledArray (<: Any) Int N (call typeof (call similar (. x (inert refs)) Int (call ntuple (-> i (block 0)) (call ndims (. x (inert refs))))))))) R N RA) (block (&& pure (return (call _map_pure f x))) (&& (call == (call length x) 0) (return (call PooledArray (comprehension (generator (call f v) (= v x)))))) (= v1 (call f (ref x 1))) (= invpool (call Dict (call => v1 (call one (call eltype (. x (inert refs))))))) (= pool (vect v1)) (= labels (call similar (. x (inert refs)))) (= (ref labels 1) 1) (= nlabels 1) (return (call _map_notpure f x 2 invpool pool labels nlabels))))) │ └─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 │ │ Stacktrace: │ [1] iterate(A::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}) │ @ Base /source/usr/share/julia/JuliaLowering/src/ast.jl:23 [inlined] │ [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:1106 │ [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:1223 │ [4] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:851 │ [5] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:712 │ [6] compile_body(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:1007 │ [7] 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:1163 │ [8] 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:1253 │ [9] 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 │ [10] include(mod::Module, _path::String) │ @ Base ./Base.jl:326 │ [11] 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:3271 │ [12] top-level scope │ @ stdin:5 │ [13] eval(m::Module, e::Any) │ @ Core ./boot.jl:517 │ [14] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String) │ @ Base ./loading.jl:3113 │ [15] push!(a::Vector{SubString{String}}, item::String) │ @ Base ./loading.jl:3123 [inlined] │ [16] exec_options(opts::Base.JLOptions) │ @ Base ./client.jl:353 │ [17] _start() │ @ Base ./client.jl:596 │ in expression starting at /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:1 │ in expression starting at stdin:5 └ ┌ DataFrames │ [Output was shown above] └ WECC with classical generators: Error During Test at /home/pkgeval/.julia/packages/PowerDynData/91X2a/test/runtests.jl:181 Got exception outside of a @test The following 2 packages failed to precompile: PooledArrays Failed to precompile PooledArrays [2dfb63ee-cc39-5dd5-95bd-886bf059d720] to "/home/pkgeval/.julia/compiled/v1.14/PooledArrays/jl_Oh0z3d" (ProcessExited(1)). DataFrames Failed to precompile DataFrames [a93c6f00-e57d-5684-b7b6-d8193f3e46c0] to "/home/pkgeval/.julia/compiled/v1.14/DataFrames/jl_uHPjCt" (ProcessExited(1)). ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =# Core.@doc " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" function (Base.map(f, x::PooledArray{<:Any, R, N, RA}; pure::Bool = false)::Union{PooledArray{<:Any, R, N, RA}, PooledArray{<:Any, Int, N, typeof(similar(x.refs, Int, ntuple((i->begin │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:338 =# │ 0 │ end), ndims(x.refs))))}}) where {R, N, RA} │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:339 =# │ pure && return _map_pure(f, x) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:340 =# │ length(x) == 0 && return PooledArray([f(v) for v = x]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:341 =# │ v1 = f(x[1]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:342 =# │ invpool = Dict(v1 => one(eltype(x.refs))) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:343 =# │ pool = [v1] │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:344 =# │ labels = similar(x.refs) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:345 =# │ labels[1] = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:346 =# │ nlabels = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:347 =# │ return _map_notpure(f, x, 2, invpool, pool, labels, nlabels) │ 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/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) :: Value │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ │ [function] │ │ [where] │ │ [::] │ │ [call] │ │ [.] │ │ Base :: Identifier │ │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ │ Bool :: Identifier │ │ false :: Value │ │ f :: Identifier │ │ [::] │ │ x :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ Union :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ Int :: Identifier │ │ N :: Identifier │ │ [call] │ │ typeof :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ │ [call] │ │ ntuple :: Identifier │ │ [->] │ │ i :: Identifier │ │ [block] │ │ 0 :: Value │ │ [call] │ │ ndims :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [block] │ │ [&&] │ │ pure :: Identifier │ │ [return] │ │ [call] │ │ _map_pure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ [&&] │ │ [call] │ │ == :: Identifier │ │ [call] │ │ length :: Identifier │ │ x :: Identifier │ │ 0 :: Value │ │ [return] │ │ [call] │ │ PooledArray :: Identifier │ │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ │ v :: Identifier │ │ [=] │ │ v :: Identifier │ │ x :: Identifier │ │ [=] │ │ v1 :: Identifier │ │ [call] │ │ f :: Identifier │ │ [ref] │ │ x :: Identifier │ │ 1 :: Value │ │ [=] │ │ invpool :: Identifier │ │ [call] │ │ Dict :: Identifier │ │ [call] │ │ => :: Identifier │ │ v1 :: Identifier │ │ [call] │ │ one :: Identifier │ │ [call] │ │ eltype :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ │ [vect] │ │ v1 :: Identifier │ │ [=] │ │ labels :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ │ 1 :: Value │ │ 1 :: Value │ │ [=] │ │ nlabels :: Identifier │ │ 1 :: Value │ │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ 2 :: Value │ │ invpool :: Identifier │ │ pool :: Identifier │ │ labels :: Identifier │ │ nlabels :: 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] │ │ [.] │ │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ scope_layer=1 │ Bool :: Identifier │ scope_layer=1 │ false :: Value │ macro_source=145 │ f :: Identifier │ scope_layer=1 │ [::] │ │ x :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ Int :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [call] │ │ typeof :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ scope_layer=1 │ [call] │ │ ntuple :: Identifier │ scope_layer=1 │ [->] │ │ i :: Identifier │ scope_layer=1 │ [block] │ macro_source=145 │ 0 :: Value │ macro_source=145 │ [call] │ │ ndims :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [block] │ │ [&&] │ │ pure :: Identifier │ scope_layer=1 │ [return] │ │ [call] │ │ _map_pure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [&&] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 0 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ PooledArray :: Identifier │ scope_layer=1 │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ scope_layer=1 │ v :: Identifier │ scope_layer=1 │ [=] │ │ v :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [=] │ │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ f :: Identifier │ scope_layer=1 │ [ref] │ │ x :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [=] │ │ invpool :: Identifier │ scope_layer=1 │ [call] │ │ Dict :: Identifier │ scope_layer=1 │ [call] │ │ => :: Identifier │ scope_layer=1 │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ one :: Identifier │ scope_layer=1 │ [call] │ │ eltype :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ scope_layer=1 │ [vect] │ │ v1 :: Identifier │ scope_layer=1 │ [=] │ │ labels :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ 1 :: Value │ macro_source=145 │ [=] │ │ nlabels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 2 :: Value │ macro_source=145 │ invpool :: Identifier │ scope_layer=1 │ pool :: Identifier │ scope_layer=1 │ labels :: Identifier │ scope_layer=1 │ nlabels :: Identifier │ scope_layer=1 │ [call] │ │ Base.Docs.doc! :: Value │ macro_source=145 │ PooledArrays :: Value │ macro_source=145 │ [call] │ │ Base.Docs.Binding :: Value │ macro_source=145 │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [call] │ macro_source=145 │ Base.Docs.docstr :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Core.svec :: Value │ macro_source=145 │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Dict{Symbol, Any} :: Value │ macro_source=145 │ :path => "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" :: Value │ macro_source=145 │ :linenumber => 322 :: Value │ macro_source=145 │ :module => PooledArrays :: Value │ macro_source=145 │ [where] │ │ [where] │ │ [where] │ │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ val :: Identifier │ scope_layer=3 │ │ file = "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" │ line = 322 └ mod = PooledArrays ERROR: LoadError: internal lowering bug: #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# - `jl_assert(!(haskey(ssa_rewrites, lhs_id)), _)`: multiple assignments to ssavalue Expression:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) Containing expressions:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any))  Detailed provenance:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) @#= /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:366 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/closure_conversion.jl:197 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any))  └─ (call core.TypeVar :#T1 Any) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3025 =#  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  ├─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" (function (where (:: (call (. Base (inert map)) (parameters (kw (:: pure Bool) false)) f (:: x (curly PooledArray (<: Any) R N RA))) (curly Union (curly PooledArray (<: Any) R N RA) (curly PooledArray (<: Any) Int N (call typeof (call similar (. x (inert refs)) Int (call ntuple (-> i (block 0)) (call ndims (. x (inert refs))))))))) R N RA) (block (&& pure (return (call _map_pure f x))) (&& (call == (call length x) 0) (return (call PooledArray (comprehension (generator (call f v) (= v x)))))) (= v1 (call f (ref x 1))) (= invpool (call Dict (call => v1 (call one (call eltype (. x (inert refs))))))) (= pool (vect v1)) (= labels (call similar (. x (inert refs)))) (= (ref labels 1) 1) (= nlabels 1) (return (call _map_notpure f x 2 invpool pool labels nlabels)))))  └─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322  Stacktrace:  [1] iterate(A::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}})  @ Base /source/usr/share/julia/JuliaLowering/src/ast.jl:23 [inlined]  [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:1106  [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:1223  [4] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:851  [5] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:712  [6] compile_body(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:1007  [7] 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:1163  [8] 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:1253  [9] 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  [10] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [11] 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:3271  [12] top-level scope  @ stdin:5  [13] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [14] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [15] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [inlined]  [16] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:353  [17] _start()  @ Base ./client.jl:596 in expression starting at /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:1 in expression starting at stdin:5 ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("2dfb63ee-cc39-5dd5-95bd-886bf059d720"), "PooledArrays") 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:2818  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2672  [4] macro expansion  @ ./loading.jl:2599 [inlined]  [5] string(::String, ::Union{Char, SubString{String}, String, Symbol}, ::Symbol, ::String)  @ Base ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2563  [7] require  @ ./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/DataFrames/0Y1g5/src/DataFrames.jl:3  [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:3271  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [18] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [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/DataFrames/0Y1g5/src/DataFrames.jl:1 in expression starting at stdin:5 2 dependencies had output during precompilation: ┌ PooledArrays │ ┌ Info: JuliaLowering threw given input: │ │ code = │ │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =# Core.@doc " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" function (Base.map(f, x::PooledArray{<:Any, R, N, RA}; pure::Bool = false)::Union{PooledArray{<:Any, R, N, RA}, PooledArray{<:Any, Int, N, typeof(similar(x.refs, Int, ntuple((i->begin │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:338 =# │ │ 0 │ │ end), ndims(x.refs))))}}) where {R, N, RA} │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:339 =# │ │ pure && return _map_pure(f, x) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:340 =# │ │ length(x) == 0 && return PooledArray([f(v) for v = x]) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:341 =# │ │ v1 = f(x[1]) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:342 =# │ │ invpool = Dict(v1 => one(eltype(x.refs))) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:343 =# │ │ pool = [v1] │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:344 =# │ │ labels = similar(x.refs) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:345 =# │ │ labels[1] = 1 │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:346 =# │ │ nlabels = 1 │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:347 =# │ │ return _map_notpure(f, x, 2, invpool, pool, labels, nlabels) │ │ 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/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) :: Value │ │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ │ │ [function] │ │ │ [where] │ │ │ [::] │ │ │ [call] │ │ │ [.] │ │ │ Base :: Identifier │ │ │ [inert] │ │ │ map :: Identifier │ │ │ [parameters] │ │ │ [kw] │ │ │ [::] │ │ │ pure :: Identifier │ │ │ Bool :: Identifier │ │ │ false :: Value │ │ │ f :: Identifier │ │ │ [::] │ │ │ x :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [curly] │ │ │ Union :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ Int :: Identifier │ │ │ N :: Identifier │ │ │ [call] │ │ │ typeof :: Identifier │ │ │ [call] │ │ │ similar :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ Int :: Identifier │ │ │ [call] │ │ │ ntuple :: Identifier │ │ │ [->] │ │ │ i :: Identifier │ │ │ [block] │ │ │ 0 :: Value │ │ │ [call] │ │ │ ndims :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [block] │ │ │ [&&] │ │ │ pure :: Identifier │ │ │ [return] │ │ │ [call] │ │ │ _map_pure :: Identifier │ │ │ f :: Identifier │ │ │ x :: Identifier │ │ │ [&&] │ │ │ [call] │ │ │ == :: Identifier │ │ │ [call] │ │ │ length :: Identifier │ │ │ x :: Identifier │ │ │ 0 :: Value │ │ │ [return] │ │ │ [call] │ │ │ PooledArray :: Identifier │ │ │ [comprehension] │ │ │ [generator] │ │ │ [call] │ │ │ f :: Identifier │ │ │ v :: Identifier │ │ │ [=] │ │ │ v :: Identifier │ │ │ x :: Identifier │ │ │ [=] │ │ │ v1 :: Identifier │ │ │ [call] │ │ │ f :: Identifier │ │ │ [ref] │ │ │ x :: Identifier │ │ │ 1 :: Value │ │ │ [=] │ │ │ invpool :: Identifier │ │ │ [call] │ │ │ Dict :: Identifier │ │ │ [call] │ │ │ => :: Identifier │ │ │ v1 :: Identifier │ │ │ [call] │ │ │ one :: Identifier │ │ │ [call] │ │ │ eltype :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ pool :: Identifier │ │ │ [vect] │ │ │ v1 :: Identifier │ │ │ [=] │ │ │ labels :: Identifier │ │ │ [call] │ │ │ similar :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ [ref] │ │ │ labels :: Identifier │ │ │ 1 :: Value │ │ │ 1 :: Value │ │ │ [=] │ │ │ nlabels :: Identifier │ │ │ 1 :: Value │ │ │ [return] │ │ │ [call] │ │ │ _map_notpure :: Identifier │ │ │ f :: Identifier │ │ │ x :: Identifier │ │ │ 2 :: Value │ │ │ invpool :: Identifier │ │ │ pool :: Identifier │ │ │ labels :: Identifier │ │ │ nlabels :: 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] │ │ │ [.] │ │ │ Base :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ map :: Identifier │ │ │ [parameters] │ │ │ [kw] │ │ │ [::] │ │ │ pure :: Identifier │ scope_layer=1 │ │ Bool :: Identifier │ scope_layer=1 │ │ false :: Value │ macro_source=145 │ │ f :: Identifier │ scope_layer=1 │ │ [::] │ │ │ x :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Union :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ Int :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ [call] │ │ │ typeof :: Identifier │ scope_layer=1 │ │ [call] │ │ │ similar :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ Int :: Identifier │ scope_layer=1 │ │ [call] │ │ │ ntuple :: Identifier │ scope_layer=1 │ │ [->] │ │ │ i :: Identifier │ scope_layer=1 │ │ [block] │ macro_source=145 │ │ 0 :: Value │ macro_source=145 │ │ [call] │ │ │ ndims :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [block] │ │ │ [&&] │ │ │ pure :: Identifier │ scope_layer=1 │ │ [return] │ │ │ [call] │ │ │ _map_pure :: Identifier │ scope_layer=1 │ │ f :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ [&&] │ │ │ [call] │ │ │ == :: Identifier │ scope_layer=1 │ │ [call] │ │ │ length :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ 0 :: Value │ macro_source=145 │ │ [return] │ │ │ [call] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [comprehension] │ │ │ [generator] │ │ │ [call] │ │ │ f :: Identifier │ scope_layer=1 │ │ v :: Identifier │ scope_layer=1 │ │ [=] │ │ │ v :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ [=] │ │ │ v1 :: Identifier │ scope_layer=1 │ │ [call] │ │ │ f :: Identifier │ scope_layer=1 │ │ [ref] │ │ │ x :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ [=] │ │ │ invpool :: Identifier │ scope_layer=1 │ │ [call] │ │ │ Dict :: Identifier │ scope_layer=1 │ │ [call] │ │ │ => :: Identifier │ scope_layer=1 │ │ v1 :: Identifier │ scope_layer=1 │ │ [call] │ │ │ one :: Identifier │ scope_layer=1 │ │ [call] │ │ │ eltype :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ pool :: Identifier │ scope_layer=1 │ │ [vect] │ │ │ v1 :: Identifier │ scope_layer=1 │ │ [=] │ │ │ labels :: Identifier │ scope_layer=1 │ │ [call] │ │ │ similar :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ [ref] │ │ │ labels :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ 1 :: Value │ macro_source=145 │ │ [=] │ │ │ nlabels :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ [return] │ │ │ [call] │ │ │ _map_notpure :: Identifier │ scope_layer=1 │ │ f :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ 2 :: Value │ macro_source=145 │ │ invpool :: Identifier │ scope_layer=1 │ │ pool :: Identifier │ scope_layer=1 │ │ labels :: Identifier │ scope_layer=1 │ │ nlabels :: Identifier │ scope_layer=1 │ │ [call] │ │ │ Base.Docs.doc! :: Value │ macro_source=145 │ │ PooledArrays :: Value │ macro_source=145 │ │ [call] │ │ │ Base.Docs.Binding :: Value │ macro_source=145 │ │ Base :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ map :: Identifier │ │ │ [call] │ macro_source=145 │ │ Base.Docs.docstr :: Value │ macro_source=145 │ │ [call] │ macro_source=145 │ │ Core.svec :: Value │ macro_source=145 │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ macro_source=145 │ │ [call] │ macro_source=145 │ │ Dict{Symbol, Any} :: Value │ macro_source=145 │ │ :path => "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" :: Value │ macro_source=145 │ │ :linenumber => 322 :: Value │ macro_source=145 │ │ :module => PooledArrays :: Value │ macro_source=145 │ │ [where] │ │ │ [where] │ │ │ [where] │ │ │ [curly] │ │ │ Union :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ val :: Identifier │ scope_layer=3 │ │ │ │ file = "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" │ │ line = 322 │ └ mod = PooledArrays │ ERROR: LoadError: internal lowering bug: │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# - `jl_assert(!(haskey(ssa_rewrites, lhs_id)), _)`: multiple assignments to ssavalue │ Expression: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) │ Containing expressions: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) │ │ Detailed provenance: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) @#= /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:366 =# │ └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/closure_conversion.jl:197 =# │ └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =# │ └─ (= #₅ (call core.TypeVar :#T1 Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =# │ └─ (= #₅ (call core.TypeVar :#T1 Any)) │ └─ (call core.TypeVar :#T1 Any) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3025 =# │ └─ (<: Any) │ └─ (<: Any) │ └─ (<: Any) │ └─ (<: Any) │ ├─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" (function (where (:: (call (. Base (inert map)) (parameters (kw (:: pure Bool) false)) f (:: x (curly PooledArray (<: Any) R N RA))) (curly Union (curly PooledArray (<: Any) R N RA) (curly PooledArray (<: Any) Int N (call typeof (call similar (. x (inert refs)) Int (call ntuple (-> i (block 0)) (call ndims (. x (inert refs))))))))) R N RA) (block (&& pure (return (call _map_pure f x))) (&& (call == (call length x) 0) (return (call PooledArray (comprehension (generator (call f v) (= v x)))))) (= v1 (call f (ref x 1))) (= invpool (call Dict (call => v1 (call one (call eltype (. x (inert refs))))))) (= pool (vect v1)) (= labels (call similar (. x (inert refs)))) (= (ref labels 1) 1) (= nlabels 1) (return (call _map_notpure f x 2 invpool pool labels nlabels))))) │ └─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 │ │ Stacktrace: │ [1] iterate(A::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}) │ @ Base /source/usr/share/julia/JuliaLowering/src/ast.jl:23 [inlined] │ [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:1106 │ [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:1223 │ [4] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:851 │ [5] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:712 │ [6] compile_body(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:1007 │ [7] 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:1163 │ [8] 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:1253 │ [9] 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 │ [10] include(mod::Module, _path::String) │ @ Base ./Base.jl:326 │ [11] 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:3271 │ [12] top-level scope │ @ stdin:5 │ [13] eval(m::Module, e::Any) │ @ Core ./boot.jl:517 │ [14] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String) │ @ Base ./loading.jl:3113 │ [15] push!(a::Vector{SubString{String}}, item::String) │ @ Base ./loading.jl:3123 [inlined] │ [16] exec_options(opts::Base.JLOptions) │ @ Base ./client.jl:353 │ [17] _start() │ @ Base ./client.jl:596 │ in expression starting at /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:1 │ in expression starting at stdin:5 └ ┌ DataFrames │ [Output was shown above] └ WECC full dynamics: Error During Test at /home/pkgeval/.julia/packages/PowerDynData/91X2a/test/runtests.jl:181 Got exception outside of a @test The following 2 packages failed to precompile: PooledArrays Failed to precompile PooledArrays [2dfb63ee-cc39-5dd5-95bd-886bf059d720] to "/home/pkgeval/.julia/compiled/v1.14/PooledArrays/jl_dQDiDd" (ProcessExited(1)). DataFrames Failed to precompile DataFrames [a93c6f00-e57d-5684-b7b6-d8193f3e46c0] to "/home/pkgeval/.julia/compiled/v1.14/DataFrames/jl_Ys8NM2" (ProcessExited(1)). ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =# Core.@doc " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" function (Base.map(f, x::PooledArray{<:Any, R, N, RA}; pure::Bool = false)::Union{PooledArray{<:Any, R, N, RA}, PooledArray{<:Any, Int, N, typeof(similar(x.refs, Int, ntuple((i->begin │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:338 =# │ 0 │ end), ndims(x.refs))))}}) where {R, N, RA} │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:339 =# │ pure && return _map_pure(f, x) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:340 =# │ length(x) == 0 && return PooledArray([f(v) for v = x]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:341 =# │ v1 = f(x[1]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:342 =# │ invpool = Dict(v1 => one(eltype(x.refs))) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:343 =# │ pool = [v1] │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:344 =# │ labels = similar(x.refs) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:345 =# │ labels[1] = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:346 =# │ nlabels = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:347 =# │ return _map_notpure(f, x, 2, invpool, pool, labels, nlabels) │ 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/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) :: Value │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ │ [function] │ │ [where] │ │ [::] │ │ [call] │ │ [.] │ │ Base :: Identifier │ │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ │ Bool :: Identifier │ │ false :: Value │ │ f :: Identifier │ │ [::] │ │ x :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ Union :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ Int :: Identifier │ │ N :: Identifier │ │ [call] │ │ typeof :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ │ [call] │ │ ntuple :: Identifier │ │ [->] │ │ i :: Identifier │ │ [block] │ │ 0 :: Value │ │ [call] │ │ ndims :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [block] │ │ [&&] │ │ pure :: Identifier │ │ [return] │ │ [call] │ │ _map_pure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ [&&] │ │ [call] │ │ == :: Identifier │ │ [call] │ │ length :: Identifier │ │ x :: Identifier │ │ 0 :: Value │ │ [return] │ │ [call] │ │ PooledArray :: Identifier │ │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ │ v :: Identifier │ │ [=] │ │ v :: Identifier │ │ x :: Identifier │ │ [=] │ │ v1 :: Identifier │ │ [call] │ │ f :: Identifier │ │ [ref] │ │ x :: Identifier │ │ 1 :: Value │ │ [=] │ │ invpool :: Identifier │ │ [call] │ │ Dict :: Identifier │ │ [call] │ │ => :: Identifier │ │ v1 :: Identifier │ │ [call] │ │ one :: Identifier │ │ [call] │ │ eltype :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ │ [vect] │ │ v1 :: Identifier │ │ [=] │ │ labels :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ │ 1 :: Value │ │ 1 :: Value │ │ [=] │ │ nlabels :: Identifier │ │ 1 :: Value │ │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ 2 :: Value │ │ invpool :: Identifier │ │ pool :: Identifier │ │ labels :: Identifier │ │ nlabels :: 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] │ │ [.] │ │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ scope_layer=1 │ Bool :: Identifier │ scope_layer=1 │ false :: Value │ macro_source=145 │ f :: Identifier │ scope_layer=1 │ [::] │ │ x :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ Int :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [call] │ │ typeof :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ scope_layer=1 │ [call] │ │ ntuple :: Identifier │ scope_layer=1 │ [->] │ │ i :: Identifier │ scope_layer=1 │ [block] │ macro_source=145 │ 0 :: Value │ macro_source=145 │ [call] │ │ ndims :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [block] │ │ [&&] │ │ pure :: Identifier │ scope_layer=1 │ [return] │ │ [call] │ │ _map_pure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [&&] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 0 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ PooledArray :: Identifier │ scope_layer=1 │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ scope_layer=1 │ v :: Identifier │ scope_layer=1 │ [=] │ │ v :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [=] │ │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ f :: Identifier │ scope_layer=1 │ [ref] │ │ x :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [=] │ │ invpool :: Identifier │ scope_layer=1 │ [call] │ │ Dict :: Identifier │ scope_layer=1 │ [call] │ │ => :: Identifier │ scope_layer=1 │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ one :: Identifier │ scope_layer=1 │ [call] │ │ eltype :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ scope_layer=1 │ [vect] │ │ v1 :: Identifier │ scope_layer=1 │ [=] │ │ labels :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ 1 :: Value │ macro_source=145 │ [=] │ │ nlabels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 2 :: Value │ macro_source=145 │ invpool :: Identifier │ scope_layer=1 │ pool :: Identifier │ scope_layer=1 │ labels :: Identifier │ scope_layer=1 │ nlabels :: Identifier │ scope_layer=1 │ [call] │ │ Base.Docs.doc! :: Value │ macro_source=145 │ PooledArrays :: Value │ macro_source=145 │ [call] │ │ Base.Docs.Binding :: Value │ macro_source=145 │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [call] │ macro_source=145 │ Base.Docs.docstr :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Core.svec :: Value │ macro_source=145 │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Dict{Symbol, Any} :: Value │ macro_source=145 │ :path => "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" :: Value │ macro_source=145 │ :linenumber => 322 :: Value │ macro_source=145 │ :module => PooledArrays :: Value │ macro_source=145 │ [where] │ │ [where] │ │ [where] │ │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ val :: Identifier │ scope_layer=3 │ │ file = "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" │ line = 322 └ mod = PooledArrays ERROR: LoadError: internal lowering bug: #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# - `jl_assert(!(haskey(ssa_rewrites, lhs_id)), _)`: multiple assignments to ssavalue Expression:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) Containing expressions:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any))  Detailed provenance:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) @#= /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:366 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/closure_conversion.jl:197 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any))  └─ (call core.TypeVar :#T1 Any) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3025 =#  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  ├─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" (function (where (:: (call (. Base (inert map)) (parameters (kw (:: pure Bool) false)) f (:: x (curly PooledArray (<: Any) R N RA))) (curly Union (curly PooledArray (<: Any) R N RA) (curly PooledArray (<: Any) Int N (call typeof (call similar (. x (inert refs)) Int (call ntuple (-> i (block 0)) (call ndims (. x (inert refs))))))))) R N RA) (block (&& pure (return (call _map_pure f x))) (&& (call == (call length x) 0) (return (call PooledArray (comprehension (generator (call f v) (= v x)))))) (= v1 (call f (ref x 1))) (= invpool (call Dict (call => v1 (call one (call eltype (. x (inert refs))))))) (= pool (vect v1)) (= labels (call similar (. x (inert refs)))) (= (ref labels 1) 1) (= nlabels 1) (return (call _map_notpure f x 2 invpool pool labels nlabels)))))  └─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322  Stacktrace:  [1] iterate(A::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}})  @ Base /source/usr/share/julia/JuliaLowering/src/ast.jl:23 [inlined]  [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:1106  [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:1223  [4] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:851  [5] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:712  [6] compile_body(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:1007  [7] 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:1163  [8] 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:1253  [9] 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  [10] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [11] 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:3271  [12] top-level scope  @ stdin:5  [13] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [14] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [15] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [inlined]  [16] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:353  [17] _start()  @ Base ./client.jl:596 in expression starting at /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:1 in expression starting at stdin:5 ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("2dfb63ee-cc39-5dd5-95bd-886bf059d720"), "PooledArrays") 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:2818  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2672  [4] macro expansion  @ ./loading.jl:2599 [inlined]  [5] string(::String, ::Union{Char, SubString{String}, String, Symbol}, ::Symbol, ::String)  @ Base ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2563  [7] require  @ ./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/DataFrames/0Y1g5/src/DataFrames.jl:3  [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:3271  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [18] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [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/DataFrames/0Y1g5/src/DataFrames.jl:1 in expression starting at stdin:5 2 dependencies had output during precompilation: ┌ PooledArrays │ ┌ Info: JuliaLowering threw given input: │ │ code = │ │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =# Core.@doc " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" function (Base.map(f, x::PooledArray{<:Any, R, N, RA}; pure::Bool = false)::Union{PooledArray{<:Any, R, N, RA}, PooledArray{<:Any, Int, N, typeof(similar(x.refs, Int, ntuple((i->begin │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:338 =# │ │ 0 │ │ end), ndims(x.refs))))}}) where {R, N, RA} │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:339 =# │ │ pure && return _map_pure(f, x) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:340 =# │ │ length(x) == 0 && return PooledArray([f(v) for v = x]) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:341 =# │ │ v1 = f(x[1]) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:342 =# │ │ invpool = Dict(v1 => one(eltype(x.refs))) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:343 =# │ │ pool = [v1] │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:344 =# │ │ labels = similar(x.refs) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:345 =# │ │ labels[1] = 1 │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:346 =# │ │ nlabels = 1 │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:347 =# │ │ return _map_notpure(f, x, 2, invpool, pool, labels, nlabels) │ │ 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/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) :: Value │ │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ │ │ [function] │ │ │ [where] │ │ │ [::] │ │ │ [call] │ │ │ [.] │ │ │ Base :: Identifier │ │ │ [inert] │ │ │ map :: Identifier │ │ │ [parameters] │ │ │ [kw] │ │ │ [::] │ │ │ pure :: Identifier │ │ │ Bool :: Identifier │ │ │ false :: Value │ │ │ f :: Identifier │ │ │ [::] │ │ │ x :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [curly] │ │ │ Union :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ Int :: Identifier │ │ │ N :: Identifier │ │ │ [call] │ │ │ typeof :: Identifier │ │ │ [call] │ │ │ similar :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ Int :: Identifier │ │ │ [call] │ │ │ ntuple :: Identifier │ │ │ [->] │ │ │ i :: Identifier │ │ │ [block] │ │ │ 0 :: Value │ │ │ [call] │ │ │ ndims :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [block] │ │ │ [&&] │ │ │ pure :: Identifier │ │ │ [return] │ │ │ [call] │ │ │ _map_pure :: Identifier │ │ │ f :: Identifier │ │ │ x :: Identifier │ │ │ [&&] │ │ │ [call] │ │ │ == :: Identifier │ │ │ [call] │ │ │ length :: Identifier │ │ │ x :: Identifier │ │ │ 0 :: Value │ │ │ [return] │ │ │ [call] │ │ │ PooledArray :: Identifier │ │ │ [comprehension] │ │ │ [generator] │ │ │ [call] │ │ │ f :: Identifier │ │ │ v :: Identifier │ │ │ [=] │ │ │ v :: Identifier │ │ │ x :: Identifier │ │ │ [=] │ │ │ v1 :: Identifier │ │ │ [call] │ │ │ f :: Identifier │ │ │ [ref] │ │ │ x :: Identifier │ │ │ 1 :: Value │ │ │ [=] │ │ │ invpool :: Identifier │ │ │ [call] │ │ │ Dict :: Identifier │ │ │ [call] │ │ │ => :: Identifier │ │ │ v1 :: Identifier │ │ │ [call] │ │ │ one :: Identifier │ │ │ [call] │ │ │ eltype :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ pool :: Identifier │ │ │ [vect] │ │ │ v1 :: Identifier │ │ │ [=] │ │ │ labels :: Identifier │ │ │ [call] │ │ │ similar :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ [ref] │ │ │ labels :: Identifier │ │ │ 1 :: Value │ │ │ 1 :: Value │ │ │ [=] │ │ │ nlabels :: Identifier │ │ │ 1 :: Value │ │ │ [return] │ │ │ [call] │ │ │ _map_notpure :: Identifier │ │ │ f :: Identifier │ │ │ x :: Identifier │ │ │ 2 :: Value │ │ │ invpool :: Identifier │ │ │ pool :: Identifier │ │ │ labels :: Identifier │ │ │ nlabels :: 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] │ │ │ [.] │ │ │ Base :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ map :: Identifier │ │ │ [parameters] │ │ │ [kw] │ │ │ [::] │ │ │ pure :: Identifier │ scope_layer=1 │ │ Bool :: Identifier │ scope_layer=1 │ │ false :: Value │ macro_source=145 │ │ f :: Identifier │ scope_layer=1 │ │ [::] │ │ │ x :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Union :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ Int :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ [call] │ │ │ typeof :: Identifier │ scope_layer=1 │ │ [call] │ │ │ similar :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ Int :: Identifier │ scope_layer=1 │ │ [call] │ │ │ ntuple :: Identifier │ scope_layer=1 │ │ [->] │ │ │ i :: Identifier │ scope_layer=1 │ │ [block] │ macro_source=145 │ │ 0 :: Value │ macro_source=145 │ │ [call] │ │ │ ndims :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [block] │ │ │ [&&] │ │ │ pure :: Identifier │ scope_layer=1 │ │ [return] │ │ │ [call] │ │ │ _map_pure :: Identifier │ scope_layer=1 │ │ f :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ [&&] │ │ │ [call] │ │ │ == :: Identifier │ scope_layer=1 │ │ [call] │ │ │ length :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ 0 :: Value │ macro_source=145 │ │ [return] │ │ │ [call] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [comprehension] │ │ │ [generator] │ │ │ [call] │ │ │ f :: Identifier │ scope_layer=1 │ │ v :: Identifier │ scope_layer=1 │ │ [=] │ │ │ v :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ [=] │ │ │ v1 :: Identifier │ scope_layer=1 │ │ [call] │ │ │ f :: Identifier │ scope_layer=1 │ │ [ref] │ │ │ x :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ [=] │ │ │ invpool :: Identifier │ scope_layer=1 │ │ [call] │ │ │ Dict :: Identifier │ scope_layer=1 │ │ [call] │ │ │ => :: Identifier │ scope_layer=1 │ │ v1 :: Identifier │ scope_layer=1 │ │ [call] │ │ │ one :: Identifier │ scope_layer=1 │ │ [call] │ │ │ eltype :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ pool :: Identifier │ scope_layer=1 │ │ [vect] │ │ │ v1 :: Identifier │ scope_layer=1 │ │ [=] │ │ │ labels :: Identifier │ scope_layer=1 │ │ [call] │ │ │ similar :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ [ref] │ │ │ labels :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ 1 :: Value │ macro_source=145 │ │ [=] │ │ │ nlabels :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ [return] │ │ │ [call] │ │ │ _map_notpure :: Identifier │ scope_layer=1 │ │ f :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ 2 :: Value │ macro_source=145 │ │ invpool :: Identifier │ scope_layer=1 │ │ pool :: Identifier │ scope_layer=1 │ │ labels :: Identifier │ scope_layer=1 │ │ nlabels :: Identifier │ scope_layer=1 │ │ [call] │ │ │ Base.Docs.doc! :: Value │ macro_source=145 │ │ PooledArrays :: Value │ macro_source=145 │ │ [call] │ │ │ Base.Docs.Binding :: Value │ macro_source=145 │ │ Base :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ map :: Identifier │ │ │ [call] │ macro_source=145 │ │ Base.Docs.docstr :: Value │ macro_source=145 │ │ [call] │ macro_source=145 │ │ Core.svec :: Value │ macro_source=145 │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ macro_source=145 │ │ [call] │ macro_source=145 │ │ Dict{Symbol, Any} :: Value │ macro_source=145 │ │ :path => "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" :: Value │ macro_source=145 │ │ :linenumber => 322 :: Value │ macro_source=145 │ │ :module => PooledArrays :: Value │ macro_source=145 │ │ [where] │ │ │ [where] │ │ │ [where] │ │ │ [curly] │ │ │ Union :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ val :: Identifier │ scope_layer=3 │ │ │ │ file = "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" │ │ line = 322 │ └ mod = PooledArrays │ ERROR: LoadError: internal lowering bug: │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# - `jl_assert(!(haskey(ssa_rewrites, lhs_id)), _)`: multiple assignments to ssavalue │ Expression: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) │ Containing expressions: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) │ │ Detailed provenance: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) @#= /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:366 =# │ └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/closure_conversion.jl:197 =# │ └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =# │ └─ (= #₅ (call core.TypeVar :#T1 Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =# │ └─ (= #₅ (call core.TypeVar :#T1 Any)) │ └─ (call core.TypeVar :#T1 Any) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3025 =# │ └─ (<: Any) │ └─ (<: Any) │ └─ (<: Any) │ └─ (<: Any) │ ├─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" (function (where (:: (call (. Base (inert map)) (parameters (kw (:: pure Bool) false)) f (:: x (curly PooledArray (<: Any) R N RA))) (curly Union (curly PooledArray (<: Any) R N RA) (curly PooledArray (<: Any) Int N (call typeof (call similar (. x (inert refs)) Int (call ntuple (-> i (block 0)) (call ndims (. x (inert refs))))))))) R N RA) (block (&& pure (return (call _map_pure f x))) (&& (call == (call length x) 0) (return (call PooledArray (comprehension (generator (call f v) (= v x)))))) (= v1 (call f (ref x 1))) (= invpool (call Dict (call => v1 (call one (call eltype (. x (inert refs))))))) (= pool (vect v1)) (= labels (call similar (. x (inert refs)))) (= (ref labels 1) 1) (= nlabels 1) (return (call _map_notpure f x 2 invpool pool labels nlabels))))) │ └─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 │ │ Stacktrace: │ [1] iterate(A::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}) │ @ Base /source/usr/share/julia/JuliaLowering/src/ast.jl:23 [inlined] │ [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:1106 │ [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:1223 │ [4] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:851 │ [5] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:712 │ [6] compile_body(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:1007 │ [7] 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:1163 │ [8] 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:1253 │ [9] 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 │ [10] include(mod::Module, _path::String) │ @ Base ./Base.jl:326 │ [11] 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:3271 │ [12] top-level scope │ @ stdin:5 │ [13] eval(m::Module, e::Any) │ @ Core ./boot.jl:517 │ [14] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String) │ @ Base ./loading.jl:3113 │ [15] push!(a::Vector{SubString{String}}, item::String) │ @ Base ./loading.jl:3123 [inlined] │ [16] exec_options(opts::Base.JLOptions) │ @ Base ./client.jl:353 │ [17] _start() │ @ Base ./client.jl:596 │ in expression starting at /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:1 │ in expression starting at stdin:5 └ ┌ DataFrames │ [Output was shown above] └ IEEE 14-bus with IEEE voltage controller: Error During Test at /home/pkgeval/.julia/packages/PowerDynData/91X2a/test/runtests.jl:181 Got exception outside of a @test The following 2 packages failed to precompile: PooledArrays Failed to precompile PooledArrays [2dfb63ee-cc39-5dd5-95bd-886bf059d720] to "/home/pkgeval/.julia/compiled/v1.14/PooledArrays/jl_OnuyA0" (ProcessExited(1)). DataFrames Failed to precompile DataFrames [a93c6f00-e57d-5684-b7b6-d8193f3e46c0] to "/home/pkgeval/.julia/compiled/v1.14/DataFrames/jl_doHZ45" (ProcessExited(1)). ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =# Core.@doc " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" function (Base.map(f, x::PooledArray{<:Any, R, N, RA}; pure::Bool = false)::Union{PooledArray{<:Any, R, N, RA}, PooledArray{<:Any, Int, N, typeof(similar(x.refs, Int, ntuple((i->begin │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:338 =# │ 0 │ end), ndims(x.refs))))}}) where {R, N, RA} │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:339 =# │ pure && return _map_pure(f, x) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:340 =# │ length(x) == 0 && return PooledArray([f(v) for v = x]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:341 =# │ v1 = f(x[1]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:342 =# │ invpool = Dict(v1 => one(eltype(x.refs))) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:343 =# │ pool = [v1] │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:344 =# │ labels = similar(x.refs) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:345 =# │ labels[1] = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:346 =# │ nlabels = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:347 =# │ return _map_notpure(f, x, 2, invpool, pool, labels, nlabels) │ 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/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) :: Value │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ │ [function] │ │ [where] │ │ [::] │ │ [call] │ │ [.] │ │ Base :: Identifier │ │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ │ Bool :: Identifier │ │ false :: Value │ │ f :: Identifier │ │ [::] │ │ x :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ Union :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ Int :: Identifier │ │ N :: Identifier │ │ [call] │ │ typeof :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ │ [call] │ │ ntuple :: Identifier │ │ [->] │ │ i :: Identifier │ │ [block] │ │ 0 :: Value │ │ [call] │ │ ndims :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [block] │ │ [&&] │ │ pure :: Identifier │ │ [return] │ │ [call] │ │ _map_pure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ [&&] │ │ [call] │ │ == :: Identifier │ │ [call] │ │ length :: Identifier │ │ x :: Identifier │ │ 0 :: Value │ │ [return] │ │ [call] │ │ PooledArray :: Identifier │ │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ │ v :: Identifier │ │ [=] │ │ v :: Identifier │ │ x :: Identifier │ │ [=] │ │ v1 :: Identifier │ │ [call] │ │ f :: Identifier │ │ [ref] │ │ x :: Identifier │ │ 1 :: Value │ │ [=] │ │ invpool :: Identifier │ │ [call] │ │ Dict :: Identifier │ │ [call] │ │ => :: Identifier │ │ v1 :: Identifier │ │ [call] │ │ one :: Identifier │ │ [call] │ │ eltype :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ │ [vect] │ │ v1 :: Identifier │ │ [=] │ │ labels :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ │ 1 :: Value │ │ 1 :: Value │ │ [=] │ │ nlabels :: Identifier │ │ 1 :: Value │ │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ 2 :: Value │ │ invpool :: Identifier │ │ pool :: Identifier │ │ labels :: Identifier │ │ nlabels :: 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] │ │ [.] │ │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ scope_layer=1 │ Bool :: Identifier │ scope_layer=1 │ false :: Value │ macro_source=145 │ f :: Identifier │ scope_layer=1 │ [::] │ │ x :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ Int :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [call] │ │ typeof :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ scope_layer=1 │ [call] │ │ ntuple :: Identifier │ scope_layer=1 │ [->] │ │ i :: Identifier │ scope_layer=1 │ [block] │ macro_source=145 │ 0 :: Value │ macro_source=145 │ [call] │ │ ndims :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [block] │ │ [&&] │ │ pure :: Identifier │ scope_layer=1 │ [return] │ │ [call] │ │ _map_pure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [&&] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 0 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ PooledArray :: Identifier │ scope_layer=1 │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ scope_layer=1 │ v :: Identifier │ scope_layer=1 │ [=] │ │ v :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [=] │ │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ f :: Identifier │ scope_layer=1 │ [ref] │ │ x :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [=] │ │ invpool :: Identifier │ scope_layer=1 │ [call] │ │ Dict :: Identifier │ scope_layer=1 │ [call] │ │ => :: Identifier │ scope_layer=1 │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ one :: Identifier │ scope_layer=1 │ [call] │ │ eltype :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ scope_layer=1 │ [vect] │ │ v1 :: Identifier │ scope_layer=1 │ [=] │ │ labels :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ 1 :: Value │ macro_source=145 │ [=] │ │ nlabels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 2 :: Value │ macro_source=145 │ invpool :: Identifier │ scope_layer=1 │ pool :: Identifier │ scope_layer=1 │ labels :: Identifier │ scope_layer=1 │ nlabels :: Identifier │ scope_layer=1 │ [call] │ │ Base.Docs.doc! :: Value │ macro_source=145 │ PooledArrays :: Value │ macro_source=145 │ [call] │ │ Base.Docs.Binding :: Value │ macro_source=145 │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [call] │ macro_source=145 │ Base.Docs.docstr :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Core.svec :: Value │ macro_source=145 │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Dict{Symbol, Any} :: Value │ macro_source=145 │ :path => "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" :: Value │ macro_source=145 │ :linenumber => 322 :: Value │ macro_source=145 │ :module => PooledArrays :: Value │ macro_source=145 │ [where] │ │ [where] │ │ [where] │ │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ val :: Identifier │ scope_layer=3 │ │ file = "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" │ line = 322 └ mod = PooledArrays ERROR: LoadError: internal lowering bug: #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# - `jl_assert(!(haskey(ssa_rewrites, lhs_id)), _)`: multiple assignments to ssavalue Expression:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) Containing expressions:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any))  Detailed provenance:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) @#= /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:366 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/closure_conversion.jl:197 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any))  └─ (call core.TypeVar :#T1 Any) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3025 =#  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  ├─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" (function (where (:: (call (. Base (inert map)) (parameters (kw (:: pure Bool) false)) f (:: x (curly PooledArray (<: Any) R N RA))) (curly Union (curly PooledArray (<: Any) R N RA) (curly PooledArray (<: Any) Int N (call typeof (call similar (. x (inert refs)) Int (call ntuple (-> i (block 0)) (call ndims (. x (inert refs))))))))) R N RA) (block (&& pure (return (call _map_pure f x))) (&& (call == (call length x) 0) (return (call PooledArray (comprehension (generator (call f v) (= v x)))))) (= v1 (call f (ref x 1))) (= invpool (call Dict (call => v1 (call one (call eltype (. x (inert refs))))))) (= pool (vect v1)) (= labels (call similar (. x (inert refs)))) (= (ref labels 1) 1) (= nlabels 1) (return (call _map_notpure f x 2 invpool pool labels nlabels)))))  └─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322  Stacktrace:  [1] iterate(A::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}})  @ Base /source/usr/share/julia/JuliaLowering/src/ast.jl:23 [inlined]  [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:1106  [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:1223  [4] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:851  [5] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:712  [6] compile_body(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:1007  [7] 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:1163  [8] 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:1253  [9] 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  [10] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [11] 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:3271  [12] top-level scope  @ stdin:5  [13] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [14] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [15] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [inlined]  [16] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:353  [17] _start()  @ Base ./client.jl:596 in expression starting at /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:1 in expression starting at stdin:5 ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("2dfb63ee-cc39-5dd5-95bd-886bf059d720"), "PooledArrays") 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:2818  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2672  [4] macro expansion  @ ./loading.jl:2599 [inlined]  [5] string(::String, ::Union{Char, SubString{String}, String, Symbol}, ::Symbol, ::String)  @ Base ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2563  [7] require  @ ./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/DataFrames/0Y1g5/src/DataFrames.jl:3  [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:3271  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [18] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [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/DataFrames/0Y1g5/src/DataFrames.jl:1 in expression starting at stdin:5 2 dependencies had output during precompilation: ┌ PooledArrays │ ┌ Info: JuliaLowering threw given input: │ │ code = │ │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =# Core.@doc " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" function (Base.map(f, x::PooledArray{<:Any, R, N, RA}; pure::Bool = false)::Union{PooledArray{<:Any, R, N, RA}, PooledArray{<:Any, Int, N, typeof(similar(x.refs, Int, ntuple((i->begin │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:338 =# │ │ 0 │ │ end), ndims(x.refs))))}}) where {R, N, RA} │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:339 =# │ │ pure && return _map_pure(f, x) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:340 =# │ │ length(x) == 0 && return PooledArray([f(v) for v = x]) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:341 =# │ │ v1 = f(x[1]) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:342 =# │ │ invpool = Dict(v1 => one(eltype(x.refs))) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:343 =# │ │ pool = [v1] │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:344 =# │ │ labels = similar(x.refs) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:345 =# │ │ labels[1] = 1 │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:346 =# │ │ nlabels = 1 │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:347 =# │ │ return _map_notpure(f, x, 2, invpool, pool, labels, nlabels) │ │ 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/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) :: Value │ │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ │ │ [function] │ │ │ [where] │ │ │ [::] │ │ │ [call] │ │ │ [.] │ │ │ Base :: Identifier │ │ │ [inert] │ │ │ map :: Identifier │ │ │ [parameters] │ │ │ [kw] │ │ │ [::] │ │ │ pure :: Identifier │ │ │ Bool :: Identifier │ │ │ false :: Value │ │ │ f :: Identifier │ │ │ [::] │ │ │ x :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [curly] │ │ │ Union :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ Int :: Identifier │ │ │ N :: Identifier │ │ │ [call] │ │ │ typeof :: Identifier │ │ │ [call] │ │ │ similar :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ Int :: Identifier │ │ │ [call] │ │ │ ntuple :: Identifier │ │ │ [->] │ │ │ i :: Identifier │ │ │ [block] │ │ │ 0 :: Value │ │ │ [call] │ │ │ ndims :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [block] │ │ │ [&&] │ │ │ pure :: Identifier │ │ │ [return] │ │ │ [call] │ │ │ _map_pure :: Identifier │ │ │ f :: Identifier │ │ │ x :: Identifier │ │ │ [&&] │ │ │ [call] │ │ │ == :: Identifier │ │ │ [call] │ │ │ length :: Identifier │ │ │ x :: Identifier │ │ │ 0 :: Value │ │ │ [return] │ │ │ [call] │ │ │ PooledArray :: Identifier │ │ │ [comprehension] │ │ │ [generator] │ │ │ [call] │ │ │ f :: Identifier │ │ │ v :: Identifier │ │ │ [=] │ │ │ v :: Identifier │ │ │ x :: Identifier │ │ │ [=] │ │ │ v1 :: Identifier │ │ │ [call] │ │ │ f :: Identifier │ │ │ [ref] │ │ │ x :: Identifier │ │ │ 1 :: Value │ │ │ [=] │ │ │ invpool :: Identifier │ │ │ [call] │ │ │ Dict :: Identifier │ │ │ [call] │ │ │ => :: Identifier │ │ │ v1 :: Identifier │ │ │ [call] │ │ │ one :: Identifier │ │ │ [call] │ │ │ eltype :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ pool :: Identifier │ │ │ [vect] │ │ │ v1 :: Identifier │ │ │ [=] │ │ │ labels :: Identifier │ │ │ [call] │ │ │ similar :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ [ref] │ │ │ labels :: Identifier │ │ │ 1 :: Value │ │ │ 1 :: Value │ │ │ [=] │ │ │ nlabels :: Identifier │ │ │ 1 :: Value │ │ │ [return] │ │ │ [call] │ │ │ _map_notpure :: Identifier │ │ │ f :: Identifier │ │ │ x :: Identifier │ │ │ 2 :: Value │ │ │ invpool :: Identifier │ │ │ pool :: Identifier │ │ │ labels :: Identifier │ │ │ nlabels :: 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] │ │ │ [.] │ │ │ Base :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ map :: Identifier │ │ │ [parameters] │ │ │ [kw] │ │ │ [::] │ │ │ pure :: Identifier │ scope_layer=1 │ │ Bool :: Identifier │ scope_layer=1 │ │ false :: Value │ macro_source=145 │ │ f :: Identifier │ scope_layer=1 │ │ [::] │ │ │ x :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Union :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ Int :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ [call] │ │ │ typeof :: Identifier │ scope_layer=1 │ │ [call] │ │ │ similar :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ Int :: Identifier │ scope_layer=1 │ │ [call] │ │ │ ntuple :: Identifier │ scope_layer=1 │ │ [->] │ │ │ i :: Identifier │ scope_layer=1 │ │ [block] │ macro_source=145 │ │ 0 :: Value │ macro_source=145 │ │ [call] │ │ │ ndims :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [block] │ │ │ [&&] │ │ │ pure :: Identifier │ scope_layer=1 │ │ [return] │ │ │ [call] │ │ │ _map_pure :: Identifier │ scope_layer=1 │ │ f :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ [&&] │ │ │ [call] │ │ │ == :: Identifier │ scope_layer=1 │ │ [call] │ │ │ length :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ 0 :: Value │ macro_source=145 │ │ [return] │ │ │ [call] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [comprehension] │ │ │ [generator] │ │ │ [call] │ │ │ f :: Identifier │ scope_layer=1 │ │ v :: Identifier │ scope_layer=1 │ │ [=] │ │ │ v :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ [=] │ │ │ v1 :: Identifier │ scope_layer=1 │ │ [call] │ │ │ f :: Identifier │ scope_layer=1 │ │ [ref] │ │ │ x :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ [=] │ │ │ invpool :: Identifier │ scope_layer=1 │ │ [call] │ │ │ Dict :: Identifier │ scope_layer=1 │ │ [call] │ │ │ => :: Identifier │ scope_layer=1 │ │ v1 :: Identifier │ scope_layer=1 │ │ [call] │ │ │ one :: Identifier │ scope_layer=1 │ │ [call] │ │ │ eltype :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ pool :: Identifier │ scope_layer=1 │ │ [vect] │ │ │ v1 :: Identifier │ scope_layer=1 │ │ [=] │ │ │ labels :: Identifier │ scope_layer=1 │ │ [call] │ │ │ similar :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ [ref] │ │ │ labels :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ 1 :: Value │ macro_source=145 │ │ [=] │ │ │ nlabels :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ [return] │ │ │ [call] │ │ │ _map_notpure :: Identifier │ scope_layer=1 │ │ f :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ 2 :: Value │ macro_source=145 │ │ invpool :: Identifier │ scope_layer=1 │ │ pool :: Identifier │ scope_layer=1 │ │ labels :: Identifier │ scope_layer=1 │ │ nlabels :: Identifier │ scope_layer=1 │ │ [call] │ │ │ Base.Docs.doc! :: Value │ macro_source=145 │ │ PooledArrays :: Value │ macro_source=145 │ │ [call] │ │ │ Base.Docs.Binding :: Value │ macro_source=145 │ │ Base :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ map :: Identifier │ │ │ [call] │ macro_source=145 │ │ Base.Docs.docstr :: Value │ macro_source=145 │ │ [call] │ macro_source=145 │ │ Core.svec :: Value │ macro_source=145 │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ macro_source=145 │ │ [call] │ macro_source=145 │ │ Dict{Symbol, Any} :: Value │ macro_source=145 │ │ :path => "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" :: Value │ macro_source=145 │ │ :linenumber => 322 :: Value │ macro_source=145 │ │ :module => PooledArrays :: Value │ macro_source=145 │ │ [where] │ │ │ [where] │ │ │ [where] │ │ │ [curly] │ │ │ Union :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ val :: Identifier │ scope_layer=3 │ │ │ │ file = "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" │ │ line = 322 │ └ mod = PooledArrays │ ERROR: LoadError: internal lowering bug: │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# - `jl_assert(!(haskey(ssa_rewrites, lhs_id)), _)`: multiple assignments to ssavalue │ Expression: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) │ Containing expressions: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) │ │ Detailed provenance: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) @#= /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:366 =# │ └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/closure_conversion.jl:197 =# │ └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =# │ └─ (= #₅ (call core.TypeVar :#T1 Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =# │ └─ (= #₅ (call core.TypeVar :#T1 Any)) │ └─ (call core.TypeVar :#T1 Any) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3025 =# │ └─ (<: Any) │ └─ (<: Any) │ └─ (<: Any) │ └─ (<: Any) │ ├─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" (function (where (:: (call (. Base (inert map)) (parameters (kw (:: pure Bool) false)) f (:: x (curly PooledArray (<: Any) R N RA))) (curly Union (curly PooledArray (<: Any) R N RA) (curly PooledArray (<: Any) Int N (call typeof (call similar (. x (inert refs)) Int (call ntuple (-> i (block 0)) (call ndims (. x (inert refs))))))))) R N RA) (block (&& pure (return (call _map_pure f x))) (&& (call == (call length x) 0) (return (call PooledArray (comprehension (generator (call f v) (= v x)))))) (= v1 (call f (ref x 1))) (= invpool (call Dict (call => v1 (call one (call eltype (. x (inert refs))))))) (= pool (vect v1)) (= labels (call similar (. x (inert refs)))) (= (ref labels 1) 1) (= nlabels 1) (return (call _map_notpure f x 2 invpool pool labels nlabels))))) │ └─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 │ │ Stacktrace: │ [1] iterate(A::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}) │ @ Base /source/usr/share/julia/JuliaLowering/src/ast.jl:23 [inlined] │ [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:1106 │ [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:1223 │ [4] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:851 │ [5] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:712 │ [6] compile_body(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:1007 │ [7] 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:1163 │ [8] 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:1253 │ [9] 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 │ [10] include(mod::Module, _path::String) │ @ Base ./Base.jl:326 │ [11] 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:3271 │ [12] top-level scope │ @ stdin:5 │ [13] eval(m::Module, e::Any) │ @ Core ./boot.jl:517 │ [14] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String) │ @ Base ./loading.jl:3113 │ [15] push!(a::Vector{SubString{String}}, item::String) │ @ Base ./loading.jl:3123 [inlined] │ [16] exec_options(opts::Base.JLOptions) │ @ Base ./client.jl:353 │ [17] _start() │ @ Base ./client.jl:596 │ in expression starting at /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:1 │ in expression starting at stdin:5 └ ┌ DataFrames │ [Output was shown above] └ Kundur with classical generators: Error During Test at /home/pkgeval/.julia/packages/PowerDynData/91X2a/test/runtests.jl:181 Got exception outside of a @test The following 2 packages failed to precompile: PooledArrays Failed to precompile PooledArrays [2dfb63ee-cc39-5dd5-95bd-886bf059d720] to "/home/pkgeval/.julia/compiled/v1.14/PooledArrays/jl_hrI01d" (ProcessExited(1)). DataFrames Failed to precompile DataFrames [a93c6f00-e57d-5684-b7b6-d8193f3e46c0] to "/home/pkgeval/.julia/compiled/v1.14/DataFrames/jl_rZmqx7" (ProcessExited(1)). ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =# Core.@doc " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" function (Base.map(f, x::PooledArray{<:Any, R, N, RA}; pure::Bool = false)::Union{PooledArray{<:Any, R, N, RA}, PooledArray{<:Any, Int, N, typeof(similar(x.refs, Int, ntuple((i->begin │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:338 =# │ 0 │ end), ndims(x.refs))))}}) where {R, N, RA} │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:339 =# │ pure && return _map_pure(f, x) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:340 =# │ length(x) == 0 && return PooledArray([f(v) for v = x]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:341 =# │ v1 = f(x[1]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:342 =# │ invpool = Dict(v1 => one(eltype(x.refs))) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:343 =# │ pool = [v1] │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:344 =# │ labels = similar(x.refs) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:345 =# │ labels[1] = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:346 =# │ nlabels = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:347 =# │ return _map_notpure(f, x, 2, invpool, pool, labels, nlabels) │ 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/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) :: Value │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ │ [function] │ │ [where] │ │ [::] │ │ [call] │ │ [.] │ │ Base :: Identifier │ │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ │ Bool :: Identifier │ │ false :: Value │ │ f :: Identifier │ │ [::] │ │ x :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ Union :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ Int :: Identifier │ │ N :: Identifier │ │ [call] │ │ typeof :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ │ [call] │ │ ntuple :: Identifier │ │ [->] │ │ i :: Identifier │ │ [block] │ │ 0 :: Value │ │ [call] │ │ ndims :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [block] │ │ [&&] │ │ pure :: Identifier │ │ [return] │ │ [call] │ │ _map_pure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ [&&] │ │ [call] │ │ == :: Identifier │ │ [call] │ │ length :: Identifier │ │ x :: Identifier │ │ 0 :: Value │ │ [return] │ │ [call] │ │ PooledArray :: Identifier │ │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ │ v :: Identifier │ │ [=] │ │ v :: Identifier │ │ x :: Identifier │ │ [=] │ │ v1 :: Identifier │ │ [call] │ │ f :: Identifier │ │ [ref] │ │ x :: Identifier │ │ 1 :: Value │ │ [=] │ │ invpool :: Identifier │ │ [call] │ │ Dict :: Identifier │ │ [call] │ │ => :: Identifier │ │ v1 :: Identifier │ │ [call] │ │ one :: Identifier │ │ [call] │ │ eltype :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ │ [vect] │ │ v1 :: Identifier │ │ [=] │ │ labels :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ │ 1 :: Value │ │ 1 :: Value │ │ [=] │ │ nlabels :: Identifier │ │ 1 :: Value │ │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ 2 :: Value │ │ invpool :: Identifier │ │ pool :: Identifier │ │ labels :: Identifier │ │ nlabels :: 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] │ │ [.] │ │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ scope_layer=1 │ Bool :: Identifier │ scope_layer=1 │ false :: Value │ macro_source=145 │ f :: Identifier │ scope_layer=1 │ [::] │ │ x :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ Int :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [call] │ │ typeof :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ scope_layer=1 │ [call] │ │ ntuple :: Identifier │ scope_layer=1 │ [->] │ │ i :: Identifier │ scope_layer=1 │ [block] │ macro_source=145 │ 0 :: Value │ macro_source=145 │ [call] │ │ ndims :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [block] │ │ [&&] │ │ pure :: Identifier │ scope_layer=1 │ [return] │ │ [call] │ │ _map_pure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [&&] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 0 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ PooledArray :: Identifier │ scope_layer=1 │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ scope_layer=1 │ v :: Identifier │ scope_layer=1 │ [=] │ │ v :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [=] │ │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ f :: Identifier │ scope_layer=1 │ [ref] │ │ x :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [=] │ │ invpool :: Identifier │ scope_layer=1 │ [call] │ │ Dict :: Identifier │ scope_layer=1 │ [call] │ │ => :: Identifier │ scope_layer=1 │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ one :: Identifier │ scope_layer=1 │ [call] │ │ eltype :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ scope_layer=1 │ [vect] │ │ v1 :: Identifier │ scope_layer=1 │ [=] │ │ labels :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ 1 :: Value │ macro_source=145 │ [=] │ │ nlabels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 2 :: Value │ macro_source=145 │ invpool :: Identifier │ scope_layer=1 │ pool :: Identifier │ scope_layer=1 │ labels :: Identifier │ scope_layer=1 │ nlabels :: Identifier │ scope_layer=1 │ [call] │ │ Base.Docs.doc! :: Value │ macro_source=145 │ PooledArrays :: Value │ macro_source=145 │ [call] │ │ Base.Docs.Binding :: Value │ macro_source=145 │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [call] │ macro_source=145 │ Base.Docs.docstr :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Core.svec :: Value │ macro_source=145 │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Dict{Symbol, Any} :: Value │ macro_source=145 │ :path => "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" :: Value │ macro_source=145 │ :linenumber => 322 :: Value │ macro_source=145 │ :module => PooledArrays :: Value │ macro_source=145 │ [where] │ │ [where] │ │ [where] │ │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ val :: Identifier │ scope_layer=3 │ │ file = "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" │ line = 322 └ mod = PooledArrays ERROR: LoadError: internal lowering bug: #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# - `jl_assert(!(haskey(ssa_rewrites, lhs_id)), _)`: multiple assignments to ssavalue Expression:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) Containing expressions:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any))  Detailed provenance:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) @#= /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:366 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/closure_conversion.jl:197 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any))  └─ (call core.TypeVar :#T1 Any) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3025 =#  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  ├─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" (function (where (:: (call (. Base (inert map)) (parameters (kw (:: pure Bool) false)) f (:: x (curly PooledArray (<: Any) R N RA))) (curly Union (curly PooledArray (<: Any) R N RA) (curly PooledArray (<: Any) Int N (call typeof (call similar (. x (inert refs)) Int (call ntuple (-> i (block 0)) (call ndims (. x (inert refs))))))))) R N RA) (block (&& pure (return (call _map_pure f x))) (&& (call == (call length x) 0) (return (call PooledArray (comprehension (generator (call f v) (= v x)))))) (= v1 (call f (ref x 1))) (= invpool (call Dict (call => v1 (call one (call eltype (. x (inert refs))))))) (= pool (vect v1)) (= labels (call similar (. x (inert refs)))) (= (ref labels 1) 1) (= nlabels 1) (return (call _map_notpure f x 2 invpool pool labels nlabels)))))  └─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322  Stacktrace:  [1] iterate(A::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}})  @ Base /source/usr/share/julia/JuliaLowering/src/ast.jl:23 [inlined]  [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:1106  [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:1223  [4] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:851  [5] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:712  [6] compile_body(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:1007  [7] 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:1163  [8] 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:1253  [9] 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  [10] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [11] 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:3271  [12] top-level scope  @ stdin:5  [13] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [14] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [15] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [inlined]  [16] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:353  [17] _start()  @ Base ./client.jl:596 in expression starting at /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:1 in expression starting at stdin:5 ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("2dfb63ee-cc39-5dd5-95bd-886bf059d720"), "PooledArrays") 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:2818  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2672  [4] macro expansion  @ ./loading.jl:2599 [inlined]  [5] string(::String, ::Union{Char, SubString{String}, String, Symbol}, ::Symbol, ::String)  @ Base ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2563  [7] require  @ ./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/DataFrames/0Y1g5/src/DataFrames.jl:3  [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:3271  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [18] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [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/DataFrames/0Y1g5/src/DataFrames.jl:1 in expression starting at stdin:5 2 dependencies had output during precompilation: ┌ PooledArrays │ ┌ Info: JuliaLowering threw given input: │ │ code = │ │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =# Core.@doc " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" function (Base.map(f, x::PooledArray{<:Any, R, N, RA}; pure::Bool = false)::Union{PooledArray{<:Any, R, N, RA}, PooledArray{<:Any, Int, N, typeof(similar(x.refs, Int, ntuple((i->begin │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:338 =# │ │ 0 │ │ end), ndims(x.refs))))}}) where {R, N, RA} │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:339 =# │ │ pure && return _map_pure(f, x) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:340 =# │ │ length(x) == 0 && return PooledArray([f(v) for v = x]) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:341 =# │ │ v1 = f(x[1]) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:342 =# │ │ invpool = Dict(v1 => one(eltype(x.refs))) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:343 =# │ │ pool = [v1] │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:344 =# │ │ labels = similar(x.refs) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:345 =# │ │ labels[1] = 1 │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:346 =# │ │ nlabels = 1 │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:347 =# │ │ return _map_notpure(f, x, 2, invpool, pool, labels, nlabels) │ │ 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/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) :: Value │ │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ │ │ [function] │ │ │ [where] │ │ │ [::] │ │ │ [call] │ │ │ [.] │ │ │ Base :: Identifier │ │ │ [inert] │ │ │ map :: Identifier │ │ │ [parameters] │ │ │ [kw] │ │ │ [::] │ │ │ pure :: Identifier │ │ │ Bool :: Identifier │ │ │ false :: Value │ │ │ f :: Identifier │ │ │ [::] │ │ │ x :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [curly] │ │ │ Union :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ Int :: Identifier │ │ │ N :: Identifier │ │ │ [call] │ │ │ typeof :: Identifier │ │ │ [call] │ │ │ similar :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ Int :: Identifier │ │ │ [call] │ │ │ ntuple :: Identifier │ │ │ [->] │ │ │ i :: Identifier │ │ │ [block] │ │ │ 0 :: Value │ │ │ [call] │ │ │ ndims :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [block] │ │ │ [&&] │ │ │ pure :: Identifier │ │ │ [return] │ │ │ [call] │ │ │ _map_pure :: Identifier │ │ │ f :: Identifier │ │ │ x :: Identifier │ │ │ [&&] │ │ │ [call] │ │ │ == :: Identifier │ │ │ [call] │ │ │ length :: Identifier │ │ │ x :: Identifier │ │ │ 0 :: Value │ │ │ [return] │ │ │ [call] │ │ │ PooledArray :: Identifier │ │ │ [comprehension] │ │ │ [generator] │ │ │ [call] │ │ │ f :: Identifier │ │ │ v :: Identifier │ │ │ [=] │ │ │ v :: Identifier │ │ │ x :: Identifier │ │ │ [=] │ │ │ v1 :: Identifier │ │ │ [call] │ │ │ f :: Identifier │ │ │ [ref] │ │ │ x :: Identifier │ │ │ 1 :: Value │ │ │ [=] │ │ │ invpool :: Identifier │ │ │ [call] │ │ │ Dict :: Identifier │ │ │ [call] │ │ │ => :: Identifier │ │ │ v1 :: Identifier │ │ │ [call] │ │ │ one :: Identifier │ │ │ [call] │ │ │ eltype :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ pool :: Identifier │ │ │ [vect] │ │ │ v1 :: Identifier │ │ │ [=] │ │ │ labels :: Identifier │ │ │ [call] │ │ │ similar :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ [ref] │ │ │ labels :: Identifier │ │ │ 1 :: Value │ │ │ 1 :: Value │ │ │ [=] │ │ │ nlabels :: Identifier │ │ │ 1 :: Value │ │ │ [return] │ │ │ [call] │ │ │ _map_notpure :: Identifier │ │ │ f :: Identifier │ │ │ x :: Identifier │ │ │ 2 :: Value │ │ │ invpool :: Identifier │ │ │ pool :: Identifier │ │ │ labels :: Identifier │ │ │ nlabels :: 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] │ │ │ [.] │ │ │ Base :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ map :: Identifier │ │ │ [parameters] │ │ │ [kw] │ │ │ [::] │ │ │ pure :: Identifier │ scope_layer=1 │ │ Bool :: Identifier │ scope_layer=1 │ │ false :: Value │ macro_source=145 │ │ f :: Identifier │ scope_layer=1 │ │ [::] │ │ │ x :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Union :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ Int :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ [call] │ │ │ typeof :: Identifier │ scope_layer=1 │ │ [call] │ │ │ similar :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ Int :: Identifier │ scope_layer=1 │ │ [call] │ │ │ ntuple :: Identifier │ scope_layer=1 │ │ [->] │ │ │ i :: Identifier │ scope_layer=1 │ │ [block] │ macro_source=145 │ │ 0 :: Value │ macro_source=145 │ │ [call] │ │ │ ndims :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [block] │ │ │ [&&] │ │ │ pure :: Identifier │ scope_layer=1 │ │ [return] │ │ │ [call] │ │ │ _map_pure :: Identifier │ scope_layer=1 │ │ f :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ [&&] │ │ │ [call] │ │ │ == :: Identifier │ scope_layer=1 │ │ [call] │ │ │ length :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ 0 :: Value │ macro_source=145 │ │ [return] │ │ │ [call] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [comprehension] │ │ │ [generator] │ │ │ [call] │ │ │ f :: Identifier │ scope_layer=1 │ │ v :: Identifier │ scope_layer=1 │ │ [=] │ │ │ v :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ [=] │ │ │ v1 :: Identifier │ scope_layer=1 │ │ [call] │ │ │ f :: Identifier │ scope_layer=1 │ │ [ref] │ │ │ x :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ [=] │ │ │ invpool :: Identifier │ scope_layer=1 │ │ [call] │ │ │ Dict :: Identifier │ scope_layer=1 │ │ [call] │ │ │ => :: Identifier │ scope_layer=1 │ │ v1 :: Identifier │ scope_layer=1 │ │ [call] │ │ │ one :: Identifier │ scope_layer=1 │ │ [call] │ │ │ eltype :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ pool :: Identifier │ scope_layer=1 │ │ [vect] │ │ │ v1 :: Identifier │ scope_layer=1 │ │ [=] │ │ │ labels :: Identifier │ scope_layer=1 │ │ [call] │ │ │ similar :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ [ref] │ │ │ labels :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ 1 :: Value │ macro_source=145 │ │ [=] │ │ │ nlabels :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ [return] │ │ │ [call] │ │ │ _map_notpure :: Identifier │ scope_layer=1 │ │ f :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ 2 :: Value │ macro_source=145 │ │ invpool :: Identifier │ scope_layer=1 │ │ pool :: Identifier │ scope_layer=1 │ │ labels :: Identifier │ scope_layer=1 │ │ nlabels :: Identifier │ scope_layer=1 │ │ [call] │ │ │ Base.Docs.doc! :: Value │ macro_source=145 │ │ PooledArrays :: Value │ macro_source=145 │ │ [call] │ │ │ Base.Docs.Binding :: Value │ macro_source=145 │ │ Base :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ map :: Identifier │ │ │ [call] │ macro_source=145 │ │ Base.Docs.docstr :: Value │ macro_source=145 │ │ [call] │ macro_source=145 │ │ Core.svec :: Value │ macro_source=145 │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ macro_source=145 │ │ [call] │ macro_source=145 │ │ Dict{Symbol, Any} :: Value │ macro_source=145 │ │ :path => "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" :: Value │ macro_source=145 │ │ :linenumber => 322 :: Value │ macro_source=145 │ │ :module => PooledArrays :: Value │ macro_source=145 │ │ [where] │ │ │ [where] │ │ │ [where] │ │ │ [curly] │ │ │ Union :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ val :: Identifier │ scope_layer=3 │ │ │ │ file = "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" │ │ line = 322 │ └ mod = PooledArrays │ ERROR: LoadError: internal lowering bug: │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# - `jl_assert(!(haskey(ssa_rewrites, lhs_id)), _)`: multiple assignments to ssavalue │ Expression: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) │ Containing expressions: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) │ │ Detailed provenance: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) @#= /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:366 =# │ └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/closure_conversion.jl:197 =# │ └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =# │ └─ (= #₅ (call core.TypeVar :#T1 Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =# │ └─ (= #₅ (call core.TypeVar :#T1 Any)) │ └─ (call core.TypeVar :#T1 Any) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3025 =# │ └─ (<: Any) │ └─ (<: Any) │ └─ (<: Any) │ └─ (<: Any) │ ├─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" (function (where (:: (call (. Base (inert map)) (parameters (kw (:: pure Bool) false)) f (:: x (curly PooledArray (<: Any) R N RA))) (curly Union (curly PooledArray (<: Any) R N RA) (curly PooledArray (<: Any) Int N (call typeof (call similar (. x (inert refs)) Int (call ntuple (-> i (block 0)) (call ndims (. x (inert refs))))))))) R N RA) (block (&& pure (return (call _map_pure f x))) (&& (call == (call length x) 0) (return (call PooledArray (comprehension (generator (call f v) (= v x)))))) (= v1 (call f (ref x 1))) (= invpool (call Dict (call => v1 (call one (call eltype (. x (inert refs))))))) (= pool (vect v1)) (= labels (call similar (. x (inert refs)))) (= (ref labels 1) 1) (= nlabels 1) (return (call _map_notpure f x 2 invpool pool labels nlabels))))) │ └─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 │ │ Stacktrace: │ [1] iterate(A::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}) │ @ Base /source/usr/share/julia/JuliaLowering/src/ast.jl:23 [inlined] │ [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:1106 │ [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:1223 │ [4] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:851 │ [5] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:712 │ [6] compile_body(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:1007 │ [7] 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:1163 │ [8] 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:1253 │ [9] 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 │ [10] include(mod::Module, _path::String) │ @ Base ./Base.jl:326 │ [11] 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:3271 │ [12] top-level scope │ @ stdin:5 │ [13] eval(m::Module, e::Any) │ @ Core ./boot.jl:517 │ [14] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String) │ @ Base ./loading.jl:3113 │ [15] push!(a::Vector{SubString{String}}, item::String) │ @ Base ./loading.jl:3123 [inlined] │ [16] exec_options(opts::Base.JLOptions) │ @ Base ./client.jl:353 │ [17] _start() │ @ Base ./client.jl:596 │ in expression starting at /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:1 │ in expression starting at stdin:5 └ ┌ DataFrames │ [Output was shown above] └ Kundur full dynamics: Error During Test at /home/pkgeval/.julia/packages/PowerDynData/91X2a/test/runtests.jl:181 Got exception outside of a @test The following 2 packages failed to precompile: PooledArrays Failed to precompile PooledArrays [2dfb63ee-cc39-5dd5-95bd-886bf059d720] to "/home/pkgeval/.julia/compiled/v1.14/PooledArrays/jl_usEOBF" (ProcessExited(1)). DataFrames Failed to precompile DataFrames [a93c6f00-e57d-5684-b7b6-d8193f3e46c0] to "/home/pkgeval/.julia/compiled/v1.14/DataFrames/jl_dH8ckA" (ProcessExited(1)). ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =# Core.@doc " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" function (Base.map(f, x::PooledArray{<:Any, R, N, RA}; pure::Bool = false)::Union{PooledArray{<:Any, R, N, RA}, PooledArray{<:Any, Int, N, typeof(similar(x.refs, Int, ntuple((i->begin │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:338 =# │ 0 │ end), ndims(x.refs))))}}) where {R, N, RA} │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:339 =# │ pure && return _map_pure(f, x) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:340 =# │ length(x) == 0 && return PooledArray([f(v) for v = x]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:341 =# │ v1 = f(x[1]) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:342 =# │ invpool = Dict(v1 => one(eltype(x.refs))) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:343 =# │ pool = [v1] │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:344 =# │ labels = similar(x.refs) │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:345 =# │ labels[1] = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:346 =# │ nlabels = 1 │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:347 =# │ return _map_notpure(f, x, 2, invpool, pool, labels, nlabels) │ 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/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) :: Value │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ │ [function] │ │ [where] │ │ [::] │ │ [call] │ │ [.] │ │ Base :: Identifier │ │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ │ Bool :: Identifier │ │ false :: Value │ │ f :: Identifier │ │ [::] │ │ x :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ Union :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [curly] │ │ PooledArray :: Identifier │ │ [<:] │ │ Any :: Identifier │ │ Int :: Identifier │ │ N :: Identifier │ │ [call] │ │ typeof :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ │ [call] │ │ ntuple :: Identifier │ │ [->] │ │ i :: Identifier │ │ [block] │ │ 0 :: Value │ │ [call] │ │ ndims :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ │ N :: Identifier │ │ RA :: Identifier │ │ [block] │ │ [&&] │ │ pure :: Identifier │ │ [return] │ │ [call] │ │ _map_pure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ [&&] │ │ [call] │ │ == :: Identifier │ │ [call] │ │ length :: Identifier │ │ x :: Identifier │ │ 0 :: Value │ │ [return] │ │ [call] │ │ PooledArray :: Identifier │ │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ │ v :: Identifier │ │ [=] │ │ v :: Identifier │ │ x :: Identifier │ │ [=] │ │ v1 :: Identifier │ │ [call] │ │ f :: Identifier │ │ [ref] │ │ x :: Identifier │ │ 1 :: Value │ │ [=] │ │ invpool :: Identifier │ │ [call] │ │ Dict :: Identifier │ │ [call] │ │ => :: Identifier │ │ v1 :: Identifier │ │ [call] │ │ one :: Identifier │ │ [call] │ │ eltype :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ │ [vect] │ │ v1 :: Identifier │ │ [=] │ │ labels :: Identifier │ │ [call] │ │ similar :: Identifier │ │ [.] │ │ x :: Identifier │ │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ │ 1 :: Value │ │ 1 :: Value │ │ [=] │ │ nlabels :: Identifier │ │ 1 :: Value │ │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ │ f :: Identifier │ │ x :: Identifier │ │ 2 :: Value │ │ invpool :: Identifier │ │ pool :: Identifier │ │ labels :: Identifier │ │ nlabels :: 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] │ │ [.] │ │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [parameters] │ │ [kw] │ │ [::] │ │ pure :: Identifier │ scope_layer=1 │ Bool :: Identifier │ scope_layer=1 │ false :: Value │ macro_source=145 │ f :: Identifier │ scope_layer=1 │ [::] │ │ x :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ Int :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [call] │ │ typeof :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ Int :: Identifier │ scope_layer=1 │ [call] │ │ ntuple :: Identifier │ scope_layer=1 │ [->] │ │ i :: Identifier │ scope_layer=1 │ [block] │ macro_source=145 │ 0 :: Value │ macro_source=145 │ [call] │ │ ndims :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [block] │ │ [&&] │ │ pure :: Identifier │ scope_layer=1 │ [return] │ │ [call] │ │ _map_pure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [&&] │ │ [call] │ │ == :: Identifier │ scope_layer=1 │ [call] │ │ length :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 0 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ PooledArray :: Identifier │ scope_layer=1 │ [comprehension] │ │ [generator] │ │ [call] │ │ f :: Identifier │ scope_layer=1 │ v :: Identifier │ scope_layer=1 │ [=] │ │ v :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ [=] │ │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ f :: Identifier │ scope_layer=1 │ [ref] │ │ x :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [=] │ │ invpool :: Identifier │ scope_layer=1 │ [call] │ │ Dict :: Identifier │ scope_layer=1 │ [call] │ │ => :: Identifier │ scope_layer=1 │ v1 :: Identifier │ scope_layer=1 │ [call] │ │ one :: Identifier │ scope_layer=1 │ [call] │ │ eltype :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ pool :: Identifier │ scope_layer=1 │ [vect] │ │ v1 :: Identifier │ scope_layer=1 │ [=] │ │ labels :: Identifier │ scope_layer=1 │ [call] │ │ similar :: Identifier │ scope_layer=1 │ [.] │ │ x :: Identifier │ scope_layer=1 │ [inert] │ │ refs :: Identifier │ │ [=] │ │ [ref] │ │ labels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ 1 :: Value │ macro_source=145 │ [=] │ │ nlabels :: Identifier │ scope_layer=1 │ 1 :: Value │ macro_source=145 │ [return] │ │ [call] │ │ _map_notpure :: Identifier │ scope_layer=1 │ f :: Identifier │ scope_layer=1 │ x :: Identifier │ scope_layer=1 │ 2 :: Value │ macro_source=145 │ invpool :: Identifier │ scope_layer=1 │ pool :: Identifier │ scope_layer=1 │ labels :: Identifier │ scope_layer=1 │ nlabels :: Identifier │ scope_layer=1 │ [call] │ │ Base.Docs.doc! :: Value │ macro_source=145 │ PooledArrays :: Value │ macro_source=145 │ [call] │ │ Base.Docs.Binding :: Value │ macro_source=145 │ Base :: Identifier │ scope_layer=1 │ [inert] │ │ map :: Identifier │ │ [call] │ macro_source=145 │ Base.Docs.docstr :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Core.svec :: Value │ macro_source=145 │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ macro_source=145 │ [call] │ macro_source=145 │ Dict{Symbol, Any} :: Value │ macro_source=145 │ :path => "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" :: Value │ macro_source=145 │ :linenumber => 322 :: Value │ macro_source=145 │ :module => PooledArrays :: Value │ macro_source=145 │ [where] │ │ [where] │ │ [where] │ │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [curly] │ │ PooledArray :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ RA :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ N :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ R :: Identifier │ scope_layer=1 │ Any :: Identifier │ scope_layer=1 │ val :: Identifier │ scope_layer=3 │ │ file = "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" │ line = 322 └ mod = PooledArrays ERROR: LoadError: internal lowering bug: #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# - `jl_assert(!(haskey(ssa_rewrites, lhs_id)), _)`: multiple assignments to ssavalue Expression:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) Containing expressions:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any))  Detailed provenance:  (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) @#= /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:366 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/closure_conversion.jl:197 =#  └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =#  └─ (= #₅ (call core.TypeVar :#T1 Any))  └─ (call core.TypeVar :#T1 Any) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3025 =#  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  └─ (<: Any)  ├─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" (function (where (:: (call (. Base (inert map)) (parameters (kw (:: pure Bool) false)) f (:: x (curly PooledArray (<: Any) R N RA))) (curly Union (curly PooledArray (<: Any) R N RA) (curly PooledArray (<: Any) Int N (call typeof (call similar (. x (inert refs)) Int (call ntuple (-> i (block 0)) (call ndims (. x (inert refs))))))))) R N RA) (block (&& pure (return (call _map_pure f x))) (&& (call == (call length x) 0) (return (call PooledArray (comprehension (generator (call f v) (= v x)))))) (= v1 (call f (ref x 1))) (= invpool (call Dict (call => v1 (call one (call eltype (. x (inert refs))))))) (= pool (vect v1)) (= labels (call similar (. x (inert refs)))) (= (ref labels 1) 1) (= nlabels 1) (return (call _map_notpure f x 2 invpool pool labels nlabels)))))  └─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322  Stacktrace:  [1] iterate(A::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}})  @ Base /source/usr/share/julia/JuliaLowering/src/ast.jl:23 [inlined]  [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:1106  [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:1223  [4] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:851  [5] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:712  [6] compile_body(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:1007  [7] 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:1163  [8] 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:1253  [9] 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  [10] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [11] 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:3271  [12] top-level scope  @ stdin:5  [13] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [14] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [15] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [inlined]  [16] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:353  [17] _start()  @ Base ./client.jl:596 in expression starting at /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:1 in expression starting at stdin:5 ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("2dfb63ee-cc39-5dd5-95bd-886bf059d720"), "PooledArrays") 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:2818  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2672  [4] macro expansion  @ ./loading.jl:2599 [inlined]  [5] string(::String, ::Union{Char, SubString{String}, String, Symbol}, ::Symbol, ::String)  @ Base ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2563  [7] require  @ ./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/DataFrames/0Y1g5/src/DataFrames.jl:3  [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:3271  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [18] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [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/DataFrames/0Y1g5/src/DataFrames.jl:1 in expression starting at stdin:5 2 dependencies had output during precompilation: ┌ PooledArrays │ ┌ Info: JuliaLowering threw given input: │ │ code = │ │ :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =# Core.@doc " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" function (Base.map(f, x::PooledArray{<:Any, R, N, RA}; pure::Bool = false)::Union{PooledArray{<:Any, R, N, RA}, PooledArray{<:Any, Int, N, typeof(similar(x.refs, Int, ntuple((i->begin │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:338 =# │ │ 0 │ │ end), ndims(x.refs))))}}) where {R, N, RA} │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:339 =# │ │ pure && return _map_pure(f, x) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:340 =# │ │ length(x) == 0 && return PooledArray([f(v) for v = x]) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:341 =# │ │ v1 = f(x[1]) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:342 =# │ │ invpool = Dict(v1 => one(eltype(x.refs))) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:343 =# │ │ pool = [v1] │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:344 =# │ │ labels = similar(x.refs) │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:345 =# │ │ labels[1] = 1 │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:346 =# │ │ nlabels = 1 │ │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:347 =# │ │ return _map_notpure(f, x, 2, invpool, pool, labels, nlabels) │ │ 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/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) :: Value │ │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ │ │ [function] │ │ │ [where] │ │ │ [::] │ │ │ [call] │ │ │ [.] │ │ │ Base :: Identifier │ │ │ [inert] │ │ │ map :: Identifier │ │ │ [parameters] │ │ │ [kw] │ │ │ [::] │ │ │ pure :: Identifier │ │ │ Bool :: Identifier │ │ │ false :: Value │ │ │ f :: Identifier │ │ │ [::] │ │ │ x :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [curly] │ │ │ Union :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [curly] │ │ │ PooledArray :: Identifier │ │ │ [<:] │ │ │ Any :: Identifier │ │ │ Int :: Identifier │ │ │ N :: Identifier │ │ │ [call] │ │ │ typeof :: Identifier │ │ │ [call] │ │ │ similar :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ Int :: Identifier │ │ │ [call] │ │ │ ntuple :: Identifier │ │ │ [->] │ │ │ i :: Identifier │ │ │ [block] │ │ │ 0 :: Value │ │ │ [call] │ │ │ ndims :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ R :: Identifier │ │ │ N :: Identifier │ │ │ RA :: Identifier │ │ │ [block] │ │ │ [&&] │ │ │ pure :: Identifier │ │ │ [return] │ │ │ [call] │ │ │ _map_pure :: Identifier │ │ │ f :: Identifier │ │ │ x :: Identifier │ │ │ [&&] │ │ │ [call] │ │ │ == :: Identifier │ │ │ [call] │ │ │ length :: Identifier │ │ │ x :: Identifier │ │ │ 0 :: Value │ │ │ [return] │ │ │ [call] │ │ │ PooledArray :: Identifier │ │ │ [comprehension] │ │ │ [generator] │ │ │ [call] │ │ │ f :: Identifier │ │ │ v :: Identifier │ │ │ [=] │ │ │ v :: Identifier │ │ │ x :: Identifier │ │ │ [=] │ │ │ v1 :: Identifier │ │ │ [call] │ │ │ f :: Identifier │ │ │ [ref] │ │ │ x :: Identifier │ │ │ 1 :: Value │ │ │ [=] │ │ │ invpool :: Identifier │ │ │ [call] │ │ │ Dict :: Identifier │ │ │ [call] │ │ │ => :: Identifier │ │ │ v1 :: Identifier │ │ │ [call] │ │ │ one :: Identifier │ │ │ [call] │ │ │ eltype :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ pool :: Identifier │ │ │ [vect] │ │ │ v1 :: Identifier │ │ │ [=] │ │ │ labels :: Identifier │ │ │ [call] │ │ │ similar :: Identifier │ │ │ [.] │ │ │ x :: Identifier │ │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ [ref] │ │ │ labels :: Identifier │ │ │ 1 :: Value │ │ │ 1 :: Value │ │ │ [=] │ │ │ nlabels :: Identifier │ │ │ 1 :: Value │ │ │ [return] │ │ │ [call] │ │ │ _map_notpure :: Identifier │ │ │ f :: Identifier │ │ │ x :: Identifier │ │ │ 2 :: Value │ │ │ invpool :: Identifier │ │ │ pool :: Identifier │ │ │ labels :: Identifier │ │ │ nlabels :: 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] │ │ │ [.] │ │ │ Base :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ map :: Identifier │ │ │ [parameters] │ │ │ [kw] │ │ │ [::] │ │ │ pure :: Identifier │ scope_layer=1 │ │ Bool :: Identifier │ scope_layer=1 │ │ false :: Value │ macro_source=145 │ │ f :: Identifier │ scope_layer=1 │ │ [::] │ │ │ x :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Union :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ Int :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ [call] │ │ │ typeof :: Identifier │ scope_layer=1 │ │ [call] │ │ │ similar :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ Int :: Identifier │ scope_layer=1 │ │ [call] │ │ │ ntuple :: Identifier │ scope_layer=1 │ │ [->] │ │ │ i :: Identifier │ scope_layer=1 │ │ [block] │ macro_source=145 │ │ 0 :: Value │ macro_source=145 │ │ [call] │ │ │ ndims :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [block] │ │ │ [&&] │ │ │ pure :: Identifier │ scope_layer=1 │ │ [return] │ │ │ [call] │ │ │ _map_pure :: Identifier │ scope_layer=1 │ │ f :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ [&&] │ │ │ [call] │ │ │ == :: Identifier │ scope_layer=1 │ │ [call] │ │ │ length :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ 0 :: Value │ macro_source=145 │ │ [return] │ │ │ [call] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [comprehension] │ │ │ [generator] │ │ │ [call] │ │ │ f :: Identifier │ scope_layer=1 │ │ v :: Identifier │ scope_layer=1 │ │ [=] │ │ │ v :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ [=] │ │ │ v1 :: Identifier │ scope_layer=1 │ │ [call] │ │ │ f :: Identifier │ scope_layer=1 │ │ [ref] │ │ │ x :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ [=] │ │ │ invpool :: Identifier │ scope_layer=1 │ │ [call] │ │ │ Dict :: Identifier │ scope_layer=1 │ │ [call] │ │ │ => :: Identifier │ scope_layer=1 │ │ v1 :: Identifier │ scope_layer=1 │ │ [call] │ │ │ one :: Identifier │ scope_layer=1 │ │ [call] │ │ │ eltype :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ pool :: Identifier │ scope_layer=1 │ │ [vect] │ │ │ v1 :: Identifier │ scope_layer=1 │ │ [=] │ │ │ labels :: Identifier │ scope_layer=1 │ │ [call] │ │ │ similar :: Identifier │ scope_layer=1 │ │ [.] │ │ │ x :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ refs :: Identifier │ │ │ [=] │ │ │ [ref] │ │ │ labels :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ 1 :: Value │ macro_source=145 │ │ [=] │ │ │ nlabels :: Identifier │ scope_layer=1 │ │ 1 :: Value │ macro_source=145 │ │ [return] │ │ │ [call] │ │ │ _map_notpure :: Identifier │ scope_layer=1 │ │ f :: Identifier │ scope_layer=1 │ │ x :: Identifier │ scope_layer=1 │ │ 2 :: Value │ macro_source=145 │ │ invpool :: Identifier │ scope_layer=1 │ │ pool :: Identifier │ scope_layer=1 │ │ labels :: Identifier │ scope_layer=1 │ │ nlabels :: Identifier │ scope_layer=1 │ │ [call] │ │ │ Base.Docs.doc! :: Value │ macro_source=145 │ │ PooledArrays :: Value │ macro_source=145 │ │ [call] │ │ │ Base.Docs.Binding :: Value │ macro_source=145 │ │ Base :: Identifier │ scope_layer=1 │ │ [inert] │ │ │ map :: Identifier │ │ │ [call] │ macro_source=145 │ │ Base.Docs.docstr :: Value │ macro_source=145 │ │ [call] │ macro_source=145 │ │ Core.svec :: Value │ macro_source=145 │ │ " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" :: Value │ macro_source=145 │ │ [call] │ macro_source=145 │ │ Dict{Symbol, Any} :: Value │ macro_source=145 │ │ :path => "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" :: Value │ macro_source=145 │ │ :linenumber => 322 :: Value │ macro_source=145 │ │ :module => PooledArrays :: Value │ macro_source=145 │ │ [where] │ │ │ [where] │ │ │ [where] │ │ │ [curly] │ │ │ Union :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ PooledArray :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ RA :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ N :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ R :: Identifier │ scope_layer=1 │ │ Any :: Identifier │ scope_layer=1 │ │ val :: Identifier │ scope_layer=3 │ │ │ │ file = "/home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl" │ │ line = 322 │ └ mod = PooledArrays │ ERROR: LoadError: internal lowering bug: │ #= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 =# - `jl_assert(!(haskey(ssa_rewrites, lhs_id)), _)`: multiple assignments to ssavalue │ Expression: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) │ Containing expressions: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) │ │ Detailed provenance: │ (= #₅ (call core.TypeVar :#T1 #₁₆₉/Any)) @#= /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:366 =# │ └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/closure_conversion.jl:197 =# │ └─ (= #₅ (call core.TypeVar :#T1 #₂₅/Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =# │ └─ (= #₅ (call core.TypeVar :#T1 Any)) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:231 =# │ └─ (= #₅ (call core.TypeVar :#T1 Any)) │ └─ (call core.TypeVar :#T1 Any) @#= /source/usr/share/julia/JuliaLowering/src/desugaring.jl:3025 =# │ └─ (<: Any) │ └─ (<: Any) │ └─ (<: Any) │ └─ (<: Any) │ ├─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:336 │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 =#) " map(f, x::PooledArray; pure::Bool=false)\n\nTransform `PooledArray` `x` by applying `f` to each element.\n\nIf `pure=true` then `f` is applied to each element of pool of `x`\nexactly once (even if some elements in pool are not present it `x`).\nThis will typically be much faster when the proportion of unique values\nin `x` is small.\n\nIf `pure=false`, the returned array will use the same reference type\nas `x`, or `Int` if the number of unique values in the result is too large\nto fit in that type.\n" (function (where (:: (call (. Base (inert map)) (parameters (kw (:: pure Bool) false)) f (:: x (curly PooledArray (<: Any) R N RA))) (curly Union (curly PooledArray (<: Any) R N RA) (curly PooledArray (<: Any) Int N (call typeof (call similar (. x (inert refs)) Int (call ntuple (-> i (block 0)) (call ndims (. x (inert refs))))))))) R N RA) (block (&& pure (return (call _map_pure f x))) (&& (call == (call length x) 0) (return (call PooledArray (comprehension (generator (call f v) (= v x)))))) (= v1 (call f (ref x 1))) (= invpool (call Dict (call => v1 (call one (call eltype (. x (inert refs))))))) (= pool (vect v1)) (= labels (call similar (. x (inert refs)))) (= (ref labels 1) 1) (= nlabels 1) (return (call _map_notpure f x 2 invpool pool labels nlabels))))) │ └─ @ /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:322 │ │ Stacktrace: │ [1] iterate(A::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}) │ @ Base /source/usr/share/julia/JuliaLowering/src/ast.jl:23 [inlined] │ [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:1106 │ [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:1223 │ [4] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:851 │ [5] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:712 │ [6] compile_body(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:1007 │ [7] 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:1163 │ [8] 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:1253 │ [9] 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 │ [10] include(mod::Module, _path::String) │ @ Base ./Base.jl:326 │ [11] 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:3271 │ [12] top-level scope │ @ stdin:5 │ [13] eval(m::Module, e::Any) │ @ Core ./boot.jl:517 │ [14] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String) │ @ Base ./loading.jl:3113 │ [15] push!(a::Vector{SubString{String}}, item::String) │ @ Base ./loading.jl:3123 [inlined] │ [16] exec_options(opts::Base.JLOptions) │ @ Base ./client.jl:353 │ [17] _start() │ @ Base ./client.jl:596 │ in expression starting at /home/pkgeval/.julia/packages/PooledArrays/Vy2X0/src/PooledArrays.jl:1 │ in expression starting at stdin:5 └ ┌ DataFrames │ [Output was shown above] └ TOML parsing with metadata: Error During Test at /home/pkgeval/.julia/packages/PowerDynData/91X2a/test/runtests.jl:210 Got exception outside of a @test The following 2 packages failed to precompile: PooledArrays Failed to precompile PooledArrays [2dfb63ee-cc39-5dd5-95bd-886bf059d720] to "/home/pkgeval/.julia/compiled/v1.14/PooledArrays/jl_SAX8E5" (ProcessExited(1)). DataFrames Failed to precompile DataFrames [a93c6f00-e57d-5684-b7b6-d8193f3e46c0] to "/home/pkgeval/.julia/compiled/v1.14/DataFrames/jl_weLJdB" (ProcessExited(1)). ┌ Warning: Failed to convert field BUS: ArgumentError("invalid base 10 digit 'n' in \"not_a_number\"") └ @ PowerDynData ~/.julia/packages/PowerDynData/91X2a/src/record_creation.jl:147 ┌ Warning: Unknown field 'UNKNOWN_FIELD' in GENROU record 1 (ignored) └ @ PowerDynData ~/.julia/packages/PowerDynData/91X2a/src/toml_parsing.jl:148 Coverage: Tables.jl interface: Error During Test at /home/pkgeval/.julia/packages/PowerDynData/91X2a/test/runtests.jl:556 Test threw exception Expression: Tables.istable(T) == true UndefVarError: `Tables` not defined in `Main` Suggestion: check for spelling errors or missing imports. Hint: Tables is loaded but not imported in the active module Main. Stacktrace: [1] top-level scope @ ~/.julia/packages/PowerDynData/91X2a/test/runtests.jl:5 [2] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2241 [inlined] [3] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2415 [inlined] [4] macro expansion @ ~/.julia/packages/PowerDynData/91X2a/test/runtests.jl:547 [inlined] [5] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2241 [inlined] [6] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2415 [inlined] [7] macro expansion @ ~/.julia/packages/PowerDynData/91X2a/test/runtests.jl:556 [inlined] [8] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:781 [inlined] Coverage: Tables.jl interface: Error During Test at /home/pkgeval/.julia/packages/PowerDynData/91X2a/test/runtests.jl:557 Test threw exception Expression: Tables.columnaccess(T) == true UndefVarError: `Tables` not defined in `Main` Suggestion: check for spelling errors or missing imports. Hint: Tables is loaded but not imported in the active module Main. Stacktrace: [1] top-level scope @ ~/.julia/packages/PowerDynData/91X2a/test/runtests.jl:5 [2] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2241 [inlined] [3] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2415 [inlined] [4] macro expansion @ ~/.julia/packages/PowerDynData/91X2a/test/runtests.jl:547 [inlined] [5] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2241 [inlined] [6] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2415 [inlined] [7] macro expansion @ ~/.julia/packages/PowerDynData/91X2a/test/runtests.jl:557 [inlined] [8] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:781 [inlined] Coverage: Tables.jl interface: Error During Test at /home/pkgeval/.julia/packages/PowerDynData/91X2a/test/runtests.jl:560 Test threw exception Expression: Tables.columns(genrou) === genrou.data UndefVarError: `Tables` not defined in `Main` Suggestion: check for spelling errors or missing imports. Hint: Tables is loaded but not imported in the active module Main. Stacktrace: [1] top-level scope @ ~/.julia/packages/PowerDynData/91X2a/test/runtests.jl:5 [2] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2241 [inlined] [3] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2415 [inlined] [4] macro expansion @ ~/.julia/packages/PowerDynData/91X2a/test/runtests.jl:547 [inlined] [5] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2241 [inlined] [6] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2415 [inlined] [7] macro expansion @ ~/.julia/packages/PowerDynData/91X2a/test/runtests.jl:560 [inlined] [8] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:781 [inlined] Coverage: Tables.jl interface: Error During Test at /home/pkgeval/.julia/packages/PowerDynData/91X2a/test/runtests.jl:561 Test threw exception Expression: Tables.columnnames(genrou) == propertynames(genrou.data) UndefVarError: `Tables` not defined in `Main` Suggestion: check for spelling errors or missing imports. Hint: Tables is loaded but not imported in the active module Main. Stacktrace: [1] top-level scope @ ~/.julia/packages/PowerDynData/91X2a/test/runtests.jl:5 [2] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2241 [inlined] [3] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2415 [inlined] [4] macro expansion @ ~/.julia/packages/PowerDynData/91X2a/test/runtests.jl:547 [inlined] [5] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2241 [inlined] [6] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2415 [inlined] [7] macro expansion @ ~/.julia/packages/PowerDynData/91X2a/test/runtests.jl:561 [inlined] [8] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:781 [inlined] Coverage: Tables.jl interface: Error During Test at /home/pkgeval/.julia/packages/PowerDynData/91X2a/test/runtests.jl:564 Test threw exception Expression: Tables.getcolumn(genrou, 1) == getfield(genrou.data, 1) UndefVarError: `Tables` not defined in `Main` Suggestion: check for spelling errors or missing imports. Hint: Tables is loaded but not imported in the active module Main. Stacktrace: [1] top-level scope @ ~/.julia/packages/PowerDynData/91X2a/test/runtests.jl:5 [2] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2241 [inlined] [3] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2415 [inlined] [4] macro expansion @ ~/.julia/packages/PowerDynData/91X2a/test/runtests.jl:547 [inlined] [5] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2241 [inlined] [6] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2415 [inlined] [7] macro expansion @ ~/.julia/packages/PowerDynData/91X2a/test/runtests.jl:564 [inlined] [8] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:781 [inlined] Coverage: Tables.jl interface: Error During Test at /home/pkgeval/.julia/packages/PowerDynData/91X2a/test/runtests.jl:567 Test threw exception Expression: Tables.getcolumn(genrou, :BUS) == genrou.data.BUS UndefVarError: `Tables` not defined in `Main` Suggestion: check for spelling errors or missing imports. Hint: Tables is loaded but not imported in the active module Main. Stacktrace: [1] top-level scope @ ~/.julia/packages/PowerDynData/91X2a/test/runtests.jl:5 [2] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2241 [inlined] [3] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2415 [inlined] [4] macro expansion @ ~/.julia/packages/PowerDynData/91X2a/test/runtests.jl:547 [inlined] [5] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2241 [inlined] [6] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2415 [inlined] [7] macro expansion @ ~/.julia/packages/PowerDynData/91X2a/test/runtests.jl:567 [inlined] [8] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:781 [inlined] Coverage: Tables.jl interface: Error During Test at /home/pkgeval/.julia/packages/PowerDynData/91X2a/test/runtests.jl:547 Got exception outside of a @test UndefVarError: `Tables` not defined in `Main` Suggestion: check for spelling errors or missing imports. Hint: Tables is loaded but not imported in the active module Main. Stacktrace: [1] top-level scope @ ~/.julia/packages/PowerDynData/91X2a/test/runtests.jl:5 [2] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2241 [inlined] [3] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2415 [inlined] [4] macro expansion @ ~/.julia/packages/PowerDynData/91X2a/test/runtests.jl:547 [inlined] [5] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2241 [inlined] [6] macro expansion @ /opt/julia/share/julia/stdlib/v1.14/Test/src/Test.jl:2415 [inlined] [7] macro expansion @ ~/.julia/packages/PowerDynData/91X2a/test/runtests.jl:570 [inlined] [8] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:327 [9] top-level scope @ none:6 [10] eval(m::Module, e::Any) @ Core ./boot.jl:517 [11] exec_options(opts::Base.JLOptions) @ Base ./client.jl:321 [12] _start() @ Base ./client.jl:596 DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:140 Loading metadata from: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/exciters/AC8B.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: AC8B DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/exciters/ESAC1A.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: ESAC1A DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/exciters/ESDC1A.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: ESDC1A DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/exciters/ESDC2A.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: ESDC2A DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/exciters/ESST1A.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: ESST1A DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/exciters/ESST3A.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: ESST3A DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/exciters/ESST4B.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: ESST4B DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/exciters/EXAC1.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: EXAC1 DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/exciters/EXAC2.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: EXAC2 DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/exciters/EXAC4.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: EXAC4 DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/exciters/EXDC2.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: EXDC2 DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/exciters/EXST1.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: EXST1 DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/exciters/IEEET1.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: IEEET1 DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/exciters/IEEET3.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: IEEET3 DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/exciters/IEEEX1.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: IEEEX1 DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/exciters/SEXS.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: SEXS DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/generators/GENCLS.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: GENCLS DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/generators/GENQEC.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: GENQEC DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/generators/GENROU.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: GENROU DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/generators/GENSAL.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: GENSAL DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/generators/GENTPJ1.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: GENTPJ1 DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/governors/GAST.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: GAST DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/governors/HYGOV.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: HYGOV DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/governors/IEEEG1.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: IEEEG1 DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/governors/IEESGO.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: IEESGO DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/governors/TGOV1.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: TGOV1 DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/renewable/REECA1.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: REECA1 DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/renewable/REGCA1.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: REGCA1 DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/renewable/REPCA1.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: REPCA1 DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/renewable/WTARA1.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: WTARA1 DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/renewable/WTDTA1.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: WTDTA1 DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/renewable/WTPTA1.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: WTPTA1 DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/renewable/WTTQA1.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: WTTQA1 DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/stabilizers/IEEEST.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: IEEEST DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/stabilizers/ST2CUT.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: ST2CUT DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:147 Parsing metadata file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/metadata/voltage_compensators/IEEEVC.yaml DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:159 Loaded metadata for model: IEEEVC DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/metadata.jl:167 Loaded 36 model schemas in 12 categories DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:46 Parsing DYR file: /home/pkgeval/.julia/packages/PowerDynData/91X2a/test/testfiles/ieee14.dyr DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:218 Parsed record for model: GENROU (17 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:218 Parsed record for model: ST2CUT (23 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:218 Parsed record for model: ESST3A (24 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:218 Parsed record for model: TGOV1 (10 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:218 Parsed record for model: GENROU (17 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:218 Parsed record for model: ST2CUT (23 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:218 Parsed record for model: EXST1 (15 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:218 Parsed record for model: IEEEG1 (25 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:218 Parsed record for model: GENROU (17 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:218 Parsed record for model: IEEEST (22 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:218 Parsed record for model: ESST3A (24 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:218 Parsed record for model: IEEEG1 (25 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:218 Parsed record for model: GENROU (17 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:218 Parsed record for model: ESST3A (24 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:218 Parsed record for model: TGOV1 (10 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:218 Parsed record for model: GENROU (17 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:218 Parsed record for model: ESST3A (24 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:218 Parsed record for model: TGOV1 (10 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:218 Parsed record for model: Toggle (4 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:218 Parsed record for model: Toggle (4 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:51 Parsed 20 records DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:293 Creating indexed records for Toggle (2 records) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/record_creation.jl:47 Creating named records for TGOV1 (3 records, 9 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/record_creation.jl:47 Creating named records for GENROU (5 records, 16 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/record_creation.jl:47 Creating named records for ESST3A (4 records, 23 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/record_creation.jl:47 Creating named records for ST2CUT (2 records, 20 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/record_creation.jl:47 Creating named records for EXST1 (1 records, 14 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/record_creation.jl:47 Creating named records for IEEEST (1 records, 20 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/record_creation.jl:47 Creating named records for IEEEG1 (2 records, 22 fields) DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:57 Created 8 model types DEBUG: /home/pkgeval/.julia/packages/PowerDynData/91X2a/src/parsing.jl:58 Encountered 35 validation issues ┌ Warning: Failed to parse metadata file: /tmp/jl_PKdSds/invalid.yaml │ exception = while parsing a block mapping at line 1, column 0: expected , but found YAML.BlockMappingStartToken at line 1, column 13 └ @ PowerDynData ~/.julia/packages/PowerDynData/91X2a/src/metadata.jl:161 ┌ Warning: Failed to convert field BUS: ArgumentError("invalid base 10 digit 'n' in \"not_an_int\"") └ @ PowerDynData ~/.julia/packages/PowerDynData/91X2a/src/record_creation.jl:147 Test Summary: | Pass Error Total Time PowerDynData.jl | 207 16 223 2m07.4s Metadata loading (YAML) | 13 13 15.1s Type system | 4 4 0.4s Parsing utilities | 6 6 0.1s DYR file parsing (without metadata) | 7 7 1.6s DYR file parsing (with metadata) | 8 1 9 23.5s Field parsing edge cases | 7 7 0.0s ANDES test cases | 56 7 63 1m00.1s NPCC full dynamics | 7 1 8 9.0s Nordic44 base case | 11 1 12 9.3s WECC with classical generators | 4 1 5 7.9s WECC full dynamics | 10 1 11 8.6s IEEE 14-bus with IEEE voltage controller | 12 1 13 8.7s Kundur with classical generators | 5 1 6 8.1s Kundur full dynamics | 7 1 8 8.3s TOML Parsing | 48 1 49 14.5s TOML parsing with metadata | 8 1 9 9.6s TOML parsing without metadata | 2 2 0.6s TOML type conversion | 4 4 0.0s TOML validation issues | 4 4 0.5s Malformed TOML input (HIGH #5) | 8 8 2.5s Required field validation (HIGH #6) | 9 9 1.0s Unknown fields warning (TOML) | 2 2 0.1s Type conversion edge cases (TOML) | 11 11 0.1s DYR to TOML Conversion | 11 11 4.1s Coverage: Tables.jl interface | 7 7 3.7s Coverage: Pretty printing | 14 14 0.7s Coverage: MetadataRegistry show | 6 6 1.1s Coverage: Bool parsing | 9 9 0.1s Coverage: string_to_type | 2 2 0.0s Coverage: validate_range | 3 3 0.0s Coverage: Debug macro | 2 2 0.2s Coverage: skip_whitespace_and_comments (SubString) | 3 3 0.0s Coverage: Metadata parse failure handling | 2 2 1.1s Coverage: DynamicData validation issues display | 1 1 0.1s Coverage: DynamicData without validation issues | 1 1 0.2s Coverage: DYR with comment lines | 2 2 0.3s Coverage: DYR missing field position | 2 2 0.5s RNG of the outermost testset: Random.Xoshiro(0x9f05fd48929d0979, 0x95842f262e20a6ec, 0x41c4a0d0ed89d2c4, 0x792c8ee9c06d82de, 0xf8a1973403aeb023) ERROR: LoadError: Some tests did not pass: 207 passed, 0 failed, 16 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/PowerDynData/91X2a/test/runtests.jl:5 Testing failed after 397.99s ERROR: LoadError: Package PowerDynData 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] Cmd(cmd::Cmd) @ Base /opt/julia/share/julia/stdlib/v1.14/Pkg/src/Operations.jl:3110 [inlined] [4] 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 [5] 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 [6] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:160 [7] test @ /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:160 [inlined] [8] test(pkg::String; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:159 [inlined] [9] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:223 [10] include(mod::Module, _path::String) @ Base ./Base.jl:326 [11] exec_options(opts::Base.JLOptions) @ Base ./client.jl:355 [12] _start() @ Base ./client.jl:596 in expression starting at /PkgEval.jl/scripts/evaluate.jl:214 PkgEval failed after 2448.42s: package fails to precompile