iKjddlmZddlmZmZmZddlmZddlm Z ddl m Z ddl m Z ddlmZddlmZmZmZmZmZmZdd lmZmZdd lmZGd d eeZed dedeefdZed dedfdZGddedZeZ eed dedfdZ!Gddee"Z#y))Callable)AnyNeverNoReturn) CannotInvert)ChoiceT)ConjectureData) equal_valuesget_pretty_function_description)ExRecurTSampledFromStrategySearchStrategyT is_hashable) cacheabledefines_strategy)UniqueIdentifiercreZdZdZedefdZdefdZde de fdZ de dee zfdZd edeed ffd Zy ) JustStrategya%A strategy which always returns a single fixed value. It's implemented as a length-one SampledFromStrategy so that all our special-case logic for filtering and sets applies also to just(x). The important difference from a SampledFromStrategy with only one element to choose is that JustStrategy *never* touches the underlying choice sequence, i.e. drawing neither reads from nor writes to `data`. This is a reasonably important optimisation (or semantic distinction!) for both JustStrategy and SampledFromStrategy. returnc |jdS)Nr)elementsselfs i/home/oem/CyberBrain26-unified/.venv/lib/python3.12/site-packages/hypothesis/strategies/_internal/misc.pyvaluezJustStrategy.value,s}}Qcdjd|jD}|jd|zSdt|jd|S)Nc3HK|]\}}}d|dt|dyw).()Nr ).0namef_s r z(JustStrategy.__repr__..1s4 avQ6q9:! < s "znone()zjust(r%)join_transformationsrr )rsuffixs r__repr__zJustStrategy.__repr__0sX "33   :: f$ $6tzzBC1VHMMrrecurc,t|jSN)rrrr/s rcalc_is_cacheablezJustStrategy.calc_is_cacheable9s4::&&rdatac<|j|j|S)Nr4) _transformrrr4s rdo_filtered_drawzJustStrategy.do_filtered_draw<stzz55rr.crt|j|jd|st|d|y)Nr6z is not produced by )r r7rrrrs r_invertzJustStrategy._invertBs7DOODJJTOBEJ%*>thGH HrN)__name__ __module__ __qualname____doc__propertyr rstrr.rboolr3r rr9rtuplerr=r;rrrrsx  r  N#N'v'$'6^6=M8M6 SU7C<%8rrT)eagerrrct|gS)aReturn a strategy which only generates ``value``. Note: ``value`` is not copied. Be wary of using mutable values. If ``value`` is the result of a callable, you can use :func:`builds(callable) ` instead of ``just(callable())`` to get a fresh value each time. Examples from this strategy do not shrink (because there is only one). )r)rs rjustrHHs   r)force_reusable_valuesNctdS)zReturn a strategy which only generates None. Examples from this strategy do not shrink (because there is only one). N)rHr;rrnonerKWs :rceZdZdedefdZdedefdZdedefdZ de fdZ de e ge fded fd Zd e e ge fdd fd Zde e gdfdd fdZy)Nothingr/rcyNTr;r2s r calc_is_emptyzNothing.calc_is_emptybrr4ctd)NzThis should never happen)NotImplementedErrorr8s rdo_drawzNothing.do_drawes""<==rcyrOr;r2s rcalc_has_reusable_valuesz Nothing.calc_has_reusable_valuesjrQrcy)Nz nothing()r;rs rr.zNothing.__repr__msrpackrc|Sr1r;)rrXs rmapz Nothing.mapp r conditionzSearchStrategy[Never]c|Sr1r;)rr\s rfilterzNothing.filtersr[rexpandzSearchStrategy[Any]c|Sr1r;)rr_s rflatmapzNothing.flatmapvs  rN)r>r?r@rrDrPr rrTrVrCr.rrrrZr^rar;rrrMrMas6d>N>x> f##,1H# 49Pu&;;< rrMrctS)zThis strategy never successfully draws a value and will always reject on an attempt to draw. Examples from this strategy do not shrink (because there are none). )NOTHINGr;rrnothingrds  NrcBeZdZdedefdZdedeedffdZ de fdZ y) BooleansStrategyr4rc"|jSr1) draw_booleanr8s rrTzBooleansStrategy.do_draws  ""rr.cDt|tst|d|fS)Nz is not a bool) isinstancerDrr<s rr=zBooleansStrategy._inverts%%&%.9: :xrcy)Nz booleans()r;rs rr.zBooleansStrategy.__repr__srN) r>r?r@r rDrTrrErr=rCr.r;rrrfrfs=#N#t#SU7C<%8 #rrf)$collections.abcrtypingrrrhypothesis.errorsr%hypothesis.internal.conjecture.choicer#hypothesis.internal.conjecture.datar )hypothesis.internal.conjecture.junkdrawerr hypothesis.internal.reflectionr *hypothesis.strategies._internal.strategiesr rrrrr%hypothesis.strategies._internal.utilsrrhypothesis.utils.conventionsrrrHrKrMrcrdrDrfr;rrrvs%''*9>BJN9&&r*&R ! !nQ' ! !-nT".nW%6 ) (  ~d+ r