.PhʂdZddlmZddlmZddlmZmZddlZ ddl m Z e d Z n#e $r e Z YnwxYwd d gZd ZGd d eZdZdZdZGddZdS)a The :class:`set` type brings the practical expressiveness of set theory to Python. It has a very rich API overall, but lacks a couple of fundamental features. For one, sets are not ordered. On top of this, sets are not indexable, i.e, ``my_set[8]`` will raise an :exc:`TypeError`. The :class:`IndexedSet` type remedies both of these issues without compromising on the excellent complexity characteristics of Python's built-in set implementation. ) bisect_left) MutableSet)chainisliceN) make_sentinel_MISSING)var_name IndexedSet complementcXeZdZdZd.dZedZdZdZdZ dZ d.d Z d Z d Z d Zd ZdZdZedZdZdZdZdZdZdZdZdZdZdZdZdZdZ exZ!Z"exZ#Z$eZ%e xZ&Z'dZ(dZ)d Z*d!Z+d"Z,d#Z-d$Z.d%Z/d&Z0d.d'Z1d(Z2d.d)Z3d*Z4d+Z5d,Z6d-Z7dS)/r a ``IndexedSet`` is a :class:`collections.MutableSet` that maintains insertion order and uniqueness of inserted elements. It's a hybrid type, mostly like an OrderedSet, but also :class:`list`-like, in that it supports indexing and slicing. Args: other (iterable): An optional iterable used to initialize the set. >>> x = IndexedSet(list(range(4)) + list(range(8))) >>> x IndexedSet([0, 1, 2, 3, 4, 5, 6, 7]) >>> x - set(range(2)) IndexedSet([2, 3, 4, 5, 6, 7]) >>> x[-1] 7 >>> fcr = IndexedSet('freecreditreport.com') >>> ''.join(fcr[:fcr.index('.')]) 'frecditpo' Standard set operators and interoperation with :class:`set` are all supported: >>> fcr & set('cash4gold.com') IndexedSet(['c', 'd', 'o', '.', 'm']) As you can see, the ``IndexedSet`` is almost like a ``UniqueList``, retaining only one copy of a given value, in the order it was first added. For the curious, the reason why IndexedSet does not support setting items based on index (i.e, ``__setitem__()``), consider the following dilemma:: my_indexed_set = [A, B, C, D] my_indexed_set[2] = A At this point, a set requires only one *A*, but a :class:`list` would overwrite *C*. Overwriting *C* would change the length of the list, meaning that ``my_indexed_set[2]`` would not be *A*, as expected with a list, but rather *D*. So, no ``__setitem__()``. Otherwise, the API strives to be as complete a union of the :class:`list` and :class:`set` APIs as possible. Nct|_g|_g|_d|_d|_|r||dSdSNr)dictitem_index_map item_list dead_indices _compactions _c_max_sizeupdateselfothers P/var/www/html/test/jupyter/venv/lib/python3.11/site-packages/boltons/setutils.py__init__zIndexedSet.__init__osW"ff   KK       cTt|jt|jz SN)lenrrrs r_dead_index_countzIndexedSet._dead_index_countys"4>""S)<%=%===rc|jsdS|xjdz c_|j}|j|j}}t |jt||_t|D]\}}|||<|||<|| d=|jdd=dS)Nr) rrr"rrmaxrr enumerate)rdead_index_countitems index_mapiitems r_compactzIndexedSet._compact}s   F Q1>4+>yt/U<<   GAtE!HIdOO ##$$ %  aaa rc|j}|sdS|j|j}}|s |dd=|dd=dSt|dkr|dS|jt|t z kr|dS|dturYd}||dz tur|dz }||dz tu|r"|ddt|kr|d=|| d=dSdS)Nir)rrrr r+r"_COMPACTION_FACTORr )rdedr'ii_mapnum_deads r_cullzIndexedSet._culls   F(;v "aaaAAA XX^^ MMOOOOO  #s5zz4F'F G G MMOOOOO 2Y( " "H(Q,(H44A (Q,(H44 s2wqzSZZ//Gxijj!!! # "rc|dkr|t|z }|js|S|}|jD]\}}||krn |||z z }|Srr r)rindex real_indexd_startd_stops r_get_real_indexzIndexedSet._get_real_indexsm 199 SYY E  L #0 + +OGVG## &7* *JJrc|dkr|t|z }|js|S|}|jD]\}}||krn |||z z}|Srr4)rr5apparent_indexr7r8s r_get_apparent_indexzIndexedSet._get_apparent_indexsk 199 SYY E  L#0 / /OGVw fw. .NNrc |j}||dz}||g}|s||dSt||}||dz }|\}}||cxkr|kr nn||d<n,||cxkr|kr nn||d<n|||dS)Nrr)rappendrinsert) rstartstopdintscand_intint_idxdintr7r8s r _add_deadzIndexedSet._add_deads! <19D4=  LL " " " FeX..Wq[! G # # # #t # # # # #DGG f $ $ $ $ $ $ $ $ $DGG LL( + + +rc*t|jSrr rr!s r__len__zIndexedSet.__len__s4&'''rc||jvSrrrr*s r __contains__zIndexedSet.__contains__st***rc$d|jDS)Nc3,K|]}|tu |VdSrr .0r*s r z&IndexedSet.__iter__..s,HH4x3G3G3G3G3G3GHHr)rr!s r__iter__zIndexedSet.__iter__sHHHHHHrcB|j}dt|DS)Nc3,K|]}|tu |VdSrrPrQs rrSz*IndexedSet.__reversed__..s,MMH8L8L8L8L8L8LMMr)rreversed)rrs r __reversed__zIndexedSet.__reversed__s%N MM)!4!4MMMMrc@|jjdt|dS)N()) __class____name__listr!s r__repr__zIndexedSet.__repr__s$.);;DJJ;;;;rct|tr@t|t|kot|t|kS t |t |kS#t $rYdSwxYwNF) isinstancer r r^set TypeErrorrs r__eq__zIndexedSet.__eq__s eZ ( ( It99E *HtDzzT%[[/H H t99E * *   55 sA77 BBc||S)z2from_iterable(it) -> create a set from an iterable)clsits r from_iterablezIndexedSet.from_iterabless2wwrc||jvr8t|j|j|<|j|dSdS)z add(item) -> add item to the setN)rr rr>rLs raddzIndexedSet.addsK t* * *(+DN(;(;D  % N ! !$ ' ' ' ' ' + *rc |j|}n#t$rt|wxYwt|j|<|||dS)z?remove(item) -> remove item from the set, raises if not presentN)rpopKeyErrorr rrFr2)rr*didxs rremovezIndexedSet.removesu !&**400DD ! ! !4..  !'t t s7cT ||dS#t$rYdSwxYw)z;discard(item) -> discard item from the set (does not raise)N)rqrorLs rdiscardzIndexedSet.discardsA  KK         DD s  ''c`|jdd=|jdd=|jdS)zclear() -> empty the setN)rrrclearr!s rruzIndexedSet.clears: N111   aaa  !!#####rc,|j}|D] }||vrdS dS)z9isdisjoint(other) -> return True if no overlap with otherFTrKrriimks r isdisjointzIndexedSet.isdisjoints3!  ACxxuutrclt|t|krdS|jD] }||vrdS dS)z9issubset(other) -> return True if other contains this setFTrH)rrrys rissubsetzIndexedSet.issubsetsJ u::D ! !5$  A~~uutrcpt|t|krdS|j}|D] }||vrdS dS)z6issuperset(other) -> return True if set contains otherFTrHrws r issupersetzIndexedSet.issupersetsO u::D ! !5!  A||uutrcB|t|g|RS)zAunion(*others) -> return a new set containing this set and others)rjrrotherss runionzIndexedSet.union"s&!!%"6v"6"6"6777rc'2K|D]}|D]}||vrn |VdS)zBiter_intersection(*others) -> iterate over elements also in othersNrgrrryrs riter_intersectionzIndexedSet.iter_intersection&sH  A  E>>E"rct|dkr)|d|fd|DS||j|S)zBintersection(*others) -> get a set with overlap of this and othersrrc3$K|] }|v|V dSrrgrRryrs rrSz*IndexedSet.intersection..4s'%D%DAea%D%Dr)r rjrrrrs @r intersectionzIndexedSet.intersection0se v;;!  1IE%%%D%D%D%D%D%D%DDD D!!"8$"8&"ABBBrc'2K|D]}|D]}||vrn |VdS)z?iter_difference(*others) -> iterate over elements not in othersNrgrs riter_differencezIndexedSet.iter_difference7sH  A  ::Erct|dkr)|d|fd|DS||j|S)z@difference(*others) -> get a new set with elements not in othersrrc3$K|] }|v|V dSrrgrs rrSz(IndexedSet.difference..Es'%H%HA%a%H%Hr)r rjrrs @r differencezIndexedSet.differenceAse v;;!  1IE%%%H%H%H%H%H%H%HHH H!!"6$"6"?@@@rcP|j|}||j|S)z;symmetric_difference(*others) -> XOR set of this and others)rrr)rrrets rsymmetric_differencezIndexedSet.symmetric_differenceHs-dj&!~~/d/8999rcPfd|D}t||S)Ncg|]}|v| Srgrg)rRxrs r z'IndexedSet.__rsub__..Ss222aATMMMMMr)type)rrvalss` r__rsub__zIndexedSet.__rsub__Rs222225222tE{{4   rc|sdSt|dkr |d}nt|}|D]}||dS)z8update(*others) -> add values from one or more iterablesNrr)r rrl)rrros rrzIndexedSet.updateWs` " F [[A  1IEE&MME  A HHQKKKK  rcJ|j|D]}||dS)z@intersection_update(*others) -> discard self.difference(*others)N)rrsrrvals rintersection_updatezIndexedSet.intersection_updatebs9"4?F+  C LL      rcz||vr||j|D]}||dS)z@difference_update(*others) -> discard self.intersection(*others)N)rurrsrs rdifference_updatezIndexedSet.difference_updategsP 6>> JJLLL$4$f-  C LL      rc||ur||D]1}||vr||||2dS)z=symmetric_difference_update(other) -> in-place XOR with otherN)rursrl)rrrs rsymmetric_difference_updatez&IndexedSet.symmetric_difference_updatens` 5== JJLLL  Cd{{ S!!!!   rc|j||Sr)rrs r__ior__zIndexedSet.__ior__xs V rc|j||Sr)rrs r__iand__zIndexedSet.__iand__|s  &)) rc|j||Sr)rrs r__isub__zIndexedSet.__isub__s'' rc|j||Sr)rrs r__ixor__zIndexedSet.__ixor__s((&11 rc|}|||}|||}||dkr| }t|}t||||S)ziterate over a slice of the setNr)r9rWr)rr@rAstepiterables r iter_slicezIndexedSet.iter_slicesm  ((//E  ''--D  q5D~~HhtT222rc |j|j|j}}}||||}||S#t $rt j|}YnwxYw|dkr|t|z }| |} |j |}n#t$rtdwxYw|S)NrzIndexedSet index out of range) r@rArrrjAttributeErroroperatorr5r r9r IndexError)rr5r@rArrr6rs r __getitem__zIndexedSet.__getitem__s 2 % UZ4Ed;;J%%j11 1  * * *N5))EEE * 199 SYY E))%00  >.,CC > > ><== = > sAA$#A$ B##B=cH|j}t|}||dks ||dz kr|j}||=nI||}|j|}t |j|<||=||||S)z>pop(index) -> remove the item at a given index (-1 by default)Nr-r)rr rrnr9r rFr2)rr5rlen_selfrr6s rrnzIndexedSet.pops,~&& =ERKK5HqL+@+@.$$&&Cs##--e44J.,C)1DN: &s# NN: & & &  rc||jvrdSdS)z9count(val) -> count number of instances of value (0 or 1)rrrK)rrs rcountzIndexedSet.counts $% % %1qrctt|}||jdd<t|jD]\}}||j|<|jdd=dS)z5reverse() -> reverse the contents of the set in-placeN)r^rWrr%rr)r reversed_listr)r*s rreversezIndexedSet.reversesgXd^^,, )qqq 00 * *GAt()D  % %  aaa rc t|fi|}||jkrdS||jdd<t|jD]\}}||j|<|jdd=dS)z/sort() -> sort the contents of the set in-placeN)sortedrr%rr)rkwargs sorted_listr)r*s rsortzIndexedSet.sorts{T,,V,, $. ( ( F'qqq 00 * *GAt()D  % %  aaa rc ||j|S#t$r!|jj}t |d|wxYw)z=index(val) -> get the index of a value, raises if not presentz is not in )r<rror\r] ValueError)rrcns rr5zIndexedSet.indexsd 8++D,?,DEE E 8 8 8(B66"6677 7 8s "+A r)8r] __module__ __qualname____doc__rpropertyr"r+r2r9r<rFrIrMrTrXr_re classmethodrjrlrqrsrurzr|r~rrrrrr__or____ror____and____rand____sub____xor____rxor__rrrrrrrrrrrrnrrrr5rgrrr r Ds))T>>X> ! ! !"""(      ,(((+++IIINNN<<<[ ((( $$$ 888CCCAAA::: Fg%%GhG--Gh!!!     3 3 3 3"  !!!!!!88888rct|tur|St|turt|Stt |S)a Given a :class:`set`, convert it to a **complement set**. Whereas a :class:`set` keeps track of what it contains, a `complement set `_ keeps track of what it does *not* contain. For example, look what happens when we intersect a normal set with a complement set:: >>> list(set(range(5)) & complement(set([2, 3]))) [0, 1, 4] We get the everything in the left that wasn't in the right, because intersecting with a complement is the same as subtracting a normal set. Args: wrapped (set): A set or any other iterable which should be turned into a complement set. All set methods and operators are supported by complement sets, between other :func:`complement`-wrapped sets and/or regular :class:`set` objects. Because a complement set only tracks what elements are *not* in the set, functionality based on set contents is unavailable: :func:`len`, :func:`iter` (and for loops), and ``.pop()``. But a complement set can always be turned back into a regular set by complementing it again: >>> s = set(range(5)) >>> complement(complement(s)) == s True .. note:: An empty complement set corresponds to the concept of a `universal set `_ from mathematics. Complement sets by example ^^^^^^^^^^^^^^^^^^^^^^^^^^ Many uses of sets can be expressed more simply by using a complement. Rather than trying to work out in your head the proper way to invert an expression, you can just throw a complement on the set. Consider this example of a name filter:: >>> class NamesFilter(object): ... def __init__(self, allowed): ... self._allowed = allowed ... ... def filter(self, names): ... return [name for name in names if name in self._allowed] >>> NamesFilter(set(['alice', 'bob'])).filter(['alice', 'bob', 'carol']) ['alice', 'bob'] What if we want to just express "let all the names through"? We could try to enumerate all of the expected names:: ``NamesFilter({'alice', 'bob', 'carol'})`` But this is very brittle -- what if at some point over this object is changed to filter ``['alice', 'bob', 'carol', 'dan']``? Even worse, what about the poor programmer who next works on this piece of code? They cannot tell whether the purpose of the large allowed set was "allow everything", or if 'dan' was excluded for some subtle reason. A complement set lets the programmer intention be expressed succinctly and directly:: NamesFilter(complement(set())) Not only is this code short and robust, it is easy to understand the intention. excluded)r_ComplementSet complemented frozensetrc)wrappeds rr r sa` G}}&&##%%% G}} !!w//// 3w<< 0 0 00rct|ttfvr|d}}n4t|tur|j|j}}nt d||fS)z9normalize args and raise type-error if there is a problemN/argument must be another set or complement(set))rrcrr _included _excludedrdrincexcs r_norm_args_typeerrorr.s[ E{{sI&&&$S e & &?EOSIJJJ 8Orct|ttfvr|d}}n.t|tur|j|j}}n t dfS||fS)zCnormalize args and return NotImplemented (for overloaded operators)N)rrcrrrrNotImplementedrs r_norm_args_notimplementedr9sW E{{sI&&&$S e & &?EOSt## 8OrceZdZdZdZd(dZdZdZeZdZ dZ d Z d Z d Z d Zd ZeZdZdZdZeZdZdZdZdZdZeZdZdZdZdZdZdZ dZ!dZ"dZ#dZ$d Z%d!Z&d"Z'd#Z(d$Z)d%Z*d&Z+d'Z,dS))rzG helper class for complement() that implements the set methods rrNc| t|ttfvsJn1| t|ttfvsJntd||c|_|_dS)Nz)one of included or excluded must be a set)rrcrrrr)rincludedrs rrz_ComplementSet.__init__Jso  >>c9%555555  >>c9%555555HII I)18&rcp|jdt|jdSdt|jdS)Nz complement(r[zcomplement(complement(z)))rreprrr!s rr_z_ComplementSet.__repr__Ss@ > !8dn!5!5888 8@T^(<(<@@@@rc2t|jtust|jturt |j|jSt |jdnt |j|jdnt |jS)z&return a complement of the current set)rrN)rrrrrrcr!s rrz_ComplementSet.complementedXs   9 , ,T^0D0D 0Q0Q!4>DNSSS S!^3TTT^9L9L!^3TTT^9L9LNNN Nrc8|j|jc|_|_dS)z2convert the current set to its complement in-placeN)rrr!s rr z_ComplementSet.complementbs)-&rc4|j ||jvS||jvSrrrLs rrMz_ComplementSet.__contains__fs$ > !t~- -t~%%rc|j'||jvr|j|dSdS|j|dSr)rrrqrlrLs rrlz_ComplementSet.addksY > !t~%%%%d+++++&% N  t $ $ $ $ $rc|j|j|dS|j|dSr)rrrlrqrLs rrqz_ComplementSet.removersB > ! N  t $ $ $ $ $ N ! !$ ' ' ' ' 'rcP|jt|jSr)rNotImplementedErrorrnr!s rrnz_ComplementSet.popxs$ > !% %~!!###rcH ||zS#t$rtdwxYwNrrrdrs rrz_ComplementSet.intersection}@ O%< " O O OMNN N O!cft|\}}|turtS|jG|t||jz St|j|jS|t||jz St|j|SNrr)rrrrrrrrrrrs rrz_ComplementSet.__and__s,U33S . ! ! > !{%sT^/CDDDD%t~/C/CEO/T/TUUUU{%sT^/CDDDD%t~/J/J3/O/OPPPPrc t|\}}|turtS|j#|||jz |_nH|xj|zc_n7|%|xj|zc_d|jc|_|_n|xj|zc_|Srrrrrrs rrz_ComplementSet.__iand__s,U33S . ! ! > !{!$t~!5#%{#%15t~.#% rcH ||zS#t$rtdwxYwrrrs rrz_ComplementSet.unionrrc\t|\}}|turtS|jB|t|j|z St|j|S|t||jz St|j|SNrr)rrrrrrrrs rrz_ComplementSet.__or__s,U33S . ! ! > !{%t~/CDDDD%t~/J/J3/O/OPPPP{%sT^/CDDDD%t~/C/CC/H/HIIIIrct|\}}|turtS|j$||xj|zc_n;|xj|zc_n*|d||jz c|_|_n|xj|zc_|Srrrs rrz_ComplementSet.__ior__s,U33S . ! ! > !{#%#%{15sT^7K.#% rct|ttfvr|d}}n6t|tur|j|j}}nt|d}}|j0||xj|zc_dS|j|dS|&|xj|zc_d|jc|_|_dS|j|dSr)rrcrrrrrsrrr'rrs rrz_ComplementSet.updates ;;3 * * *dCC %[[N * *CC ''C > !{#%&&s+++++{#%15t~.%%c*****rct|ttfvr|d}}n6t|tur|j|j}}nt|d}}|j7||j|dS||jz dc|_|_dS||xj|zc_dS|j|dSr)rrcrrrrrrsrs rrsz_ComplementSet.discards ;;3 * * *dCC %[[N * *CC ''C > !{%%c*****14t~1Et.{#%&&s+++++rcH ||z S#t$rtdwxYwrrrs rrz#_ComplementSet.symmetric_differencerrc|t|\}}|turtS|turtS|jB|t|j|z St|j|S|t||jz St|j|Sr)rrrrrrrs rrz_ComplementSet.__xor__s,U33S . ! ! . ! ! > !{%t~/CDDDD%t~/R/RSV/W/WXXXX{%sT^/CDDDD%t~/R/RSV/W/WXXXXrcDt|\}}|jD||xj|zc_dS|j||jdc|_|_dS|&|xj|zc_d|jc|_|_dS|j|dSr)rrrrrs rrz*_ComplementSet.symmetric_difference_update s'..S > !{#%::3???15.{#%15t~.::3?????rct|\}}|turtS|j|||jSdS||j|S|j|Sra)rrrr|rrzrs rrzz_ComplementSet.isdisjoints{'..S . ! ! > !{||DN333u{~..s333~00555rcJ ||kS#t$rtdwxYw)z7everything missing from other is also missing from selfrrrs rr|z_ComplementSet.issubset(@ O5= " O O OMNN N O"ct|\}}|turtS|turtS|j|dS|j|S||j|S|j|Sra)rrrr issupsersetrzr|rs r__le__z_ComplementSet.__le__/s,U33S . ! ! . ! ! > !{u~11#666{~00555~..s333rct|\}}|turtS|turtS|j|dS|j|kS||j|S|j|kSra)rrrrrzrs r__lt__z_ComplementSet.__lt__@s|,U33S . ! ! . ! ! > !{u~++{~00555~++rcJ ||kS#t$rtdwxYw)z7everything missing from self is also missing from superrrrs rr~z_ComplementSet.issupersetQrrct|\}}|turtS|j7||j| S|j|S|dS|j|Sra)rrrrrr|r rs r__ge__z_ComplementSet.__ge__Xs,U33S . ! ! > !{>66s;;;;~..s333{u~11#666rct|\}}|turtS|j(||j| S|j|kS|dS|j|kSra)rrrrrrs r__gt__z_ComplementSet.__gt__gsn,U33S . ! ! > !{>66s;;;;~++{u~++rcH ||z S#t$rtdwxYwrrrs rrz_ComplementSet.differencevrrc<t|\}}|turtS|j2|t|j|zSt||jz S|t|j|zSt|j|Srrrrrrrrs rrz_ComplementSet.__sub__|s,U33S . ! ! > !{%t~/CDDDD%sT^/CDDDD{%t~/CDDDD%t~/H/H/M/MNNNNrc<t|\}}|turtS|j2|t||jzSt|j|z S|t||jzSt||jSrrrs rrz_ComplementSet.__rsub__s,U33S . ! ! > !{%sT^/CDDDD%t~/CDDDD{%sT^/CDDDD%s~~dn/M/MNNNNrcL ||z}dS#t$rtdwxYwrrrs rrz _ComplementSet.difference_updatesC O EMDDD" O O OMNN N Os #ct|\}}|turtS|j+||xj|zc_nE||jz dc|_|_n-||xj|zc_n|j||Sr)rrrrrrs rrz_ComplementSet.__isub__s,U33S . ! ! > !{#%14t~1Et.{#%00555 rct|t|uo|j|jko|j|jkp't|ttfvo |j|kSr)rrrrcrrs rrez_ComplementSet.__eq__se JJ$u++ % 2%/1 2%/1I KKC+ + G%0G  IrcTt|jt|jz Sr)hashrrr!s r__hash__z_ComplementSet.__hash__s!DN##d4>&:&:::rcV|jt|jStd)Nz'complemented sets have undefined length)rr rr!s rrIz_ComplementSet.__len__s) > %t~&& &!"KLLLrcV|jt|jStd)Nz)complemented sets have undefined contents)riterrr!s rrTz_ComplementSet.__iter__s) > %'' '!"MNNNrc<|jt|jSdS)NT)rboolr!s r__bool__z_ComplementSet.__bool__s > %'' 'tr)NN)-r]rrr __slots__rr_r __invert__r rMrlrqrnrrrrrrrrrrsrrrrrzr|r r r~rrrrrrrrerrIrTr!rgrrrrDs+I<<<<AAA NNNJHHH&&& %%%((( $$$ OOO Q Q QH"OOO J J JG +++&,,,$OOO YYY"H @ @ @ 6 6 6OOO444",,,"OOO 7 7 7 , , ,OOO O O OOOO OOO  III;;;MMM OOO rr)rbisectrcollections.abcr itertoolsrrr typeutilsrr ImportErrorobject__all__r.r r rrrrgrrr+s_>  &&&&&&########((((((}j111HHvxxHHH  &P8P8P8P8P8P8P8P8f T1T1T1nDDDDDDDDDDs/AA