'i ddlmZdZy)) Expressionctrtdr jtt j }t r|dz}|dk(rdn|dk(rdntd|zGfdd t}|| S) aWTurn a plain callable into an Expression. The callable can be of this simple form:: def foo(text, pos): '''If this custom expression matches starting at text[pos], return the index where it stops matching. Otherwise, return None.''' if the expression matched: return end_pos If there child nodes to return, return a tuple:: return end_pos, children If the expression doesn't match at the given ``pos`` at all... :: return None If your callable needs to make sub-calls to other rules in the grammar or do error reporting, it can take this form, gaining additional arguments:: def foo(text, pos, cache, error, grammar): # Call out to other rules: node = grammar['another_rule'].match_core(text, pos, cache, error) ... # Return values as above. The return value of the callable, if an int or a tuple, will be automatically transmuted into a :class:`~parsimonious.Node`. If it returns a Node-like class directly, it will be passed through unchanged. :arg rule_name: The rule name to attach to the resulting :class:`~parsimonious.Expression` :arg grammar: The :class:`~parsimonious.Grammar` this expression will be a part of, to make delegating to other rules possible __func__rTFz@Custom rule functions must take either 2 or 5 arguments, not %s.c&eZdZfdZfdZy)#expression..AdHocExpressionc r ||n |||| }t|tr|d}}nt|tr|\}}n|St|||||S)N)children) isinstanceinttupleNode) selftextposcacheerrorresultendr callablegrammar is_simples N/var/www/br/venv/lib/python3.12/site-packages/parsimonious/adhoc_expression.py_uncached_matchz3expression..AdHocExpression._uncached_match;sf-6htS)tS%@ &#& &XFE* & X dCx@ @c"djzS)Nz{custom function "%s"})__name__)rrs r_as_rhsz+expression..AdHocExpression._as_rhsHs+h.?.?? ?rN)r __module__ __qualname__rr)rrrsrAdHocExpressionr :s A @rr")name) ismethoddescriptorhasattrrlengetfullargspecargsismethod RuntimeErrorr)r rule_namernum_argsr"rs` ` @r expressionr-sR(#*(E$$>(+001HA 1} Q 02:;< <@@*@"  **rN) expressionsrr-rrr0s#I+r