Package evaluation to test COCOA on Julia 1.14.0-DEV.2593 (15c2b67521*) started at 2026-07-04T15:27:47.126 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 14.98s ################################################################################ # Installation # Installing COCOA... Resolving package versions... Installed ForwardDiff ───────────────── v1.4.1 Installed DataStructures ────────────── v0.19.5 Installed HiGHS ─────────────────────── v1.24.0 Installed DiffResults ───────────────── v1.1.0 Installed MacroTools ────────────────── v0.5.16 Installed OnlineStatsBase ───────────── v1.7.3 Installed AbstractTrees ─────────────── v0.4.5 Installed SBML ──────────────────────── v1.6.0 Installed JLD2 ──────────────────────── v0.5.15 Installed Bzip2_jll ─────────────────── v1.0.9+0 Installed StatsBase ─────────────────── v0.34.12 Installed InlineStrings ─────────────── v1.4.5 Installed OrderedCollections ────────── v1.8.2 Installed AliasTables ───────────────── v1.1.3 Installed CodecZlib ─────────────────── v0.7.8 Installed ConstructionBase ──────────── v1.6.0 Installed ArnoldiMethod ─────────────── v0.4.0 Installed TranscodingStreams ────────── v0.11.3 Installed Compat ────────────────────── v4.18.1 Installed HashArrayMappedTries ──────── v0.2.0 Installed IteratorInterfaceExtensions ─ v1.0.0 Installed Combinatorics ─────────────── v1.1.0 Installed DataAPI ───────────────────── v1.16.0 Installed Statistics ────────────────── v1.11.1 Installed PrecompileTools ───────────── v1.3.4 Installed InvertedIndices ───────────── v1.3.1 Installed DataValueInterfaces ───────── v1.0.0 Installed StatsAPI ──────────────────── v1.8.0 Installed ConstraintTrees ───────────── v1.11.1 Installed SBMLFBCModels ─────────────── v1.1.1 Installed CommonSubexpressions ──────── v0.3.1 Installed SentinelArrays ────────────── v1.4.10 Installed FileIO ────────────────────── v1.19.0 Installed StructUtils ───────────────── v2.8.2 Installed StaticArraysCore ──────────── v1.4.4 Installed IrrationalConstants ───────── v0.2.6 Installed StaticArrays ──────────────── v1.9.18 Installed CodecBzip2 ────────────────── v0.8.5 Installed COCOA ─────────────────────── v1.0.0 Installed AbstractFBCModels ─────────── v1.3.0 Installed StringManipulation ────────── v0.4.4 Installed NaNMath ───────────────────── v1.1.4 Installed JuMP ──────────────────────── v1.30.1 Installed SimpleTraits ──────────────── v0.9.6 Installed LogExpFunctions ───────────── v1.0.1 Installed DiffRules ─────────────────── v1.16.0 Installed Parsers ───────────────────── v2.8.6 Installed OpenSpecFun_jll ───────────── v0.5.6+0 Installed JSON ──────────────────────── v1.6.1 Installed Requires ──────────────────── v1.3.1 Installed SBML_jll ──────────────────── v5.21.0+0 Installed StableRNGs ────────────────── v1.0.4 Installed OpenBLAS32_jll ────────────── v0.3.33+1 Installed PrettyTables ──────────────── v3.3.2 Installed Tables ────────────────────── v1.13.0 Installed ScopedValues ──────────────── v1.6.2 Installed IfElse ────────────────────── v0.1.1 Installed COBREXA ───────────────────── v2.9.1 Installed Unitful ───────────────────── v1.28.0 Installed PtrArrays ─────────────────── v1.4.0 Installed XML2_jll ──────────────────── v2.13.9+0 Installed SpecialFunctions ──────────── v2.8.0 Installed DataFrames ────────────────── v1.8.2 Installed MathOptIIS ────────────────── v0.2.0 Installed Reexport ──────────────────── v1.2.2 Installed MutableArithmetics ────────── v1.8.0 Installed Missings ──────────────────── v1.2.0 Installed PooledArrays ──────────────── v1.4.3 Installed TableTraits ───────────────── v1.0.1 Installed JLLWrappers ───────────────── v1.8.0 Installed Preferences ───────────────── v1.5.2 Installed SortingAlgorithms ─────────── v1.2.3 Installed Libiconv_jll ──────────────── v1.18.0+0 Installed Inflate ───────────────────── v0.1.5 Installed LaTeXStrings ──────────────── v1.4.0 Installed Crayons ───────────────────── v4.1.1 Installed DocStringExtensions ───────── v0.9.5 Installed HiGHS_jll ─────────────────── v1.15.0+0 Installed MathOptInterface ──────────── v1.51.1 Installed Graphs ────────────────────── v1.14.0 Installing 7 artifacts Installed artifact OpenSpecFun 105.4 KiB Installed artifact Bzip2 152.8 KiB Installed artifact HiGHS 2.3 MiB Installed artifact Libiconv 1022.9 KiB Installed artifact XML2 2.0 MiB Installed artifact OpenBLAS32 5.0 MiB Installed artifact SBML 4.2 MiB Updating `~/.julia/environments/v1.14/Project.toml` [9ecc82ce] + COCOA v1.0.0 Updating `~/.julia/environments/v1.14/Manifest.toml` [5a4f3dfa] + AbstractFBCModels v1.3.0 [1520ce14] + AbstractTrees v0.4.5 [66dad0bd] + AliasTables v1.1.3 [ec485272] + ArnoldiMethod v0.4.0 [babc4406] + COBREXA v2.9.1 [9ecc82ce] + COCOA v1.0.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [861a8166] + Combinatorics v1.1.0 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [5515826b] + ConstraintTrees v1.11.1 [187b0558] + ConstructionBase v1.6.0 [a8cc5b0e] + Crayons v4.1.1 [9a962f9c] + DataAPI v1.16.0 [a93c6f00] + DataFrames v1.8.2 [864edb3b] + DataStructures v0.19.5 [e2d170a0] + DataValueInterfaces v1.0.0 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.16.0 [ffbed154] + DocStringExtensions v0.9.5 [5789e2e9] + FileIO v1.19.0 [f6369f11] + ForwardDiff v1.4.1 [86223c79] + Graphs v1.14.0 [076d061b] + HashArrayMappedTries v0.2.0 [87dc4568] + HiGHS v1.24.0 [615f187c] + IfElse v0.1.1 [d25df0c9] + Inflate v0.1.5 [842dd82b] + InlineStrings v1.4.5 [41ab1584] + InvertedIndices v1.3.1 [92d709cd] + IrrationalConstants v0.2.6 [82899510] + IteratorInterfaceExtensions v1.0.0 ⌅ [033835bb] + JLD2 v0.5.15 [692b3bcd] + JLLWrappers v1.8.0 [682c06a0] + JSON v1.6.1 [4076af6c] + JuMP v1.30.1 [b964fa9f] + LaTeXStrings v1.4.0 [2ab3a3ac] + LogExpFunctions v1.0.1 [1914dd2f] + MacroTools v0.5.16 [8c4f8055] + MathOptIIS v0.2.0 [b8f27783] + MathOptInterface v1.51.1 [e1d29d7a] + Missings v1.2.0 [d8a4904e] + MutableArithmetics v1.8.0 [77ba4419] + NaNMath v1.1.4 [925886fa] + OnlineStatsBase v1.7.3 ⌅ [bac558e1] + OrderedCollections v1.8.2 [69de0a69] + Parsers v2.8.6 [2dfb63ee] + PooledArrays v1.4.3 [aea7be01] + PrecompileTools v1.3.4 [21216c6a] + Preferences v1.5.2 [08abe8d2] + PrettyTables v3.3.2 [43287f4e] + PtrArrays v1.4.0 [189a3867] + Reexport v1.2.2 [ae029012] + Requires v1.3.1 [e5567a89] + SBML v1.6.0 [3e8f9d1a] + SBMLFBCModels v1.1.1 [7e506255] + ScopedValues v1.6.2 [91c51154] + SentinelArrays v1.4.10 [699a6c99] + SimpleTraits v0.9.6 [a2af1166] + SortingAlgorithms v1.2.3 [276daf66] + SpecialFunctions v2.8.0 [860ef19b] + StableRNGs v1.0.4 [90137ffa] + StaticArrays v1.9.18 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.8.0 [2913bbd2] + StatsBase v0.34.12 [892a3eda] + StringManipulation v0.4.4 [ec057cc2] + StructUtils v2.8.2 [3783bdb8] + TableTraits v1.0.1 [bd369af6] + Tables v1.13.0 [3bb67fe8] + TranscodingStreams v0.11.3 [1986cc42] + Unitful v1.28.0 [6e34b625] + Bzip2_jll v1.0.9+0 [8fd58aa0] + HiGHS_jll v1.15.0+0 [94ce4f54] + Libiconv_jll v1.18.0+0 [656ef2d0] + OpenBLAS32_jll v0.3.33+1 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [bb12108a] + SBML_jll v5.21.0+0 ⌅ [02c8fc9c] + XML2_jll v2.13.9+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 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [b27032c2] + LibCURL v1.0.0 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.14.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [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 [2f01184e] + SparseArrays v1.13.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 [4536629a] + OpenBLAS_jll v0.3.33+0 [05823500] + OpenLibm_jll v0.8.7+0 [458c3c95] + OpenSSL_jll v3.5.7+0 [efcefdf7] + PCRE2_jll v10.47.0+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.2+0 [3161d3a3] + Zstd_jll v1.5.7+1 [8e850b90] + libblastrampoline_jll v5.15.0+0 [8e850ede] + nghttp2_jll v1.69.0+0 [3f19e933] + p7zip_jll v17.8.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 12.12s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling project... 8.9 s ✓ TestEnv 1 dependency successfully precompiled in 9 seconds. 27 already precompiled. Precompiling package dependencies... Precompiling project... 2.7 s ✓ Crayons 4.2 s ✓ MacroTools 317.4 s ✓ InlineStrings 0.6 s ✓ Reexport 1.3 s ✓ Statistics 1.1 s ✓ DataAPI 1.7 s ✓ ConstructionBase 2.6 s ✓ IrrationalConstants 0.7 s ✓ DataValueInterfaces 1.2 s ✓ StaticArraysCore 0.8 s ✓ StatsAPI 151.6 s ✓ OrderedCollections 57.2 s ✓ InvertedIndices 1.9 s ✓ StableRNGs 1.1 s ✓ HashArrayMappedTries 1.5 s ✓ DocStringExtensions 74.7 s ✓ AbstractTrees 2.6 s ✓ Combinatorics 1.6 s ✓ Inflate 0.5 s ✓ IfElse 37.9 s ✓ PtrArrays 56.8 s ✓ TranscodingStreams 0.5 s ✓ IteratorInterfaceExtensions 26.4 s ✓ LaTeXStrings 1.7 s ✓ Requires 1.8 s ✓ NaNMath 181.3 s ✓ SentinelArrays 32.6 s ✓ StructUtils 464.2 s ✓ Unitful 2.0 s ✓ Compat 31.7 s ✓ Preferences 127.8 s ✓ MutableArithmetics 1.9 s ✓ CommonSubexpressions 3.5 s ✓ SimpleTraits 41.9 s ✓ Statistics → SparseArraysExt 56.8 s ✓ Missings 23.0 s ✓ PooledArrays 0.6 s ✓ ConstructionBase → ConstructionBaseLinearAlgebraExt 1.0 s ✓ DiffResults 171.7 s ✓ DataStructures 1.3 s ✓ ScopedValues 82.1 s ✓ AbstractFBCModels 1.7 s ✓ LogExpFunctions ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:66 =# Core.@doc "$(TYPEDSIGNATURES)\n\nTake a [`Grammar`](@ref) and an indexable input sequence (typically `Vector` or\n`String`), and return a final [`ParserState`](@ref) that contains all matched\ngrammar productions.\n\nThe `input` must be random-indexable (because PikaParsers require a lot of\nrandom indexing) using Int indexes, must support `firstindex`, `lastindex`,\n`prevind`, `nextind`, index arithmetics with `+` and `-`, and indexes in\n`view`s must be the same as in original container except for a constant offset.\n\n# Lexing and fast terminal matching\n\nIf `fast_match` is specified, the function does not match terminals using the\nassociated grammar rules, but with a `fast_match` function that reports the\nmatched terminals via a callback. The function is called exactly once for each\nposition in `input` in reverse order (i.e., the indexes will start at\n`lastindex(input)` and continue using `prevind` all the way to\n`firstindex(input)`), which can be utilized by the application for\noptimization. The call parameters consist of the input vector, position in\nthe input vector, and a \"report\" function used to send back a clause ID (of\nsame type as `G` in `typeof(grammar)`) and the last item of the terminal match\nthat can starts at that position. Calls to the reporting function can be\nrepeated if more terminal types match. Terminals not reported by the calls to\n`fast_match` will not be matched.\n\nFor complicated grammars, this may be much faster than having the parser to try\nmatching all terminal types at each position.\n\nIf your grammar does not contain dangerous or highly surprising kinds of\nterminals (in particular, it can be scanned greedily left-to-right), you may\nuse [`parse_lex`](@ref) to run a reasonable terminal-only lexing step, which is\nthen automatically used as a basis for fast matching.\n\n# Caveats\n\nTake care when indexing `String`s. With UTF-8, not all codepoints may\nnecessarily have length 1.\n\nIf unsure, you may always `collect` the strings to vectors of `Char`s\n(basically converting to UTF-32), where each character occupies precisely one\nindex.\n\n# Results\n\nUse [`find_match_at!`](@ref) to extract matches from [`ParserState`](@ref).\n\nPika parsing never really fails. Instead, in case when the grammar rule is not\nmatched in the input, the expected rule match match is either not going to be\nfound at the starting position with [`find_match_at!`](@ref), or it will not\nspan the whole input.\n\n# Example\n\n parse(\n g,\n \"abcde123\",\n (input, i, match) -> isdigit(input[i]) ? match(:digit, i) : match(:letter, i),\n )\n\n" function (parse(grammar::Grammar{G, T}, input::I, fast_match = nothing)::ParserState{G, T, I}) where {G, T, I} │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:128 =# │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:133 =# │ st = ParserState{G, T, I}(grammar, PikaQueue(length(grammar.clauses)), Match[], 0, Int[], input) │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:144 =# │ terminal_q = PikaQueue(length(grammar.clauses)) │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:145 =# │ reset!(terminal_q, grammar.terminals) │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:147 =# │ i = lastindex(input) │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:148 =# │ while i >= firstindex(input) │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:149 =# │ if isnothing(fast_match) │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:150 =# │ reset!(st.q, terminal_q) │ else │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:152 =# │ fast_match(input, i, ((rid::G, last::Int)->begin │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:155 =# │ let cl = grammar.idx[rid] │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:156 =# │ new_match!(Match(cl, i, last, 0, submatch_empty(st)), st) │ end │ end)) │ end │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:160 =# │ while !(isempty(st.q)) │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:161 =# │ clause = pop!(st.q) │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:177 =# │ cls = grammar.clauses[clause] │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:178 =# │ if cls isa Token{Int, T} │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:179 =# │ match_clause!(cls, clause, i, st) │ elseif #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:180 =# cls isa Tokens{Int, T, I} │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:181 =# │ match_clause!(cls, clause, i, st) │ elseif #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:182 =# cls isa Satisfy{Int, T} │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:183 =# │ match_clause!(cls, clause, i, st) │ elseif #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:184 =# cls isa Scan{Int, T} │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:185 =# │ match_clause!(cls, clause, i, st) │ elseif #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:186 =# cls isa Seq{Int, T} │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:187 =# │ match_clause!(cls, clause, i, st) │ elseif #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:188 =# cls isa First{Int, T} │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:189 =# │ match_clause!(cls, clause, i, st) │ elseif #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:190 =# cls isa FollowedBy{Int, T} │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:191 =# │ match_clause!(cls, clause, i, st) │ elseif #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:192 =# cls isa Many{Int, T} │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:193 =# │ match_clause!(cls, clause, i, st) │ elseif #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:194 =# cls isa Some{Int, T} │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:195 =# │ match_clause!(cls, clause, i, st) │ elseif #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:196 =# cls isa Tie{Int, T} │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:197 =# │ match_clause!(cls, clause, i, st) │ else │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:202 =# │ match_clause!(cls, clause, i, st) │ end │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:205 =# │ end │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:206 =# │ i = prevind(input, i) │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:207 =# │ end │ #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:209 =# │ st │ 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/PikaParser/SOJr9/src/parse.jl:66 =#) :: Value | │ [string] | │ TYPEDSIGNATURES :: Identifier | │ "\n\nTake a [`Grammar`](@ref) and an indexable input sequence (typically `Vector` or\n`String`), and return a final [`ParserState`](@ref) that contains all matched\ngrammar productions.\n\nThe `input` must be random-indexable (because PikaParsers require a lot of\nrandom indexing) using Int indexes, must support `firstindex`, `lastindex`,\n`prevind`, `nextind`, index arithmetics with `+` and `-`, and indexes in\n`view`s must be the same as in original container except for a constant offset.\n\n# Lexing and fast terminal matching\n\nIf `fast_match` is specified, the function does not match terminals using the\nassociated grammar rules, but with a `fast_match` function that reports the\nmatched terminals via a callback. The function is called exactly once for each\nposition in `input` in reverse order (i.e., the indexes will start at\n`lastindex(input)` and continue using `prevind` all the way to\n`firstindex(input)`), which can be utilized by the application for\noptimization. The call parameters consist of the input vector, position in\nthe input vector, and a \"report\" function used to send back a clause ID (of\nsame type as `G` in `typeof(grammar)`) and the last item of the terminal match\nthat can starts at that position. Calls to the reporting function can be\nrepeated if more terminal types match. Terminals not reported by the calls to\n`fast_match` will not be matched.\n\nFor complicated grammars, this may be much faster than having the parser to try\nmatching all terminal types at each position.\n\nIf your grammar does not contain dangerous or highly surprising kinds of\nterminals (in particular, it can be scanned greedily left-to-right), you may\nuse [`parse_lex`](@ref) to run a reasonable terminal-only lexing step, which is\nthen automatically used as a basis for fast matching.\n\n# Caveats\n\nTake care when indexing `String`s. With UTF-8, not all codepoints may\nnecessarily have length 1.\n\nIf unsure, you may always `collect` the strings to vectors of `Char`s\n(basically converting to UTF-32), where each character occupies precisely one\nindex.\n\n# Results\n\nUse [`find_match_at!`](@ref) to extract matches from [`ParserState`](@ref).\n\nPika parsing never really fails. Instead, in case when the grammar rule is not\nmatched in the input, the expected rule match match is either not going to be\nfound at the starting position with [`find_match_at!`](@ref), or it will not\nspan the whole input.\n\n# Example\n\n parse(\n g,\n \"abcde123\",\n (input, i, match) -> isdigit(input[i]) ? match(:digit, i) : match(:letter, i),\n )\n\n" :: Value | │ [function] | │ [where] | │ [::] | │ [call] | │ parse :: Identifier | │ [::] | │ grammar :: Identifier | │ [curly] | │ Grammar :: Identifier | │ G :: Identifier | │ T :: Identifier | │ [::] | │ input :: Identifier | │ I :: Identifier | │ [kw] | │ fast_match :: Identifier | │ nothing :: Identifier | │ [curly] | │ ParserState :: Identifier | │ G :: Identifier | │ T :: Identifier | │ I :: Identifier | │ G :: Identifier | │ T :: Identifier | │ I :: Identifier | │ [block] | │ [=] | │ st :: Identifier | │ [call] | │ [curly] | │ ParserState :: Identifier | │ G :: Identifier | │ T :: Identifier | │ I :: Identifier | │ grammar :: Identifier | │ [call] | │ PikaQueue :: Identifier | │ [call] | │ length :: Identifier | │ [.] | │ grammar :: Identifier | │ [inert] | │ clauses :: Identifier | │ [ref] | │ Match :: Identifier | │ 0 :: Value | │ [ref] | │ Int :: Identifier | │ input :: Identifier | │ [=] | │ terminal_q :: Identifier | │ [call] | │ PikaQueue :: Identifier | │ [call] | │ length :: Identifier | │ [.] | │ grammar :: Identifier | │ [inert] | │ clauses :: Identifier | │ [call] | │ reset! :: Identifier | │ terminal_q :: Identifier | │ [.] | │ grammar :: Identifier | │ [inert] | │ terminals :: Identifier | │ [=] | │ i :: Identifier | │ [call] | │ lastindex :: Identifier | │ input :: Identifier | │ [while] | │ [call] | │ >= :: Identifier | │ i :: Identifier | │ [call] | │ firstindex :: Identifier | │ input :: Identifier | │ [block] | │ [if] | │ [call] | │ isnothing :: Identifier | │ fast_match :: Identifier | │ [block] | │ [call] | │ reset! :: Identifier | │ [.] | │ st :: Identifier | │ [inert] | │ q :: Identifier | │ terminal_q :: Identifier | │ [block] | │ [call] | │ fast_match :: Identifier | │ input :: Identifier | │ i :: Identifier | │ [->] | │ [tuple] | │ [::] | │ rid :: Identifier | │ G :: Identifier | │ [::] | │ last :: Identifier | │ Int :: Identifier | │ [block] | │ [let] | │ [=] | │ cl :: Identifier | │ [ref] | │ [.] | │ grammar :: Identifier | │ [inert] | │ idx :: Identifier | │ rid :: Identifier | │ [block] | │ [call] | │ new_match! :: Identifier | │ [call] | │ Match :: Identifier | │ cl :: Identifier | │ i :: Identifier | │ last :: Identifier | │ 0 :: Value | │ [call] | │ submatch_empty :: Identifier | │ st :: Identifier | │ st :: Identifier | │ [while] | │ [call] | │ ! :: Identifier | │ [call] | │ isempty :: Identifier | │ [.] | │ st :: Identifier | │ [inert] | │ q :: Identifier | │ [block] | │ [=] | │ clause :: Identifier | │ [call] | │ pop! :: Identifier | │ [.] | │ st :: Identifier | │ [inert] | │ q :: Identifier | │ [=] | │ cls :: Identifier | │ [ref] | │ [.] | │ grammar :: Identifier | │ [inert] | │ clauses :: Identifier | │ clause :: Identifier | │ [if] | │ [call] | │ isa :: Identifier | │ cls :: Identifier | │ [curly] | │ Token :: Identifier | │ Int :: Identifier | │ T :: Identifier | │ [block] | │ [call] | │ match_clause! :: Identifier | │ cls :: Identifier | │ clause :: Identifier | │ i :: Identifier | │ st :: Identifier | │ [elseif] | │ [block] | │ [call] | │ isa :: Identifier | │ cls :: Identifier | │ [curly] | │ Tokens :: Identifier | │ Int :: Identifier | │ T :: Identifier | │ I :: Identifier | │ [block] | │ [call] | │ match_clause! :: Identifier | │ cls :: Identifier | │ clause :: Identifier | │ i :: Identifier | │ st :: Identifier | │ [elseif] | │ [block] | │ [call] | │ isa :: Identifier | │ cls :: Identifier | │ [curly] | │ Satisfy :: Identifier | │ Int :: Identifier | │ T :: Identifier | │ [block] | │ [call] | │ match_clause! :: Identifier | │ cls :: Identifier | │ clause :: Identifier | │ i :: Identifier | │ st :: Identifier | │ [elseif] | │ [block] | │ [call] | │ isa :: Identifier | │ cls :: Identifier | │ [curly] | │ Scan :: Identifier | │ Int :: Identifier | │ T :: Identifier | │ [block] | │ [call] | │ match_clause! :: Identifier | │ cls :: Identifier | │ clause :: Identifier | │ i :: Identifier | │ st :: Identifier | │ [elseif] | │ [block] | │ [call] | │ isa :: Identifier | │ cls :: Identifier | │ [curly] | │ Seq :: Identifier | │ Int :: Identifier | │ T :: Identifier | │ [block] | │ [call] | │ match_clause! :: Identifier | │ cls :: Identifier | │ clause :: Identifier | │ i :: Identifier | │ st :: Identifier | │ [elseif] | │ [block] | │ [call] | │ isa :: Identifier | │ cls :: Identifier | │ [curly] | │ First :: Identifier | │ Int :: Identifier | │ T :: Identifier | │ [block] | │ [call] | │ match_clause! :: Identifier | │ cls :: Identifier | │ clause :: Identifier | │ i :: Identifier | │ st :: Identifier | │ [elseif] | │ [block] | │ [call] | │ isa :: Identifier | │ cls :: Identifier | │ [curly] | │ FollowedBy :: Identifier | │ Int :: Identifier | │ T :: Identifier | │ [block] | │ [call] | │ match_clause! :: Identifier | │ cls :: Identifier | │ clause :: Identifier | │ i :: Identifier | │ st :: Identifier | │ [elseif] | │ [block] | │ [call] | │ isa :: Identifier | │ cls :: Identifier | │ [curly] | │ Many :: Identifier | │ Int :: Identifier | │ T :: Identifier | │ [block] | │ [call] | │ match_clause! :: Identifier | │ cls :: Identifier | │ clause :: Identifier | │ i :: Identifier | │ st :: Identifier | │ [elseif] | │ [block] | │ [call] | │ isa :: Identifier | │ cls :: Identifier | │ [curly] | │ Some :: Identifier | │ Int :: Identifier | │ T :: Identifier | │ [block] | │ [call] | │ match_clause! :: Identifier | │ cls :: Identifier | │ clause :: Identifier | │ i :: Identifier | │ st :: Identifier | │ [elseif] | │ [block] | │ [call] | │ isa :: Identifier | │ cls :: Identifier | │ [curly] | │ Tie :: Identifier | │ Int :: Identifier | │ T :: Identifier | │ [block] | │ [call] | │ match_clause! :: Identifier | │ cls :: Identifier | │ clause :: Identifier | │ i :: Identifier | │ st :: Identifier | │ [block] | │ [call] | │ match_clause! :: Identifier | │ cls :: Identifier | │ clause :: Identifier | │ i :: Identifier | │ st :: Identifier | │ [=] | │ i :: Identifier | │ [call] | │ prevind :: Identifier | │ input :: Identifier | │ i :: Identifier | │ st :: 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(5PjqK3uRff5,DocStringExtensions,SL(Fynm7gcfeY8,PikaParser,)),@doc], │ [if] | [old,SL(5PjqK3uRff5,DocStringExtensions,SL(Fynm7gcfeY8,PikaParser,)),@doc], │ true :: Value | [old,SL(5PjqK3uRff5,DocStringExtensions,SL(Fynm7gcfeY8,PikaParser,)),@doc], │ [=] | [old,SL(5PjqK3uRff5,DocStringExtensions,SL(Fynm7gcfeY8,PikaParser,)),@doc], │ val :: Identifier | [old,SL(5PjqK3uRff5,DocStringExtensions,SL(Fynm7gcfeY8,PikaParser,)),@doc], │ [function] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [where] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [::] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ parse :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [::] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ grammar :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Grammar :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ G :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [::] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ input :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ I :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [kw] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ fast_match :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ nothing :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ ParserState :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ G :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ I :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ G :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ I :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [=] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ ParserState :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ G :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ I :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ grammar :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ PikaQueue :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ length :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [.] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ grammar :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [inert] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clauses :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [ref] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Match :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ 0 :: Value | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [ref] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ input :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [=] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ terminal_q :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ PikaQueue :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ length :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [.] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ grammar :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [inert] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clauses :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ reset! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ terminal_q :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [.] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ grammar :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [inert] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ terminals :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [=] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ lastindex :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ input :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [while] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ >= :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ firstindex :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ input :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [if] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isnothing :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ fast_match :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ reset! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [.] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [inert] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ q :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ terminal_q :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ fast_match :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ input :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [->] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [tuple] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [::] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ rid :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ G :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [::] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ last :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [let] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [=] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cl :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [ref] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [.] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ grammar :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [inert] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ idx :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ rid :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ new_match! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Match :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cl :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ last :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ 0 :: Value | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ submatch_empty :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [while] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ ! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isempty :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [.] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [inert] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ q :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [=] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ pop! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [.] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [inert] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ q :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [=] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [ref] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [.] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ grammar :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [inert] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clauses :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [if] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isa :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Token :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ match_clause! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [elseif] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isa :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Tokens :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ I :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ match_clause! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [elseif] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isa :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Satisfy :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ match_clause! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [elseif] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isa :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Scan :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ match_clause! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [elseif] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isa :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Seq :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ match_clause! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [elseif] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isa :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ First :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ match_clause! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [elseif] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isa :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ FollowedBy :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ match_clause! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [elseif] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isa :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Many :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ match_clause! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [elseif] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isa :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Some :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ match_clause! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [elseif] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isa :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Tie :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ match_clause! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ match_clause! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [=] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ prevind :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ input :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(5PjqK3uRff5,DocStringExtensions,SL(Fynm7gcfeY8,PikaParser,)),@doc], │ Base.Docs.doc! :: Value | [old,SL(5PjqK3uRff5,DocStringExtensions,SL(Fynm7gcfeY8,PikaParser,)),@doc], │ PikaParser :: Value | [old,SL(5PjqK3uRff5,DocStringExtensions,SL(Fynm7gcfeY8,PikaParser,)),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Base.Docs.Binding :: Value | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ PikaParser :: Value | [old,SL(4ywNDH40AFz,Base,SL(Fynm7gcfeY8,PikaParser,)),(. Base (inert @__MODULE__))], │ [inert] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc],jl_source=L47 │ parse :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Base.Docs.docstr :: Value | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Core.svec :: Value | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ DocStringExtensions.interpolation :: Value | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ TYPEDSIGNATURES :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [inert] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [function] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [where] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [::] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ parse :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [::] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ grammar :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Grammar :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ G :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [::] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ input :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ I :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [kw] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ fast_match :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ nothing :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ ParserState :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ G :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ I :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ G :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ I :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [=] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ ParserState :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ G :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ I :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ grammar :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ PikaQueue :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ length :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [.] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ grammar :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [inert] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clauses :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [ref] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Match :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ 0 :: Value | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [ref] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ input :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [=] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ terminal_q :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ PikaQueue :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ length :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [.] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ grammar :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [inert] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clauses :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ reset! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ terminal_q :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [.] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ grammar :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [inert] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ terminals :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [=] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ lastindex :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ input :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [while] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ >= :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ firstindex :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ input :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [if] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isnothing :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ fast_match :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ reset! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [.] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [inert] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ q :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ terminal_q :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ fast_match :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ input :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [->] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [tuple] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [::] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ rid :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ G :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [::] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ last :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [let] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [=] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cl :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [ref] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [.] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ grammar :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [inert] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ idx :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ rid :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ new_match! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Match :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cl :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ last :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ 0 :: Value | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ submatch_empty :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [while] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ ! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isempty :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [.] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [inert] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ q :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [=] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ pop! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [.] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [inert] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ q :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [=] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [ref] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [.] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ grammar :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [inert] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clauses :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [if] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isa :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Token :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ match_clause! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [elseif] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isa :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Tokens :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ I :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ match_clause! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [elseif] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isa :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Satisfy :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ match_clause! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [elseif] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isa :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Scan :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ match_clause! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [elseif] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isa :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Seq :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ match_clause! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [elseif] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isa :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ First :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ match_clause! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [elseif] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isa :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ FollowedBy :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ match_clause! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [elseif] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isa :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Many :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ match_clause! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [elseif] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isa :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Some :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ match_clause! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [elseif] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ isa :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Tie :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Int :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ match_clause! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [block] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ match_clause! :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ cls :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ clause :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [=] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ prevind :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ input :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ i :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ st :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ "\n\nTake a [`Grammar`](@ref) and an indexable input sequence (typically `Vector` or\n`String`), and return a final [`ParserState`](@ref) that contains all matched\ngrammar productions.\n\nThe `input` must be random-indexable (because PikaParsers require a lot of\nrandom indexing) using Int indexes, must support `firstindex`, `lastindex`,\n`prevind`, `nextind`, index arithmetics with `+` and `-`, and indexes in\n`view`s must be the same as in original container except for a constant offset.\n\n# Lexing and fast terminal matching\n\nIf `fast_match` is specified, the function does not match terminals using the\nassociated grammar rules, but with a `fast_match` function that reports the\nmatched terminals via a callback. The function is called exactly once for each\nposition in `input` in reverse order (i.e., the indexes will start at\n`lastindex(input)` and continue using `prevind` all the way to\n`firstindex(input)`), which can be utilized by the application for\noptimization. The call parameters consist of the input vector, position in\nthe input vector, and a \"report\" function used to send back a clause ID (of\nsame type as `G` in `typeof(grammar)`) and the last item of the terminal match\nthat can starts at that position. Calls to the reporting function can be\nrepeated if more terminal types match. Terminals not reported by the calls to\n`fast_match` will not be matched.\n\nFor complicated grammars, this may be much faster than having the parser to try\nmatching all terminal types at each position.\n\nIf your grammar does not contain dangerous or highly surprising kinds of\nterminals (in particular, it can be scanned greedily left-to-right), you may\nuse [`parse_lex`](@ref) to run a reasonable terminal-only lexing step, which is\nthen automatically used as a basis for fast matching.\n\n# Caveats\n\nTake care when indexing `String`s. With UTF-8, not all codepoints may\nnecessarily have length 1.\n\nIf unsure, you may always `collect` the strings to vectors of `Char`s\n(basically converting to UTF-32), where each character occupies precisely one\nindex.\n\n# Results\n\nUse [`find_match_at!`](@ref) to extract matches from [`ParserState`](@ref).\n\nPika parsing never really fails. Instead, in case when the grammar rule is not\nmatched in the input, the expected rule match match is either not going to be\nfound at the starting position with [`find_match_at!`](@ref), or it will not\nspan the whole input.\n\n# Example\n\n parse(\n g,\n \"abcde123\",\n (input, i, match) -> isdigit(input[i]) ? match(:digit, i) : match(:letter, i),\n )\n\n" :: Value | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [call] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Dict{Symbol, Any} :: Value | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ :path => "/home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl" :: Value | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ :linenumber => 66 :: Value | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ :module => PikaParser :: Value | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [where] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [where] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [where] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Union :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Tuple :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Grammar :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ G :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ I :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Tuple :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Grammar :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ G :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ I :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Any :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Tuple :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ I :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Tuple :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [curly] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Tuple :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ G :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [<:] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ I :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Any :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [<:] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ T :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Any :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [<:] | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ G :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ Any :: Identifier | [old,SL(Fynm7gcfeY8,PikaParser,),@doc], │ [if] | [old,SL(5PjqK3uRff5,DocStringExtensions,SL(Fynm7gcfeY8,PikaParser,)),@doc], │ true :: Value | [old,SL(5PjqK3uRff5,DocStringExtensions,SL(Fynm7gcfeY8,PikaParser,)),@doc], │ val :: Identifier | [old,SL(5PjqK3uRff5,DocStringExtensions,SL(Fynm7gcfeY8,PikaParser,)),@doc], │ │ file = "/home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl" │ line = 66 └ mod = PikaParser ERROR: LoadError: LoweringError: #= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:152 =# - Found unexpected binding of kind static_parameter Expression:  #₂₆/G Containing expressions:  (= #₁₁₂/G #₂₆/G)  (= #₄ (call core.svec (call core.svec #₇₉/#parse##->###0 #₂₆/G #₃₆/Int) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:152:0))  (= #₄ (call core.svec (call core.svec (function_type #₄₁/#->#) #₂₆/G #₃₆/Int) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:152:0))  Detailed provenance:  #₂₆/G  ├─ G  │ ├─ G  │ │ └─ @ /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:152  │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:66 =#) (string TYPEDSIGNATURES "\n\nTake a [`Grammar`](@ref) and an indexable input sequence (typically `Vector` or\n`String`), and return a final [`ParserState`](@ref) that contains all matched\ngrammar productions.\n\nThe `input` must be random-indexable (because PikaParsers require a lot of\nrandom indexing) using Int indexes, must support `firstindex`, `lastindex`,\n`prevind`, `nextind`, index arithmetics with `+` and `-`, and indexes in\n`view`s must be the same as in original container except for a constant offset.\n\n# Lexing and fast terminal matching\n\nIf `fast_match` is specified, the function does not match terminals using the\nassociated grammar rules, but with a `fast_match` function that reports the\nmatched terminals via a callback. The function is called exactly once for each\nposition in `input` in reverse order (i.e., the indexes will start at\n`lastindex(input)` and continue using `prevind` all the way to\n`firstindex(input)`), which can be utilized by the application for\noptimization. The call parameters consist of the input vector, position in\nthe input vector, and a \"report\" function used to send back a clause ID (of\nsame type as `G` in `typeof(grammar)`) and the last item of the terminal match\nthat can starts at that position. Calls to the reporting function can be\nrepeated if more terminal types match. Terminals not reported by the calls to\n`fast_match` will not be matched.\n\nFor complicated grammars, this may be much faster than having the parser to try\nmatching all terminal types at each position.\n\nIf your grammar does not contain dangerous or highly surprising kinds of\nterminals (in particular, it can be scanned greedily left-to-right), you may\nuse [`parse_lex`](@ref) to run a reasonable terminal-only lexing step, which is\nthen automatically used as a basis for fast matching.\n\n# Caveats\n\nTake care when indexing `String`s. With UTF-8, not all codepoints may\nnecessarily have length 1.\n\nIf unsure, you may always `collect` the strings to vectors of `Char`s\n(basically converting to UTF-32), where each character occupies precisely one\nindex.\n\n# Results\n\nUse [`find_match_at!`](@ref) to extract matches from [`ParserState`](@ref).\n\nPika parsing never really fails. Instead, in case when the grammar rule is not\nmatched in the input, the expected rule match match is either not going to be\nfound at the starting position with [`find_match_at!`](@ref), or it will not\nspan the whole input.\n\n# Example\n\n parse(\n g,\n \"abcde123\",\n (input, i, match) -> isdigit(input[i]) ? match(:digit, i) : match(:letter, i),\n )\n\n") (function (where (:: (call parse (:: grammar (curly Grammar G T)) (:: input I) (kw fast_match nothing)) (curly ParserState G T I)) G T I) (block (= st (call (curly ParserState G T I) grammar (call PikaQueue (call length (. grammar (inert clauses)))) (ref Match) 0 (ref Int) input)) (= terminal_q (call PikaQueue (call length (. grammar (inert clauses))))) (call reset! terminal_q (. grammar (inert terminals))) (= i (call lastindex input)) (while (call >= i (call firstindex input)) (block (if (call isnothing fast_match) (block (call reset! (. st (inert q)) terminal_q)) (block (call fast_match input i (-> (tuple (:: rid G) (:: last Int)) (block (let (= cl (ref (. grammar (inert idx)) rid)) (block (call new_match! (call Match cl i last 0 (call submatch_empty st)) st)))))))) (while (call ! (call isempty (. st (inert q)))) (block (= clause (call pop! (. st (inert q)))) (= cls (ref (. grammar (inert clauses)) clause)) (if (call isa cls (curly Token Int T)) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Tokens Int T I))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Satisfy Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Scan Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Seq Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly First Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly FollowedBy Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Many Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Some Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Tie Int T))) (block (call match_clause! cls clause i st)) (block (call match_clause! cls clause i st)))))))))))))) (= i (call prevind input i)))) st)))  │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:66 =#) (string TYPEDSIGNATURES "\n\nTake a [`Grammar`](@ref) and an indexable input sequence (typically `Vector` or\n`String`), and return a final [`ParserState`](@ref) that contains all matched\ngrammar productions.\n\nThe `input` must be random-indexable (because PikaParsers require a lot of\nrandom indexing) using Int indexes, must support `firstindex`, `lastindex`,\n`prevind`, `nextind`, index arithmetics with `+` and `-`, and indexes in\n`view`s must be the same as in original container except for a constant offset.\n\n# Lexing and fast terminal matching\n\nIf `fast_match` is specified, the function does not match terminals using the\nassociated grammar rules, but with a `fast_match` function that reports the\nmatched terminals via a callback. The function is called exactly once for each\nposition in `input` in reverse order (i.e., the indexes will start at\n`lastindex(input)` and continue using `prevind` all the way to\n`firstindex(input)`), which can be utilized by the application for\noptimization. The call parameters consist of the input vector, position in\nthe input vector, and a \"report\" function used to send back a clause ID (of\nsame type as `G` in `typeof(grammar)`) and the last item of the terminal match\nthat can starts at that position. Calls to the reporting function can be\nrepeated if more terminal types match. Terminals not reported by the calls to\n`fast_match` will not be matched.\n\nFor complicated grammars, this may be much faster than having the parser to try\nmatching all terminal types at each position.\n\nIf your grammar does not contain dangerous or highly surprising kinds of\nterminals (in particular, it can be scanned greedily left-to-right), you may\nuse [`parse_lex`](@ref) to run a reasonable terminal-only lexing step, which is\nthen automatically used as a basis for fast matching.\n\n# Caveats\n\nTake care when indexing `String`s. With UTF-8, not all codepoints may\nnecessarily have length 1.\n\nIf unsure, you may always `collect` the strings to vectors of `Char`s\n(basically converting to UTF-32), where each character occupies precisely one\nindex.\n\n# Results\n\nUse [`find_match_at!`](@ref) to extract matches from [`ParserState`](@ref).\n\nPika parsing never really fails. Instead, in case when the grammar rule is not\nmatched in the input, the expected rule match match is either not going to be\nfound at the starting position with [`find_match_at!`](@ref), or it will not\nspan the whole input.\n\n# Example\n\n parse(\n g,\n \"abcde123\",\n (input, i, match) -> isdigit(input[i]) ? match(:digit, i) : match(:letter, i),\n )\n\n") (function (where (:: (call parse (:: grammar (curly Grammar G T)) (:: input I) (kw fast_match nothing)) (curly ParserState G T I)) G T I) (block (= st (call (curly ParserState G T I) grammar (call PikaQueue (call length (. grammar (inert clauses)))) (ref Match) 0 (ref Int) input)) (= terminal_q (call PikaQueue (call length (. grammar (inert clauses))))) (call reset! terminal_q (. grammar (inert terminals))) (= i (call lastindex input)) (while (call >= i (call firstindex input)) (block (if (call isnothing fast_match) (block (call reset! (. st (inert q)) terminal_q)) (block (call fast_match input i (-> (tuple (:: rid G) (:: last Int)) (block (let (= cl (ref (. grammar (inert idx)) rid)) (block (call new_match! (call Match cl i last 0 (call submatch_empty st)) st)))))))) (while (call ! (call isempty (. st (inert q)))) (block (= clause (call pop! (. st (inert q)))) (= cls (ref (. grammar (inert clauses)) clause)) (if (call isa cls (curly Token Int T)) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Tokens Int T I))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Satisfy Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Scan Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Seq Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly First Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly FollowedBy Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Many Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Some Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Tie Int T))) (block (call match_clause! cls clause i st)) (block (call match_clause! cls clause i st)))))))))))))) (= i (call prevind input i)))) st)))  │ └─ @ /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:66  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:66 =#) (string TYPEDSIGNATURES "\n\nTake a [`Grammar`](@ref) and an indexable input sequence (typically `Vector` or\n`String`), and return a final [`ParserState`](@ref) that contains all matched\ngrammar productions.\n\nThe `input` must be random-indexable (because PikaParsers require a lot of\nrandom indexing) using Int indexes, must support `firstindex`, `lastindex`,\n`prevind`, `nextind`, index arithmetics with `+` and `-`, and indexes in\n`view`s must be the same as in original container except for a constant offset.\n\n# Lexing and fast terminal matching\n\nIf `fast_match` is specified, the function does not match terminals using the\nassociated grammar rules, but with a `fast_match` function that reports the\nmatched terminals via a callback. The function is called exactly once for each\nposition in `input` in reverse order (i.e., the indexes will start at\n`lastindex(input)` and continue using `prevind` all the way to\n`firstindex(input)`), which can be utilized by the application for\noptimization. The call parameters consist of the input vector, position in\nthe input vector, and a \"report\" function used to send back a clause ID (of\nsame type as `G` in `typeof(grammar)`) and the last item of the terminal match\nthat can starts at that position. Calls to the reporting function can be\nrepeated if more terminal types match. Terminals not reported by the calls to\n`fast_match` will not be matched.\n\nFor complicated grammars, this may be much faster than having the parser to try\nmatching all terminal types at each position.\n\nIf your grammar does not contain dangerous or highly surprising kinds of\nterminals (in particular, it can be scanned greedily left-to-right), you may\nuse [`parse_lex`](@ref) to run a reasonable terminal-only lexing step, which is\nthen automatically used as a basis for fast matching.\n\n# Caveats\n\nTake care when indexing `String`s. With UTF-8, not all codepoints may\nnecessarily have length 1.\n\nIf unsure, you may always `collect` the strings to vectors of `Char`s\n(basically converting to UTF-32), where each character occupies precisely one\nindex.\n\n# Results\n\nUse [`find_match_at!`](@ref) to extract matches from [`ParserState`](@ref).\n\nPika parsing never really fails. Instead, in case when the grammar rule is not\nmatched in the input, the expected rule match match is either not going to be\nfound at the starting position with [`find_match_at!`](@ref), or it will not\nspan the whole input.\n\n# Example\n\n parse(\n g,\n \"abcde123\",\n (input, i, match) -> isdigit(input[i]) ? match(:digit, i) : match(:letter, i),\n )\n\n") (function (where (:: (call parse (:: grammar (curly Grammar G T)) (:: input I) (kw fast_match nothing)) (curly ParserState G T I)) G T I) (block (= st (call (curly ParserState G T I) grammar (call PikaQueue (call length (. grammar (inert clauses)))) (ref Match) 0 (ref Int) input)) (= terminal_q (call PikaQueue (call length (. grammar (inert clauses))))) (call reset! terminal_q (. grammar (inert terminals))) (= i (call lastindex input)) (while (call >= i (call firstindex input)) (block (if (call isnothing fast_match) (block (call reset! (. st (inert q)) terminal_q)) (block (call fast_match input i (-> (tuple (:: rid G) (:: last Int)) (block (let (= cl (ref (. grammar (inert idx)) rid)) (block (call new_match! (call Match cl i last 0 (call submatch_empty st)) st)))))))) (while (call ! (call isempty (. st (inert q)))) (block (= clause (call pop! (. st (inert q)))) (= cls (ref (. grammar (inert clauses)) clause)) (if (call isa cls (curly Token Int T)) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Tokens Int T I))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Satisfy Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Scan Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Seq Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly First Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly FollowedBy Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Many Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Some Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Tie Int T))) (block (call match_clause! cls clause i st)) (block (call match_clause! cls clause i st)))))))))))))) (= i (call prevind input i)))) st)))  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:66 =#) (string TYPEDSIGNATURES "\n\nTake a [`Grammar`](@ref) and an indexable input sequence (typically `Vector` or\n`String`), and return a final [`ParserState`](@ref) that contains all matched\ngrammar productions.\n\nThe `input` must be random-indexable (because PikaParsers require a lot of\nrandom indexing) using Int indexes, must support `firstindex`, `lastindex`,\n`prevind`, `nextind`, index arithmetics with `+` and `-`, and indexes in\n`view`s must be the same as in original container except for a constant offset.\n\n# Lexing and fast terminal matching\n\nIf `fast_match` is specified, the function does not match terminals using the\nassociated grammar rules, but with a `fast_match` function that reports the\nmatched terminals via a callback. The function is called exactly once for each\nposition in `input` in reverse order (i.e., the indexes will start at\n`lastindex(input)` and continue using `prevind` all the way to\n`firstindex(input)`), which can be utilized by the application for\noptimization. The call parameters consist of the input vector, position in\nthe input vector, and a \"report\" function used to send back a clause ID (of\nsame type as `G` in `typeof(grammar)`) and the last item of the terminal match\nthat can starts at that position. Calls to the reporting function can be\nrepeated if more terminal types match. Terminals not reported by the calls to\n`fast_match` will not be matched.\n\nFor complicated grammars, this may be much faster than having the parser to try\nmatching all terminal types at each position.\n\nIf your grammar does not contain dangerous or highly surprising kinds of\nterminals (in particular, it can be scanned greedily left-to-right), you may\nuse [`parse_lex`](@ref) to run a reasonable terminal-only lexing step, which is\nthen automatically used as a basis for fast matching.\n\n# Caveats\n\nTake care when indexing `String`s. With UTF-8, not all codepoints may\nnecessarily have length 1.\n\nIf unsure, you may always `collect` the strings to vectors of `Char`s\n(basically converting to UTF-32), where each character occupies precisely one\nindex.\n\n# Results\n\nUse [`find_match_at!`](@ref) to extract matches from [`ParserState`](@ref).\n\nPika parsing never really fails. Instead, in case when the grammar rule is not\nmatched in the input, the expected rule match match is either not going to be\nfound at the starting position with [`find_match_at!`](@ref), or it will not\nspan the whole input.\n\n# Example\n\n parse(\n g,\n \"abcde123\",\n (input, i, match) -> isdigit(input[i]) ? match(:digit, i) : match(:letter, i),\n )\n\n") (function (where (:: (call parse (:: grammar (curly Grammar G T)) (:: input I) (kw fast_match nothing)) (curly ParserState G T I)) G T I) (block (= st (call (curly ParserState G T I) grammar (call PikaQueue (call length (. grammar (inert clauses)))) (ref Match) 0 (ref Int) input)) (= terminal_q (call PikaQueue (call length (. grammar (inert clauses))))) (call reset! terminal_q (. grammar (inert terminals))) (= i (call lastindex input)) (while (call >= i (call firstindex input)) (block (if (call isnothing fast_match) (block (call reset! (. st (inert q)) terminal_q)) (block (call fast_match input i (-> (tuple (:: rid G) (:: last Int)) (block (let (= cl (ref (. grammar (inert idx)) rid)) (block (call new_match! (call Match cl i last 0 (call submatch_empty st)) st)))))))) (while (call ! (call isempty (. st (inert q)))) (block (= clause (call pop! (. st (inert q)))) (= cls (ref (. grammar (inert clauses)) clause)) (if (call isa cls (curly Token Int T)) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Tokens Int T I))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Satisfy Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Scan Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Seq Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly First Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly FollowedBy Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Many Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Some Int T))) (block (call match_clause! cls clause i st)) (elseif (block (call isa cls (curly Tie Int T))) (block (call match_clause! cls clause i st)) (block (call match_clause! cls clause i st)))))))))))))) (= i (call prevind input i)))) st)))  └─ @ /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/parse.jl:66  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/PikaParser/SOJr9/src/PikaParser.jl:13  [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/PikaParser/SOJr9/src/parse.jl:66 in expression starting at /home/pkgeval/.julia/packages/PikaParser/SOJr9/src/PikaParser.jl:1 in expression starting at stdin:5 ✗ PikaParser 37.7 s ✓ AliasTables 19.9 s ✓ CodecZlib 0.7 s ✓ TableTraits 12.9 s ✓ FileIO 30.9 s ✓ StructUtils → StructUtilsStaticArraysCoreExt 71.6 s ✓ Unitful → PrintfExt ┌ Info: JuliaLowering threw given input: │ code = │ :((constructorof(::Type{Unitful.Quantity{_, D, U}}) where {_, D, U}) = begin │ #= /home/pkgeval/.julia/packages/Unitful/HhRY9/ext/ConstructionBaseUnitfulExt.jl:5 =# │ Unitful.Quantity{T, D, U} where T │ 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 │ [=] | │ [where] | │ [call] | │ constructorof :: Identifier | │ [::] | │ [curly] | │ Type :: Identifier | │ [curly] | │ [.] | │ Unitful :: Identifier | │ [inert] | │ Quantity :: Identifier | │ _ :: Identifier | │ D :: Identifier | │ U :: Identifier | │ _ :: Identifier | │ D :: Identifier | │ U :: Identifier | │ [block] | │ [where] | │ [curly] | │ [.] | │ Unitful :: Identifier | │ [inert] | │ Quantity :: Identifier | │ T :: Identifier | │ D :: Identifier | │ U :: Identifier | │ T :: 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 │ [=] | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ [where] | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ [call] | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ constructorof :: Identifier | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ [::] | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ [curly] | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ Type :: Identifier | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ [curly] | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ [.] | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ Unitful :: Identifier | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ [inert] | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ Quantity :: Identifier | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ _ :: Identifier | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ D :: Identifier | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ U :: Identifier | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ _ :: Identifier | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ D :: Identifier | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ U :: Identifier | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ [block] | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ [where] | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ [curly] | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ [.] | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ Unitful :: Identifier | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ [inert] | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ Quantity :: Identifier | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ T :: Identifier | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ D :: Identifier | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ U :: Identifier | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ T :: Identifier | [old,SL(IvVOsSru4nP,ConstructionBaseUnitfulExt,),], │ │ file = "/home/pkgeval/.julia/packages/Unitful/HhRY9/ext/ConstructionBaseUnitfulExt.jl" │ line = 5 └ mod = ConstructionBaseUnitfulExt ERROR: LoadError: LoweringError: #= /home/pkgeval/.julia/packages/Unitful/HhRY9/ext/ConstructionBaseUnitfulExt.jl:5 =# - all-underscore identifiers are write-only and their values cannot be used in expressions Expression:  _ Containing expressions:  (call core.svec (call core.Typeof #₃/constructorof) (call core.apply_type #₆/Type (call core.apply_type (call top.getproperty #₇/Unitful :Quantity) _ #₄/D #₅/U)))  (call core.svec (function_type #₃/constructorof) (call core.apply_type #₆/Type (call core.apply_type (call top.getproperty #₇/Unitful :Quantity) _ #₄/D #₅/U)))  (call core.svec (function_type constructorof) (call core.apply_type Type (call core.apply_type (call top.getproperty Unitful :Quantity) _ D U)))  (call core.apply_type (. Unitful :Quantity) _ D U)  Detailed provenance:  _  └─ _  └─ _  └─ @ /home/pkgeval/.julia/packages/Unitful/HhRY9/ext/ConstructionBaseUnitfulExt.jl:5  Stacktrace:  [1] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:646  [2] compile_args(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, args::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, SubArray{Int64, 1, Vector{Int64}, Tuple{UnitRange{Int64}}, true}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:166  [3] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:654  [4] compile_args(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, args::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, SubArray{Int64, 1, Vector{Int64}, Tuple{UnitRange{Int64}}, true}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:166  [5] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:654  [6] compile_args(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, args::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, SubArray{Int64, 1, Vector{Int64}, Tuple{UnitRange{Int64}}, true}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:166  [7] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:654  [8] compile_args(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, args::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, SubArray{Int64, 1, Vector{Int64}, Tuple{UnitRange{Int64}}, true}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:166  [9] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:654  [10] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:680  [11] compile(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}, needs_value::Bool, in_tail_pos::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:715  [12] compile_body(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1037  [13] 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:1197  [14] 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  [15] 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  [16] include(mod::Module, _path::String)  @ Base Base.jl:325  [17] 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  [18] top-level scope  @ stdin:5  [19] eval(m::Module, e::Any)  @ Core boot.jl:522  [20] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [21] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [22] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [23] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/Unitful/HhRY9/ext/ConstructionBaseUnitfulExt.jl:1 in expression starting at stdin:5 ✗ Unitful → ConstructionBaseUnitfulExt 35.3 s ✓ Unitful → NaNMathExt 1.0 s ✓ Compat → CompatLinearAlgebraExt 31.8 s ✓ JLLWrappers 31.6 s ✓ PrecompileTools 40.6 s ✓ SortingAlgorithms ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/ConstraintTrees/WXXYD/src/tree.jl:231 =# Core.@doc "$(TYPEDSIGNATURES)\n\nLike [`filter`](@ref) but the filtering predicate function also receives the\n\"path\" in the tree.\n" function ifilter(f, x::Tree{T}) where T │ #= /home/pkgeval/.julia/packages/ConstraintTrees/WXXYD/src/tree.jl:237 =# │ #= /home/pkgeval/.julia/packages/ConstraintTrees/WXXYD/src/tree.jl:238 =# │ go(ix, x::Tree{T}) = begin │ #= /home/pkgeval/.julia/packages/ConstraintTrees/WXXYD/src/tree.jl:238 =# │ Tree{T}((k => go(tuple(ix..., k), v) for (k, v) = x if f(tuple(ix..., k), v))) │ end │ #= /home/pkgeval/.julia/packages/ConstraintTrees/WXXYD/src/tree.jl:240 =# │ go(ix, x) = begin │ #= /home/pkgeval/.julia/packages/ConstraintTrees/WXXYD/src/tree.jl:240 =# │ x │ end │ #= /home/pkgeval/.julia/packages/ConstraintTrees/WXXYD/src/tree.jl:242 =# │ go((), x) │ 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/ConstraintTrees/WXXYD/src/tree.jl:231 =#) :: Value | │ [string] | │ TYPEDSIGNATURES :: Identifier | │ "\n\nLike [`filter`](@ref) but the filtering predicate function also receives the\n\"path\" in the tree.\n" :: Value | │ [function] | │ [where] | │ [call] | │ ifilter :: Identifier | │ f :: Identifier | │ [::] | │ x :: Identifier | │ [curly] | │ Tree :: Identifier | │ T :: Identifier | │ T :: Identifier | │ [block] | │ [=] | │ [call] | │ go :: Identifier | │ ix :: Identifier | │ [::] | │ x :: Identifier | │ [curly] | │ Tree :: Identifier | │ T :: Identifier | │ [block] | │ [call] | │ [curly] | │ Tree :: Identifier | │ T :: Identifier | │ [generator] | │ [call] | │ => :: Identifier | │ k :: Identifier | │ [call] | │ go :: Identifier | │ [call] | │ tuple :: Identifier | │ [...] | │ ix :: Identifier | │ k :: Identifier | │ v :: Identifier | │ [filter] | │ [call] | │ f :: Identifier | │ [call] | │ tuple :: Identifier | │ [...] | │ ix :: Identifier | │ k :: Identifier | │ v :: Identifier | │ [=] | │ [tuple] | │ k :: Identifier | │ v :: Identifier | │ x :: Identifier | │ [=] | │ [call] | │ go :: Identifier | │ ix :: Identifier | │ x :: Identifier | │ [block] | │ x :: Identifier | │ [call] | │ go :: Identifier | │ [tuple] | │ x :: 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(1DiAPmjCWxe,DocStringExtensions,SL(9ldU7jJ1u06,ConstraintTrees,)),@doc], │ [if] | [old,SL(1DiAPmjCWxe,DocStringExtensions,SL(9ldU7jJ1u06,ConstraintTrees,)),@doc], │ true :: Value | [old,SL(1DiAPmjCWxe,DocStringExtensions,SL(9ldU7jJ1u06,ConstraintTrees,)),@doc], │ [=] | [old,SL(1DiAPmjCWxe,DocStringExtensions,SL(9ldU7jJ1u06,ConstraintTrees,)),@doc], │ val :: Identifier | [old,SL(1DiAPmjCWxe,DocStringExtensions,SL(9ldU7jJ1u06,ConstraintTrees,)),@doc], │ [function] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [where] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ ifilter :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ f :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [::] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ x :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [curly] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ Tree :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ T :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ T :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [block] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [=] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ go :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ ix :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [::] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ x :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [curly] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ Tree :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ T :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [block] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [curly] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ Tree :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ T :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [generator] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ => :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ k :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ go :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ tuple :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [...] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ ix :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ k :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ v :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [filter] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ f :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ tuple :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [...] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ ix :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ k :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ v :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [=] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [tuple] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ k :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ v :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ x :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [=] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ go :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ ix :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ x :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [block] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ x :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ go :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [tuple] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ x :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(1DiAPmjCWxe,DocStringExtensions,SL(9ldU7jJ1u06,ConstraintTrees,)),@doc], │ Base.Docs.doc! :: Value | [old,SL(1DiAPmjCWxe,DocStringExtensions,SL(9ldU7jJ1u06,ConstraintTrees,)),@doc], │ ConstraintTrees :: Value | [old,SL(1DiAPmjCWxe,DocStringExtensions,SL(9ldU7jJ1u06,ConstraintTrees,)),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ Base.Docs.Binding :: Value | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ ConstraintTrees :: Value | [old,SL(AH8dDKIVzpV,Base,SL(9ldU7jJ1u06,ConstraintTrees,)),(. Base (inert @__MODULE__))], │ [inert] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc],jl_source=L47 │ ifilter :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ Base.Docs.docstr :: Value | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ Core.svec :: Value | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ DocStringExtensions.interpolation :: Value | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ TYPEDSIGNATURES :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [inert] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [function] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [where] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ ifilter :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ f :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [::] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ x :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [curly] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ Tree :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ T :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ T :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [block] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [=] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ go :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ ix :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [::] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ x :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [curly] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ Tree :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ T :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [block] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [curly] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ Tree :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ T :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [generator] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ => :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ k :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ go :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ tuple :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [...] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ ix :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ k :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ v :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [filter] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ f :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ tuple :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [...] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ ix :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ k :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ v :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [=] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [tuple] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ k :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ v :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ x :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [=] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ go :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ ix :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ x :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [block] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ x :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ go :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [tuple] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ x :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ "\n\nLike [`filter`](@ref) but the filtering predicate function also receives the\n\"path\" in the tree.\n" :: Value | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [call] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ Dict{Symbol, Any} :: Value | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ :path => "/home/pkgeval/.julia/packages/ConstraintTrees/WXXYD/src/tree.jl" :: Value | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ :linenumber => 231 :: Value | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ :module => ConstraintTrees :: Value | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [where] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [curly] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ Union :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [curly] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ Tuple :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ Any :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [curly] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ Tree :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ T :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [curly] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ Tuple :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ T :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [<:] | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ T :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ Any :: Identifier | [old,SL(9ldU7jJ1u06,ConstraintTrees,),@doc], │ [if] | [old,SL(1DiAPmjCWxe,DocStringExtensions,SL(9ldU7jJ1u06,ConstraintTrees,)),@doc], │ true :: Value | [old,SL(1DiAPmjCWxe,DocStringExtensions,SL(9ldU7jJ1u06,ConstraintTrees,)),@doc], │ val :: Identifier | [old,SL(1DiAPmjCWxe,DocStringExtensions,SL(9ldU7jJ1u06,ConstraintTrees,)),@doc], │ │ file = "/home/pkgeval/.julia/packages/ConstraintTrees/WXXYD/src/tree.jl" │ line = 231 └ mod = ConstraintTrees ERROR: LoadError: LoweringError: #= /home/pkgeval/.julia/packages/ConstraintTrees/WXXYD/src/tree.jl:238 =# - Found unexpected binding of kind static_parameter Expression:  #₂₁/T Containing expressions:  (= #₁₀₂/T #₂₁/T)  (call core.svec (call core.svec #₄₆/#ifilter#go##0 core.Any (call core.apply_type #₁₇/Tree #₂₁/T)) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/ConstraintTrees/WXXYD/src/tree.jl:238:0)  (call core.svec (call core.svec (function_type #₂₂/go) core.Any (call core.apply_type #₁₇/Tree #₂₁/T)) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/ConstraintTrees/WXXYD/src/tree.jl:238:0)  Detailed provenance:  #₂₁/T  ├─ T  │ ├─ T  │ │ └─ @ /home/pkgeval/.julia/packages/ConstraintTrees/WXXYD/src/tree.jl:238  │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/ConstraintTrees/WXXYD/src/tree.jl:231 =#) (string TYPEDSIGNATURES "\n\nLike [`filter`](@ref) but the filtering predicate function also receives the\n\"path\" in the tree.\n") (function (where (call ifilter f (:: x (curly Tree T))) T) (block (= (call go ix (:: x (curly Tree T))) (block (call (curly Tree T) (generator (call => k (call go (call tuple (... ix) k) v)) (filter (call f (call tuple (... ix) k) v) (= (tuple k v) x)))))) (= (call go ix x) (block x)) (call go (tuple) x))))  │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/ConstraintTrees/WXXYD/src/tree.jl:231 =#) (string TYPEDSIGNATURES "\n\nLike [`filter`](@ref) but the filtering predicate function also receives the\n\"path\" in the tree.\n") (function (where (call ifilter f (:: x (curly Tree T))) T) (block (= (call go ix (:: x (curly Tree T))) (block (call (curly Tree T) (generator (call => k (call go (call tuple (... ix) k) v)) (filter (call f (call tuple (... ix) k) v) (= (tuple k v) x)))))) (= (call go ix x) (block x)) (call go (tuple) x))))  │ └─ @ /home/pkgeval/.julia/packages/ConstraintTrees/WXXYD/src/tree.jl:231  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/ConstraintTrees/WXXYD/src/tree.jl:231 =#) (string TYPEDSIGNATURES "\n\nLike [`filter`](@ref) but the filtering predicate function also receives the\n\"path\" in the tree.\n") (function (where (call ifilter f (:: x (curly Tree T))) T) (block (= (call go ix (:: x (curly Tree T))) (block (call (curly Tree T) (generator (call => k (call go (call tuple (... ix) k) v)) (filter (call f (call tuple (... ix) k) v) (= (tuple k v) x)))))) (= (call go ix x) (block x)) (call go (tuple) x))))  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/ConstraintTrees/WXXYD/src/tree.jl:231 =#) (string TYPEDSIGNATURES "\n\nLike [`filter`](@ref) but the filtering predicate function also receives the\n\"path\" in the tree.\n") (function (where (call ifilter f (:: x (curly Tree T))) T) (block (= (call go ix (:: x (curly Tree T))) (block (call (curly Tree T) (generator (call => k (call go (call tuple (... ix) k) v)) (filter (call f (call tuple (... ix) k) v) (= (tuple k v) x)))))) (= (call go ix x) (block x)) (call go (tuple) x))))  └─ @ /home/pkgeval/.julia/packages/ConstraintTrees/WXXYD/src/tree.jl:231  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/ConstraintTrees/WXXYD/src/ConstraintTrees.jl:67  [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/ConstraintTrees/WXXYD/src/tree.jl:231 in expression starting at /home/pkgeval/.julia/packages/ConstraintTrees/WXXYD/src/ConstraintTrees.jl:16 in expression starting at stdin:5 ✗ ConstraintTrees 150.8 s ✓ Tables  ====================================================================================== 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 473 running 1 of 1  signal (10): User defined signal 1 _ZN4llvm12MachineInstr17setPreInstrSymbolERNS_15MachineFunctionEPNS_8MCSymbolE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm12MachineInstr17cloneInstrSymbolsERNS_15MachineFunctionERKS0_ at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN12_GLOBAL__N_111X86FastISel19tryToFoldLoadIntoMIEPN4llvm12MachineInstrEjPKNS1_8LoadInstE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm16SelectionDAGISel20SelectAllBasicBlocksERKNS_8FunctionE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm16SelectionDAGISel20runOnMachineFunctionERNS_15MachineFunctionE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm22SelectionDAGISelLegacy20runOnMachineFunctionERNS_15MachineFunctionE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm19MachineFunctionPass13runOnFunctionERNS_8FunctionE.part.0 at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm13FPPassManager13runOnFunctionERNS_8FunctionE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm13FPPassManager11runOnModuleERNS_6ModuleE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) _ZN4llvm6legacy15PassManagerImpl3runERNS_6ModuleE at /opt/julia/bin/../lib/julia/libLLVM.so.21.1jl (unknown line) operator() at /source/src/jitlayers.cpp:1388:23 compileModule at /source/src/jitlayers.cpp:2368:79 materialize at /source/src/jitlayers.cpp:877:36 _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: 0x7d13374fdd35) 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: 0x7d13543f9249) 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 ==============================================================  │ 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 32334347537 deps_ns=171200841 compilation_ns=32110823220 methods=270 34.6 s ✓ OpenBLAS32_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 270 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 0x00007bc3f9ac5f00 Total snapshots: 306. Utilization: 0% ╎306 @Base/task.jl:1170 wait_forever() 305╎ 306 @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 0x000077e6149fc790 Total snapshots: 329. Utilization: 0% ╎329 @Base/task.jl:1170 wait_forever() 328╎ 329 @Base/task.jl:1248 wait() [270] 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: 15105463 (Pool: 15104671; Big: 792); 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) 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 2733.26s: test duration exceeded the time limit