'i6ddlmZddlmZmZddlmZmZmZm Z m Z m Z m Z m Z mZmZddlmZmZddlmZGddeZGdd eZGd d eZGd d eZGddeZGddeZy))TestCase) ParseErrorIncompleteParseError) LiteralRegexSequenceOneOfNot QuantifierOptional ZeroOrMore OneOrMore Expression)Grammar rule_grammar)Nodec@eZdZdZdZdZdZdZdZdZ dZ d Z y ) LengthTestszTests for returning the right lengths I wrote these before parse tree generation was implemented. They're partially redundant with TreeTests. cL|dn|j|jz }||k(sJy)zReturn whether the match lengths of 2 nodes are equal. Makes tests shorter and lets them omit positional stuff they don't care about. N)endstart)selfnodelength node_lengths T/var/www/br/venv/lib/python3.12/site-packages/parsimonious/tests/test_expressions.pylen_eqzLengthTests.len_eqs*#ld4::0E f$$$cZ|jtdjddd|jtdjdd|j t tdjd|jtdd jd dy) Nhelloehellozhello*hellooogoodbyeT) ignore_caseHELLO)rrmatchr assertRaisesrrs r test_regexzLengthTests.test_regexs{ GG$**8Q7; E(O)))4a8 *eHo&;&;YG E't4::7CQGrc |jttdtdtdj dd|j t ttdtdtdjd|jttdj ddd y) Nzhi*loz.ingohiiiilobingo1234 hiiiilobingz>hiiiir"r#)rrrrr)r*rr+s r test_sequencezLengthTests.test_sequence#s HU5\74=%.IOOPbcegh *huU|WT]/4W~'??Dum U HU5\*001=qArc r|jttdtdjdd|jttdtdjdd|j t ttdtdjdy)Naaabbbbaaaaa)rr rr)r*rr+s r test_one_ofzLengthTests.test_one_of)sz E'%.'$-8>>uEqI E'%.'$-8>>wGK *eGENGDM&J&P&PRVWrc|jttdjdd|j t ttdjdy)N.rHi)rr rr)r*rr+s rtest_notzLengthTests.test_not.sC Cc O))"-q1 *c%*o&;&;TBrc |jtttdtdj dd|jtttdtdj dd|jttdj dd|jttdj ddy) Nabr"abr8r9r5r)rrr rr)r+s r test_optionalzLengthTests.test_optional2s HXgcl3WS\BHHMqQ HXgcl3WS\BHHNPQR HWS\*006: HWS\*006:rc|jttdjdd|jttdjdd|jt djdd|jtt djddy)NrBr=rbbbr6^)rr rr)rr+s rtest_zero_or_morezLengthTests.test_zero_or_more8s Jws|,2226: Jws|,22591= E#J$$R(!, JuSz*004a8rcN|jttdjdd|jttdjdd|jttddjdd|jt tdddjdd |jt tdddjd d|j t ttddjd |j t t tdddjd |jttd jd d y)NrBr"rFr6)minr#)rJmaxbbbbbbbbbbr5rGr)rrrr)r r*rrr+s rtest_one_or_morezLengthTests.test_one_or_moreAs! Igcl+11#6: Igcl+11%8!< Igcl288?C Jws|:@@H!L Jws|:@@JAN *i !&D&J&JDQ *j1!&L&R&RTXY IeCj)//5q9rN) __name__ __module__ __qualname____doc__rr,r2r:r?rDrHrOrrrr s3%H B X C; 9:rrc4eZdZdZdZdZdZdZdZdZ y) TreeTestszTests for building the right trees We have only to test successes here; failures (None-returning cases) are covered above. c xtdd}|j|jdt|dddy)zATest that leaf expressions like ``Literal`` make the right nodes.r greetingnamerr#N)r assertEqualr)r)rhs rtest_simple_nodezTreeTests.test_simple_nodeTs2 G* - )47Aq+ABrcttddtddd}d}|j|j|t ||dd t |j d|dd t |j d |d d g y )z@Assert that ``Sequence`` produces nodes with the right children.heigh greeting1rYho greeting2dwarfheighhorr%r#r"childrenN)rrr[r)rmembers)rstexts rtest_sequence_nodeszTreeTests.test_sequence_nodesYs WW;7T;7g G Qad199UV D)4dAq a$1 -L/,0 1rN) rPrQrRrSr]rjr:rDrurxrTrrrVrVLs)C h. CC 1rrVceZdZdZdZy) ParseTestsz Tests for the ``parse()`` methodcttddd}d}|j|j|t ||ddt |j d|ddt |j d|ddg y ) zMake sure ``parse()`` returns the tree on success. There's not much more than that to test that we haven't already vetted above. rArlrYmorer9rr8r"reN)rrr[parserrgrqs rtest_parse_successzParseTests.test_parse_successsv51? D)4dAq a$1 - a$1 -L/,0 1rN)rPrQrRrSr~rTrrrzrzs * 1rrzc4eZdZdZdZdZdZdZdZdZ y) ErrorReportingTestsz Tests for reporting parse errorscRtd}d} |j|y#t$r|}|j|jd|j|j |d|j|j ||jt|dYd}~yd}~wwxYw)zMake sure ``parse()`` fails and blames the rightward-progressing-most named Expression when an Expression isn't satisfied. Make sure ParseErrors have nice Unicode representations. z bold_text = open_parens text close_parens open_parens = "((" text = ~"[a-zA-Z]+" close_parens = "))" ((fred!! close_parensz @ W%IJK= ? W%KLM? ArcL|jttddy)z Make sure there are no surrounding parens around the entire right-hand side of an expression (as they're unnecessary). zfoo = ("foo" ("bar" "baz"))zfoo = 'foo' ('bar' 'baz')Nrr+s rtest_unicode_surrounding_parensz3RepresentationTests.test_unicode_surrounding_parens-s" W%BCD4 6rN)rPrQrRrSrrrrrTrrrrs?% !AF6rrceZdZdZdZy) SlotsTestszTests to do with __slots__cGddt}|}|j|ji|j|jdy)aMake sure a subclass of a __slots__-less class can introduce new slots itself. This isn't supposed to work, according to the language docs: When inheriting from a class without __slots__, the __dict__ attribute of that class will always be accessible, so a __slots__ definition in the subclass is meaningless. But it does. ceZdZdgZdZy))SlotsTests.test_subclassing..Smoosmoocd|_y)Nr)rr+s r__init__z2SlotsTests.test_subclassing..Smoo.__init__Js " rN)rPrQrR __slots__rrTrrSmoorGsI #rrrN)r r[__dict__r)rrrs rtest_subclassingzSlotsTests.test_subclassing:s? #: # v + F+rN)rPrQrRrSrrTrrrr7s $,rrN)unittestrparsimonious.exceptionsrrparsimonious.expressionsrrrr r r r r rrparsimonious.grammarrrparsimonious.nodesrrrVrzrrrrTrrrssD___6#>:(>:B4141t11"_c(_cD;6(;6|,,r