Package evaluation to test StableHashTraits on Julia 1.14.0-DEV.2593 (15c2b67521*) started at 2026-07-03T18:06:19.831 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 15.14s ################################################################################ # Installation # Installing StableHashTraits... Resolving package versions... Installed Tables ────────────────────── v1.13.0 Installed IteratorInterfaceExtensions ─ v1.0.0 Installed DataAPI ───────────────────── v1.16.0 Installed Compat ────────────────────── v4.18.1 Installed TableTraits ───────────────── v1.0.1 Installed DataValueInterfaces ───────── v1.0.0 Installed StructTypes ───────────────── v1.11.0 Installed TupleTools ────────────────── v1.6.0 Installed StableHashTraits ──────────── v2.0.3 Installed OrderedCollections ────────── v2.0.1 Updating `~/.julia/environments/v1.14/Project.toml` [c5dd0088] + StableHashTraits v2.0.3 Updating `~/.julia/environments/v1.14/Manifest.toml` [34da2185] + Compat v4.18.1 [9a962f9c] + DataAPI v1.16.0 [e2d170a0] + DataValueInterfaces v1.0.0 [82899510] + IteratorInterfaceExtensions v1.0.0 [bac558e1] + OrderedCollections v2.0.1 [c5dd0088] + StableHashTraits v2.0.3 [856f2bd8] + StructTypes v1.11.0 [3783bdb8] + TableTraits v1.0.1 [bd369af6] + Tables v1.13.0 [9d95972d] + TupleTools v1.6.0 [ade2ca70] + Dates v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.13.0 [fa267f1f] + TOML v1.0.3 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 Installation completed after 1.69s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling project... 8.5 s ✓ TestEnv 1 dependency successfully precompiled in 9 seconds. 27 already precompiled. ┌ Warning: Could not use exact versions of packages in manifest, re-resolving └ @ TestEnv ~/.julia/packages/TestEnv/RUPmD/src/julia-1.13/activate_set.jl:78 Precompiling package dependencies... Precompiling project... 313.6 s ✓ InlineStrings 0.6 s ✓ Reexport 1.0 s ✓ IndirectArrays 1.3 s ✓ MappedArrays 1.1 s ✓ DataAPI 0.9 s ✓ TensorCore 1.4 s ✓ Statistics 3.9 s ✓ ExproniconLite 1.6 s ✓ Tricks 2.0 s ✓ MD5 0.6 s ✓ DataValueInterfaces 0.8 s ✓ StatsAPI 36.7 s ✓ URIs 0.6 s ✓ Retry 0.9 s ✓ LazilyInitializedFields 148.4 s ✓ OrderedCollections 2.8 s ✓ PrecompileSignatures 56.8 s ✓ InvertedIndices 1.2 s ✓ HashArrayMappedTries 1.0 s ✓ DeepDiffs 37.3 s ✓ BitFlags 398.0 s ✓ IterTools 0.6 s ✓ IniFile 94.7 s ✓ OffsetArrays 1.0 s ✓ ExprTools 93.3 s ✓ LRUCache 2.4 s ✓ ExpressionExplorer 1.0 s ✓ SimpleBufferStream 55.7 s ✓ TranscodingStreams 3.8 s ✓ MIMEs 0.5 s ✓ IteratorInterfaceExtensions 1.6 s ✓ TupleTools 26.1 s ✓ LaTeXStrings 2.7 s ✓ Crayons 1.4 s ✓ ArrowTypes 1.8 s ✓ Requires 2.3 s ✓ MsgPack 2.4 s ✓ ConcurrentUtilities 181.0 s ✓ SentinelArrays 31.2 s ✓ Scratch 32.1 s ✓ StructTypes 31.9 s ✓ LoggingExtras 33.0 s ✓ StructUtils 2.3 s ✓ Compat 32.2 s ✓ Preferences 38.6 s ✓ ExceptionUnwrapping 0.7 s ✓ SymDict 56.4 s ✓ Missings 23.4 s ✓ PooledArrays 168.8 s ✓ FixedPointNumbers 2.3 s ✓ HypertextLiteral 3.0 s ✓ Distances 35.9 s ✓ RegistryInstances 160.1 s ✓ DataStructures 73.6 s ✓ Configurations 1.4 s ✓ ScopedValues 79.9 s ✓ OpenSSL 38.2 s ✓ StackViews 38.9 s ✓ PaddedViews 38.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(JY1QSWAtpiD,Base.Docs,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,)),@doc], │ [if] | [old,SL(JY1QSWAtpiD,Base.Docs,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,)),@doc], │ true :: Value | [old,SL(JY1QSWAtpiD,Base.Docs,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,)),@doc], │ [=] | [old,SL(JY1QSWAtpiD,Base.Docs,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,)),@doc], │ val :: Identifier | [old,SL(JY1QSWAtpiD,Base.Docs,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,)),@doc], │ [function] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [where] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [::] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ topological_order :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [parameters] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [kw] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [::] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ allow_multiple_defs :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ Bool :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ false :: Value | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [kw] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [::] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ skip_at_partial_multiple_defs :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ Bool :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ false :: Value | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [::] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ topology :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [curly] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ NotebookTopology :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [::] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ roots :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [curly] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ AbstractVector :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [curly] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ TopologicalOrder :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [<:] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ AbstractCell :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ skip_at_partial_multiple_defs :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ allow_multiple_defs :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ nothing :: Value | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ throw :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc],mod=Base │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ AssertionError :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc],mod=Base │ "allow_multiple_defs" :: Value | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ entries :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [ref] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ exits :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [ref] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ errable :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [curly] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ Dict :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ ReactivityError :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [function] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [::] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ bfs :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [::] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ ChildExplorationResult :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ in :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ exits :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [return] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ Ok :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [elseif] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ haskey :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ errable :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [return] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ Ok :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [elseif] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [&&] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ > :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ length :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ entries :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ 0 :: Value | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ === :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [ref] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ entries :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ end :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [return] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ Ok :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [elseif] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ in :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ entries :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ currently_in :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ setdiff :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ entries :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ exits :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cycle :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [ref] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ currently_in :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ : :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ findfirst :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ isequal :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ currently_in :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ end :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ ! :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cycle_is_among_functions :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ topology :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cycle :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [for] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cycle :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [ref] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ errable :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ CyclicReferenceError :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ topology :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cycle :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [return] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ Cycle :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cycle :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [return] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ Ok :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ current_entries_num :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ length :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ entries :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ current_exits_num :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ length :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ exits :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ push! :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ entries :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ assigners :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ where_assigned :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ topology :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ referencers :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ |> :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ where_referenced :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ topology :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [.] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ Iterators :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [inert] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ reverse :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [&&] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ ! :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ allow_multiple_defs :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ > :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ length :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ assigners :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ 1 :: Value | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [for] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ assigners :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [ref] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ errable :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ MultipleDefinitionsError :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ topology :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ assigners :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ should_continue_search_down :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [||] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ ! :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ skip_at_partial_multiple_defs :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ all :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [->] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [||] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ === :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ ∈ :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ exits :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ assigners :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ should_search_fellow_assigners_if_any :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ ! :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ allow_multiple_defs :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ to_search_next :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ should_continue_search_down :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ should_search_fellow_assigners_if_any :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ union :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ assigners :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ referencers :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ referencers :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [ref] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [for] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ to_search_next :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ !== :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ child_result :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ bfs :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [||] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ isa :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ child_result :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ Ok :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ ∉ :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [.] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ child_result :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [inert] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cycled_cells :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [continue] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ ! :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ is_soft_edge :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ topology :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ deleteat! :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ entries :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ : :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ + :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ current_entries_num :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ 1 :: Value | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ length :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ entries :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ deleteat! :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ exits :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ : :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ + :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ current_exits_num :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ 1 :: Value | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ length :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ exits :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [return] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ child_result :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [for] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cycled_cell :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [.] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ child_result :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [inert] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cycled_cells :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ delete! :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ errable :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cycled_cell :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ === :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [ref] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ entries :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ end :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ pop! :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ entries :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [continue] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ push! :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ exits :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cell :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ Ok :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ prelim_order_1 :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ sort :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ roots :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [kw] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ alg :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ MergeSort :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [kw] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ by :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [->] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ cell_precedence_heuristic :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ topology :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ c :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [for] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ i :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ : :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ length :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ prelim_order_1 :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ -1 :: Value | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ 1 :: Value | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [block] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ bfs :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [ref] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ prelim_order_1 :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ i :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [=] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ ordered :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ reverse :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ exits :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ TopologicalOrder :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ topology :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ setdiff :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ ordered :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ keys :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ errable :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ errable :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(JY1QSWAtpiD,Base.Docs,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,)),@doc], │ Base.Docs.doc! :: Value | [old,SL(JY1QSWAtpiD,Base.Docs,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,)),@doc], │ PlutoDependencyExplorer :: Value | [old,SL(JY1QSWAtpiD,Base.Docs,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,)),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ Base.Docs.Binding :: Value | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ PlutoDependencyExplorer :: Value | [old,SL(HDTp05Rwdbn,Base,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,)),(. Base (inert @__MODULE__))], │ [inert] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc],jl_source=L47 │ topological_order :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ Base.Docs.docstr :: Value | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ Core.svec :: Value | [old,SL(6Ipp0JoqDW6,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(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [call] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ Dict{Symbol, Any} :: Value | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ :path => "/home/pkgeval/.julia/packages/PlutoDependencyExplorer/BaZEm/src/topological_order.jl" :: Value | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ :linenumber => 8 :: Value | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ :module => PlutoDependencyExplorer :: Value | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [where] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [curly] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ Union :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [curly] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ Tuple :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [curly] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ NotebookTopology :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [curly] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ AbstractVector :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [curly] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ Tuple :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [<:] | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ C :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ AbstractCell :: Identifier | [old,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,),@doc], │ [if] | [old,SL(JY1QSWAtpiD,Base.Docs,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,)),@doc], │ true :: Value | [old,SL(JY1QSWAtpiD,Base.Docs,SL(6Ipp0JoqDW6,PlutoDependencyExplorer,)),@doc], │ val :: Identifier | [old,SL(JY1QSWAtpiD,Base.Docs,SL(6Ipp0JoqDW6,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.1 s ✓ CodecZlib 0.7 s ✓ TableTraits 36.5 s ✓ InlineStrings → ArrowTypesExt 13.6 s ✓ FileIO 30.1 s ✓ RelocatableFolders 0.9 s ✓ Compat → CompatLinearAlgebraExt 30.5 s ✓ JLLWrappers 31.4 s ✓ PrecompileTools  ====================================================================================== 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 571 running 1 of 1  signal (10): User defined signal 1 widenslotwrapper at ./../usr/share/julia/Compiler/src/typelattice.jl:226:0 [inlined] singleton_type at ./../usr/share/julia/Compiler/src/utilities.jl:213:0 (pc: 2) iscall_with_boundscheck at ./../usr/share/julia/Compiler/src/optimize.jl:729:0 [inlined] scan_inconsistency! at ./../usr/share/julia/Compiler/src/optimize.jl:864:0 (pc: 98) ScanStmt at ./../usr/share/julia/Compiler/src/optimize.jl:904:0 (pc: 42) scan! at ./../usr/share/julia/Compiler/src/ssair/irinterp.jl:287:0 (pc: 100) ipo_dataflow_analysis! at ./../usr/share/julia/Compiler/src/optimize.jl:1013:0 (pc: 126) optimize at ./../usr/share/julia/Compiler/src/optimize.jl:1037:0 [inlined] finish_nocycle at ./../usr/share/julia/Compiler/src/typeinfer.jl:272:0 (pc: 15) jfptr_finish_nocycle_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 typeinf at ./../usr/share/julia/Compiler/src/abstractinterpretation.jl:5001:0 (pc: 252) typeinf_ext at ./../usr/share/julia/Compiler/src/typeinfer.jl:1539:0 (pc: 150) add_codeinsts_to_jit! at ./../usr/share/julia/Compiler/src/typeinfer.jl:1710:0 (pc: 250) typeinf_ext_toplevel at ./../usr/share/julia/Compiler/src/typeinfer.jl:1745:0 [inlined] typeinf_ext_toplevel at ./../usr/share/julia/Compiler/src/typeinfer.jl:1753:0 (pc: 21) jfptr_typeinf_ext_toplevel_4.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] jl_type_infer at /source/src/gf.c:475:35 jl_compile_method_very_internal at /source/src/gf.c:3904:20 _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: 0x7993724fee65) 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: 0x79938f332249) 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 39 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 0x000075bf0e6e9f00 Total snapshots: 343. Utilization: 0% ╎343 @Base/task.jl:1170 wait_forever() 342╎ 343 @Base/task.jl:1248 wait() ====================================================================================== 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 0x00007401a367efe0 Total snapshots: 351. Utilization: 0% ╎351 @Base/task.jl:1170 wait_forever() 350╎ 351 @Base/task.jl:1248 wait() [39] 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: 18689482 (Pool: 18688618; Big: 864); GC: 24 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) schedule at ./task.jl:1045:0 [inlined] uv_writecb_task at ./stream.jl:1198:0 (pc: 11) jlcapi_uv_writecb_task_512.1 at /opt/julia/lib/julia/sys.so (unknown line) uv__write_callbacks at /workspace/srcdir/libuv/src/unix/stream.c:926:0 uv__stream_io at /workspace/srcdir/libuv/src/unix/stream.c:1227:0 uv__run_pending at /workspace/srcdir/libuv/src/unix/core.c:824:0 uv_run at /workspace/srcdir/libuv/src/unix/core.c:420:0 ijl_process_events at /source/src/jl_uv.c:397:21 process_events at ./libuv.jl:133:0 [inlined] wait at ./task.jl:1235:0 (pc: 15) PkgEval terminated after 2730.56s: test duration exceeded the time limit