eiAdZddlmZmZmZmZddlZddlmZm Z ddl m Z m Z ddl mZeZdZd ZGd d eZGd d eZGddeZGddeZGddeZGddeZGddeZGddeZGddeZGddeZGddeZGd d!eZdS)"zESubexpressions that make up a parsed grammar These do the parsing. )getfullargspec isfunctionismethodismethoddescriptorN) ParseErrorIncompleteParseError)Node RegexNode) StrAndReprcbtttg}tfd|DS)Nc&g|] }|Sr).0 criterionvalues o/var/www/html/volatility/venv/lib/python3.11/site-packages/ccxt/static_dependencies/parsimonious/expressions.py zis_callable..s#;;;Y %  ;;;)rrrany)rcriterias` r is_callablers3H&89H ;;;;(;;; < <.AdHocExpressionc r ||n|||| }t|tr|d}}nt|tr|\}}n|St|||||SNchildren) isinstanceinttupler ) selftextposcacheerrorresultendr"callablegrammar is_simples r_uncached_matchz3expression..AdHocExpression._uncached_matchQs-6AhhtS)))htS%@@ &#&&  &XFE**  & XX dCx@@@ @rcdjzS)Nz{custom function "%s"})__name__)r&r-s r_as_rhsz+expression..AdHocExpression._as_rhs^s+h.?? ?rN)r2 __module__ __qualname__r0r3)r-r.r/srAdHocExpressionrPs_ A A A A A A A @ @ @ @ @ @ @rr6name) rhasattrrlenrargsr RuntimeError Expression)r- rule_namer.num_argsr6r/s` ` @r expressionr@sR(##%*(E(E%$>(++011HA 1}} Q 02:;<< <@@@@@@@@@*@@@" ? * * **rcbeZdZdZddgZddZdZdZdZdd Z dd Z d Z d Z dZ dZdZdS)r=z3A thing that can be matched against a piece of textr8identity_tuplec.||_|jf|_dSN)r8rB)r&r8s r__init__zExpression.__init__ms #ymrc*t|jSrE)hashrBr&s r__hash__zExpression.__hash__qsD'(((rcLt||jo|j|jkSrE)r# __class__rBr&others r__eq__zExpression.__eq__ts$%00`T5HEL`5``rc||k SrErrMs r__ne__zExpression.__ne__wsEM""rrc|||}|jt|krt||j||S)zReturn a parse tree of ``text``. Raise ``ParseError`` if the expression wasn't satisfied. Raise ``IncompleteParseError`` if the expression was satisfied but didn't consume the full string. )r()matchr,r:r )r&r'r(nodes rparsezExpression.parsezsEzz$Cz(( 8c$ii  &tTXt<< < rc\t|}|||i|}|||S)aReturn the parse tree matching this expression at the given position, not necessarily extending all the way to the end of ``text``. Raise ``ParseError`` if there is no match there. :arg pos: The index at which to start matching )r match_core)r&r'r(r*rTs rrSzExpression.matchs74  tS"e44 <K rct|}|||ft}|tur|||||x}|||f<|6||jkr+|jst |jdd||_||_|S)aInternal guts of ``match()`` This is appropriate to call only from custom rules or Expression subclasses. :arg cache: The packrat cache:: {(oid, pos): Node tree matched by object `oid` at index `pos` ...} :arg error: A ParseError instance with ``text`` already filled in but otherwise blank. We update the error reporting info on this object as we go. (Sticking references on an existing instance is faster than allocating a new one for each expression that fails.) We return None rather than raising and catching ParseErrors because catching is slow. Nr8)idgetMARKERr0r(r8getattrexpr)r&r'r(r)r*expr_idrTs rrWzExpression.match_cores@T((yy'300 6>>+/+?+?@C@E@E,G,G GD5'3( >F EJEI rcLd|jjd|dS)N< >)rLr2as_rulerIs r__str__zExpression.__str__s+ N # # # LLNNNN rc|}|dr|dr |dd}|jr |jd|n|S)zReturn the left- and right-hand sides of a rule that represents me. Return unicode. If I have no ``name``, omit the left-hand side. ()rz = )r3strip startswithendswithr8)r&rhss rrczExpression.as_rulesp llnn""$$ >>#   3<<#4#4 ad)C26)Ddiii--Drc$d|jDS)zReturn an iterable of my unicode-represented children, stopping descent when we hit a named node so the returned value resembles the input rule.cDg|]}|jp|Sr)r8r3)rms rrz/Expression._unicode_members..s'>>>A&199;;>>>r)membersrIs r_unicode_memberszExpression._unicode_memberss?>>>>>rct)zfReturn the right-hand side of a rule that represents me. Implemented by subclasses. )NotImplementedErrorrIs rr3zExpression._as_rhss "!rNrC)r)r2r4r5__doc__ __slots__rFrJrOrQrUrSrWrdrcrqr3rrrr=r=ds== )*I,,,,)))aaa###        222h E E E??? """""rr=c6eZdZdZdgZdfd ZdZdZxZS)LiteralzFA string literal Use these if you can; they're the fastest. literalrCcxtt||||_||f|_dSrE)superrxrFryrB)r&ryr8rLs rrFzLiteral.__init__s: gt%%d+++ #Worc ||j|r't||||t|jzSdSrE)rjryr r:)r&r'r(r)r*s rr0zLiteral._uncached_matchsJ ??4< - - BdCs4z/Regex._regex_flags_from_bits..+s<aa1Q$>uQU||Baaaaaarr)joinranger:)r&rrs `@r_regex_flags_from_bitszRegex._regex_flags_from_bits(sMwwaaaaaaQTUZQ[Q[^_Q_H`H`aaaaaarc|d|jj||jjS)Nz~{!r}{})formatrrrrrIs rr3z Regex._as_rhs-s8 $ ; ;DGM J JLL Lr)rCFFFFFFF) r2r4r5rurvrFr0rr3rrs@rrr s ICHUZ 3 3 3 3 3 3bbb LLLLLLLrrc4eZdZdZdgZfdZdZdZxZS)Compoundz7An abstract expression which contains other expressionsrpctt||dd||_dS)z)``members`` is a sequence of expressions.r8rCN)r{rrFrZrp)r&rpkwargsrLs rrFzCompound.__init__7s: h&&vzz&"'='=>>> rc8t|j|jfSrE)rHrLr8rIs rrJzCompound.__hash__<sT^TY/000rclt||jo|j|jko|j|jkSrE)r#rLr8rprMs rrOzCompound.__eq__Bs8 udn - - * I # * LEM ) +r) r2r4r5rurvrFrJrOrrs@rrr2scAA I 111 +++++++rrceZdZdZdZdZdS)SequencezA series of expressions that must match contiguous, ordered pieces of the text In other words, it's a concatenation operator: each piece has to match, one after another. c|}d}g}|jD]M}|||||} | dS|| | j| jz } || z }|| z }Nt |||||z|SNr)rprWappendr,startr ) r&r'r(r)r*new_poslength_of_sequencer"rorTlengths rr0zSequence._uncached_matchQs ) )A<<gue<)>)@)@AABBBrNr2r4r5rur0r3rrrrrIsD I I ICCCCCrrceZdZdZdZdZdS)OneOfzA series of expressions, one of which must match Expressions are tested in order from first to last. The first to succeed wins. c|jD]8}|||||}|t||||j|gcS9dSr rprWr r,)r&r'r(r)r*rorTs rr0zOneOf._uncached_matchksf H HA<<c5%88DD$TXGGGGGG  H Hrcvdd|S)Nrz / rrIs rr3z OneOf._as_rhsrs,v{{4+@+@+B+BCCDDDrNrrrrrrdsD HHHEEEEErrceZdZdZdZdZdS) LookaheadzSAn expression which consumes nothing, even if its contained expression succeedsct|jd||||}|t||||SdSrrprWr r&r'r(r)r*rTs rr0zLookahead._uncached_match~sC|A))$UEBB  dC-- -  rc<d|dzS)Nz&%srrqrIs rr3zLookahead._as_rhs--//222rNrrrrrrvs<... 33333rrceZdZdZdZdZdS)NotzAn expression that succeeds only if the expression within it doesn't In any case, it never consumes any characters; it's a negative lookahead. ct|jd||||}|t||||SdSrrrs rr0zNot._uncached_matchsC|A))$UEBB <dC-- - rsMLLLLLLLLLLL 88888888"""""""" === I+I+I+XC"C"C"C"C"C"C"C"L"""""j"""*888887888%L%L%L%L%LJ%L%L%LP+++++z+++.CCCCCxCCC6EEEEEHEEE$33333333"33333(333* 3 3 3 3 3x 3 3 3"33333333$ 3 3 3 3 3 3 3 3 3 3r