GeezerVison

Parsing performance.sql, the JMH benchmark's input, allocates 7.17 MB per parse on master, and about 1 MB of that (15%) does no work. The profile taken for #2870 found the sources: collections created on every call of a production but filled only on a rare path, a regex compiled for every LIKE, and function names joined into a string just to compare them.

This PR is separate from #2870 so each PR's benchmark stays clean.

• Condition() created a deque for leading NOT and ! prefixes on every call, though few conditions are negated. An empty ArrayDeque allocates its 17-slot array up front. The deque is now created at the first NOT or !, as fix: give every parsed object a node spanning its source #2870 already does for the token deque beside it.
• PrimaryExpression() created two lists on every call, for chained signs such as - -1 and for JSON operators such as ->. Both are now created at their first element.
• LikeExpression.KeyWord.from called String.replaceAll("\\s+", "_"), which compiles the pattern on every call. The pattern is now a static constant.
• consumeXmlLeadingKeyword and FunctionArgumentList called Function.getName() for every function to check for XMLPARSE, XMLELEMENT or XMLFOREST, and getName() joins the name parts into a new string each time. Both now compare the single name part.

Behaviour is unchanged, so there are no new tests. ExpressionPrecedenceTest pins stacked prefixes (not !1 = 1 deparses as NOT ! 1 = 1), DuckDBTest the chained signs, JsonExpressionRenderingTest the JSON operators, XmlForestTest the XML keywords and LikeExpressionTest the multi-word SIMILAR TO.

./gradlew jmh -PjmhProfiler=gc, alternating master (a075737) and this branch on the same machine. gc.alloc.rate.norm is bytes per parse:

The branch is 2.4% faster in both runs while the 5.4 control moves 2% either way, so the time difference is at the edge of what this benchmark resolves. The allocation difference is not in doubt.

The Condition() change edits the same lines as #2870, so whichever merges second has a small conflict to resolve. Both deques can then be created together at the first NOT or !.