__  __    __   __  _____      _            _          _____ _          _ _ 
 |  \/  |   \ \ / / |  __ \    (_)          | |        / ____| |        | | |
 | \  / |_ __\ V /  | |__) | __ ___   ____ _| |_ ___  | (___ | |__   ___| | |
 | |\/| | '__|> <   |  ___/ '__| \ \ / / _` | __/ _ \  \___ \| '_ \ / _ \ | |
 | |  | | |_ / . \  | |   | |  | |\ V / (_| | ||  __/  ____) | | | |  __/ | |
 |_|  |_|_(_)_/ \_\ |_|   |_|  |_| \_/ \__,_|\__\___| |_____/|_| |_|\___V 2.1
 if you need WebShell for Seo everyday contact me on Telegram
 Telegram Address : @jackleet
        
        
For_More_Tools: Telegram: @jackleet | Bulk Smtp support mail sender | Business Mail Collector | Mail Bouncer All Mail | Bulk Office Mail Validator | Html Letter private



Upload:

Command:

aptanhua@216.73.216.200: ~ $
�

^��g�#�� �ddlZGd�d�Zy)�Nc��eZdZdZdgZd*d�Zd�Zd�Zd�Zd�Z	d	�Z
d+d
�Zd�Zd�Z
d
�Zd�Zd�Zd�Zd�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*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�dtt|jj����d�S)Nzdns.set.Set(�))�repr�listr�keys�r	s r�__repr__zSet.__repr__.s'���d�4��
�
���(9�#:�;�<�A�>�>r
c�@�||jvrd|j|<yy)zAdd an item to the set.N�r�r	r
s  rrzSet.add1s#���t�z�z�!�#�D�J�J�t��"r
c�F�	|j|=y#t$rt�wxYw)zRemove an item from the set.N)r�KeyError�
ValueErrorrs  r�removez
Set.remove7s(��	��
�
�4� ���	���	�s�
� c�<�|jj|d�y)z'Remove an item from the set if present.N)r�poprs  r�discardzSet.discard?s��	
�
�
���t�T�"r
c�@�|jj�\}}|S)z&Remove an arbitrary item from the set.)r�popitem)r	�k�_s   rrzSet.popDs�����#�#�%���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__rr�update)r	�cls�objs   r�_clonez
Set._cloneIsT���4��(��#�#�C��.�.�C��k�k�#����F��	��	�	������$��
r
c�"�|j�S�z!Make a (shallow) copy of the set.�r+rs r�__copy__zSet.__copy___����{�{�}�r
c�"�|j�Sr-r.rs r�copyzSet.copydr0r
c��t|t�std��||ury|jD]}|j	|��y)zaUpdate the set, adding any elements from other which are not
        already in the set.
        �other must be a Set instanceN)�
isinstancerrrr�r	�otherr
s   r�union_updatezSet.union_updateis=��
�%��%��;�<�<��5�=���K�K�D��H�H�T�N� r
c��t|t�std��||uryt|j�D]}||jvs�|j|=� y)z]Update the set, removing any elements from other which are not
        in both sets.
        r4N)r5rrrrr6s   r�intersection_updatezSet.intersection_updateusQ��
�%��%��;�<�<��5�=������$�D��5�;�;�&��J�J�t�$�%r
c��t|t�std��||ur|jj	�y|jD]}|j|��y)zWUpdate the set, removing any elements from other which are in
        the set.
        r4N)r5rrr�clearrr6s   r�difference_updatezSet.difference_update�sK��
�%��%��;�<�<��5�=��J�J�����������T�"�$r
c���t|t�std��||ur|jj	�y|j|�}|j
|�|j|�y)z<Update the set, retaining only elements unique to both sets.r4N)r5rrrr<�intersectionr8r=)r	r7�overlaps   r�symmetric_difference_updatezSet.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	r7r*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:rCs   rr?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=rCs   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+rArCs   r�symmetric_differencezSet.symmetric_difference�s"���k�k�m���'�'��.��
r
c�$�|j|�S�N�rD�r	r7s  r�__or__z
Set.__or__�����z�z�%� � r
c�$�|j|�SrK)r?rMs  r�__and__zSet.__and__�s��� � ��'�'r
c�$�|j|�SrKrLrMs  r�__add__zSet.__add__�rOr
c�$�|j|�SrK)rGrMs  r�__sub__zSet.__sub__�s�����u�%�%r
c�$�|j|�SrK)rIrMs  r�__xor__zSet.__xor__�s���(�(��/�/r
c�(�|j|�|SrK�r8rMs  r�__ior__zSet.__ior__�������%� ��r
c�(�|j|�|SrK)r:rMs  r�__iand__zSet.__iand__�s��� � ��'��r
c�(�|j|�|SrKrYrMs  r�__iadd__zSet.__iadd__�r[r
c�(�|j|�|SrK)r=rMs  r�__isub__zSet.__isub__�s�����u�%��r
c�(�|j|�|SrK)rArMs  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)rr6s   rr(z
Set.update�s���D��H�H�T�N�r
c�8�|jj�y)zMake the set empty.N)rr<rs rr<z	Set.clear�s���
�
���r
c�4�|j|jk(SrKrrMs  r�__eq__z
Set.__eq__�s���z�z�U�[�[�(�(r
c�&�|j|�SrK)rgrMs  r�__ne__z
Set.__ne__�s���;�;�u�%�%�%r
c�,�t|j�SrK)�lenrrs r�__len__zSet.__len__s���4�:�:��r
c�,�t|j�SrK)�iterrrs r�__iter__zSet.__iter__s���D�J�J��r
c��t|t�rIttj|j
|j|j|j��Sttj|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||=yrK)r5rrrr)r	ry�elts   r�__delitem__zSet.__delitem__
s;���a����D��G�}���J�J�s�O�%��
�
�4��7�#r
c�|�t|t�std��|jD]}||jvs�yy)zFIs this set a subset of *other*?

        Returns a ``bool``.
        r4FT�r5rrrr6s   r�issubsetzSet.issubsets<���%��%��;�<�<��J�J�D��5�;�;�&���r
c�|�t|t�std��|jD]}||jvs�yy)zHIs this set a superset of *other*?

        Returns a ``bool``.
        r4FTrr6s   r�
issupersetzSet.issuperset!s<���%��%��;�<�<��K�K�D��4�:�:�%�� �r
c�|�t|t�std��|jD]}||jvs�yy)Nr4FTrr6s   r�
isdisjointzSet.isdisjoint.s:���%��%��;�<�<��K�K�D��t�z�z�!�� �r
rK)�returnr)+�__name__�
__module__�__qualname__�__doc__�	__slots__rrrrrrr+r/r2r8r:r=rArDr?rGrIrNrQrSrUrWrZr]r_rarcr(r<rgrirlrorzr}r�r�r��r
rrrs�����	�I��?�$��#�
�
�,�
�

�
%�#�
,��	�	�
�!�(�!�&�0������	��)�&�� �@�$���r
r)rsrr�r
r�<module>r�s��$�_�_r

Filemanager

Name Type Size Permission Actions
__init__.cpython-312.pyc File 698 B 0644
_asyncbackend.cpython-312.pyc File 4.68 KB 0644
_asyncio_backend.cpython-312.pyc File 13.93 KB 0644
_ddr.cpython-312.pyc File 7.59 KB 0644
_features.cpython-312.pyc File 3.2 KB 0644
_immutable_ctx.cpython-312.pyc File 3.14 KB 0644
_trio_backend.cpython-312.pyc File 13.13 KB 0644
asyncbackend.cpython-312.pyc File 3.31 KB 0644
asyncquery.cpython-312.pyc File 36.65 KB 0644
asyncresolver.cpython-312.pyc File 20.8 KB 0644
dnssec.cpython-312.pyc File 50.3 KB 0644
dnssectypes.cpython-312.pyc File 1.91 KB 0644
e164.cpython-312.pyc File 4.77 KB 0644
edns.cpython-312.pyc File 25.07 KB 0644
entropy.cpython-312.pyc File 5.78 KB 0644
enum.cpython-312.pyc File 4.75 KB 0644
exception.cpython-312.pyc File 7.03 KB 0644
flags.cpython-312.pyc File 2.97 KB 0644
grange.cpython-312.pyc File 1.71 KB 0644
immutable.cpython-312.pyc File 3.67 KB 0644
inet.cpython-312.pyc File 6.52 KB 0644
ipv4.cpython-312.pyc File 2.64 KB 0644
ipv6.cpython-312.pyc File 6.64 KB 0644
message.cpython-312.pyc File 84.56 KB 0644
name.cpython-312.pyc File 48 KB 0644
namedict.cpython-312.pyc File 4.23 KB 0644
nameserver.cpython-312.pyc File 14.07 KB 0644
node.cpython-312.pyc File 16.22 KB 0644
opcode.cpython-312.pyc File 3.04 KB 0644
query.cpython-312.pyc File 63.1 KB 0644
rcode.cpython-312.pyc File 4.31 KB 0644
rdata.cpython-312.pyc File 37.64 KB 0644
rdataclass.cpython-312.pyc File 3.42 KB 0644
rdataset.cpython-312.pyc File 22.37 KB 0644
rdatatype.cpython-312.pyc File 9.98 KB 0644
renderer.cpython-312.pyc File 15.75 KB 0644
resolver.cpython-312.pyc File 86.04 KB 0644
reversename.cpython-312.pyc File 4.6 KB 0644
rrset.cpython-312.pyc File 12.16 KB 0644
serial.cpython-312.pyc File 5.04 KB 0644
set.cpython-312.pyc File 11.92 KB 0644
tokenizer.cpython-312.pyc File 25.91 KB 0644
transaction.cpython-312.pyc File 28.62 KB 0644
tsig.cpython-312.pyc File 16.35 KB 0644
tsigkeyring.cpython-312.pyc File 2.81 KB 0644
ttl.cpython-312.pyc File 2.37 KB 0644
update.cpython-312.pyc File 15.87 KB 0644
version.cpython-312.pyc File 752 B 0644
versioned.cpython-312.pyc File 14.26 KB 0644
win32util.cpython-312.pyc File 9.31 KB 0644
wire.cpython-312.pyc File 5.3 KB 0644
xfr.cpython-312.pyc File 14.12 KB 0644
zone.cpython-312.pyc File 65.9 KB 0644
zonefile.cpython-312.pyc File 32.97 KB 0644
zonetypes.cpython-312.pyc File 1.29 KB 0644