⚝
One Hat Cyber Team
⚝
Your IP:
216.73.216.24
Server IP:
50.6.168.112
Server:
Linux server-617809.webnetzimbabwe.com 5.14.0-570.25.1.el9_6.x86_64 #1 SMP PREEMPT_DYNAMIC Wed Jul 9 04:57:09 EDT 2025 x86_64
Server Software:
Apache
PHP Version:
8.4.10
Buat File
|
Buat Folder
Eksekusi
Dir :
~
/
lib
/
python3.9
/
site-packages
/
dns
/
__pycache__
/
View File Name :
set.cpython-39.opt-1.pyc
a àMÒe€# ã @ s d dl Z G dd„ dƒZdS )é Nc @ sN e Zd ZdZdgZdQdd„Zdd„ Zdd „ Zd d „ Zd d „ Z dd„ Z d dœdd„Z dd„ Z dd„ Z dd„ Zdd„ Zdd „ Zd d „ Zd d „ Zd!d"„ Zd#d$„ Zd%d&„ Zd'd(„ Zd)d*„ Zd+d,„ Zd-d.„ Zd/d0„ Zd1d2„ Zd3d4„ Z d5d6„ Z d7d8„ Z d9d:„ Z d;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 )RÚ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. ÚitemsNc C s( t ƒ | _|dur$|D ]}| |¡ qdS )zaInitialize the set. *items*, an iterable or ``None``, the initial set of items. N)Údictr Úadd)Úselfr Úitem© r ú+/usr/lib/python3.9/site-packages/dns/set.pyÚ__init__ s z Set.__init__c C s dt t| j ¡ ƒƒ S )Nzdns.set.Set(%s))ÚreprÚlistr Úkeys©r r r r Ú__repr__- s z Set.__repr__c C s || j vrd| j |< dS )zAdd an item to the set.N©r ©r r r r r r 0 s zSet.addc C s( z | j |= W n ty" t‚Y n0 dS )z Remove an item from the set.N)r ÚKeyErrorÚ ValueErrorr r r r Úremove6 s z Set.removec C s | j |d¡ dS )z'Remove an item from the set if present.N)r Úpopr r r r Údiscard> s z Set.discardc C s | j ¡ \}}|S )z&Remove an arbitrary item from the set.)r Úpopitem)r ÚkÚ_r r r r C s zSet.pop)Úreturnc C s< 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__r r Úupdate)r ÚclsÚobjr r r Ú_cloneH s z Set._clonec C s | ¡ S ©z!Make a (shallow) copy of the set.©r" r r r r Ú__copy__^ s z Set.__copy__c C s | ¡ S r# r$ r r r r Úcopyc s zSet.copyc C s8 t |tƒstdƒ‚| |u r dS |jD ]}| |¡ q$dS )zaUpdate the set, adding any elements from other which are not already in the set. ú other must be a Set instanceN)Ú isinstancer r r r ©r Úotherr r r r Ú union_updateh s zSet.union_updatec C sD t |tƒstdƒ‚| |u r dS t| jƒD ]}||jvr(| j|= q(dS )z]Update the set, removing any elements from other which are not in both sets. r' N)r( r r r r r) r r r Úintersection_updatet s zSet.intersection_updatec C s@ t |tƒstdƒ‚| |u r&| j ¡ n|jD ]}| |¡ q,dS )zWUpdate the set, removing any elements from other which are in the set. r' N)r( r r r Úclearr r) r r r Údifference_updateƒ s zSet.difference_updatec C sH t |tƒstdƒ‚| |u r&| j ¡ n | |¡}| |¡ | |¡ dS )z<Update the set, retaining only elements unique to both sets.r' N)r( r r r r- Ú intersectionr+ r. )r r* Zoverlapr r r Úsymmetric_difference_update s z Set.symmetric_difference_updatec C s | ¡ }| |¡ |S )zwReturn a new set which is the union of ``self`` and ``other``. Returns the same Set type as this set. )r" r+ ©r r* r! r r r Úunionœ s z Set.unionc C s | ¡ }| |¡ |S )z†Return a new set which is the intersection of ``self`` and ``other``. Returns the same Set type as this set. )r" r, r1 r r r r/ ¦ s zSet.intersectionc C s | ¡ }| |¡ |S )z©Return a new set which ``self`` - ``other``, i.e. the items in ``self`` which are not also in ``other``. Returns the same Set type as this set. )r" r. r1 r r r Ú difference± s zSet.differencec C s | ¡ }| |¡ |S )zëReturn a new set which (``self`` - ``other``) | (``other`` - ``self), ie: the items in either ``self`` or ``other`` which are not contained in their intersection. Returns the same Set type as this set. )r" r0 r1 r r r Úsymmetric_difference¼ s zSet.symmetric_differencec C s | |¡S ©N©r2 ©r r* r r r Ú__or__È s z Set.__or__c C s | |¡S r5 )r/ r7 r r r Ú__and__Ë s z Set.__and__c C s | |¡S r5 r6 r7 r r r Ú__add__Î s z Set.__add__c C s | |¡S r5 )r3 r7 r r r Ú__sub__Ñ s z Set.__sub__c C s | |¡S r5 )r4 r7 r r r Ú__xor__Ô s z Set.__xor__c C s | |¡ | S r5 ©r+ r7 r r r Ú__ior__× s z Set.__ior__c C s | |¡ | S r5 )r, r7 r r r Ú__iand__Û s z Set.__iand__c C s | |¡ | S r5 r= r7 r r r Ú__iadd__ß s z Set.__iadd__c C s | |¡ | S r5 )r. r7 r r r Ú__isub__ã s z Set.__isub__c C s | |¡ | S r5 )r0 r7 r r r Ú__ixor__ç s z Set.__ixor__c C s |D ]}| |¡ qdS )zÑUpdate the set, adding any elements from other which are not already in the set. *other*, the collection of items with which to update the set, which may be any iterable type. N)r r) r r r r ë s z Set.updatec C s | j ¡ dS )zMake the set empty.N)r r- r r r r r- ö s z Set.clearc C s | j |j kS r5 r r7 r r r Ú__eq__ú s z Set.__eq__c C s | |¡ S r5 )rC r7 r r r Ú__ne__ý s z Set.__ne__c C s t | jƒS r5 )Úlenr r r r r Ú__len__ s z Set.__len__c C s t | jƒS r5 )Úiterr r r r r Ú__iter__ s z Set.__iter__c C sB t |tƒr&tt | j|j|j|j¡ƒS t t | j||d ¡ƒS d S )Né ) r( Úslicer Ú itertoolsÚislicer ÚstartÚstopÚstepÚnext)r Úir r r Ú __getitem__ s zSet.__getitem__c C s6 t |tƒr&t| | ƒD ] }| j|= qn | j| | = d S r5 )r( rJ r r )r rQ Úeltr r r Ú __delitem__ s zSet.__delitem__c C s2 t |tƒstdƒ‚| jD ]}||jvr dS qdS )zFIs this set a subset of *other*? Returns a ``bool``. r' FT©r( r r r r) r r r Úissubset s z Set.issubsetc C s2 t |tƒstdƒ‚|jD ]}|| jvr dS qdS )zHIs this set a superset of *other*? Returns a ``bool``. r' FTrU r) r r r Ú issuperset s zSet.issupersetc C s2 t |tƒstdƒ‚|jD ]}|| jv r dS qdS )Nr' FTrU r) r r r Ú isdisjoint- s zSet.isdisjoint)N)+Ú__name__Ú __module__Ú __qualname__Ú__doc__Ú __slots__r r r r r r r" r% r& r+ r, r. r0 r2 r/ r3 r4 r8 r9 r: r; r< r> r? r@ rA rB r r- rC rD rF rH rR rT rV rW rX r r r r r sP r )rK r r r r r Ú<module> s