o «ïg€#ã@sddlZGdd„dƒZdS)éNc@sJeZdZdZdgZdQdd„Zdd„Zdd „Zd d „Zd d „Z dd„Z dRdd„Z dd„Z dd„Z dd„Zdd„Zdd„Zdd„Zdd „Zd!d"„Zd#d$„Zd%d&„Zd'd(„Zd)d*„Zd+d,„Zd-d.„Zd/d0„Zd1d2„Zd3d4„Zd5d6„Zd7d8„Zd9d:„Zd;d<„Z d=d>„Z!d?d@„Z"dAdB„Z#dCdD„Z$dEdF„Z%dGdH„Z&dIdJ„Z'dKdL„Z(dMdN„Z)dOdP„Z*dS)SÚSeta!A simple set class. This class was originally used to deal with sets being missing in ancient versions of python, but dnspython will continue to use it as these sets are based on lists and are thus indexable, and this ability is widely used in dnspython applications. ÚitemsNcCs,tƒ|_|dur|D] }| |¡q dSdS)zaInitialize the set. *items*, an iterable or ``None``, the initial set of items. N)ÚdictrÚadd)ÚselfrÚitem©rúT/var/www/html/portale_awareness/portale-venv/lib/python3.10/site-packages/dns/set.pyÚ__init__ s  üz Set.__init__cCsdtt|j ¡ƒƒS)Nzdns.set.Set(%s))ÚreprÚlistrÚkeys©rrrr Ú__repr__-sz Set.__repr__cCs||jvr d|j|<dSdS)zAdd an item to the set.N©r©rrrrr r0s ÿzSet.addcCs"z|j|=WdStyt‚w)zRemove an item from the set.N)rÚKeyErrorÚ ValueErrorrrrr Úremove6s  ÿz Set.removecCs|j |d¡dS)z'Remove an item from the set if present.N)rÚpoprrrr Údiscard>sz Set.discardcCs|j ¡\}}|S)z&Remove an arbitrary item from the set.)rÚpopitem)rÚkÚ_rrr rCszSet.popÚreturncCs<t|dƒr |j}n|j}| |¡}tƒ|_|j |j¡|S)aÞMake a (shallow) copy of the set. There is a 'clone protocol' that subclasses of this class should use. To make a copy, first call your super's _clone() method, and use the object returned as the new instance. Then make shallow copies of the attributes defined in the subclass. This protocol allows us to write the set algorithms that return new instances (e.g. union) once, and keep using them in subclasses. Ú _clone_class)ÚhasattrrÚ __class__Ú__new__rrÚupdate)rÚclsÚobjrrr Ú_cloneHs  z Set._clonecCó| ¡S©z!Make a (shallow) copy of the set.©r"rrrr Ú__copy__^óz Set.__copy__cCr#r$r%rrrr Úcopycr'zSet.copycCs8t|tƒs tdƒ‚||urdS|jD]}| |¡qdS)zaUpdate the set, adding any elements from other which are not already in the set. úother must be a Set instanceN)Ú isinstancerrrr©rÚotherrrrr Ú union_updatehs   ÿzSet.union_updatecCsDt|tƒs tdƒ‚||urdSt|jƒD] }||jvr|j|=qdS)z]Update the set, removing any elements from other which are not in both sets. r)N)r*rrr rr+rrr Úintersection_updatets  €þzSet.intersection_updatecCsBt|tƒs tdƒ‚||ur|j ¡dS|jD]}| |¡qdS)zWUpdate the set, removing any elements from other which are in the set. r)N)r*rrrÚclearrr+rrr Údifference_updateƒs   ÿzSet.difference_updatecCsJt|tƒs tdƒ‚||ur|j ¡dS| |¡}| |¡| |¡dS)zt|tƒrtt |j|j|j|j¡ƒSt t |j||d¡ƒS)Né) r*Úslicer Ú itertoolsÚislicerÚstartÚstopÚstepÚnext)rÚirrr Ú __getitem__s zSet.__getitem__cCs8t|tƒrt||ƒD]}|j|=q dS|j||=dSr;)r*rUr r)rr\Úeltrrr Ú __delitem__ s  ÿzSet.__delitem__cCs2t|tƒs tdƒ‚|jD] }||jvrdSq dS)zFIs this set a subset of *other*? Returns a ``bool``. r)FT©r*rrrr+rrr Úissubsetó   ÿz Set.issubsetcCs2t|tƒs tdƒ‚|jD] }||jvrdSq dS)zHIs this set a superset of *other*? Returns a ``bool``. r)FTr`r+rrr Ú issuperset rbzSet.issupersetcCs2t|tƒs tdƒ‚|jD] }||jvrdSq dS)Nr)FTr`r+rrr Ú isdisjoint-s   ÿzSet.isdisjointr;)rr)+Ú__name__Ú __module__Ú __qualname__Ú__doc__Ú __slots__r rrrrrr"r&r(r-r.r0r3r6r1r8r9r>r@rArBrCrFrHrIrJrKrr/rLrNrQrSr]r_rarcrdrrrr rsR            r)rVrrrrr Ús