iKj I UddlZddlZddlZddlZddlZddlmZmZddlm Z m Z m Z ddl m Z ddlmZddlmZmZddlmZddlmZdd lmZdd lmZer dd lmZdd lmZd Zde de!fdZ"de de!fdZ#de$de!fdZ%de&de!fdZ'de!de!fdZ(e"dZ)e"dZ*edZ+de+de+fdZ,ddd e-e+ddfd!Z.d"e$ej^e e+zd#e de e+fd$Z0e d%d&e1e2d'fde-e1e!e!e2ffd(Z3Gd)d*Z4d+Z5Gd,d-Z6Gd.d/Z7ed0xsejpjrZ:e2e;d1<e d2e2d3e!e2zde2fd4Zs4 E !z)   Lrza sample() in Samplerzone more from many()Tvc|Sr))r7s ridentityr:Ms Hrdatarlsctt|dz D]1}|j|t|dz }||||c||<||<3y)aOShuffle ``ls`` in place, drawing from ``data``. Reversed Fisher-Yates shuffle: swap each element with itself or with a later element. This shrinks i==j for each element, i.e. towards no change, so a shuffled sequence shrinks back to its original order. We don't consider the last element as it's always a no-op. r1N)rangelen draw_integer)r;r<ijs rfisher_yates_shufflerCQsU3r7Q; $   aR1 -!ube 1r!u$rvalues strategy_namecdtjvr\t|tjdjr5|jdk7rgt d|jd|j dt|ttjtjfst d|d|dt|tr|St|S) Nnumpyr1zPOnly one-dimensional arrays are supported for sampling, and the given value has z dimensions (shape z). This array would give samples of array slices instead of elements! Use np.ravel(values) to convert to a one-dimensional array, or tuple(values) if you want to sample slices.zCannot sample from z\ because it is not an ordered collection. Hypothesis goes to some length to ensure that the a strategy has stable results between runs. To replay a saved test case, the sampled values must have the same iteration order on every run - ruling out sets, dicts, etc due to hash randomization. Most cases can simply use `sorted(values)`, but mixed types or special values such as math.nan require careful handling - and note that when shrinking a test case, Hypothesis treats earlier values as simpler.)sysmodulesr!ndarrayndimr shaperrrenumEnumMetar>tuple)rDrEs r check_samplerP^s#++*VS[[5I5Q5Q"R ;;! !++1;;-7J<<.!)) cllDMM J K!&,AANP; ;  &%  =r@weights.ct|}t|Dcgc]}|ddg }}t|}t|}|d}|d}g}g} |D cgc]} | |z  } } g} t | D]Q\}} | |z}| j ||dk(r |||d<*|dkr|j |A| j |St j|t j| |r| rt j|}t j| }||k7sJ| ||kDsJ||dJ|||d<|| |z ||d<| || |z|z | |<| |dkrt j||n'| |dk(r |||d<nt j| ||r| r| r||| jd<| r|r|||jd<|rg}|D]x\}}} t|tsJt|ts|J| J||j ||| fH||kr|j |||| z fe|j ||| fz|j|Scc}wcc} w)Nrr1)r?r>sumr# enumerateappendheapqheapifyheappopheappushpopr!intsort)rRnrAtabletotalnum_typezeroonesmalllargew probabilitiesscaled_probabilitiesalternate_chancescaledlohi new_tablebase alternates rcompute_sampler_tablerq~s G AFKAh,Oat_,OE,O LEE{H A;D 1+CEE(/01QY0M0(*(7 !A%##F+ Q;E!HQK aZ LLO LLO MM% MM% E ]]5 ! ]]5 !Rxx#B'#---Ry|###b ! 1"55b !  $';B'? ? $R   #a ' NN5" % !" % *E"IaL NN5" %% E&  $eiik1   $eiik1 /1I-2 B)i)$$$$)S)Y->>>+++     dD*:; <     is5E/EF G   dI/?@ A BNN {-P1s I0 I5cjeZdZUdZeeeeefed<ddde ede fdZ dd d d d edzd efdZ y)Samplera(Sampler based on Vose's algorithm for the alias method. See http://www.keithschwarz.com/darts-dice-coins/ for a good explanation. The general idea is that we store a table of triples (base, alternate, p). base. We then pick a triple uniformly at random, and choose its alternate value with probability p and else choose its base value. The triples are chosen so that the resulting mixture has the right distribution. We maintain the following invariants to try to produce good shrinks: 1. The table is in lexicographic (base, alternate) order, so that choosing an earlier value in the list always lowers (or at least leaves unchanged) the value. 2. base[i] < alternate[i], so that shrinking the draw always results in shrinking the chosen element. r`T)observerRrtcD||_tt||_yr))rtrqrOr`)selfrRrts r__init__zSampler.__init__s *5>: rN)forcedr;rrxrc|jr|jtdntfd|jD}|j |j||j\}}}d}|k(xr|dkD}|k(s|sJ|j |||j}|jr|j|r|k(s J|f|S|k(s J|f|S)Nc3NK|]\}}}|k(s |k(r |dkDr|||fyw)rNr9).0rorprjrxs r z!Sampler.sample..s?7T9&6T>f &9>NQR>Ry"23s"%rxrtr)rt start_spanSAMPLE_IN_SAMPLER_LABELnextr`choice draw_boolean stop_span) rvr;rx forced_choicerorprjforced_use_alternate use_alternates ` rsamplezSampler.samples  << OO3 4~ ;?:: -1KK JJ LL-8- )i) $  $*Y#6#O;Ka;O T>%9 99)) 'LL* << NN  >Y&%8 M69:M M8 >TV^ Cfd^ C3Kr) __name__ __module__r*__doc__listrOr]float__annotations__rboolrwrr9rrrsrssc" c3o& ''DH;;T;" **d * *rrszIteration over many() is interleaved with other draws. Are you iterating over several many() objects at once, e.g. with zip()?ceZdZdZddddddedeezd eezd edzd ed dfd ZddZde dzde d dfdZ d e dfdZ d e dfdZddedzd dfdZd efdZddZd efdZy)manyaUtility class for collections. Bundles up the logic we use for "should I keep drawing more values?" and handles starting and stopping spans in the right place. Intended usage is something like: with many(data, ...) as elements: for _ in elements: if not add_stuff_to_result(): elements.reject() Leaving the loop early with ``break``, ``return``, or an exception is supported, and keeps both the span tree and the choice sequence well-formed. NTr}r;rmin_sizemax_size average_sizerxrtrcFd|cxkr |cxkr|ksJJ|||cxkr|ksJJ||_||_||_||_t ||z ||z |_d|_d|_d|_||_ d|_ d|_ d|_ d|_ d|_d|_y)NrF)rrr; forced_size_calc_p_continue p_continuecount rejections force_stoprt_depth _iterated_closed_done _in_element _rejected)rvr;rrrrxrts rrwz many.__init__sH8 888888~V!?x!???!???     !*<(+BHxDWX  "&    rcj|j td|jj|_|S)NzCannot reuse a many() object.)rr r;depthrvs r __enter__zmany.__enter__8s, ;; "!"AB Biioo  rexc_type_c d|_|jjry|jj|j k7r|t t y|j|%|jsd|_ |jyyy)NT) rr;frozenr_expected_depthr _INTERLEAVED_MANY_MSG_finish_elementrr_decide)rvrrs r__exit__z many.__exit__>sy 99    99??d224 4%&;<<    DJJ#DO LLN %/ rc|j |jr td|jr tdd|_|j S)Nzmmany() must be used as `with many(...) as elements:` followed by `for _ in elements:`, inside the with-block.z,Cannot iterate over a many() more than once.T)rrr r_iteraters r__iter__z many.__iter__MsM ;; $,,!K  >>!"PQ Q}}rc#TK|j} |jr td|j|j k7rtt |j r|j|jsy|xjdz c_ d|_d|_ dw)NTz,Cannot iterate over many() after exiting it.r1F) r;rr rrrrrrrr)rvr;s rrz many._iterateXsyy||%&TUUzzT1133%&;<<$$&<<> JJ!OJ#D "DN sB&B(whycr|jr |jr td|xjdzc_|xjdz c_d|_|jt dd|jzkDr=|j|j kr|jj|yd|_ yy)zReject the current element (i.e. don't count it towards our budget of elements because it's not going to go in the final collection).z>reject() can only be called once per element, inside the loop.r1TrTN) rrr rrmaxrr; mark_invalidr)rvrs rrejectz many.rejecths4>>!P  a  1 ??SA N3 3zzDMM) &&s+"& 4rcl|jJ|j|jxr |jzSr))rrrtrs rrzmany._expected_depthzs0{{&&&{{d..?4<<@@rc|jr;d|_|jr'|jj|jyyy)NF)discard)rrtr;rrrs rrzmany._finish_element~s?   $D || ##DNN#; rc|jrN|j|jkr5|jj d|jd|j|j r|jj t|j|jk(r|j|jk}nd}|jr*|j|j|jk(sJd}n]|j|jkrd}nA|j|jk\rd}n%|j|j|jk}|jjdc}|j_ |jj|j||j }||j_ |s-d|_ |j r|jj|S)Nz stopped with z elements, below min_size=FTrr})rrrr;rrtr~ONE_FROM_MANY_LABELrrunique_element_depthrrrr)rvshould_continue forced_resultrs rrz many._decides ??tzzDMM9 II " " |+Edmm_U  << II !4 5 ==DMM )#jj4==8O M''/4::AQAQ3QQQ % dmm+ $ t}}, % !!- $ T-=-= = 59II4R4RTU 1E4991"ii44$ 5O .3DII *DJ|| ##%r)rrr))rN)rrr*rr]rrrwrr#objectrrrrr-rrrrr9rrrr s ,"+  Ek d  8  & T  (4. (4. '#*''$AA<%%rrcNeZdZdZdedeezddfdZdedfdZdedfd Z y) invert_manyabThe inversion counterpart of ``many``: the boolean choices that ``many`` would draw around each element. Fixed-size collections draw no booleans at all; variable-size ones draw a continuation boolean before each element (forced while below min_size, but forced draws still consume a choice) and a final False to stop (forced at max_size).rrrNc||k7|_yr)_variable_size)rvrrs rrwzinvert_many.__init__s&(2r)r.c"|jrdSdS)N)Tr9rrs rmorezinvert_many.mores--w525rc"|jrdSdS)N)Fr9rrs rdonezinvert_many.dones..x6B6r) rrr*rr]rrwrOrrr9rrrrsHA 33e 336eN+67eN+7rrgSMALLEST_POSITIVE_FLOAT desired_avgrcP||ks J||f||k(ryddd|zz z }|dk(s|tjk(rd|cxkr dksJ|J||Sd|cxkr dksJ|J|t|||kDr%|dz}|tkrt}nt|||kDr%d}|t||z dkDrEd|cxkr|ks nJ||f||zdz }t|||kr|}n|}|t||z dkDrEd|cxkr dksJ|J|t|||ksJ|S)zCReturn the p_continue which will generate the desired average size.?r1rg-C6?g{Gz?rT)mathinf_p_continue_to_avgr)rrrrmmids rrrs ( ";[($;; "hSA O,,JQ(dhh.J"".J.".J." z A )z) )z)  Z 2[ @f / /0J  Z 2[ @ B *:x@ @4 G:""4Z$44"B!# c8 , ;JB *:x@ @4 G z A )z) )z)  j( 3{ BB B rrc8|dk\r|Sdd|z z dz d||zz zS)zBReturn the average_size generated by this p_continue and max_size.r1rr9)rrs rrrs1Q 1z> "Q &1z8/C+C DDr)>rMrrXrrH collectionsrrcollections.abcrrr functoolsrtypesr typingr r hypothesis.errorsr hypothesis.internal.compatr hypothesis.internal.floatsr"hypothesis.internal.lambda_sourcesr%hypothesis.internal.conjecture.choicer#hypothesis.internal.conjecture.datarr2r-r]rr&r#r$rr"r5rrr6r:rrCEnumrPrOrrqrsrrr float_infominrrrrr9rrrs   (88)-5.<=B &s&s& 0 0S 02T2c20f00CC//FG*+AB CL  a  $/ $T!W $ $ Ohqk ):= a[@ 2?5#4?eCeO>T9U??DBBL< __D77"")!C1C1CC #%#3;#5# #LE5EC%KEEEr