opt
/
hc_python
/
lib
/
python3.12
/
site-packages
/
dns
/
__pycache__
/
Go to Home Directory
+
Upload
Create File
root@0UT1S:~$
Execute
By Order of Mr.0UT1S
[DIR] ..
N/A
__init__.cpython-312.pyc
698 bytes
Rename
Delete
_asyncbackend.cpython-312.pyc
4.68 KB
Rename
Delete
_asyncio_backend.cpython-312.pyc
13.93 KB
Rename
Delete
_ddr.cpython-312.pyc
7.59 KB
Rename
Delete
_features.cpython-312.pyc
3.20 KB
Rename
Delete
_immutable_ctx.cpython-312.pyc
3.14 KB
Rename
Delete
_trio_backend.cpython-312.pyc
13.13 KB
Rename
Delete
asyncbackend.cpython-312.pyc
3.31 KB
Rename
Delete
asyncquery.cpython-312.pyc
36.65 KB
Rename
Delete
asyncresolver.cpython-312.pyc
20.80 KB
Rename
Delete
dnssec.cpython-312.pyc
50.30 KB
Rename
Delete
dnssectypes.cpython-312.pyc
1.91 KB
Rename
Delete
e164.cpython-312.pyc
4.77 KB
Rename
Delete
edns.cpython-312.pyc
25.07 KB
Rename
Delete
entropy.cpython-312.pyc
5.78 KB
Rename
Delete
enum.cpython-312.pyc
4.75 KB
Rename
Delete
exception.cpython-312.pyc
7.03 KB
Rename
Delete
flags.cpython-312.pyc
2.97 KB
Rename
Delete
grange.cpython-312.pyc
1.71 KB
Rename
Delete
immutable.cpython-312.pyc
3.67 KB
Rename
Delete
inet.cpython-312.pyc
6.52 KB
Rename
Delete
ipv4.cpython-312.pyc
2.64 KB
Rename
Delete
ipv6.cpython-312.pyc
6.64 KB
Rename
Delete
message.cpython-312.pyc
84.56 KB
Rename
Delete
name.cpython-312.pyc
48.00 KB
Rename
Delete
namedict.cpython-312.pyc
4.23 KB
Rename
Delete
nameserver.cpython-312.pyc
14.07 KB
Rename
Delete
node.cpython-312.pyc
16.22 KB
Rename
Delete
opcode.cpython-312.pyc
3.04 KB
Rename
Delete
query.cpython-312.pyc
63.10 KB
Rename
Delete
rcode.cpython-312.pyc
4.31 KB
Rename
Delete
rdata.cpython-312.pyc
37.64 KB
Rename
Delete
rdataclass.cpython-312.pyc
3.42 KB
Rename
Delete
rdataset.cpython-312.pyc
22.37 KB
Rename
Delete
rdatatype.cpython-312.pyc
9.98 KB
Rename
Delete
renderer.cpython-312.pyc
15.75 KB
Rename
Delete
resolver.cpython-312.pyc
86.04 KB
Rename
Delete
reversename.cpython-312.pyc
4.60 KB
Rename
Delete
rrset.cpython-312.pyc
12.16 KB
Rename
Delete
serial.cpython-312.pyc
5.04 KB
Rename
Delete
set.cpython-312.pyc
11.92 KB
Rename
Delete
tokenizer.cpython-312.pyc
25.91 KB
Rename
Delete
transaction.cpython-312.pyc
28.62 KB
Rename
Delete
tsig.cpython-312.pyc
16.35 KB
Rename
Delete
tsigkeyring.cpython-312.pyc
2.81 KB
Rename
Delete
ttl.cpython-312.pyc
2.37 KB
Rename
Delete
update.cpython-312.pyc
15.87 KB
Rename
Delete
version.cpython-312.pyc
752 bytes
Rename
Delete
versioned.cpython-312.pyc
14.26 KB
Rename
Delete
win32util.cpython-312.pyc
9.31 KB
Rename
Delete
wire.cpython-312.pyc
5.30 KB
Rename
Delete
xfr.cpython-312.pyc
14.12 KB
Rename
Delete
zone.cpython-312.pyc
65.90 KB
Rename
Delete
zonefile.cpython-312.pyc
32.97 KB
Rename
Delete
zonetypes.cpython-312.pyc
1.29 KB
Rename
Delete
� !��g�# � � � d dl Z G d� d� Zy)� Nc � � e Zd ZdZdgZd*d�Zd� Zd� Zd� Zd� Z d � Z d+d �Z d � Z d � Z d � Zd� Zd� Zd� Zd� Zd� Zd� Zd� Zd� Zd� Zd� Zd� Zd� Zd� Zd� Z d � Z d � Z d � Z d � Z d � Z!d!� Z"d"� Z#d#� Z$d$� Z%d%� Z&d&� Z'd'� Z(d(� Z)d)� Z*y),�Seta� A simple set class. This class was originally used to deal with python not having a set class, and originally the class used lists in its implementation. The ordered and indexable nature of RRsets and Rdatasets is unfortunately widely used in dnspython applications, so for backwards compatibility sets continue to be a custom class, now based on an ordered dictionary. �itemsNc �X � t � | _ |�|D ] }| j |� � yy)zaInitialize the set. *items*, an iterable or ``None``, the initial set of items. N)�dictr �add)�selfr �items �6/opt/hc_python/lib/python3.12/site-packages/dns/set.py�__init__z Set.__init__! s/ � � �V�� � � � �� ����� � � c �b � dt t | j j � � � � d�S )Nz dns.set.Set(�))�repr�listr �keys�r s r �__repr__z Set.__repr__. s' � � �d�4�� � ���(9�#:� ;� <�A�>�>r c �@ � || j vrd| j |< yy)zAdd an item to the set.N�r �r r s r r zSet.add1 s# � � �t�z�z� !� #�D�J�J�t� � "r c �F � | j |= y# t $ r t �w xY w)z Remove an item from the set.N)r �KeyError� ValueErrorr s r �removez Set.remove7 s( � � �� � �4� ��� � � � �s � � c �< � | j j |d� y)z'Remove an item from the set if present.N)r �popr s r �discardz Set.discard? s � � � � ���t�T�"r c �@ � | j j � \ }}|S )z&Remove an arbitrary item from the set.)r �popitem)r �k�_s r r zSet.popD s � ����#�#�%���A��r c �� � t | d� r | j }n | j }|j |� }t � |_ |j 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�objs r �_clonez Set._cloneI sT � � �4� � (��#�#�C��.�.�C��k�k�#� ���F�� � � � ������$�� r c �" � | j � S �z!Make a (shallow) copy of the set.�r+ r s r �__copy__z Set.__copy___ � � � �{�{�}� r c �" � | j � S r- r. r s r �copyzSet.copyd r0 r c � � t |t � s t d� �| |u ry|j D ] }| j |� � y)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 s r � union_updatezSet.union_updatei s= � � �%��%� � ;�<� <� �5�=� ��K�K�D� �H�H�T�N� r c � � t |t � s t d� �| |u ryt | j � D ] }||j vs�| j |= � y)z]Update the set, removing any elements from other which are not in both sets. r4 N)r5 r r r r r6 s r �intersection_updatezSet.intersection_updateu sQ � � �%��%� � ;�<� <� �5�=� � ����$�D��5�;�;�&��J�J�t�$� %r c � � t |t � s t d� �| |u r| j j � y|j D ] }| j |� � y)zWUpdate the set, removing any elements from other which are in the set. r4 N)r5 r r r �clearr r6 s r �difference_updatezSet.difference_update� sK � � �%��%� � ;�<� <� �5�=� �J�J� � � � � � ��� � �T�"� $r c �� � t |t � s t d� �| |u r| j j � y| j |� }| j |� | j |� y)z<Update the set, retaining only elements unique to both sets.r4 N)r5 r r r r< � intersectionr8 r= )r r7 �overlaps r �symmetric_difference_updatez Set.symmetric_difference_update� s] � � �%��%� � ;�<� <� �5�=� �J�J� � � ��'�'��.�G� � � �e� $� � "� "�7� +r c �H � | j � }|j |� |S )zwReturn a new set which is the union of ``self`` and ``other``. Returns the same Set type as this set. )r+ r8 �r r7 r* s r �unionz Set.union� s" � � �k�k�m�� ���� �� r c �H � | j � }|j |� |S )z�Return a new set which is the intersection of ``self`` and ``other``. Returns the same Set type as this set. )r+ r: rC s r r? zSet.intersection� s" � � �k�k�m�� � � ��&�� r c �H � | j � }|j |� |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= rC s r � differencezSet.difference� s" � � �k�k�m�� � � �e�$�� r c �H � | j � }|j |� |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+ rA rC s r �symmetric_differencezSet.symmetric_difference� s" � � �k�k�m�� �'�'��.�� r c �$ � | j |� S �N�rD �r r7 s r �__or__z Set.__or__� � � ��z�z�%� � r c �$ � | j |� S rK )r? rM s r �__and__z Set.__and__� s � �� � ��'�'r c �$ � | j |� S rK rL rM s r �__add__z Set.__add__� rO r c �$ � | j |� S rK )rG rM s r �__sub__z Set.__sub__� s � ����u�%�%r c �$ � | j |� S rK )rI rM s r �__xor__z Set.__xor__� s � ��(�(��/�/r c �( � | j |� | S rK �r8 rM s r �__ior__z Set.__ior__� � � � ���%� �� r c �( � | j |� | S rK )r: rM s r �__iand__z Set.__iand__� s � � � � ��'�� r c �( � | j |� | S rK rY rM s r �__iadd__z Set.__iadd__� r[ r c �( � | j |� | S rK )r= rM s r �__isub__z Set.__isub__� s � � � � �u�%�� r c �( � | j |� | S rK )rA rM s r �__ixor__z Set.__ixor__� s � � �(�(��/�� r c �4 � |D ] }| j |� � y)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 r6 s r r( z Set.update� s � � �D� �H�H�T�N� r c �8 � | j j � y)zMake the set empty.N)r r< r s r r< z Set.clear� s � � � � ���r c �4 � | j |j k( S rK r rM s r �__eq__z Set.__eq__� s � ��z�z�U�[�[�(�(r c �& � | j |� S rK )rg rM s r �__ne__z Set.__ne__� s � ��;�;�u�%�%�%r c �, � t | j � S rK )�lenr r s r �__len__z Set.__len__ s � ��4�:�:�� r c �, � t | j � S rK )�iterr r s r �__iter__z Set.__iter__ s � ��D�J�J� � r c � � t |t � rIt t j | j |j |j |j � � S t t j | j ||dz � � S )N� ) r5 �slicer � itertools�islicer �start�stop�step�next)r �is r � __getitem__zSet.__getitem__ sZ � � �a�� �� �(�(����Q�W�W�a�f�f�a�f�f�M�N� N�� �(�(����Q��A��>�?� ?r c � � t |t � r!t | | � D ] }| j |= � y | j | | = y rK )r5 rr r r )r ry �elts r � __delitem__zSet.__delitem__ s; � � �a�� ��D��G�}���J�J�s�O� %� � � �4��7�#r c �| � t |t � s t d� �| j D ] }||j vs� y y)zFIs this set a subset of *other*? Returns a ``bool``. r4 FT�r5 r r r r6 s r �issubsetz Set.issubset s< � � �%��%� � ;�<� <��J�J�D��5�;�;�&� � � r c �| � t |t � s t d� �|j D ] }|| j vs� y y)zHIs this set a superset of *other*? Returns a ``bool``. r4 FTr r6 s r � issupersetzSet.issuperset! s< � � �%��%� � ;�<� <��K�K�D��4�:�:�%� � � r c �| � t |t � s t d� �|j D ] }|| j v s� y y)Nr4 FTr r6 s r � isdisjointzSet.isdisjoint. s: � ��%��%� � ;�<� <��K�K�D��t�z�z�!� � � r rK )�returnr )+�__name__� __module__� __qualname__�__doc__� __slots__r r r r r r r+ r/ r2 r8 r: r= rA rD r? rG rI rN rQ rS rU rW rZ r] r_ ra rc r( r< rg ri rl ro rz r} r� r� r� � r r r r s� � �� � �I� �?�$� �#� � �, � � � %� #� ,�� � � �!�(�!�&�0������ ��)�&� � �@� $� � �r r )rs r r� r r �<module>r� s ��$ �_� _r
Save