You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The generated parser uses varargs to find a matching token. For heavily used rules this is allocating a lot of memory.
I'm not sure if this is feasible, but creating a static TokenSet for the tokens instead of allocating an array for each invocation could reduce allocations (and thus GC) a lot.
Thank you for your consideration!
publicstaticbooleanprocess_substitution(PsiBuilderb, intl) {
if (!recursion_guard_(b, l, "process_substitution")) returnfalse;
// here, a static TokenSet could be passed to avoid the implicit array allocationif (!nextTokenIsFast(b, INPUT_PROCESS_SUBSTITUTION, OUTPUT_PROCESS_SUBSTITUTION)) returnfalse;
//...
}
The text was updated successfully, but these errors were encountered:
The generated parser uses varargs to find a matching token. For heavily used rules this is allocating a lot of memory.
I'm not sure if this is feasible, but creating a static TokenSet for the tokens instead of allocating an array for each invocation could reduce allocations (and thus GC) a lot.
Thank you for your consideration!
The text was updated successfully, but these errors were encountered: