iY SrSSKrSSKrSSKrSSKJrJrJr SSKJrJ r SSK J r SSK J r SSKJr SSKJrJrJrJr SS KJr SS KJr SS KJrJrJr SS KJ r J!r! SS K"J#r#J$r$ SSK%J&r&J'r'J(r( SSK)J*r*J+r+ SSK,J-r- SSK.J/r/ SSK0J1r1 SSK2J3r3 SSK4J5r5 SSK6J7r7J8r8J9r9J:r: SSK;Jr>J?r? SSK@JArA SSKBJCrCJDrDJErEJFrF SSKGJHrH SSKIJJrJ \"S5rK\1"S5rLS\MS\N4S jrO"S!S"5rP"S#S$5rQSSSS%.S&jrRSSS'.S(jrS"S)S*\T5rU\"S+S+S,9"S-S.55rV"S/S0\US19rW\"S+S2S,9"S3S455rX\R"5rZ"S5S6\E5r["S7S8\E\C5r\"S9S:\\\C5r]S;\\\CS\E\C4S<jr^\"S+S+S,9"S=S>\\C55r_S?\KS\_\K4S@jr`SAraSBrbSCrcSDrdSEre\SF\_\C\C-4rf\\f\C/\f\C4rgSG\S\h4SHjri\SFSI.SJ\\\\CSKSSL\ES\g\C4SMjj5rj\SFSN.SK\\\CSJ\PSL\ES\g\C4SOjj5rj\SFSFSP.SKSSJ\PSL\ES\\SQ/\SQ44SRjj5rjSSSST.SJ\\\\C\P-SK\\\CS-SL\ES\g\C\\SQ/\SQ4-4SUjjrj\SFSI.SJ\\\\CSKSSL\ES\g\C4SVjj5rk\SFSN.SK\\\CSJ\PSL\ES\g\C4SWjj5rk\SFSFSP.SKSSJ\PSL\ES\\SQ/\SQ44SXjj5rkSSSST.SJ\\\\C\P-SK\\\CS-SL\ES\g\C\\SQ/\SQ4-4SYjjrk\"S+S+S,9"SZS[55rlS\\\/\N4S\\#/\#44S]jrm\"S+S+S,9"S^S_55rnS2S`.Sa\NS\\#/\#44Sbjjro"ScSd\E5rpg)eaThis module provides support for a stateful style of testing, where tests attempt to find a sequence of operations that cause a breakage rather than just a single value. Notably, the set of steps available at any point may depend on the execution to date. N)CallableIterableSequence) dataclassfield) lru_cache)StringIO) perf_counter)AnyClassVarTypeVaroverload)TestCase) strategies) HealthCheck Verbositysettings)_current_build_contextcurrent_build_context)TestFuncgiven)FlakyStrategyDefinitionInvalidArgumentInvalidDefinition)add_notebatched) BUFFER_SIZE)gc_cumulative_time)calc_label_from_name)fail_health_check)observability_enabled)function_digestget_pretty_function_descriptionnicereprproxies) check_type)current_verbosityreport)FeatureStrategy)Ex OneOfStrategySearchStrategycheck_strategy)note_deprecation)RepresentationPrinterTzanother state machine stepobjreturnc[U[5(aSUs=::aS::ag [U[5=(d USL$)za Returns True if two separately created instances of v will have the same id (due to interning). TN) isinstanceintbool)r1s R/var/www/html/ai-image-ml/venv/lib/python3.13/site-packages/hypothesis/stateful.py _is_singletonr:Cs=#sc 0S 0!1 c4 /C4K/c\rSrSrSrSrg)_OmittedArgumentQziSentinel class to prevent overlapping overloads in type hints. See comments above the overloads of @rule.N)__name__ __module__ __qualname____firstlineno____doc____static_attributes__r?r;r9r=r=Qs%r;r=c*\rSrSrSSjrSrSrSrg)TestCasePropertyVNc>Ub [U5nUR5$N)type _to_test_case)selfr1typs r9__get__TestCaseProperty.__get__Ws ?s)C  ""r;c[S5e)NzCannot set TestCaseAttributeError)rMr1values r9__set__TestCaseProperty.__set__\s233r;c[S5e)NzCannot delete TestCaserR)rMr1s r9 __delete__TestCaseProperty.__delete___s566r;r?rJ)r@rArBrCrOrUrXrEr?r;r9rGrGVs# 47r;rGr _min_steps _flaky_statec2^^^^Tc(TRRm[[TS5 [[TS5 [[TS5 TS:a[STS35eT=(d 0mT[[R"55UUUU4Sj55n[T5URRl[!TS S5Ul[!TS S5UlS UlU$![a [S[ [ 5S9mNf=f) Nz'state_machine_factory.TestCase.settingsdeadlinesuppress_health_checkrr[rz _min_steps=z must be non-negative.c  >^^URmT"5n[[US5 UTlTRUl[ 5R =(d [5[R:m/Tl UU4SjnU"SURRS35 URTUTR5 TRnSnTR!["5 SnXC:aSnO"UT::aSnOTR$S[&-:aSn[)5n[+5nTR-S US 9(aGOUS - nSTS 'UR.(aUR.Vs/sHLn[0R2"[0R4"U5[0R6"UR855PMN n nTR;[0R<"U 55upUR.R?U5 OTR;UR@5upSTS 'S URBR3n TRDRGU S5 [+5U- n TRDU ==[)5U- U - - ss'T(d[I5(a3URK5V V s0sHupXRMU 5_M nn n [O5n[QU5n[SURK55Hup[UU [V5(aURXU RZX 'M7[UU [R5(dMN[]SU 55(dMgU Vs/sHnURXURZPM snX 'M SURBR3n[)5n[+5nURB"U40UD6n[+5U- n TRU==[)5U- U - - ss'UR^(aZ[UU[`5(a'URcUR^URd5 OWURcUR^U/5 O9Ub6[gTSURBRhSU<3[jRl5 T(d[I5(aU"URoUWU55 URTUTR5 TRq5 GM:U"S5 URs5 gs snfs sn n fs snf!T(d[I5(aU"URoUWU55 ff=f!U"S5 URs5 f=f)Nzstate_machine_factory()c>T(a [U5 [5(aTRRU5 ggrJ)r(r!_stateful_repr_partsappend)scd print_stepss r9outputAget_state_machine_test..run_state_machine..outputs/q $&&''..q1'r;zstate = ()rTFg?g>)pforcedselecting_rulezgenerate:rule:gc3B# UHn[U[5v M g7frJr6 VarReference.0items r9 Dget_state_machine_test..run_state_machine..s9GHtJt\::qz execute:rule:z.run_state_machinevs ! !)>)@('3LM&,.,H,H) " # , , V0A0Cy0V #% 2 b  Xg//889< =  $ $Xvr7M7M N 44II 56 ) $I*, %IYY# "34!%I)^ -/??VI?>Q 26 -.33%,$D$D"$DD "''$-1F1Ft~~1VW$D""$:)>!?JD44;;DA!#)@)@!AJD16 -.-dmm.D.D-EF  ((S9.08;  j)\^j-H9-TT) "7"9"9@D %@L0033 "% ""P:D $TZZ\ 2%a66&-&=&=aff&EDG'400S9GH966WX&XVWdw'>'>tyy'IVW&XDG !3,DMM,B,B+CDE(NE13H!]]7;d;F 2 4x ?I**51\^e5Ki5WW1||%fo>>#;;DLL&--X#;;DLL6(S+)$##'==#=#=">j T'44 #&;&=&=w11$ vNO((62;Q;QR sv % &    A"&%'Y,#&;&=&=w11$ vNO '> % &    sfC!U)&AT$9C7U)0T) U)A.T4 T4&T4*#T/ DT4,AU)$ U)/T442U&&U))V_hypothesis_internal_use_seed*_hypothesis_internal_use_reproduce_failureF)rrr&SettingsrSrrr7rrrrr" hypothesis inner_test_hypothesis_internal_add_digestgetattrrr%_hypothesis_internal_print_given_args)rrr[r\rs```` r9get_state_machine_testrcs"  X,55>>H x+T Ux:.sJ -A~ J<7MNOO%2L  2779ttp -.  ++K7>>73DKKTD@?D; ] XT+EVWH Xs'C22!DD)rr[cSS0n[UUUUS9nU"5 g![anUS(a [US5 eSnAff=f)a\Run a state machine definition as a test, either silently doing nothing or printing a minimal breaking program and raising an exception. state_machine_factory is anything which returns an instance of RuleBasedStateMachine when called with no arguments - it can be a class or a function. settings will be used to control the execution of the test. rnFrZzwwhile selecting a rule to run. This is usually caused by a flaky precondition, or a bundle that was unexpectedly empty.N)rrr)rrr[ flaky_statestate_machine_testerrs r9run_state_machine_as_testrs_$U+K/   " ' ( Q  s A;Ac(^\rSrSrU4SjrSrU=r$)StateMachineMetaic >US:Xab[U[5(aMSUR5S3n[SURSUSURSUSURS 3 5e[ TU]X5$) Nr settings()z Assigning z .settings = z does nothing. Assign to .TestCase.settings, or use @ as a decorator on the  class.)r6r show_changedrSr@super __setattr__)clsrrTdescrrs r9rStateMachineMeta.__setattr__s : *UH"="= 2 2 45Q7E S\\N,ug>ll^#?wG,,w0  w"4//r;r?)r@rArBrCrrE __classcell__rs@r9rrs 00r;rT)slotsfrozencF\rSrSr%\S\S'\S\S'\S\S'Srg) _SetupStatei$Rulerules Invariant invariants initializersr?N)r@rArBrCr__annotations__rEr?r;r9rr$s! <[!!v,r;rc\rSrSr%Sr0r\\\\ 4\ S'SSjr Sr Sr S rS \S\\4S jrS r\S 5rSSS\S\S\4SjrSrSrSr\"5r\\S55rSrg)rzi+aA RuleBasedStateMachine gives you a structured way to define state machines. The idea is that a state machine carries the system under test and some supporting data. This data can be stored in instance variables or divided into Bundles. The state machine has a set of rules which may read data from bundles (or just from normal strategies), push data onto bundles, change the state of the machine, or verify properties. At any given point a random applicable rule will be executed. _setup_state_per_classr2Nc UR5nUR(d"[S[U5RS35e[ [ [U55RS5=n[5(aA[U5RnSUR5S3n[SUSUSUS US 3 5eURUlURUl URR5Ul 0Ul[R "5Ul/Ul0Ul[)5Ul[-UR*[.R0S 9Ul[5U5Ulg) NzState machine z defines no rulesrrrzAssigning settings = z. as a class attribute does nothing. Assign to rrr)context) setup_staterrrKr@r6varsgetrrrrcopyrbundles collectionsCounternames_counters names_listrr _RuleBasedStateMachine__streamr/rrT_RuleBasedStateMachine__printer RuleStrategyr)rMrretnamers r9__init__RuleBasedStateMachine.__init__8sP&&(   # d!4!4 55FG  4T +// ;;aX F FJ''E 013E#'w/"G#?wG)  !&& %00(3(@(@(E(E(G%(* 3>3F3F3H%'/1  . MM#9#?#?  ,D1r;c[U[5(a UR$[U[5(aH[ SU55(a1SSR UVs/sHo"RPM sn5-S-$UR RS5 UR RS5 SURl SURl URRR5 URRU5 URR5 UR R!5$s snf)Nc3B# UHn[U[5v M g7frJrprrs r9ru6RuleBasedStateMachine._pretty_print..Zs- 7'?qAAr;cUSURU3nURU==S- ss'URRU5 U$)N_rm)rrrd)rMtargetrs r9 _new_nameRuleBasedStateMachine._new_namejsK81T0089: F#q(# v& r;nc\[UR5nX!:deURX!- S$rJ)lenr)rMrlen_s r9 _last_names!RuleBasedStateMachine._last_namesps-4??#yytxz**r;c:URRU/5$rJ)rr)rMrs r9bundleRuleBasedStateMachine.bundleus||&&tR00r;cURU$![a Of=f/n/n/n[R"U5HupE[ U[ S5n[ U[ S5n[ U[S5nUbURU5 UbURU5 UbURU5 [ U[S5cMUbMUbM[[U5S35e [XUS9n XRU'U $)Nz has been decorated with @precondition, but not @rule (or @invariant), which is not allowed. A precondition must be combined with a rule or an invariant, since it has no effect alone.)rrr) rKeyErrorinspect getmembersr RULE_MARKERINITIALIZE_RULE_MARKERINVARIANT_MARKERrdPRECONDITIONS_MARKERr_rule_qualnamer) rrrr_namefr initializer invariantstates r9r!RuleBasedStateMachine.setup_statexs --c2 2   #% &( **3/HE1k40D!!%;TBK#3T:I T"&##K0$!!),/6BL%'%a()*44!0.z +0""3' s  rrrrcVSn/nUR(Ga5[U[5(a[UR5OSn[UR5U-nUR U5n[U[5(a[UR5S:Xa+UV s/sH n SU S3PM n n SR U 5S-nOUR(aa[[X55n SR U S5n U S-nU SSH+n SR U 5nURUS-U -5 M- OSR U5S-nSR SUR555nUS URRSUS 3nS R U/U-5$s sn f) Nrmrz,)z = rrc34# UHupUSU3v M g7f)=Nr?)rsrrs r9ru3RuleBasedStateMachine._repr_step..s= A3as sstate.r ) rr6rrrrrrrrdrrr@)rMrrroutput_assignmentextra_assignment_linesnumber_of_resultsnumber_of_last_names last_namesroutput_per_targetnames_per_targetfirst_target_outputother_target_namesother_target_outputargs output_lines r9r RuleBasedStateMachine._repr_steps!# <<<&0&I&IFMM"q $'t||#47H#H ))*>?J&/22v}}%*BL(M*$1TF"*%(M(- 3D(E(M%]](,GJ,R'S$*.))4DQ4G*H'(;e(C%.>qr.B*.2ii8J.K+.55/%7:MM/C %*JJz$:U$B!yy= ==*+6$--2H2H1I4&PQR yy+)??@@%)NsF&cXUHnUHnURU5nU4Sjn[U5(d/URRR [ U5U5 X@R U'URR U/5R[U55 M M g)Nc$URU5$rJ)text)r1rkcyclers r9printer>RuleBasedStateMachine._add_results_to_targets..printers66$<'r;) r r:rsingleton_pprintersridrrrdrq)rMrresultsr rrr>s r9r-RuleBasedStateMachine._add_results_to_targetssF!~~f-04( %V,,NN66AA"V*gV-3$$T* ''3::<;MN"r;c x^TRGH(nTR(aUR(dM([U4SjUR55(dMNUR R n[5R(d-UR[R:d[5(a U"SUS35 [5nUR T5nUSU3==[5U- - ss'UcM[USUR RSU<S3[ R"5 GM+ g)Nc32># UH o"T5v M g7frJr?)rsprecondrMs r9ru9RuleBasedStateMachine.check_invariants..sH4Gwt}}4Gsr+rjzexecute:invariant:z9The return value of an @invariant is always ignored, but rxz instead of None)rrcheck_during_initr preconditionsrr@rr} verbosityrr~r!r r rBrr)rMrrhruntimesinvarrrrs` r9r&RuleBasedStateMachine.check_invariantss__E,,U5L5LHE4G4GHHH>>**D%'00%%8(**vR() NE^^D)F )$0 1\^e5K K 1!!O~~223:fZH&& ,, !%r;cg)zeCalled after a run has finished executing to clean up any necessary state. Does nothing by default. Nr?rs r9rRuleBasedStateMachine.teardownsr;c|^"U4SjS[5nTRS-UlTRS-UlU$)NcZ>\rSrSr\"S\"\5S9rU4SjrS\l Y\l Sr g)ARuleBasedStateMachine._to_test_case..StateMachineTestCaseiNr^c.>[TURS9 g)N)r)rr)rMrs r9runTestIRuleBasedStateMachine._to_test_case..StateMachineTestCase.runTests)# Fr;Tr?) r@rArBrCrrrrrTis_hypothesis_test_hypothesis_state_machine_classrE)rsr9StateMachineTestCaserRs,T+EVWH G*.G &69G 3r;rXz .TestCase)rr@rB)rrXs` r9rL#RuleBasedStateMachine._to_test_cases= :8 :), {(B%,/,<,<{,J)##r;) __printer__streamrrrrrrrr)r2N) r@rArBrCrDrr rrKrrrrrr r7rstrrr classmethodrr rrrrrGrrrLrEr?r;r9rzrz+sACHT$ *;%<=B2>( B +S+T#Y+ 1%%NAvASA#A#A@O 2  !H $ $r;rz) metaclassFc\rSrSr%\\S'\\S'\\S'\\S'\"SS9r\S\S '\"SS S 9r \ S -\S '\"SS S 9r \ S -\S '\"S\ S9r\ \\4\S'SrS\ 4SjrSrSrg )rirrrrIF)init)Bundle.rN)r`default _cached_hash _cached_repr)r`default_factoryarguments_strategiesc^/n[URR55Htup#[U[5(ae[U[ 5(a5UR U5 [U[5n[ URUS9nX0RU'Mv [U5Ul gNconsume) sortedrrr6BundleReferenceStrategyrardBundleConsumerrrftupler)rMrrrrjs r9 __post_init__Rule.__post_init__s4>>//12DA!!%<== ==!V$$q!$Q7+AFFGD+, % %a ( 3W~ r;r2c xURc[R"U5Vs/sHLn[XR5(dMURS[ [XR553PMN nnUR RSSRU5S3UlUR$s snf)Nr)rrr) rd dataclassesfieldsrrr#rr@r)rMrbitss r9r Rule.__repr__s    $)//56E4,P5::,a2743LMNP5  $(>>#:#:";1TYYt_L#*>$%>L#*>+0eT+R$sCx.R & !# ! !r;rcB^\rSrSrSS.S\S\4U4SjjjrSrSrU=r $) rli7Frirrjc:>[TU]5 XlX lgrJ)rrrrj)rMrrjrs r9r BundleReferenceStrategy.__init__8s   r;cFUR[5nURUR5nU(dUR SUR<35 UR S[ U5S- [ U5S9nUR(aURU5$X4$)NzCannot draw from empty bundle rrm)shrink_towards) r self_strategyrr mark_invalid draw_integerrrjpop)rMrrrpositions r9do_drawBundleReferenceStrategy.do_draw=s))M* *    >tyymL M$$QF aF $T <<::h' '# #r;)rjr) r@rArBrCr\r8rrrErrs@r9rlrl7s(5:Sd $ $r;rlc t^\rSrSrSrSSS.S\S\S\S S 4U4S jjjrS rS r Sr Sr U4Sjr Sr SrU=r$)raiLaA collection of values for use in stateful testing. Bundles are a kind of strategy where values can be added by rules, and (like any strategy) used as inputs to future rules. The ``name`` argument they are passed is the they are referred to internally by the state machine; no two bundles may have the same name. It is idiomatic to use the attribute being assigned to as the name of the Bundle:: class MyStateMachine(RuleBasedStateMachine): keys = Bundle("keys") Bundles can contain the same value more than once; this becomes relevant when using :func:`~hypothesis.stateful.consumes` to remove values again. If the ``consume`` argument is set to True, then all values that are drawn from this bundle will be consumed (as above) when requested. FTrjdraw_referencesrrjrr2NcV>[TU]5 Xl[XS9UlX0lgrh)rrrrl_Bundle__reference_strategyr)rMrrjrrs r9rBundle.__init__bs(  $;D$R!.r;cUR[5nURUR5nURUR$rJ)rrrrr)rMrr references r9rBundle.do_drawjs9))M*IId778 &&y~~66r;cURRnUSLaSUR<S3$SUR<SU<S3$)NFz Bundle(name=rz , consume=)rrjr)rMrjs r9rBundle.__repr__osG++33 e !$))a0 0dii]+WJa88r;cg)NFr?)rMrecurs r9 calc_is_emptyBundle.calc_is_emptyusr;c~UR[5n[URUR55(+$rJ)rrr8rr)rMrrs r9is_currently_emptyBundle.is_currently_emptyys-))M*tyy1222r;c>UR(a>[U5"URURRSS9R U5$[ TU]U5$)NFr)rrKrrrjflatmapr)rMexpandrs r9rBundle.flatmapsR   : 1199 %gfo   wv&&r;c0[SUR45$)Nra)rwrrs r9rxBundle.__hash__s Xtyy)**r;)__reference_strategyrr)r@rArBrCrDr\r8rrrrrrrxrErrs@r9raraLs\,-24//%)/DH/ //7 9 3'++r;rac:^\rSrSrS\\SS4U4SjjrSrU=r$)rmirr2Nc6>[TU]URSS9 g)NTri)rrr)rMrrs r9rBundleConsumer.__init__s d3r;r?) r@rArBrCrar*rrErrs@r9rmrms4vbz4d44r;rmrcX[U[5(d [S5e[U5$)aWhen introducing a rule in a RuleBasedStateMachine, this function can be used to mark bundles from which each value used in a step with the given rule should be removed. This function returns a strategy object that can be manipulated and combined like any other. For example, a rule declared with ``@rule(value1=b1, value2=consumes(b2), value3=lists(consumes(b3)))`` will consume a value from Bundle ``b2`` and several values from Bundle ``b3`` to populate ``value2`` and ``value3`` each time it is executed. z)Argument to be consumed must be a bundle.)r6ra TypeErrorrm)rs r9consumesrs( ff % %CDD & !!r;c0\rSrSr%\\S4\S'SrSrg)ri.rc,[UR5$rJ)iterrrs r9__iter__MultipleResults.__iter__sDKK  r;r?N) r@rArBrCrnr*rrrEr?r;r9rrs "c'N!r;rr7c[U5$)aThis function can be used to pass multiple results to the target(s) of a rule. Just use ``return multiple(result1, result2, ...)`` in your rule. It is also possible to use ``return multiple()`` with no arguments in order to end a rule without passing any result. )r)r7s r9rrs 4  r;c Ub'U(a[SU<SU<S/UQUP7<S35eU4n/nUHn[U[5(d4Sn[U[5(aUS- n[XC[ U54-5e[U[5(aR[U[ 5(a[ SURS3S S S S 9 URn[U[5(aMRURU5 M [U5$) z4Single validator and converter for target arguments.zPassing both targets=z and target=z is redundant - pass targets=z instead.zBGot invalid target %r of type %r, but all targets must be Bundles.z It looks like you passed `one_of(a, b)` or `a | b` as a target. You should instead pass `targets=(a, b)` to add the return value of this rule to both the `a` and `b` bundles, or define a rule for each target if it should be added to exactly one.zUsing consumes(z`) doesn't makes sense in this context. This will be an error in a future version of Hypothesis.z 2021-09-08F)since has_codemod stacklevel) rr6rar+rKrmr.rrdrn)rr converted_targetstmsgs r9_convert_targetsrs  !'{,vjI,,>g,>v,>+AL ) !V$$VC!]++6"#DG "45 5F##!^,, %affX.OO& % AF##   #-. " ##r;hypothesis_stateful_rule#hypothesis_stateful_initialize_rule!hypothesis_stateful_preconditionshypothesis_stateful_invariant.r!c>URRS5S$)Nz .)rBrsplit)r!s r9rrs >>  -b 11r;)r rr kwargsc grJr?rr rs r9rr r;)rc grJr?r rrs r9rrr;)r r).Nc grJr?rs r9rrrr;r?)rr c r^^[X5mTR5Hup4[XCS9 M UU4SjnU$)aDecorator for RuleBasedStateMachine. Any Bundle present in ``target`` or ``targets`` will define where the end result of this function should go. If both are empty then the end result will be discarded. ``target`` must be a Bundle, or if the result should be replicated to multiple bundles you can pass a tuple of them as the ``targets`` argument. It is invalid to use both arguments for a single rule. If the result should go to exactly one of several bundles, define a separate rule for each case. kwargs then define the arguments that will be passed to the function invocation. If their value is a Bundle, or if it is ``consumes(b)`` where ``b`` is a Bundle, then values that have previously been produced for that bundle will be provided. If ``consumes`` is used, the value will also be removed from the bundle. Any other kwargs should be strategies and values from them will be provided. rc>^[T[S5(a[[T5S35e[T[S5n[T[ S5nUb[[T5S35eUb[[T5S35e[T[ S5n[TTTUS9n[T5U4Sj5n[U[U5 U$)Nz} is used with both @rule and @invariant, which is not allowed. A function may be either a rule or an invariant, but not both.z; has been decorated with @rule twice, which is not allowed.J has been decorated with both @rule and @initialize, which is not allowed.r?rrrrIc>T"U0UD6$rJr?r7rr!s r9 rule_wrapper*rule..accept..rule_wrapperad%f% %r; rrrrrrrrr%setattrr! existing_ruleexisting_initialize_rulerIrrrrs` r9acceptrule..acceptEs 1& - -#!!$%&++   ;5 #*1.Dd#K  $#!!$%&  $ /#!!$%&55   #7< %'    &  &  k40r;rrr-rr rrrrrs ` @r9rr(s72)9 q!!F Mr;c grJr?rs r9 initializerlrr;c grJr?rs r9rrvrr;c grJr?rs r9rr}rr;c r^^[X5mTR5Hup4[XCS9 M UU4SjnU$)aDecorator for RuleBasedStateMachine. An initialize decorator behaves like a rule, but all ``@initialize()`` decorated methods will be called before any ``@rule()`` decorated methods, in an arbitrary order. Each ``@initialize()`` method will be called exactly once per run, unless one raises an exception - after which only the ``.teardown()`` method will be run. ``@initialize()`` methods may not have preconditions. rc>^[T[S5(a[[T5S35e[T[S5n[T[ S5nUb[[T5S35eUb[[T5S35e[T[ S5nU(a[[T5S35e[TTTUS9n[T5U4Sj5n[U[ U5 U$)Nz is used with both @initialize and @invariant, which is not allowed. A function may be either an initialization rule or an invariant, but not both.rzA has been decorated with @initialize twice, which is not allowed.r? has been decorated with both @initialize and @precondition, which is not allowed. An initialization rule runs unconditionally and may not have a precondition.rc>T"U0UD6$rJr?rs r9r0initialize..accept..rule_wrapperrr;rrs` r9rinitialize..accepts$ 1& - -#!!$%&66   ;5 #*1.Dd#K  $#!!$%&55  $ /#!!$%&((  #7< #!!$%&HH  %'    &  &  4d;r;rrs ` @r9rrs7)9 q!&P Mr;c \rSrSr%\\S'Srg)rqirr?N)r@rArBrCr\rrEr?r;r9rqrqs Ir;rqrFc^U4SjnU$)aaDecorator to apply a precondition for rules in a RuleBasedStateMachine. Specifies a precondition for a rule to be considered as a valid step in the state machine, which is more efficient than using :func:`~hypothesis.assume` within the rule. The ``precond`` function will be called with the instance of RuleBasedStateMachine and should return True or False. Usually it will need to look at attributes on that instance. For example:: class MyTestMachine(RuleBasedStateMachine): state = 1 @precondition(lambda self: self.state != 0) @rule(numerator=integers()) def divide_with(self, numerator): self.state = numerator / self.state If multiple preconditions are applied to a single rule, it is only considered a valid step when all of them return True. Preconditions may be applied to invariants as well as rules. c >^[T5U4Sj5n[T[S5nUb[[ T5S35e[T[ S5n[T[ S5nUb<Ube[R"U/URQTP7S9n[U[ U5 U$Ub<Ube[R"U/URQTP7S9n[U[ U5 U$[U[/[T[S5QTP75 U$)Nc>T"U0UD6$rJr?rs r9precondition_wrapper=precondition..decorator..precondition_wrapperrr;r)rIr?) r%rrrrrrrrreplacerIrr)r!rrrr#new_rule new_invariantrFs` r9 decoratorprecondition..decoratorsB  &  &$+1.Dd#K # /#!!$%&HH  q+t,A/6  $ $$"**$Bd&8&8$B'$BH (+x @$# "< <'//)L9+B+B)LG)LM (*:M J$# $$@'!126@@  $#r;r?)rFrs` r9 preconditionrs."$H r;cB\rSrSr%\\S'\\S'\\S'S\4SjrSr g) ri rrIrHr2cS[UR53SUR<3SUR<3/nSSR U5S3$)Nz function=zself.preconditions=zself.check_during_init=z Invariant(rr)r#rrIrHr)rMpartss r9rInvariant.__repr__s[7 FG H"t!!# $&t%%' (  DIIe,-Q//r;r?N) r@rArBrCr rr8r\rrEr?r;r9rr sM0#0r;r)rHrHc6^[[TS5 U4SjnU$)a<Decorator to apply an invariant for rules in a RuleBasedStateMachine. The decorated function will be run after every rule and can raise an exception to indicate failed invariants. For example:: class MyTestMachine(RuleBasedStateMachine): state = 1 @invariant() def is_nonzero(self): assert self.state != 0 By default, invariants are only checked after all :func:`@initialize() ` rules have been run. Pass ``check_during_init=True`` for invariants which can also be checked during initialization. rHch>^[T[S5(d[T[S5(a[[ T5S35e[T[ S5nUb[[ T5S35e[T[ S5n[TUTS9n[T5U4Sj5n[U[ U5 U$)NzI has been decorated with both @invariant and @rule, which is not allowed.z@ has been decorated with @invariant twice, which is not allowed.r?)rrIrHc>T"U0UD6$rJr?rs r9invariant_wrapper4invariant..accept..invariant_wrapper@rr;) rrrrrrrrr%r)r!existing_invariantrIrLrrHs` r9rinvariant..accept-s 1k4 ( (GA7Mt,T,T#!!$%&// %Q(8$?  )#!!$%&((  #7< '/   &  & !#3U;  r;)r&r8)rHrs` r9r#r#s&t&(;<!4 Mr;cF^\rSrSrS\SS4U4SjjrSrSrSrS r U=r $) riJrr2Nc>[TU]5 XlURR 5Ul[ R "[URVs1sHo"RRiM snS9SU4S9Ul URRSS9 [ R"UR5Ul gs snf)N)at_least_one_ofz enabled rules)keyc[UR5[UR5URR 4$rJ)rkrrrrr@)rs r9'RuleStrategy.__init__..]s,t||$DNN# &&r;)rrrrrrsharedr)rr@enabled_rules_strategysort sampled_fromrules_strategy)rMrrrs r9rRuleStrategy.__init__Ks  ]]'') &(ii $**,U*QZZ-@-@*,U V '*' #   !oodjj9%-VsC cvURRSURRRS3$)Nz (machine=z({...})))rr@rrs r9rRuleStrategy.__repr__es2..))*)DLL4J4J4S4S3TT^__r;c ^^ [U4SjTR55(d^SRTRVs/sHo"RRPM sn5nSTR <SU3n[ U5SeURTR5m U U4SjnURTRRU55n0nURR5HupxURU5Xg'M X&4$s snf![a3n URRn [U SU<SU<SU 35 eSn A ff=f) Nc3F># UHnTRU5v M g7frJ)is_valid)rsrrMs r9ru'RuleStrategy.do_draw..is>:44==&&:s!rz#No progress can be made from state z<, because no available rule had a True precondition. rules: c~>TRU5=(a% TRURR5$rJ)r  is_enabledrr@)r feature_flagsrMs r9rule_is_enabled-RuleStrategy.do_draw..rule_is_enabledss.==#U (@(@ATAT(U Ur;zwhile generating z from z for rule )anyrrrr@rrrrrfilterrfr Exceptionr) rMrrrrrrrstratrrnamer s ` @r9rRuleStrategy.do_drawhs7>4::>>>II$**M*$}}55*MNE5dll5EFBBGJ $C(d 2 $"="=>  Vyy,,33ODE 11779HA #yy/ :  9N0  .. 1!fUIZPUwWX sD 3D E.E  EcURH/nURRUR5(aM/ g URRnURR R SURRS3nURH?nU"UR5nUS[U53nX7RUS9 U(aM? g g)NFz, rule ,z precondition ) conditionT) rrrrr|rrBrr@rIr# update_count)rMrb predicatesdescpred meets_precondwheres r9r RuleStrategy.is_validsA<<&&qvv..\\;; ,,((556gdmm>T>T=UUVW&&D .MfN+J4+P*QRE   * *] * C = 'r;)rrrr) r@rArBrCrzrrrr rErrs@r9rrJs-: 5:$:4`!@r;r)qrDrrrrcollections.abcrrrrr functoolsrior timer typingr r r runittestrrrrhypothesis._settingsrrrrhypothesis.controlrrhypothesis.corerrhypothesis.errorsrrrhypothesis.internal.compatrr%hypothesis.internal.conjecture.enginer)hypothesis.internal.conjecture.junkdrawerr$hypothesis.internal.conjecture.utilsrhypothesis.internal.healthcheckr !hypothesis.internal.observabilityr!hypothesis.internal.reflectionr"r#r$r%hypothesis.internal.validationr&hypothesis.reportingr'r(,hypothesis.strategies._internal.featureflagsr)*hypothesis.strategies._internal.strategiesr*r+r,r-hypothesis.utils.deprecationr.hypothesis.vendor.prettyr/r0robjectr8r:r=rGrrrKrrrzrrunnerrrlrarmrrrrrrrr _RuleType _RuleWrapperr\rrrrqrrr#rr?r;r9r<s88(33'MML+ 9=HE=C 6:H :: CL./KL 0v 0$ 0%% 7 7(,WtBFRS6 0t 0 d#$ U$&6U$p e$-!-!%-!` $n$*C+^B C+L4VBZ4 "VBZ"N2$6"$ d#!hrl!$!!A!/!,!"$J) >:2 S/"-22 3 2267 2c2c2F  fRj !   "   7:bz$4FT"    #   x "#Xi%889  8: $@ fRj !$4 4@ 2J @ @ "(9"5!68K!KLL @H  fRj !   "   7:bz$4FT"    #   x "#Xi%889  8: $: fRj !$4 4: 2J : : "(9"5!68K!KLL :z d#$ ;(C5$;/;HhZ=Q4R;| d# 0 0$ 0,1/D/Xxj(>R5S/dL>Lr;