iKjbM ^UdZddlZddlZddlZddlZddlZddlZddlmZddlm Z m Z m Z m Z ddl mZddlmZmZmZmZmZmZmZddlmZddlmZed Zd ed ed efd Zde ede eeee efd e efdZ!Gdde eZ"dedede egefd efdZ#GddeeZ$d efdZ%GddZ&e&Z'eZ(GddZ)de egefd efdZ*da+da,e-e.d <da/e-e.d!<ej`Z1d e-fd"Z2d#e ed$e ed efd%Z3d#e ed$e ed efd&Z4d'ed efd(Z5y))zA module for miscellaneous useful bits and bobs that don't obviously belong anywhere else. If you spot a better home for anything that lives here, please move it.N) ArrayType)CallableIterableIteratorSequence)Lock)AnyClassVarGenericLiteralTypeVarUnionoverload)HypothesisWarning) float_to_intTabreturnc,t|t|uryt|trt|t|k(St|tt fr3t |t |k(xrttt||St||k(S)aLike ==, but requires identical types (so True != 1 != 1.0) and compares floats by bitpattern (so nan == nan and 0.0 != -0.0), applying both rules elementwise through lists and tuples. Values of any other type - dicts, sets, arbitrary objects - are compared by plain == after the type check, so a NaN, signed zero, or bool/int confusion nested inside them is missed: a NaN there compares unequal and a nested True matches 1. Callers use this for best-effort, replay-verified inversion, where such a miss costs a widening opportunity - the replay produces a wrong or unequal value and is rejected - never correctness. F) type isinstancefloatrlisttuplelenallmap equal_valuesbool)rrs n/home/oem/CyberBrain26-unified/.venv/lib/python3.12/site-packages/hypothesis/internal/conjecture/junkdrawer.pyrr(sv Awd1g!UA,q/11!dE]#1vQ@CL!Q(?$@@ Q<ls replacementscg}d}d}|D]A\}}}|j||||j||}|t|||z z z }C|j||dt|t||zk(sJ|S)ztSubstitute multiple replacement values into a list. Replacements is a list of (start, end, value) triples. rN)extendr)r#r$resultprevoffsetuvrs r! replace_allr-?sF D F#1a baj! a#a&AE"" #  MM"TU) v;#b'F* ** * Mr"c eZdZUdZgdZeeeed<e e jeZ ee eefed<dZ d&deefdZeded dfd Zed ed eed eeed ffdZded efdZd efdZd efdZeded efdZeded dfdZdeezd dfdZdeezd dfdZdeded dfdZd eefdZ de!d e"fdZ#de!d e"fd Z$ded dfd!Z%deded dfd"Z&d#eed dfd$Z'd'd%Z(y)(IntListaClass for storing a list of non-negative integers compactly. We store them as the smallest size integer array we can get away with. When we try to add an integer that is too large, we upgrade the array to the smallest word size needed to store the new value.)BHILQO ARRAY_CODESNEXT_ARRAY_CODE) __underlyingvaluesc |jD]} |j||}ntd|t |t r*|D]%}t |t r|dkstd|||_y#t$rYtwxYw)NzCould not create storage for rzCould not create IntList for ) r6_array_or_list OverflowErrorAssertionErrorrrint ValueError_IntList__underlying)selfr9code underlyingr+s r!__init__zIntList.__init__bs$$ MD !00v>  M!#@ !KL L j$ ' Q!!S)QU$'DVJ%OPP Q9C!  sA66 BBnrcB|tjddg|zS)Nr0r)array)clsrEs r! of_lengthzIntList.of_lengthqs5;;sQC(1,--r"rBcontentszArrayType[int]cN|dk(r t|Stj||S)Nr5)rrG)rBrJs r!r;zIntList._array_or_listus& 3;> !{{4**r"valuec8|jj|SN)r@count)rArLs r!rOz IntList.count}s  &&u--r"c4dt|jdS)NzIntList())rr@rAs r!__repr__zIntList.__repr__s$t0014A66r"c,t|jSrN)rr@rRs r!__len__zIntList.__len__s4$$%%r"icyrNrArVs r! __getitem__zIntList.__getitem__s*-r"zlist[int] | ArrayType[int]cyrNrXrYs r!rZzIntList.__getitem__sEHr"z int | list[int] | ArrayType[int]c |j|SrNr@rYs r!rZzIntList.__getitem__s  ##r"Nc|j|=yrNr]rYs r! __delitem__zIntList.__delitem__s   a r"r+c<|jj||yrN)r@insert)rArVr+s r!razIntList.inserts   A&r"c,t|jSrN)iterr@rRs r!__iter__zIntList.__iter__sD%%&&r"othercj||uryt|tstS|j|jk(S)NTrr/NotImplementedr@rAres r!__eq__zIntList.__eq__s3 5=%)! !  E$6$666r"cj||uryt|tstS|j|jk7S)NFrgris r!__ne__zIntList.__ne__s3 5=%)! !  E$6$666r"c |jj|y#t$r8t|j}|jjd|||<YywxYwNr)r@appendr<r)rArErVs r!rozIntList.appendsW     $ $Q ' D%%&A    $ $Q 'DG s>AAct ||j|<y#t$r|dkDsJ|jYnwxYw8rn)r@r<_IntList__upgrade)rArVrEs r! __setitem__zIntList.__setitem__sF !'(!!!$  !1u u  ! s  66r#c4|D]}|j|yrN)ro)rAr#rEs r!r&zIntList.extends A KKN r"ct|jtjsJ|j|jj}|j ||j|_yrN)rr@rGr7typecoder;)rArBs r! __upgradezIntList.__upgradesS$++U[[999##D$5$5$>$>? //d6G6GHr")rXrN))__name__ __module__ __qualname____doc__r6r rstr__annotations__dict itertoolspairwiser7 __slots__rr>rD classmethodrI staticmethodrrr;rOrSrUrrZslicer_rarrdobjectr rjrlrorrr&rqrXr"r!r/r/Us(FK$s)$E045GY5G5G 5T0UOXd38n-U!I Cx} C.#.)..++%c]+ tCy** +++.3.3.7#7&&-S-S-- HUH'CHH$S5[$-O$!S5[!T!'''''(3-'7F7t77F7t7!S!S!T!#4Ir"r/lohifch||}|dz|kr!||zdz}|||k(r|}n|}|dz|kr!|S)zBinary searches in [lo , hi) to find n such that f(n) == f(lo) but f(n + 1) != f(lo). It is implicitly assumed and will not be checked that f(hi) != f(lo). rX)rrr referencemids r! binary_searchrsO"I q&2+Bw1n S6Y BB q&2+ Ir"ceZdZdZdeefdZdefdZddedefdZ dededd fd Z dedefd Z ded edd fd Z dede eeffdZdeefdZy )LazySequenceCopyaEA "copy" of a sequence that works by inserting a mask in front of the underlying sequence, so that you can mutate it without changing the underlying sequence. Effectively behaves as if you could do list(x) in O(1) time. The full list API is not supported yet but there's no reason in principle it couldn't be.r9cN||_t||_d|_d|_yrN)_LazySequenceCopy__valuesr_LazySequenceCopy__len_LazySequenceCopy__mask_LazySequenceCopy__popped_at)rAr9s r!rDzLazySequenceCopy.__init__s% [ +/ .2r"rcv|j |jS|jt|jz SrN)rrrrRs r!rUzLazySequenceCopy.__len__s2    #:: zzC 0 0111r"rVc2t|dk(r td|j|\}}d}|j|jj |d}||j |}|j g|_|j j||S)NrzCannot pop from empty list)r IndexError#_LazySequenceCopy__underlying_indexrpoprrro)rArVr*r+s r!rzLazySequenceCopy.pops t9>9: :&&q)1  ;; " 4(A 9 a A    #!D  "r"jNc2||k(ry||||c||<||<y)zSwap the elements ls[i], ls[j].NrX)rArVrs r!swapzLazySequenceCopy.swaps( 6 7DGQar"c|j|\}}|j|}|j|S|jj||SrN)rrrget)rArV_defaults r!rZzLazySequenceCopy.__getitem__sH&&q)1--" ;; N;;??1g. .r"r+cp|j|\}}|ji|_||j|<yrN)rr)rArVr+rs r!rrzLazySequenceCopy.__setitem__s4&&q)1 ;; DK Ar"cHt|}|| ks||k\rtd|d|d|dkr||z }d|cxkr|ksJJ|}|jOt|jt|jksJt |jD] }|||kz } ||fS)NzIndex z out of range [0, rQr)rrrrreversed)rArVrEr*ps r!__underlying_indexz#LazySequenceCopy.__underlying_indexs$ I r6Q!VvaS(:1#Q?@ @ q5 FAAzzzz     't''(C ,>> >>d../ Q!V  !t r"c#LKtt|D] }|| ywrN)rangerrYs r!rdzLazySequenceCopy.__iter__/s's4y! Aq'M s"$))rxryrzr{rrrDr>rUrrrZrrrrrrdrXr"r!rrs$ 2x{222 S! ,c,c,d, /S/Q/SQ4 CE#s(OB(1+r"rc`tjd}d}|r|j}|dz }|r|S)aJGet stack size for caller's frame. From https://stackoverflow.com/a/47956089/9297601 , this is a simple but much faster alternative to `len(inspect.stack(0))`. We use it with get/set recursionlimit to make stack overflows non-flaky; see https://github.com/HypothesisWorks/hypothesis/issues/2494 for details. rr)sys _getframef_back)framesizes r!stack_depth_of_callerr4s8 MM! E D      Kr"cZeZdZdZdddededdfdZded eddfd Zdddededdfd Zy) StackframeLimiterc>d|_t|_d|_yrn)_active_contextsset _known_limits_original_limitrRs r!rDzStackframeLimiter.__init__Ss !'*u+/r"Tcheck new_limitrrNc|rPtjx}|jvr.tjd|j d|dt dy|jj|tj|y)NzXThe recursion limit will not be reset, since it was changed during test execution (from z to z).) stacklevel) rgetrecursionlimitrwarningswarnrraddsetrecursionlimit)rArr current_limits r!_setrecursionlimitz$StackframeLimiter._setrecursionlimitXsz "%"7"7"99$BTBTT MM//3/C/C.DDWY[!    y) i(r"rc|jdk(r:|jJ||_|jj|j|xjdz c_|j |y)Nrr)rrrrr)rArrs r! enter_contextzStackframeLimiter.enter_contexthse  A %''/ //#0D    " "4#7#7 8 "  *r"c$|jdkDsJ|xjdzc_|jdk(r4|j}|J |j||d|_|h|_y|j||y#d|_|h|_wxYw)Nrrr)rrrr)rArroriginal_limits r! exit_contextzStackframeLimiter.exit_contextss$$q((( "  A %"11N!- -- 6''e'D'+$'5%5"  # #IU # ; (,$'5%5"s A>>B) rxryrzrDr>r rrrrXr"r!rrDsb0 CG)C)4)4) +s +c +d +=A.gc_callbacksW'/C'$' &Y]+sY>+.;% !"I s55 AArhooksstatscJ t|jz ay#t$rYywxYwrN)rdurationr)rs r!hookz gc_cumulative_time..hooks('5>>9'%s  ""T)_gc_initializedhasattrgcr r~r|r>rrar r on_gc_minoron_gc_collect_stepr)rrs r!gc_cumulative_timers  2{ # / 7;CH~  * LL  ; / R ! C D xx##+'+$xx**2.2+ r"l1l2c t|t|krytdt|dt||dDS)NFc3,K|] \}}||k(ywrNrX.0v1v2s r! zstartswith..sKFBrRxKstrictrrziprrs r! startswithrs9 2wR Kc"Ys2w-E&JK KKr"c t|t|krytdt|t| d|dDS)NFc3,K|] \}}||k(ywrNrXrs r!rzendswith..sLFBrRxLrrrrs r!endswithrs; 2wR Lc"c"gXZ."U&KL LLr"rEc|dzdz S)zThe number of bytes required to represent an n-bit number. Equivalent to (n + 7) // 8, but slightly faster. This really is called enough times that that matters.rX)rEs r! bits_to_bytesr!s Ea<r")6r{rGrrrtimerrcollections.abcrrrr threadingrtypingr r r r r rrhypothesis.errorsrhypothesis.internal.floatsrrr rrr>rr-r/rrrrrrrrrrrr}r perf_counterrrrrrrXr"r!rs-  BB03 CLCCD. 5c8A;!678 !W,kIhsmkI\csxt '<$\wqz\~ s  @<@