zzaXddlZddlmcmZddlmZddlm Z ddl m Z Gdde Z y)N) find_integer)Shrinker)identitycDeZdZdZefdZdZdZdZdZ dZ dZ d Z y ) OrderingzA shrinker that tries to make a sequence more sorted. Will not change the length or the contents, only tries to reorder the elements of the sequence. c||_yNkey)selfr s v/home/oem/CyberBrain26-unified/.venv/lib/python3.12/site-packages/hypothesis/internal/conjecture/shrinking/ordering.pysetupzOrdering.setups ct|Sr )tuple)r values r make_immutablezOrdering.make_immutables U|rcb|jt|j|jSNr )considersortedcurrentr r s r short_circuitzOrdering.short_circuits }}VDLLdhh?@@rctt|j|tt|j|kSr )rmapr )r leftrights r left_is_betterzOrdering.left_is_better!s-S4()E#dhh2F,GGGrc t|}|j}t|}||k(}|stjd|fd||fdt j vstj trtjtnddt j vstj |rtj|ndtj|dt j vstj trtjtnddt j vstj |rtj|ndtj|tj|dz}dd|iz}ttj|dx}x}x}}t|}|j}t|}||k(}|stjd|fd||fd t j vstj trtjtnd dt j vstj |rtj|ndtj|d t j vstj trtjtnd dt j vstj |rtj|ndtj|tj|dz}dd|iz}ttj|dx}x}x}}y) N)==)zm%(py3)s {%(py3)s = %(py0)s(%(py1)s) } == %(py10)s {%(py10)s = %(py5)s(%(py8)s {%(py8)s = %(py6)s.current }) }lenrr )py0py1py3py5py6py8py10zassert %(py12)spy12r) r"r @pytest_ar_call_reprcompare @py_builtinslocals_should_repr_global_name _safereprAssertionError_format_explanationr)r r @py_assert2 @py_assert7 @py_assert9 @py_assert4 @py_format11 @py_format13s r check_invariantszOrdering.check_invariants$s5z..S..z.....z.......s...s......5...5...z......S...S.......................e}4t||4| 44} 44444} 4444444v444v444444e444e444}444444444444444t444t444|444 44444444rcD|j|jyr ) sort_regionssort_regions_with_gapsrs r run_stepzOrdering.run_step(s  ##%rcddztjkrJtjdtfd}|z dztjkrIyy)zGuarantees that for each i we have tried to swap index i with index i + 1. This uses an adaptive algorithm that works by sorting contiguous regions starting from each element. rNc |ztjkxrUjtj|zjzt j|zdzSr)r"rrrr list)kiprefixr s r z'Ordering.sort_regions..7so!a%3t||#44MMT\\!a!e4$((CD4<<A012r)r"rrAr)r rBrCrDs` @@r r;zOrdering.sort_regions,se !ec$,,''$,,r*+FA FA!ec$,,''rc4tdtjdz D]njdz jcxkrjdzkrnn?fddztfdz tfdpy)a&Guarantees that for each i we have tried to swap index i with index i + 2. This uses an adaptive algorithm that works by sorting contiguous regions centered on each element, where that element is treated as fixed and the elements around it are sorted.. r?c|dks|t jkDry|k}|k}|r|s tjd||fd||fdt j vstj |rtj|nddt j vstj rtjnddt j vstj |rtj|nddz}d d |iz}ttj|dx}}|z }t j| jd z|z} jt jd||d|z jgz||dzt j|dzS) NrF)<=<)z%(py0)s <= %(py3)sz%(py3)s < %(py4)sarCb)r#r%py4zassert %(py6)sr'r?) r"rr+r,r-r.r/r0r1r2rrrA) rJrK @py_assert1r3 @py_format5 @py_format7splitvaluesrCr s r can_sortz1Ordering.sort_regions_with_gaps..can_sortOsRq5ADLL 11 Az!Az!!!!qA!!!!!!q!!!q!!!!!!A!!!A!!!!!!!!!!!!!!!!A Qq 1DLLQ4K KL}}bq)*Ven%||A'(UVn%4<<+, -rc|zSr rBrRrrs r rEz1Ordering.sort_regions_with_gaps.._sHT519,Erc|z Sr rTrUs r rEz1Ordering.sort_regions_with_gaps..`s8D1He#<rN)ranger"rr)r rRrCrrs`@@@@r r<zOrdering.sort_regions_with_gaps@sq#dll+a/0 >A||AE"dll1oLa!e9LL DEE \"EF FE < =1 >rN) __name__ __module__ __qualname____doc__rrrrrr9r=r;r<rTrr rrs6 !AH5&( >rr) builtinsr-_pytest.assertion.rewrite assertionrewriter+)hypothesis.internal.conjecture.junkdrawerr/hypothesis.internal.conjecture.shrinking.commonr$hypothesis.internal.conjecture.utilsrrrTrr rcs#BD9P>xP>r