Package evaluation to test PlutoStaticHTML on Julia 1.14.0-DEV.2593 (15c2b67521*) started at 2026-07-04T12:01:54.687 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 15.45s ################################################################################ # Installation # Installing PlutoStaticHTML... Resolving package versions... Installed AbstractTrees ─────────────── v0.4.5 Installed Libuuid_jll ───────────────── v2.42.0+0 Installed Gettext_jll ───────────────── v0.21.0+0 Installed Configurations ────────────── v0.17.6 Installed Bzip2_jll ─────────────────── v1.0.9+0 Installed HarfBuzz_jll ──────────────── v2.8.1+1 Installed RelocatableFolders ────────── v1.0.1 Installed URIs ──────────────────────── v1.6.1 Installed Tricks ────────────────────── v0.1.13 Installed Libmount_jll ──────────────── v2.42.0+0 Installed CodecZlib ─────────────────── v0.7.8 Installed ConcurrentUtilities ───────── v2.5.1 Installed Gumbo_jll ─────────────────── v0.10.2+0 Installed ExpressionExplorer ────────── v1.1.4 Installed PlutoDependencyExplorer ───── v1.2.2 Installed PlutoStaticHTML ───────────── v8.0.0 Installed OrderedCollections ────────── v1.8.2 Installed Cairo_jll ─────────────────── v1.18.4+0 Installed Xorg_libXau_jll ───────────── v1.0.13+0 Installed Xorg_libX11_jll ───────────── v1.8.13+0 Installed ExceptionUnwrapping ───────── v0.1.11 Installed IteratorInterfaceExtensions ─ v1.0.0 Installed Compat ────────────────────── v4.18.1 Installed TranscodingStreams ────────── v0.11.3 Installed GracefulPkg ───────────────── v2.4.3 Installed DataValueInterfaces ───────── v1.0.0 Installed Graphite2_jll ─────────────── v1.3.16+0 Installed DataAPI ───────────────────── v1.16.0 Installed PrecompileSignatures ──────── v3.0.3 Installed MIMEs ─────────────────────── v1.1.0 Installed Malt ──────────────────────── v1.4.1 Installed ExproniconLite ────────────── v0.10.14 Installed PrecompileTools ───────────── v1.3.4 Installed Expat_jll ─────────────────── v2.8.1+0 Installed Pixman_jll ────────────────── v0.44.2+0 Installed LoggingExtras ─────────────── v1.2.0 Installed OpenSSL ───────────────────── v1.6.1 Installed MbedTLS ───────────────────── v1.1.10 Installed Fontconfig_jll ────────────── v2.17.1+0 Installed Libffi_jll ────────────────── v3.2.2+2 Installed libpng_jll ────────────────── v1.6.58+0 Installed BitFlags ──────────────────── v0.1.10 Installed LazilyInitializedFields ───── v1.3.0 Installed Tables ────────────────────── v1.13.0 Installed ICU_jll ───────────────────── v69.1.0+0 Installed Glib_jll ──────────────────── v2.82.4+0 Installed Xorg_libXrender_jll ───────── v0.9.12+0 Installed MsgPack ───────────────────── v1.2.1 Installed HTTP ──────────────────────── v1.11.0 Installed Xorg_libxcb_jll ───────────── v1.17.1+0 Installed XML2_jll ──────────────────── v2.13.9+0 Installed Scratch ───────────────────── v1.3.0 Installed LZO_jll ───────────────────── v2.10.3+0 Installed HypertextLiteral ──────────── v1.0.0 Installed SimpleBufferStream ────────── v1.2.0 Installed FreeType2_jll ─────────────── v2.14.3+1 Installed Preferences ───────────────── v1.5.2 Installed JLLWrappers ───────────────── v1.8.0 Installed Xorg_libXdmcp_jll ─────────── v1.1.6+0 Installed Gumbo ─────────────────────── v0.8.3 Installed RegistryInstances ─────────── v0.1.0 Installed TableTraits ───────────────── v1.0.1 Installed Libiconv_jll ──────────────── v1.18.0+0 Installed LLVMOpenMP_jll ────────────── v18.1.8+0 Installed Xorg_libXext_jll ──────────── v1.3.8+0 Installed MbedTLS_jll ───────────────── v2.28.1010+0 Installed HarfBuzz_ICU_jll ──────────── v2.8.1+0 Installed Xorg_xtrans_jll ───────────── v1.6.0+0 Installed tectonic_jll ──────────────── v0.15.0+0 Installed LRUCache ──────────────────── v1.6.2 Installed Pluto ─────────────────────── v1.0.1 Installing 30 artifacts Installed artifact Xorg_xtrans 39.5 KiB Installed artifact Libffi 30.5 KiB Installed artifact Xorg_libXdmcp 49.9 KiB Installed artifact FreeType2 1.2 MiB Installed artifact Gumbo 446.2 KiB Installed artifact Pixman 327.0 KiB Installed artifact Cairo 1.5 MiB Installed artifact XML2 2.0 MiB Installed artifact Xorg_libxcb 1.3 MiB Installed artifact MbedTLS 1.0 MiB Installed artifact tectonic 5.2 MiB Installed artifact LLVMOpenMP 559.3 KiB Installed artifact Libiconv 1022.9 KiB Installed artifact Xorg_libXau 25.8 KiB Installed artifact Fontconfig 443.8 KiB Installed artifact HarfBuzz 829.7 KiB Installed artifact Libuuid 1.9 MiB Installed artifact Expat 247.7 KiB Installed artifact Xorg_libXrender 174.0 KiB Installed artifact HarfBuzz_ICU 41.7 KiB Installed artifact Xorg_libXext 187.3 KiB Installed artifact ICU 10.7 MiB Installed artifact LZO 164.6 KiB Installed artifact libpng 234.7 KiB Installed artifact Bzip2 152.8 KiB Installed artifact Xorg_libX11 2.3 MiB Installed artifact Graphite2 109.8 KiB Installed artifact Glib 4.2 MiB Installed artifact Gettext 2.8 MiB Installed artifact Libmount 3.4 MiB Updating `~/.julia/environments/v1.14/Project.toml` [359b1769] + PlutoStaticHTML v8.0.0 Updating `~/.julia/environments/v1.14/Manifest.toml` [1520ce14] + AbstractTrees v0.4.5 [d1d4a3ce] + BitFlags v0.1.10 [944b1d66] + CodecZlib v0.7.8 [34da2185] + Compat v4.18.1 [f0e56b4a] + ConcurrentUtilities v2.5.1 [5218b696] + Configurations v0.17.6 [9a962f9c] + DataAPI v1.16.0 [e2d170a0] + DataValueInterfaces v1.0.0 [460bff9d] + ExceptionUnwrapping v0.1.11 [21656369] + ExpressionExplorer v1.1.4 [55351af7] + ExproniconLite v0.10.14 [828d9ff0] + GracefulPkg v2.4.3 [708ec375] + Gumbo v0.8.3 ⌅ [cd3eb016] + HTTP v1.11.0 [ac1192a8] + HypertextLiteral v1.0.0 [82899510] + IteratorInterfaceExtensions v1.0.0 [692b3bcd] + JLLWrappers v1.8.0 [8ac3fa9e] + LRUCache v1.6.2 [0e77f7df] + LazilyInitializedFields v1.3.0 [e6f89c97] + LoggingExtras v1.2.0 [6c6e2e6c] + MIMEs v1.1.0 [36869731] + Malt v1.4.1 [739be429] + MbedTLS v1.1.10 [99f44e22] + MsgPack v1.2.1 [4d8831e6] + OpenSSL v1.6.1 ⌅ [bac558e1] + OrderedCollections v1.8.2 [c3e4b0f8] + Pluto v1.0.1 [72656b73] + PlutoDependencyExplorer v1.2.2 [359b1769] + PlutoStaticHTML v8.0.0 [91cefc8d] + PrecompileSignatures v3.0.3 [aea7be01] + PrecompileTools v1.3.4 [21216c6a] + Preferences v1.5.2 [2792f1a3] + RegistryInstances v0.1.0 [05181044] + RelocatableFolders v1.0.1 [6c6a2e73] + Scratch v1.3.0 [777ac1f9] + SimpleBufferStream v1.2.0 [3783bdb8] + TableTraits v1.0.1 [bd369af6] + Tables v1.13.0 [3bb67fe8] + TranscodingStreams v0.11.3 [410a4b4d] + Tricks v0.1.13 [5c2747f8] + URIs v1.6.1 [6e34b625] + Bzip2_jll v1.0.9+0 ⌃ [83423d85] + Cairo_jll v1.18.4+0 [2e619515] + Expat_jll v2.8.1+0 [a3f928ae] + Fontconfig_jll v2.17.1+0 [d7e528f0] + FreeType2_jll v2.14.3+1 ⌅ [78b55507] + Gettext_jll v0.21.0+0 ⌃ [7746bdde] + Glib_jll v2.82.4+0 [3b182d85] + Graphite2_jll v1.3.16+0 [528830af] + Gumbo_jll v0.10.2+0 ⌃ [655565e8] + HarfBuzz_ICU_jll v2.8.1+0 ⌅ [2e76f6c2] + HarfBuzz_jll v2.8.1+1 ⌅ [a51ab1cf] + ICU_jll v69.1.0+0 [1d63c593] + LLVMOpenMP_jll v18.1.8+0 [dd4b983a] + LZO_jll v2.10.3+0 ⌅ [e9f186c6] + Libffi_jll v3.2.2+2 [94ce4f54] + Libiconv_jll v1.18.0+0 [4b2f31a3] + Libmount_jll v2.42.0+0 [38a345b3] + Libuuid_jll v2.42.0+0 [c8ffd9c3] + MbedTLS_jll v2.28.1010+0 ⌅ [30392449] + Pixman_jll v0.44.2+0 ⌅ [02c8fc9c] + XML2_jll v2.13.9+0 [4f6342f7] + Xorg_libX11_jll v1.8.13+0 [0c0b7dd1] + Xorg_libXau_jll v1.0.13+0 [a3789734] + Xorg_libXdmcp_jll v1.1.6+0 [1082639a] + Xorg_libXext_jll v1.3.8+0 [ea2f1a96] + Xorg_libXrender_jll v0.9.12+0 [c7cfdc94] + Xorg_libxcb_jll v1.17.1+0 [c5fb5394] + Xorg_xtrans_jll v1.6.0+0 [b53b4c65] + libpng_jll v1.6.58+0 ⌅ [d7dd28d6] + tectonic_jll v0.15.0+0 [0dad84c5] + ArgTools v1.2.0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [f43a241f] + Downloads v1.7.0 [7b1f6079] + FileWatching v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [4af54fe1] + LazyArtifacts v1.11.0 [b27032c2] + LibCURL v1.0.0 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.14.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 [a4e569a6] + Tar v1.10.0 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.5.5+2 [deac9b47] + LibCURL_jll v8.21.0+0 [e37daf67] + LibGit2_jll v1.9.4+0 [29816b5a] + LibSSH2_jll v1.11.101+0 [14a3606d] + MozillaCACerts_jll v2026.5.14 [458c3c95] + OpenSSL_jll v3.5.7+0 [efcefdf7] + PCRE2_jll v10.47.0+0 [83775a58] + Zlib_jll v1.3.2+0 [3161d3a3] + Zstd_jll v1.5.7+1 [8e850ede] + nghttp2_jll v1.69.0+0 [3f19e933] + p7zip_jll v17.8.0+0 Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading. To see why use `status --outdated -m` Installation completed after 21.4s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling project... 9.0 s ✓ TestEnv 1 dependency successfully precompiled in 9 seconds. 27 already precompiled. Precompiling package dependencies... Precompiling project... 320.9 s ✓ InlineStrings 0.6 s ✓ Reexport 1.3 s ✓ Statistics 1.0 s ✓ DataAPI 3.7 s ✓ ExproniconLite 1.8 s ✓ Tricks 0.7 s ✓ DataValueInterfaces 38.0 s ✓ URIs 0.9 s ✓ LazilyInitializedFields 151.4 s ✓ OrderedCollections 57.3 s ✓ InvertedIndices 2.8 s ✓ PrecompileSignatures 36.7 s ✓ BitFlags 74.2 s ✓ AbstractTrees 94.5 s ✓ LRUCache 2.3 s ✓ ExpressionExplorer 57.9 s ✓ TranscodingStreams 0.9 s ✓ SimpleBufferStream 3.8 s ✓ MIMEs 0.5 s ✓ IteratorInterfaceExtensions 26.7 s ✓ LaTeXStrings 2.6 s ✓ Crayons 2.2 s ✓ MsgPack 2.3 s ✓ ConcurrentUtilities 180.2 s ✓ SentinelArrays 31.0 s ✓ Scratch 31.6 s ✓ LoggingExtras 2.2 s ✓ Compat 31.6 s ✓ Preferences 38.0 s ✓ ExceptionUnwrapping 56.3 s ✓ Missings 23.0 s ✓ PooledArrays 2.0 s ✓ HypertextLiteral 36.1 s ✓ RegistryInstances 172.0 s ✓ DataStructures 74.0 s ✓ Configurations 80.4 s ✓ OpenSSL 39.2 s ✓ LRUCache → SerializationExt ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:8 =# Core.@doc "Return a `TopologicalOrder` that lists the cells to be evaluated in a single reactive run, in topological order. Includes the given roots.\n\n# Keyword arguments\n\n- `allow_multiple_defs::Bool = false`\n \n If `false` (default), multiple definitions are not allowed. When a cell is found that defines a variable that is also defined by another cell (this other cell is called a *fellow assigner*), then both cells are marked as `errable` and not `runnable`.\n \n If `true`, then multiple definitions are allowed, in the sense that we ignore the existance of other cells that define the same variable.\n\n\n- `skip_at_partial_multiple_defs::Bool = false`\n \n If `true` (not default), and `allow_multiple_defs = true` (not default), then the search stops going downward when finding a cell that has fellow assigners, *unless all fellow assigners can be reached by the `roots`*, in which case we continue searching downward.\n\n In other words, if there is a set of fellow assigners that can only be reached **partially** by the roots, then this set blocks the search, and cells that depend on the set are not found.\n" function (topological_order(topology::NotebookTopology{C}, roots::AbstractVector{C}; allow_multiple_defs::Bool = false, skip_at_partial_multiple_defs::Bool = false)::TopologicalOrder{C}) where C <: AbstractCell │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:26 =# │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:31 =# │ if skip_at_partial_multiple_defs │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:32 =# │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:32 =# @assert allow_multiple_defs │ end │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:35 =# │ entries = C[] │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:36 =# │ exits = C[] │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:37 =# │ errable = Dict{C, ReactivityError}() │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:40 =# │ function bfs(cell::C)::ChildExplorationResult │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:40 =# │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:41 =# │ if cell in exits │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:42 =# │ return Ok() │ elseif #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:43 =# haskey(errable, cell) │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:44 =# │ return Ok() │ elseif #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:45 =# length(entries) > 0 && entries[var"end"] === cell │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:46 =# │ return Ok() │ elseif #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:47 =# cell in entries │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:48 =# │ currently_in = setdiff(entries, exits) │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:49 =# │ cycle = currently_in[findfirst(isequal(cell), currently_in):var"end"] │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:51 =# │ if !(cycle_is_among_functions(topology, cycle)) │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:52 =# │ for cell = cycle │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:53 =# │ errable[cell] = CyclicReferenceError(topology, cycle) │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:54 =# │ end │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:55 =# │ return Cycle(cycle) │ end │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:58 =# │ return Ok() │ end │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:62 =# │ current_entries_num = length(entries) │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:63 =# │ current_exits_num = length(exits) │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:65 =# │ push!(entries, cell) │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:67 =# │ assigners = where_assigned(topology, cell) │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:68 =# │ referencers = where_referenced(topology, cell) |> Iterators.reverse │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:70 =# │ if !allow_multiple_defs && length(assigners) > 1 │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:71 =# │ for c = assigners │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:72 =# │ errable[c] = MultipleDefinitionsError(topology, c, assigners) │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:73 =# │ end │ end │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:76 =# │ should_continue_search_down = !skip_at_partial_multiple_defs || all((c->begin │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:76 =# │ c === cell || c ∈ exits │ end), assigners) │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:77 =# │ should_search_fellow_assigners_if_any = !allow_multiple_defs │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:79 =# │ to_search_next = if should_continue_search_down │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:80 =# │ if should_search_fellow_assigners_if_any │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:81 =# │ union(assigners, referencers) │ else │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:83 =# │ referencers │ end │ else │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:86 =# │ C[] │ end │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:89 =# │ for c = to_search_next │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:90 =# │ if c !== cell │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:91 =# │ child_result = bfs(c) │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:94 =# │ if child_result isa Ok || cell ∉ child_result.cycled_cells │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:95 =# │ continue │ end │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:102 =# │ if !(is_soft_edge(topology, cell, c)) │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:104 =# │ deleteat!(entries, current_entries_num + 1:length(entries)) │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:105 =# │ deleteat!(exits, current_exits_num + 1:length(exits)) │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:106 =# │ return child_result │ end │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:111 =# │ for cycled_cell = child_result.cycled_cells │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:112 =# │ delete!(errable, cycled_cell) │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:113 =# │ end │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:115 =# │ if entries[var"end"] === c │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:116 =# │ pop!(entries) │ end │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:119 =# │ continue │ end │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:121 =# │ end │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:122 =# │ push!(exits, cell) │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:123 =# │ Ok() │ end │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:128 =# │ prelim_order_1 = sort(roots, alg = MergeSort, by = (c->begin │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:128 =# │ cell_precedence_heuristic(topology, c) │ end)) │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:130 =# │ for i = length(prelim_order_1):-1:1 │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:131 =# │ bfs(prelim_order_1[i]) │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:132 =# │ end │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:133 =# │ ordered = reverse(exits) │ #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:134 =# │ TopologicalOrder(topology, setdiff(ordered, keys(errable)), errable) │ end) │ st0 = │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,context,syntax_flags,name_val,meta,value,jl_source,is_toplevel_thunk,source │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:8 =#) :: Value | │ "Return a `TopologicalOrder` that lists the cells to be evaluated in a single reactive run, in topological order. Includes the given roots.\n\n# Keyword arguments\n\n- `allow_multiple_defs::Bool = false`\n \n If `false` (default), multiple definitions are not allowed. When a cell is found that defines a variable that is also defined by another cell (this other cell is called a *fellow assigner*), then both cells are marked as `errable` and not `runnable`.\n \n If `true`, then multiple definitions are allowed, in the sense that we ignore the existance of other cells that define the same variable.\n\n\n- `skip_at_partial_multiple_defs::Bool = false`\n \n If `true` (not default), and `allow_multiple_defs = true` (not default), then the search stops going downward when finding a cell that has fellow assigners, *unless all fellow assigners can be reached by the `roots`*, in which case we continue searching downward.\n\n In other words, if there is a set of fellow assigners that can only be reached **partially** by the roots, then this set blocks the search, and cells that depend on the set are not found.\n" :: Value | │ [function] | │ [where] | │ [::] | │ [call] | │ topological_order :: Identifier | │ [parameters] | │ [kw] | │ [::] | │ allow_multiple_defs :: Identifier | │ Bool :: Identifier | │ false :: Value | │ [kw] | │ [::] | │ skip_at_partial_multiple_defs :: Identifier | │ Bool :: Identifier | │ false :: Value | │ [::] | │ topology :: Identifier | │ [curly] | │ NotebookTopology :: Identifier | │ C :: Identifier | │ [::] | │ roots :: Identifier | │ [curly] | │ AbstractVector :: Identifier | │ C :: Identifier | │ [curly] | │ TopologicalOrder :: Identifier | │ C :: Identifier | │ [<:] | │ C :: Identifier | │ AbstractCell :: Identifier | │ [block] | │ [if] | │ skip_at_partial_multiple_defs :: Identifier | │ [block] | │ [macrocall] | │ @assert :: Identifier | │ :(#= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:32 =#) :: Value | │ allow_multiple_defs :: Identifier | │ [=] | │ entries :: Identifier | │ [ref] | │ C :: Identifier | │ [=] | │ exits :: Identifier | │ [ref] | │ C :: Identifier | │ [=] | │ errable :: Identifier | │ [call] | │ [curly] | │ Dict :: Identifier | │ C :: Identifier | │ ReactivityError :: Identifier | │ [function] | │ [::] | │ [call] | │ bfs :: Identifier | │ [::] | │ cell :: Identifier | │ C :: Identifier | │ ChildExplorationResult :: Identifier | │ [block] | │ [if] | │ [call] | │ in :: Identifier | │ cell :: Identifier | │ exits :: Identifier | │ [block] | │ [return] | │ [call] | │ Ok :: Identifier | │ [elseif] | │ [block] | │ [call] | │ haskey :: Identifier | │ errable :: Identifier | │ cell :: Identifier | │ [block] | │ [return] | │ [call] | │ Ok :: Identifier | │ [elseif] | │ [block] | │ [&&] | │ [call] | │ > :: Identifier | │ [call] | │ length :: Identifier | │ entries :: Identifier | │ 0 :: Value | │ [call] | │ === :: Identifier | │ [ref] | │ entries :: Identifier | │ end :: Identifier | │ cell :: Identifier | │ [block] | │ [return] | │ [call] | │ Ok :: Identifier | │ [elseif] | │ [block] | │ [call] | │ in :: Identifier | │ cell :: Identifier | │ entries :: Identifier | │ [block] | │ [=] | │ currently_in :: Identifier | │ [call] | │ setdiff :: Identifier | │ entries :: Identifier | │ exits :: Identifier | │ [=] | │ cycle :: Identifier | │ [ref] | │ currently_in :: Identifier | │ [call] | │ : :: Identifier | │ [call] | │ findfirst :: Identifier | │ [call] | │ isequal :: Identifier | │ cell :: Identifier | │ currently_in :: Identifier | │ end :: Identifier | │ [if] | │ [call] | │ ! :: Identifier | │ [call] | │ cycle_is_among_functions :: Identifier | │ topology :: Identifier | │ cycle :: Identifier | │ [block] | │ [for] | │ [=] | │ cell :: Identifier | │ cycle :: Identifier | │ [block] | │ [=] | │ [ref] | │ errable :: Identifier | │ cell :: Identifier | │ [call] | │ CyclicReferenceError :: Identifier | │ topology :: Identifier | │ cycle :: Identifier | │ [return] | │ [call] | │ Cycle :: Identifier | │ cycle :: Identifier | │ [return] | │ [call] | │ Ok :: Identifier | │ [=] | │ current_entries_num :: Identifier | │ [call] | │ length :: Identifier | │ entries :: Identifier | │ [=] | │ current_exits_num :: Identifier | │ [call] | │ length :: Identifier | │ exits :: Identifier | │ [call] | │ push! :: Identifier | │ entries :: Identifier | │ cell :: Identifier | │ [=] | │ assigners :: Identifier | │ [call] | │ where_assigned :: Identifier | │ topology :: Identifier | │ cell :: Identifier | │ [=] | │ referencers :: Identifier | │ [call] | │ |> :: Identifier | │ [call] | │ where_referenced :: Identifier | │ topology :: Identifier | │ cell :: Identifier | │ [.] | │ Iterators :: Identifier | │ [inert] | │ reverse :: Identifier | │ [if] | │ [&&] | │ [call] | │ ! :: Identifier | │ allow_multiple_defs :: Identifier | │ [call] | │ > :: Identifier | │ [call] | │ length :: Identifier | │ assigners :: Identifier | │ 1 :: Value | │ [block] | │ [for] | │ [=] | │ c :: Identifier | │ assigners :: Identifier | │ [block] | │ [=] | │ [ref] | │ errable :: Identifier | │ c :: Identifier | │ [call] | │ MultipleDefinitionsError :: Identifier | │ topology :: Identifier | │ c :: Identifier | │ assigners :: Identifier | │ [=] | │ should_continue_search_down :: Identifier | │ [||] | │ [call] | │ ! :: Identifier | │ skip_at_partial_multiple_defs :: Identifier | │ [call] | │ all :: Identifier | │ [->] | │ c :: Identifier | │ [block] | │ [||] | │ [call] | │ === :: Identifier | │ c :: Identifier | │ cell :: Identifier | │ [call] | │ ∈ :: Identifier | │ c :: Identifier | │ exits :: Identifier | │ assigners :: Identifier | │ [=] | │ should_search_fellow_assigners_if_any :: Identifier | │ [call] | │ ! :: Identifier | │ allow_multiple_defs :: Identifier | │ [=] | │ to_search_next :: Identifier | │ [if] | │ should_continue_search_down :: Identifier | │ [block] | │ [if] | │ should_search_fellow_assigners_if_any :: Identifier | │ [block] | │ [call] | │ union :: Identifier | │ assigners :: Identifier | │ referencers :: Identifier | │ [block] | │ referencers :: Identifier | │ [block] | │ [ref] | │ C :: Identifier | │ [for] | │ [=] | │ c :: Identifier | │ to_search_next :: Identifier | │ [block] | │ [if] | │ [call] | │ !== :: Identifier | │ c :: Identifier | │ cell :: Identifier | │ [block] | │ [=] | │ child_result :: Identifier | │ [call] | │ bfs :: Identifier | │ c :: Identifier | │ [if] | │ [||] | │ [call] | │ isa :: Identifier | │ child_result :: Identifier | │ Ok :: Identifier | │ [call] | │ ∉ :: Identifier | │ cell :: Identifier | │ [.] | │ child_result :: Identifier | │ [inert] | │ cycled_cells :: Identifier | │ [block] | │ [continue] | │ [if] | │ [call] | │ ! :: Identifier | │ [call] | │ is_soft_edge :: Identifier | │ topology :: Identifier | │ cell :: Identifier | │ c :: Identifier | │ [block] | │ [call] | │ deleteat! :: Identifier | │ entries :: Identifier | │ [call] | │ : :: Identifier | │ [call] | │ + :: Identifier | │ current_entries_num :: Identifier | │ 1 :: Value | │ [call] | │ length :: Identifier | │ entries :: Identifier | │ [call] | │ deleteat! :: Identifier | │ exits :: Identifier | │ [call] | │ : :: Identifier | │ [call] | │ + :: Identifier | │ current_exits_num :: Identifier | │ 1 :: Value | │ [call] | │ length :: Identifier | │ exits :: Identifier | │ [return] | │ child_result :: Identifier | │ [for] | │ [=] | │ cycled_cell :: Identifier | │ [.] | │ child_result :: Identifier | │ [inert] | │ cycled_cells :: Identifier | │ [block] | │ [call] | │ delete! :: Identifier | │ errable :: Identifier | │ cycled_cell :: Identifier | │ [if] | │ [call] | │ === :: Identifier | │ [ref] | │ entries :: Identifier | │ end :: Identifier | │ c :: Identifier | │ [block] | │ [call] | │ pop! :: Identifier | │ entries :: Identifier | │ [continue] | │ [call] | │ push! :: Identifier | │ exits :: Identifier | │ cell :: Identifier | │ [call] | │ Ok :: Identifier | │ [=] | │ prelim_order_1 :: Identifier | │ [call] | │ sort :: Identifier | │ roots :: Identifier | │ [kw] | │ alg :: Identifier | │ MergeSort :: Identifier | │ [kw] | │ by :: Identifier | │ [->] | │ c :: Identifier | │ [block] | │ [call] | │ cell_precedence_heuristic :: Identifier | │ topology :: Identifier | │ c :: Identifier | │ [for] | │ [=] | │ i :: Identifier | │ [call] | │ : :: Identifier | │ [call] | │ length :: Identifier | │ prelim_order_1 :: Identifier | │ -1 :: Value | │ 1 :: Value | │ [block] | │ [call] | │ bfs :: Identifier | │ [ref] | │ prelim_order_1 :: Identifier | │ i :: Identifier | │ [=] | │ ordered :: Identifier | │ [call] | │ reverse :: Identifier | │ exits :: Identifier | │ [call] | │ TopologicalOrder :: Identifier | │ topology :: Identifier | │ [call] | │ setdiff :: Identifier | │ ordered :: Identifier | │ [call] | │ keys :: Identifier | │ errable :: Identifier | │ errable :: Identifier | │ │ st1 = │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,context,syntax_flags,name_val,meta,value,jl_source,is_toplevel_thunk,source │ [block] | [old,SL(BE1PUxHEjLN,Base.Docs,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,)),@doc], │ [if] | [old,SL(BE1PUxHEjLN,Base.Docs,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,)),@doc], │ true :: Value | [old,SL(BE1PUxHEjLN,Base.Docs,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,)),@doc], │ [=] | [old,SL(BE1PUxHEjLN,Base.Docs,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,)),@doc], │ val :: Identifier | [old,SL(BE1PUxHEjLN,Base.Docs,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,)),@doc], │ [function] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [where] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [::] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ topological_order :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [parameters] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [kw] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [::] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ allow_multiple_defs :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ Bool :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ false :: Value | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [kw] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [::] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ skip_at_partial_multiple_defs :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ Bool :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ false :: Value | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [::] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ topology :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [curly] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ NotebookTopology :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [::] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ roots :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [curly] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ AbstractVector :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [curly] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ TopologicalOrder :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [<:] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ AbstractCell :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ skip_at_partial_multiple_defs :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ allow_multiple_defs :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ nothing :: Value | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ throw :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc],mod=Base │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ AssertionError :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc],mod=Base │ "allow_multiple_defs" :: Value | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ entries :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [ref] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ exits :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [ref] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ errable :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [curly] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ Dict :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ ReactivityError :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [function] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [::] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ bfs :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [::] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ ChildExplorationResult :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ in :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ exits :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [return] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ Ok :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [elseif] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ haskey :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ errable :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [return] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ Ok :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [elseif] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [&&] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ > :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ length :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ entries :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ 0 :: Value | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ === :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [ref] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ entries :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ end :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [return] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ Ok :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [elseif] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ in :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ entries :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ currently_in :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ setdiff :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ entries :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ exits :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cycle :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [ref] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ currently_in :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ : :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ findfirst :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ isequal :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ currently_in :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ end :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ ! :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cycle_is_among_functions :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ topology :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cycle :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [for] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cycle :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [ref] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ errable :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ CyclicReferenceError :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ topology :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cycle :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [return] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ Cycle :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cycle :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [return] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ Ok :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ current_entries_num :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ length :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ entries :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ current_exits_num :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ length :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ exits :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ push! :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ entries :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ assigners :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ where_assigned :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ topology :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ referencers :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ |> :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ where_referenced :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ topology :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [.] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ Iterators :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [inert] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ reverse :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [&&] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ ! :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ allow_multiple_defs :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ > :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ length :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ assigners :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ 1 :: Value | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [for] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ assigners :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [ref] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ errable :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ MultipleDefinitionsError :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ topology :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ assigners :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ should_continue_search_down :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [||] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ ! :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ skip_at_partial_multiple_defs :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ all :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [->] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [||] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ === :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ ∈ :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ exits :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ assigners :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ should_search_fellow_assigners_if_any :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ ! :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ allow_multiple_defs :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ to_search_next :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ should_continue_search_down :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ should_search_fellow_assigners_if_any :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ union :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ assigners :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ referencers :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ referencers :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [ref] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [for] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ to_search_next :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ !== :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ child_result :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ bfs :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [||] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ isa :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ child_result :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ Ok :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ ∉ :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [.] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ child_result :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [inert] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cycled_cells :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [continue] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ ! :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ is_soft_edge :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ topology :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ deleteat! :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ entries :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ : :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ + :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ current_entries_num :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ 1 :: Value | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ length :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ entries :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ deleteat! :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ exits :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ : :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ + :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ current_exits_num :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ 1 :: Value | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ length :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ exits :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [return] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ child_result :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [for] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cycled_cell :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [.] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ child_result :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [inert] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cycled_cells :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ delete! :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ errable :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cycled_cell :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ === :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [ref] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ entries :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ end :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ pop! :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ entries :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [continue] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ push! :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ exits :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ Ok :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ prelim_order_1 :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ sort :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ roots :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [kw] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ alg :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ MergeSort :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [kw] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ by :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [->] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ cell_precedence_heuristic :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ topology :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [for] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ i :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ : :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ length :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ prelim_order_1 :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ -1 :: Value | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ 1 :: Value | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ bfs :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [ref] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ prelim_order_1 :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ i :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ ordered :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ reverse :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ exits :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ TopologicalOrder :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ topology :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ setdiff :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ ordered :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ keys :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ errable :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ errable :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(BE1PUxHEjLN,Base.Docs,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,)),@doc], │ Base.Docs.doc! :: Value | [old,SL(BE1PUxHEjLN,Base.Docs,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,)),@doc], │ PlutoDependencyExplorer :: Value | [old,SL(BE1PUxHEjLN,Base.Docs,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,)),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ Base.Docs.Binding :: Value | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ PlutoDependencyExplorer :: Value | [old,SL(FkeWqfxveg0,Base,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,)),(. Base (inert @__MODULE__))], │ [inert] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc],jl_source=L47 │ topological_order :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ Base.Docs.docstr :: Value | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ Core.svec :: Value | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ "Return a `TopologicalOrder` that lists the cells to be evaluated in a single reactive run, in topological order. Includes the given roots.\n\n# Keyword arguments\n\n- `allow_multiple_defs::Bool = false`\n \n If `false` (default), multiple definitions are not allowed. When a cell is found that defines a variable that is also defined by another cell (this other cell is called a *fellow assigner*), then both cells are marked as `errable` and not `runnable`.\n \n If `true`, then multiple definitions are allowed, in the sense that we ignore the existance of other cells that define the same variable.\n\n\n- `skip_at_partial_multiple_defs::Bool = false`\n \n If `true` (not default), and `allow_multiple_defs = true` (not default), then the search stops going downward when finding a cell that has fellow assigners, *unless all fellow assigners can be reached by the `roots`*, in which case we continue searching downward.\n\n In other words, if there is a set of fellow assigners that can only be reached **partially** by the roots, then this set blocks the search, and cells that depend on the set are not found.\n" :: Value | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ Dict{Symbol, Any} :: Value | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ :path => "/home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl" :: Value | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ :linenumber => 8 :: Value | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ :module => PlutoDependencyExplorer :: Value | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [where] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [curly] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ Union :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [curly] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ Tuple :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [curly] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ NotebookTopology :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [curly] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ AbstractVector :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [curly] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ Tuple :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [<:] | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ AbstractCell :: Identifier | [old,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(BE1PUxHEjLN,Base.Docs,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,)),@doc], │ true :: Value | [old,SL(BE1PUxHEjLN,Base.Docs,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,)),@doc], │ val :: Identifier | [old,SL(BE1PUxHEjLN,Base.Docs,SL(2vRZ2YLIOqf,PlutoDependencyExplorer,)),@doc], │ │ file = "/home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl" │ line = 8 └ mod = PlutoDependencyExplorer ERROR: LoadError: LoweringError: #= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:40 =# - Found unexpected binding of kind static_parameter Expression:  #₅₄/C Containing expressions:  (= #₁₇₄/C #₅₄/C)  (= #₃ (call core.svec (call core.svec #₁₄₃/##kw_body#topological_order#0#bfs##0 #₅₄/C) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:40:0))  (= #₃ (call core.svec (call core.svec (function_type #₅₆/bfs) #₅₄/C) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:40:0))  Detailed provenance:  #₅₄/C  ├─ C  │ ├─ C  │ │ └─ @ /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:40  │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:8 =#) "Return a `TopologicalOrder` that lists the cells to be evaluated in a single reactive run, in topological order. Includes the given roots.\n\n# Keyword arguments\n\n- `allow_multiple_defs::Bool = false`\n \n If `false` (default), multiple definitions are not allowed. When a cell is found that defines a variable that is also defined by another cell (this other cell is called a *fellow assigner*), then both cells are marked as `errable` and not `runnable`.\n \n If `true`, then multiple definitions are allowed, in the sense that we ignore the existance of other cells that define the same variable.\n\n\n- `skip_at_partial_multiple_defs::Bool = false`\n \n If `true` (not default), and `allow_multiple_defs = true` (not default), then the search stops going downward when finding a cell that has fellow assigners, *unless all fellow assigners can be reached by the `roots`*, in which case we continue searching downward.\n\n In other words, if there is a set of fellow assigners that can only be reached **partially** by the roots, then this set blocks the search, and cells that depend on the set are not found.\n" (function (where (:: (call topological_order (parameters (kw (:: allow_multiple_defs Bool) false) (kw (:: skip_at_partial_multiple_defs Bool) false)) (:: topology (curly NotebookTopology C)) (:: roots (curly AbstractVector C))) (curly TopologicalOrder C)) (<: C AbstractCell)) (block (if skip_at_partial_multiple_defs (block (macrocall @assert :(#= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:32 =#) allow_multiple_defs))) (= entries (ref C)) (= exits (ref C)) (= errable (call (curly Dict C ReactivityError))) (function (:: (call bfs (:: cell C)) ChildExplorationResult) (block (if (call in cell exits) (block (return (call Ok))) (elseif (block (call haskey errable cell)) (block (return (call Ok))) (elseif (block (&& (call > (call length entries) 0) (call === (ref entries end) cell))) (block (return (call Ok))) (elseif (block (call in cell entries)) (block (= currently_in (call setdiff entries exits)) (= cycle (ref currently_in (call : (call findfirst (call isequal cell) currently_in) end))) (if (call ! (call cycle_is_among_functions topology cycle)) (block (for (= cell cycle) (block (= (ref errable cell) (call CyclicReferenceError topology cycle)))) (return (call Cycle cycle)))) (return (call Ok))))))) (= current_entries_num (call length entries)) (= current_exits_num (call length exits)) (call push! entries cell) (= assigners (call where_assigned topology cell)) (= referencers (call |> (call where_referenced topology cell) (. Iterators (inert reverse)))) (if (&& (call ! allow_multiple_defs) (call > (call length assigners) 1)) (block (for (= c assigners) (block (= (ref errable c) (call MultipleDefinitionsError topology c assigners)))))) (= should_continue_search_down (|| (call ! skip_at_partial_multiple_defs) (call all (-> c (block (|| (call === c cell) (call ∈ c exits)))) assigners))) (= should_search_fellow_assigners_if_any (call ! allow_multiple_defs)) (= to_search_next (if should_continue_search_down (block (if should_search_fellow_assigners_if_any (block (call union assigners referencers)) (block referencers))) (block (ref C)))) (for (= c to_search_next) (block (if (call !== c cell) (block (= child_result (call bfs c)) (if (|| (call isa child_result Ok) (call ∉ cell (. child_result (inert cycled_cells)))) (block (continue))) (if (call ! (call is_soft_edge topology cell c)) (block (call deleteat! entries (call : (call + current_entries_num 1) (call length entries))) (call deleteat! exits (call : (call + current_exits_num 1) (call length exits))) (return child_result))) (for (= cycled_cell (. child_result (inert cycled_cells))) (block (call delete! errable cycled_cell))) (if (call === (ref entries end) c) (block (call pop! entries))) (continue))))) (call push! exits cell) (call Ok))) (= prelim_order_1 (call sort roots (kw alg MergeSort) (kw by (-> c (block (call cell_precedence_heuristic topology c)))))) (for (= i (call : (call length prelim_order_1) -1 1)) (block (call bfs (ref prelim_order_1 i)))) (= ordered (call reverse exits)) (call TopologicalOrder topology (call setdiff ordered (call keys errable)) errable))))  │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:8 =#) "Return a `TopologicalOrder` that lists the cells to be evaluated in a single reactive run, in topological order. Includes the given roots.\n\n# Keyword arguments\n\n- `allow_multiple_defs::Bool = false`\n \n If `false` (default), multiple definitions are not allowed. When a cell is found that defines a variable that is also defined by another cell (this other cell is called a *fellow assigner*), then both cells are marked as `errable` and not `runnable`.\n \n If `true`, then multiple definitions are allowed, in the sense that we ignore the existance of other cells that define the same variable.\n\n\n- `skip_at_partial_multiple_defs::Bool = false`\n \n If `true` (not default), and `allow_multiple_defs = true` (not default), then the search stops going downward when finding a cell that has fellow assigners, *unless all fellow assigners can be reached by the `roots`*, in which case we continue searching downward.\n\n In other words, if there is a set of fellow assigners that can only be reached **partially** by the roots, then this set blocks the search, and cells that depend on the set are not found.\n" (function (where (:: (call topological_order (parameters (kw (:: allow_multiple_defs Bool) false) (kw (:: skip_at_partial_multiple_defs Bool) false)) (:: topology (curly NotebookTopology C)) (:: roots (curly AbstractVector C))) (curly TopologicalOrder C)) (<: C AbstractCell)) (block (if skip_at_partial_multiple_defs (block (macrocall @assert :(#= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:32 =#) allow_multiple_defs))) (= entries (ref C)) (= exits (ref C)) (= errable (call (curly Dict C ReactivityError))) (function (:: (call bfs (:: cell C)) ChildExplorationResult) (block (if (call in cell exits) (block (return (call Ok))) (elseif (block (call haskey errable cell)) (block (return (call Ok))) (elseif (block (&& (call > (call length entries) 0) (call === (ref entries end) cell))) (block (return (call Ok))) (elseif (block (call in cell entries)) (block (= currently_in (call setdiff entries exits)) (= cycle (ref currently_in (call : (call findfirst (call isequal cell) currently_in) end))) (if (call ! (call cycle_is_among_functions topology cycle)) (block (for (= cell cycle) (block (= (ref errable cell) (call CyclicReferenceError topology cycle)))) (return (call Cycle cycle)))) (return (call Ok))))))) (= current_entries_num (call length entries)) (= current_exits_num (call length exits)) (call push! entries cell) (= assigners (call where_assigned topology cell)) (= referencers (call |> (call where_referenced topology cell) (. Iterators (inert reverse)))) (if (&& (call ! allow_multiple_defs) (call > (call length assigners) 1)) (block (for (= c assigners) (block (= (ref errable c) (call MultipleDefinitionsError topology c assigners)))))) (= should_continue_search_down (|| (call ! skip_at_partial_multiple_defs) (call all (-> c (block (|| (call === c cell) (call ∈ c exits)))) assigners))) (= should_search_fellow_assigners_if_any (call ! allow_multiple_defs)) (= to_search_next (if should_continue_search_down (block (if should_search_fellow_assigners_if_any (block (call union assigners referencers)) (block referencers))) (block (ref C)))) (for (= c to_search_next) (block (if (call !== c cell) (block (= child_result (call bfs c)) (if (|| (call isa child_result Ok) (call ∉ cell (. child_result (inert cycled_cells)))) (block (continue))) (if (call ! (call is_soft_edge topology cell c)) (block (call deleteat! entries (call : (call + current_entries_num 1) (call length entries))) (call deleteat! exits (call : (call + current_exits_num 1) (call length exits))) (return child_result))) (for (= cycled_cell (. child_result (inert cycled_cells))) (block (call delete! errable cycled_cell))) (if (call === (ref entries end) c) (block (call pop! entries))) (continue))))) (call push! exits cell) (call Ok))) (= prelim_order_1 (call sort roots (kw alg MergeSort) (kw by (-> c (block (call cell_precedence_heuristic topology c)))))) (for (= i (call : (call length prelim_order_1) -1 1)) (block (call bfs (ref prelim_order_1 i)))) (= ordered (call reverse exits)) (call TopologicalOrder topology (call setdiff ordered (call keys errable)) errable))))  │ └─ @ /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:8  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:8 =#) "Return a `TopologicalOrder` that lists the cells to be evaluated in a single reactive run, in topological order. Includes the given roots.\n\n# Keyword arguments\n\n- `allow_multiple_defs::Bool = false`\n \n If `false` (default), multiple definitions are not allowed. When a cell is found that defines a variable that is also defined by another cell (this other cell is called a *fellow assigner*), then both cells are marked as `errable` and not `runnable`.\n \n If `true`, then multiple definitions are allowed, in the sense that we ignore the existance of other cells that define the same variable.\n\n\n- `skip_at_partial_multiple_defs::Bool = false`\n \n If `true` (not default), and `allow_multiple_defs = true` (not default), then the search stops going downward when finding a cell that has fellow assigners, *unless all fellow assigners can be reached by the `roots`*, in which case we continue searching downward.\n\n In other words, if there is a set of fellow assigners that can only be reached **partially** by the roots, then this set blocks the search, and cells that depend on the set are not found.\n" (function (where (:: (call topological_order (parameters (kw (:: allow_multiple_defs Bool) false) (kw (:: skip_at_partial_multiple_defs Bool) false)) (:: topology (curly NotebookTopology C)) (:: roots (curly AbstractVector C))) (curly TopologicalOrder C)) (<: C AbstractCell)) (block (if skip_at_partial_multiple_defs (block (macrocall @assert :(#= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:32 =#) allow_multiple_defs))) (= entries (ref C)) (= exits (ref C)) (= errable (call (curly Dict C ReactivityError))) (function (:: (call bfs (:: cell C)) ChildExplorationResult) (block (if (call in cell exits) (block (return (call Ok))) (elseif (block (call haskey errable cell)) (block (return (call Ok))) (elseif (block (&& (call > (call length entries) 0) (call === (ref entries end) cell))) (block (return (call Ok))) (elseif (block (call in cell entries)) (block (= currently_in (call setdiff entries exits)) (= cycle (ref currently_in (call : (call findfirst (call isequal cell) currently_in) end))) (if (call ! (call cycle_is_among_functions topology cycle)) (block (for (= cell cycle) (block (= (ref errable cell) (call CyclicReferenceError topology cycle)))) (return (call Cycle cycle)))) (return (call Ok))))))) (= current_entries_num (call length entries)) (= current_exits_num (call length exits)) (call push! entries cell) (= assigners (call where_assigned topology cell)) (= referencers (call |> (call where_referenced topology cell) (. Iterators (inert reverse)))) (if (&& (call ! allow_multiple_defs) (call > (call length assigners) 1)) (block (for (= c assigners) (block (= (ref errable c) (call MultipleDefinitionsError topology c assigners)))))) (= should_continue_search_down (|| (call ! skip_at_partial_multiple_defs) (call all (-> c (block (|| (call === c cell) (call ∈ c exits)))) assigners))) (= should_search_fellow_assigners_if_any (call ! allow_multiple_defs)) (= to_search_next (if should_continue_search_down (block (if should_search_fellow_assigners_if_any (block (call union assigners referencers)) (block referencers))) (block (ref C)))) (for (= c to_search_next) (block (if (call !== c cell) (block (= child_result (call bfs c)) (if (|| (call isa child_result Ok) (call ∉ cell (. child_result (inert cycled_cells)))) (block (continue))) (if (call ! (call is_soft_edge topology cell c)) (block (call deleteat! entries (call : (call + current_entries_num 1) (call length entries))) (call deleteat! exits (call : (call + current_exits_num 1) (call length exits))) (return child_result))) (for (= cycled_cell (. child_result (inert cycled_cells))) (block (call delete! errable cycled_cell))) (if (call === (ref entries end) c) (block (call pop! entries))) (continue))))) (call push! exits cell) (call Ok))) (= prelim_order_1 (call sort roots (kw alg MergeSort) (kw by (-> c (block (call cell_precedence_heuristic topology c)))))) (for (= i (call : (call length prelim_order_1) -1 1)) (block (call bfs (ref prelim_order_1 i)))) (= ordered (call reverse exits)) (call TopologicalOrder topology (call setdiff ordered (call keys errable)) errable))))  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:8 =#) "Return a `TopologicalOrder` that lists the cells to be evaluated in a single reactive run, in topological order. Includes the given roots.\n\n# Keyword arguments\n\n- `allow_multiple_defs::Bool = false`\n \n If `false` (default), multiple definitions are not allowed. When a cell is found that defines a variable that is also defined by another cell (this other cell is called a *fellow assigner*), then both cells are marked as `errable` and not `runnable`.\n \n If `true`, then multiple definitions are allowed, in the sense that we ignore the existance of other cells that define the same variable.\n\n\n- `skip_at_partial_multiple_defs::Bool = false`\n \n If `true` (not default), and `allow_multiple_defs = true` (not default), then the search stops going downward when finding a cell that has fellow assigners, *unless all fellow assigners can be reached by the `roots`*, in which case we continue searching downward.\n\n In other words, if there is a set of fellow assigners that can only be reached **partially** by the roots, then this set blocks the search, and cells that depend on the set are not found.\n" (function (where (:: (call topological_order (parameters (kw (:: allow_multiple_defs Bool) false) (kw (:: skip_at_partial_multiple_defs Bool) false)) (:: topology (curly NotebookTopology C)) (:: roots (curly AbstractVector C))) (curly TopologicalOrder C)) (<: C AbstractCell)) (block (if skip_at_partial_multiple_defs (block (macrocall @assert :(#= /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:32 =#) allow_multiple_defs))) (= entries (ref C)) (= exits (ref C)) (= errable (call (curly Dict C ReactivityError))) (function (:: (call bfs (:: cell C)) ChildExplorationResult) (block (if (call in cell exits) (block (return (call Ok))) (elseif (block (call haskey errable cell)) (block (return (call Ok))) (elseif (block (&& (call > (call length entries) 0) (call === (ref entries end) cell))) (block (return (call Ok))) (elseif (block (call in cell entries)) (block (= currently_in (call setdiff entries exits)) (= cycle (ref currently_in (call : (call findfirst (call isequal cell) currently_in) end))) (if (call ! (call cycle_is_among_functions topology cycle)) (block (for (= cell cycle) (block (= (ref errable cell) (call CyclicReferenceError topology cycle)))) (return (call Cycle cycle)))) (return (call Ok))))))) (= current_entries_num (call length entries)) (= current_exits_num (call length exits)) (call push! entries cell) (= assigners (call where_assigned topology cell)) (= referencers (call |> (call where_referenced topology cell) (. Iterators (inert reverse)))) (if (&& (call ! allow_multiple_defs) (call > (call length assigners) 1)) (block (for (= c assigners) (block (= (ref errable c) (call MultipleDefinitionsError topology c assigners)))))) (= should_continue_search_down (|| (call ! skip_at_partial_multiple_defs) (call all (-> c (block (|| (call === c cell) (call ∈ c exits)))) assigners))) (= should_search_fellow_assigners_if_any (call ! allow_multiple_defs)) (= to_search_next (if should_continue_search_down (block (if should_search_fellow_assigners_if_any (block (call union assigners referencers)) (block referencers))) (block (ref C)))) (for (= c to_search_next) (block (if (call !== c cell) (block (= child_result (call bfs c)) (if (|| (call isa child_result Ok) (call ∉ cell (. child_result (inert cycled_cells)))) (block (continue))) (if (call ! (call is_soft_edge topology cell c)) (block (call deleteat! entries (call : (call + current_entries_num 1) (call length entries))) (call deleteat! exits (call : (call + current_exits_num 1) (call length exits))) (return child_result))) (for (= cycled_cell (. child_result (inert cycled_cells))) (block (call delete! errable cycled_cell))) (if (call === (ref entries end) c) (block (call pop! entries))) (continue))))) (call push! exits cell) (call Ok))) (= prelim_order_1 (call sort roots (kw alg MergeSort) (kw by (-> c (block (call cell_precedence_heuristic topology c)))))) (for (= i (call : (call length prelim_order_1) -1 1)) (block (call bfs (ref prelim_order_1 i)))) (= ordered (call reverse exits)) (call TopologicalOrder topology (call setdiff ordered (call keys errable)) errable))))  └─ @ /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:8  Stacktrace:  [1] _renumber(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ssa_rewrites::Dict{Int64, Int64}, slot_rewrites::Dict{Int64, Int64}, label_table::Dict{Int64, Int64}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1097  [2] renumber_body(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, input_code::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}, slot_rewrites::Dict{Int64, Int64})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1162  [3] compile_lambda(outer_ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1257  [4] linearize_ir(ctx::Base.JuliaLowering.ClosureConversionCtx{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1287  [5] core_lowering_hook(code::Any, mod::Module, file::String, line::UInt64, world::UInt64, _warn::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/hooks.jl:33  [6] include(mapexpr::Function, mod::Module, _path::String)  @ Base Base.jl:326  [7] top-level scope  @ ~/.julia/packages/PlutoDependencyExplorer/BaZEm/src/PlutoDependencyExplorer.jl:24  [8] include(mod::Module, _path::String)  @ Base Base.jl:325  [9] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3303  [10] top-level scope  @ stdin:5  [11] eval(m::Module, e::Any)  @ Core boot.jl:522  [12] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [13] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [14] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [15] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl:8 in expression starting at /home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/PlutoDependencyExplorer.jl:2 in expression starting at stdin:5 ✗ PlutoDependencyExplorer 19.0 s ✓ CodecZlib 0.7 s ✓ TableTraits 31.0 s ✓ RelocatableFolders 0.9 s ✓ Compat → CompatLinearAlgebraExt 32.5 s ✓ JLLWrappers 30.8 s ✓ PrecompileTools 40.6 s ✓ SortingAlgorithms 151.5 s ✓ Tables 52.3 s ✓ Malt 9.7 s ✓ GracefulPkg 49.5 s ✓ Aqua 32.1 s ✓ Libmount_jll 32.6 s ✓ ICU_jll 32.2 s ✓ Libffi_jll 32.1 s ✓ LZO_jll 32.0 s ✓ Graphite2_jll 32.0 s ✓ Libuuid_jll 32.4 s ✓ libpng_jll 32.1 s ✓ Bzip2_jll 32.2 s ✓ LLVMOpenMP_jll 32.2 s ✓ Libiconv_jll 32.2 s ✓ MbedTLS_jll 32.2 s ✓ Gumbo_jll 31.8 s ✓ Xorg_libXau_jll 32.0 s ✓ Xorg_libXdmcp_jll  ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ======================================================================================  cmd: /opt/julia/bin/julia 565 running 1 of 1  signal (10): User defined signal 1 _ZN4llvm5Value12setValueNameEPNS_14StringMapEntryIPS0_EE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm5Value11deleteValueEv at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm11Instruction15eraseFromParentEv at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) RemoveNoopAddrSpaceCasts at /source/src/llvm-remove-addrspaces.cpp:203:28 removeAddrspaces at /source/src/llvm-remove-addrspaces.cpp:386:33 run at /source/src/llvm-remove-addrspaces.cpp:430:37 run at /source/src/llvm-remove-addrspaces.cpp:456:65 run at /source/usr/include/llvm/IR/PassManagerInternal.h:91:41 _ZN4llvm11PassManagerINS_6ModuleENS_15AnalysisManagerIS1_JEEEJEE3runERS1_RS3_ at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) run at /source/src/pipeline.cpp:989:12 operator() at /source/src/jitlayers.cpp:1271:17 operator() at /source/src/jitlayers.cpp:1409:12 [inlined] optimizeModule at /source/src/jitlayers.cpp:2360:18 materialize at /source/src/jitlayers.cpp:876:31 _ZN4llvm3orc19MaterializationTask3runEv at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) dispatch at /source/src/julia-task-dispatcher.h:361:11 _ZN4llvm3orc16ExecutionSession22dispatchOutstandingMUsEv at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm3orc16ExecutionSession17OL_completeLookupESt10unique_ptrINS0_21InProgressLookupStateESt14default_deleteIS3_EESt10shared_ptrINS0_23AsynchronousSymbolQueryEESt8functionIFvRKNS_8DenseMapIPNS0_8JITDylibENS_8DenseSetINS0_15SymbolStringPtrENS_12DenseMapInfoISF_vEEEENSG_ISD_vEENS_6detail12DenseMapPairISD_SI_EEEEEE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm3orc25InProgressFullLookupState8completeESt10unique_ptrINS0_21InProgressLookupStateESt14default_deleteIS3_EE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm3orc16ExecutionSession19OL_applyQueryPhase1ESt10unique_ptrINS0_21InProgressLookupStateESt14default_deleteIS3_EENS_5ErrorE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm3orc16ExecutionSession6lookupENS0_10LookupKindERKSt6vectorISt4pairIPNS0_8JITDylibENS0_19JITDylibLookupFlagsEESaIS8_EENS0_15SymbolLookupSetENS0_11SymbolStateENS_15unique_functionIFvNS_8ExpectedINS_8DenseMapINS0_15SymbolStringPtrENS0_17ExecutorSymbolDefENS_12DenseMapInfoISI_vEENS_6detail12DenseMapPairISI_SJ_EEEEEEEEESt8functionIFvRKNSH_IS6_NS_8DenseSetISI_SL_EENSK_IS6_vEENSN_IS6_SV_EEEEEE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) publishCIs at /source/src/jitlayers.cpp:2059:14 jl_compile_codeinst_impl at /source/src/jitlayers.cpp:511:39 jl_compile_method_very_internal at /source/src/gf.c:3927:27 _jl_invoke at /source/src/gf.c:4337:16 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 core_lowering_hook at /source/usr/share/julia/JuliaLowering/src/hooks.jl:30:0 (pc: 111) unknown function (ip: 0x79facd2fdd35) at (unknown file) _jl_invoke at /source/src/gf.c:4345:23 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 jl_apply at /source/src/julia.h:2405:12 [inlined] ijl_lower at /source/src/ast.c:1271:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:594:31 jl_eval_module_expr at /source/src/toplevel.c:262:5 [inlined] jl_toplevel_eval_flex at /source/src/toplevel.c:661:27 jl_eval_toplevel_stmts at /source/src/toplevel.c:598:15 jl_toplevel_eval_flex at /source/src/toplevel.c:680:27 ijl_toplevel_eval at /source/src/toplevel.c:778:12 ijl_toplevel_eval_in at /source/src/toplevel.c:823:13 eval at ./boot.jl:522:0 (pc: 1) include_string at ./loading.jl:3132:0 (pc: 208) _jl_invoke at /source/src/gf.c:4345:23 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 _include at ./loading.jl:3192:0 (pc: 122) include at ./Base.jl:325:0 (pc: 1) include_package_for_output at ./loading.jl:3303:0 (pc: 848) jfptr_include_package_for_output_1.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4345:23 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 jl_apply at /source/src/julia.h:2405:12 [inlined] do_call at /source/src/interpreter.c:123:26 eval_value at /source/src/interpreter.c:259:16 eval_stmt_value at /source/src/interpreter.c:194:23 [inlined] eval_body at /source/src/interpreter.c:757:13 jl_interpret_toplevel_thunk at /source/src/interpreter.c:947:21 ijl_eval_thunk at /source/src/toplevel.c:764:18 jl_toplevel_eval_flex at /source/src/toplevel.c:708:26 jl_eval_toplevel_stmts at /source/src/toplevel.c:598:15 jl_toplevel_eval_flex at /source/src/toplevel.c:680:27 ijl_toplevel_eval at /source/src/toplevel.c:778:12 ijl_toplevel_eval_in at /source/src/toplevel.c:823:13 eval at ./boot.jl:522:0 (pc: 1) include_string at ./loading.jl:3132:0 (pc: 208) include_string at ./loading.jl:3142:0 [inlined] exec_options at ./client.jl:353:0 (pc: 813) _start at ./client.jl:596:0 (pc: 295) jfptr__start_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4345:23 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 jl_apply at /source/src/julia.h:2405:12 [inlined] true_main at /source/src/jlapi.c:985:29 jl_repl_entrypoint at /source/src/jlapi.c:1152:15 main at /source/cli/loader_exe.c:58:15 unknown function (ip: 0x79faea16c249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file)   ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ==============================================================  ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 312 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404:0 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430:0 ijl_task_get_next at /source/src/scheduler.c:524:34 wait at ./task.jl:1248:0 (pc: 107) wait_forever at ./task.jl:1170:0 (pc: 4) jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4345:23 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 jl_apply at /source/src/julia.h:2405:12 [inlined] start_task at /source/src/task.c:1276:19 unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.14/Profile/src/Profile.jl:1361 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x000077183f4bdf00 Total snapshots: 305. Utilization: 0% ╎305 @Base/task.jl:1170 wait_forever() 304╎ 305 @Base/task.jl:1248 wait() │ exception = │ This interactive function requires a stdlib to be loaded, and package code should instead use it directly from that stdlib. │ Stacktrace: │ [1] error(s::String) │ @ Base error.jl:56 │ [2] require_stdlib(package_uuidkey::Base.PkgId, ext::Nothing, from::Module) │ @ Base loading.jl:3024 │ [3] require_stdlib(package_uuidkey::Base.PkgId) │ @ Base loading.jl:3020 [inlined] │ [4] macro expansion │ @ some.jl:157 [inlined] │ [5] profile_printing_listener(cond::Base.AsyncCondition) │ @ Base Base.jl:357 │ [6] (::Base.var"#start_profile_listener##0#start_profile_listener##1"{Base.AsyncCondition})() │ @ Base Base.jl:376 └ @ Base Base.jl:367 33902769099 deps_ns=171987397 compilation_ns=33669500545 methods=218 36.4 s ✓ Expat_jll ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404:0 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430:0 ijl_task_get_next at /source/src/scheduler.c:524:34 wait at ./task.jl:1248:0 (pc: 107) wait_forever at ./task.jl:1170:0 (pc: 4) jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4345:23 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 jl_apply at /source/src/julia.h:2405:12 [inlined] start_task at /source/src/task.c:1276:19 unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.14/Profile/src/Profile.jl:1361 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x000077831147c6a0 Total snapshots: 303. Utilization: 0% ╎303 @Base/task.jl:1170 wait_forever() 302╎ 303 @Base/task.jl:1248 wait() [312] signal 15: Terminated in expression starting at /PkgEval.jl/scripts/precompile.jl:34 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404:0 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430:0 ijl_task_get_next at /source/src/scheduler.c:524:34 wait at ./task.jl:1248:0 (pc: 107) wait_forever at ./task.jl:1170:0 (pc: 4) jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4345:23 [inlined] ijl_apply_generic at /source/src/gf.c:4583:12 jl_apply at /source/src/julia.h:2405:12 [inlined] start_task at /source/src/task.c:1276:19 unknown function (ip: (nil)) at (unknown file) Allocations: 14416601 (Pool: 14415783; Big: 818); GC: 16 val already in a list atexit hook threw an error: ErrorException("schedule: Task not runnable") error at ./error.jl:56:0 (pc: 6) #schedule#625 at ./task.jl:1053:0 (pc: 71) PkgEval terminated after 2734.98s: test duration exceeded the time limit