Ë iKêjk.ãór—UddlmZmZmZddlmZmZmZmZe e e e fdfZeed<eGd„d««Z y)é)ÚIterableÚIteratorÚSequence)ÚSelfÚ TypeAliasÚcastÚfinal.Ú IntervalsTcó$—eZdZdZededdfd„«Zddeee ddfd„Z de fd „Zdee fd „Z de de fd„Zd ee zdefd„Zdefd„Zde de fd„Zde de fd„Zd d„Zd d„Zd d„Zdedefd„Zde fd„Zd d„Zd d„Zd d„Zde defd„Zdede fd„Zy)!ÚIntervalSeta A compact and efficient representation of a set of ``(a, b)`` intervals. Can be treated like a set of integers, in that ``n in intervals`` will return ``True`` if ``n`` is contained in any of the ``(a, b)`` intervals, and ``False`` otherwise. ÚsÚreturnrc ó”—|t|«Dcgc]}t|«t|«f‘Œc}«}|j|«Scc}w)zªReturn a tuple of intervals, covering the codepoints of characters in `s`. >>> IntervalSet.from_string('abcdef0123456789') ((48, 57), (97, 102)) )ÚsortedÚordÚunion)Úclsr ÚcÚxs úe/home/oem/CyberBrain26-unified/.venv/lib/python3.12/site-packages/hypothesis/internal/intervalsets.pyÚfrom_stringzIntervalSet.from_string!s=€ñ ¬6°!«9Ö5 a”#a“&œ#˜a›&Ò!Ò5Ó6ˆØw‰wq‹zÐùò6sAÚ intervalsNcó —tttd„|D«««|_t d„|jD««sJ‚dg|_|jD]6\}}|j j |j d|z|z dz«Œ8|j j«|_|jtd««|_t|jtd««t|«dz «|_y)Nc3ó2K—|]}t|«–—Œyw©N)Útuple©Ú.0Úvs rú z'IntervalSet.__init__..-sèø€Ò:¨1œe AŸhÑ:ùs‚c3ó8K—|]}t|«dk(–—Œyw)éN)Úlenrs rr z'IntervalSet.__init__..1sèø€Ò7 1”3q“6˜Q•;Ñ7ùs‚réÿÿÿÿéÚ0ÚZ)rr rrÚallÚoffsetsÚappendÚpopÚsizeÚindex_aboverÚ_idx_of_zeroÚminr#Ú _idx_of_Z)ÚselfrÚurs rÚ__init__zIntervalSet.__init__+sÒ€Ü%)ÜœÑ:° Ô:Ó:ó& ˆŒô Ñ7¨¯©Ô7Ô7Ð7Ð7à#$ #ˆŒØ—N‘Nò >‰DˆAˆqØL‰L×Ñ §¡¨RÑ 0°1Ñ 4°qÑ 8¸1Ñ <Õ=ð >à—L‘L×$Ñ$Ó&ˆŒ Ø ×,Ñ,¬S°«XÓ6ˆÔÜ˜T×-Ñ-¬c°#«hÓ7¼¸T»ÀQ¹ÓGˆócó—|jSr)r,©r1s rÚ__len__zIntervalSet.__len__:s€Øy‰yÐr4c#ófK—|jD]\}}t||dz«Ed{–—†Œy7Œw)Nr%)rÚrange)r1r2rs rÚ__iter__zIntervalSet.__iter__=s3èø€Ø—N‘Nò '‰DˆAˆqÜ˜Q A¡“×&Ñ&ñ 'Ø&ús‚%1§/¨1Úicó®—|dkr|j|z}|dks||jk\rtd|›d|j›d«‚t|j«dz }|j||kDr6|}d}|dz|kr(||zdz}|j||kr|}n|}|dz|krŒ(|}||j|z }|j|\}}||z} | |ksJ‚| S)NrzInvalid index z for [0, ú)r%r")r,Ú IndexErrorr#rr)) r1r;ÚjÚhiÚloÚmidÚtr2rÚrs rÚ__getitem__zIntervalSet.__getitem__Asø€ØˆqŠ5Ø— ‘ ˜A‘ ˆAØˆqŠ5A˜Ÿ™’NÜ˜~¨a¨S° ¸$¿)¹)¸ÀAÐFÓGÐGô —‘Ó !Ñ#ˆØ<‰<˜‰?˜QÒØˆBØˆBàq‘&˜2’+Ø˜B‘w 1‘nØ—<‘< Ñ$¨Ò)Ø‘BàBðq‘&˜2“+ðˆAØ —‘˜Q‘ÑˆØ~‰~˜aÑ ‰ˆˆ1Ø ‰EˆØAŠvˆ ˆvØˆr4Úelemcó–‡—t‰t«rt‰«Šd‰cxkrdksJ‚J‚tˆfd„|jD««S)Nriÿÿc3óD•K—|]\}}|‰cxkxr|knc–—Œywr©)rÚstartÚendrFs €rr z+IntervalSet.__contains__..^s"øèø€ÒI©J¨E°35˜DÖ' C×'Ð'ÑIùsƒ )Ú isinstanceÚstrrÚanyr)r1rFs `rÚ__contains__zIntervalSet.__contains__ZsDø€ÜdœCÔ Üt“9ˆDØDÔ$˜HÒ$Ð$Ñ$Ð$Ð$ÜÓI¸$¿.¹.ÔIÓIÐIr4có"—d|j›dS)NzIntervalSet(r=)rr6s rÚ__repr__zIntervalSet.__repr__`s€Ø˜dŸn™nÐ/¨qÐ1Ð1r4ÚvaluecóÎ—t|j|jd¬«D]3\}\}}||k(r|cS||kDrt|›d«‚||ksŒ+|||z zcSt|›d«‚)NT©Ústrictz is not in list)Úzipr)rÚ ValueError©r1rRÚoffsetr2rs rÚindexzIntervalSet.indexcsy€Ü! $§,¡,°·±ÀtÔLò ,‰NˆF‘FQ˜ØEŠzØ’ ØU’Ü E 7¨/Ð!:Ó;Ð;Ø˜‹zØ ¨¡Ñ+Ò+ð ,ô˜E˜7 /Ð2Ó3Ð3r4có¤—t|j|jd¬«D] \}\}}||k\r|cS||ksŒ|||z zcS|jS)NTrT)rVr)rr,rXs rr-zIntervalSet.index_abovemsX€Ü! $§,¡,°·±ÀtÔLò ,‰NˆF‘FQ˜ØEŠzØ’ Ø˜‹zØ ¨¡Ñ+Ò+ð ,ð y‰yÐr4Úothercó$—|j|«Sr)r©r1r\s rÚ__or__zIntervalSet.__or__us€Øz‰z˜%Ó Ð r4có$—|j|«Sr)Ú differencer^s rÚ__sub__zIntervalSet.__sub__xs€Ø‰˜uÓ%Ð%r4có$—|j|«Sr)Úintersectionr^s rÚ__and__zIntervalSet.__and__{s€Ø× Ñ Ó'Ð'r4cóX—t|t«xr|j|jk(Sr)rLrrr^s rÚ__eq__zIntervalSet.__eq__~s!€Ü˜%¤Ó-ÒU°5·?±?ÀdÇnÁnÑ3TÐUr4có,—t|j«Sr)Úhashrr6s rÚ__hash__zIntervalSet.__hash__s€ÜD—N‘NÓ#Ð#r4có†—t|t|««sJ‚|j}|j}|st|«S|st|«St ||zd¬«}|j«g}|rK|j«\}}|d\}} || dzkr|t || «f|d<n|j||f«|rŒKt|«S)zÙMerge two sequences of intervals into a single tuple of intervals. Any integer bounded by `x` or `y` is also bounded by the result. >>> union([(3, 10)], [(1, 2), (5, 17)]) ((1, 17),) T)Úreverser$r%)rLÚtyperrrr+Úmaxr*) r1r\rÚyrÚresultr2rÚaÚbs rrzIntervalSet.union„sÅ€ô˜%¤ d£Ô,Ð,Ð,ØN‰NˆØO‰OˆÙÜ˜q“>Ð!ÙÜ˜q“>Ð!Ü˜1˜q™5¨$Ô/ˆ Ø—-‘-“/Ð"ˆÙð—=‘=“?‰DˆAˆqØ˜"‘:‰DˆAˆqØA˜‘EŠzà¤ Q¨£˜^r’ ð— ‘ ˜q !˜fÔ%ò!ô"˜6Ó"Ð"r4có¾—t|t|««sJ‚|j}|j}|st|«St tt|««}d}d}g}|t |«krÈ|t |«krº||\}}||ksJ‚||\} } | | ksJ‚| |kr|dz }nt| |kDr|j||«|dz }nU| |kr| |k\r|dz }nE| dz||d<|dz }n4|j|| dz f«| dz|kr| dz||d<|dz }n|dz }|t |«kr|t |«krŒº|j||d«ttt|««S)awSet difference for lists of intervals. That is, returns a list of intervals that bounds all values bounded by x that are not also bounded by y. x and y are expected to be in sorted order. For example difference([(1, 10)], [(2, 3), (9, 15)]) would return [(1, 1), (4, 8)], removing the values 2, 3, 9 and 10 from the interval. rr%N) rLrmrrÚlistÚmapr#r*Úextendr)r1r\rror;r?rpÚxlÚxrÚylÚyrs rrazIntervalSet.difference¨s€ô˜%¤ d£Ô,Ð,Ð,ØN‰NˆØO‰OˆÙÜ˜q“>Ð!Ü””T˜1“ÓˆØ ˆØ ˆØ&(ˆØ”#a“&Šj˜Q¤ Q£šZðq‘T‰FˆBØ˜’8ˆO8Øq‘T‰FˆBØ˜’8ˆO8àBŠwðQ‘‘Øb’ð— ‘ ˜a ™dÔ#ØQ‘‘Ør’Ø˜’8ð˜‘F‘Að! 1™fAa‘D˜‘GØ˜‘F‘Að— ‘ ˜r 2¨¡6˜lÔ+à˜‘6˜R’<ð! 1™fAa‘D˜‘GØ˜‘F‘Að ˜‘FAði”#a“&Šj˜Q¤ Q£›Zðp ‰ a˜˜eÔÜœ3œu fÓ-Ó.Ð.r4có—t|t|««sJ|«‚g}dx}}|t|j«krº|t|j«kr¢|j|\}}|j|\}}||kDr|dz }nB||kDr|dz }n7|j t||«t ||«f«||kr|dz }n|dz }|t|j«kr|t|j«krŒ¢t|«S)z(Set intersection for lists of intervals.rr%)rLrmr#rr*rnr/r) r1r\rr;r?r2rÚUÚVs rrdzIntervalSet.intersectionõsö€ä˜%¤ d£Ô,Ð3¨eÓ3Ð,Øˆ Øˆ ˆˆAØ”#d—n‘nÓ%Ò%¨!¬c°%·/±/Ó.BÒ*BØ—>‘> !Ñ$‰DˆAˆqØ—?‘? 1Ñ%‰DˆAˆqØ1ŠuØQ‘‘ØQ’ØQ‘‘à× Ñ ¤# a¨£)¬S°°A«YÐ!7Ô8Øq’5Ø˜‘F‘Aà˜‘FAð”#d—n‘nÓ%Ò%¨!¬c°%·/±/Ó.BÓ*Bô˜9Ó%Ð%r4có—||jkrk|j|jz }||kr||jz }n#|j||z z }||jksJ‚d|cxkr|jksJ‚J‚t||«S)Nr)r0r.Úchr)r1r;Úns rÚchar_in_shrink_orderz IntervalSet.char_in_shrink_order s’€ð —‘Òð—‘ ×!2Ñ!2Ñ2ˆAØAŠvØT×&Ñ&Ñ&‘ð ×%Ñ%¨¨Q©Ñ/Ø˜4×,Ñ,Ò,Ð,Ð,Ø˜Ô+˜TŸ^™^Ò+Ð+Ñ+Ð+Ð+ä4˜‘7‹|Ðr4rcó¾—t|«dk(sJ‚|jt|««}||jkr£|j|jz }|j|cxkr|jkr"nn||jz}d|cxkr|ks4J‚J‚|j|z |z}|dz|cxkr|jksJ‚J‚d|cxkr|jksJ‚J‚|S)z2 Inverse of char_in_shrink_order. r%r)r#rZrr0r.)r1rr;r€s rÚindex_from_char_in_shrink_orderz+IntervalSet.index_from_char_in_shrink_order!sÜ€ô1‹v˜Š{Ðˆ{ØJ‰J”s˜1“vÓˆà—‘ÒØ—‘ ×!2Ñ!2Ñ2ˆAà× Ñ AÔ7¨¯©Õ7ØT×&Ñ&Ñ&Ø˜A”{ ’{Ð"‘{Ð"{ð×%Ñ%¨Ñ)¨AÑ-Ø˜1‘u Ô3 T§^¡^Ò3Ð3Ñ3Ð3Ð3Ø˜Ô+˜TŸ^™^Ò+Ð+Ñ+Ð+Ð+àˆr4)rI)r\rrr)Ú__name__Ú __module__Ú__qualname__Ú__doc__ÚclassmethodrMrrrÚintr3r7rr:rEÚboolrOrQrZr-r_rbreÚobjectrgrjrrardrrƒrIr4rrrs,„ñðð˜Cð Fòóðñ H (¨8°C©=Ñ"9ð HÀ4ó Hð˜óð'˜( 3™-ó'ð˜Sð Sóð2J s¡ðJ¨tóJð2˜#ó2ð4˜3ð4 3ó4ð ð¨óó!ó&ó(ðV˜FðV tóVð$˜#ó$ó"#óHK/óZ&ð( cð¨cóð0°ð¸ôr4rN)Úcollections.abcrrrÚtypingrrrr rr‰r Ú__annotations__rrIr4rúrsKð÷9Ò8ß/Ó/à˜e C¨ H™o¨sÐ2Ñ3€ ˆIÓ3ð÷[ð[óñ[r4