Name	Size	Mode	Actions
asyncbackend.cpython-313.pyc	3455	0644	editdlrm
asyncquery.cpython-313.pyc	37661	0644	editdlrm
asyncresolver.cpython-313.pyc	20871	0644	editdlrm
dnssec.cpython-313.pyc	51461	0644	editdlrm
dnssectypes.cpython-313.pyc	2070	0644	editdlrm
e164.cpython-313.pyc	4849	0644	editdlrm
edns.cpython-313.pyc	25894	0644	editdlrm
entropy.cpython-313.pyc	6110	0644	editdlrm
enum.cpython-313.pyc	4930	0644	editdlrm
exception.cpython-313.pyc	7474	0644	editdlrm
flags.cpython-313.pyc	3098	0644	editdlrm
grange.cpython-313.pyc	1775	0644	editdlrm
immutable.cpython-313.pyc	3828	0644	editdlrm
inet.cpython-313.pyc	6581	0644	editdlrm
ipv4.cpython-313.pyc	2719	0644	editdlrm
ipv6.cpython-313.pyc	6921	0644	editdlrm
message.cpython-313.pyc	85931	0644	editdlrm
name.cpython-313.pyc	49060	0644	editdlrm
namedict.cpython-313.pyc	4354	0644	editdlrm
nameserver.cpython-313.pyc	14706	0644	editdlrm
node.cpython-313.pyc	16349	0644	editdlrm
opcode.cpython-313.pyc	3140	0644	editdlrm
query.cpython-313.pyc	64517	0644	editdlrm
rcode.cpython-313.pyc	4453	0644	editdlrm
rdata.cpython-313.pyc	38650	0644	editdlrm
rdataclass.cpython-313.pyc	3537	0644	editdlrm
rdataset.cpython-313.pyc	22657	0644	editdlrm
rdatatype.cpython-313.pyc	10239	0644	editdlrm
renderer.cpython-313.pyc	15945	0644	editdlrm
resolver.cpython-313.pyc	88007	0644	editdlrm
reversename.cpython-313.pyc	4693	0644	editdlrm
rrset.cpython-313.pyc	12317	0644	editdlrm
serial.cpython-313.pyc	5421	0644	editdlrm
set.cpython-313.pyc	12121	0644	editdlrm
tokenizer.cpython-313.pyc	26525	0644	editdlrm
transaction.cpython-313.pyc	28883	0644	editdlrm
tsig.cpython-313.pyc	17168	0644	editdlrm
tsigkeyring.cpython-313.pyc	2871	0644	editdlrm
ttl.cpython-313.pyc	2535	0644	editdlrm
update.cpython-313.pyc	16119	0644	editdlrm
version.cpython-313.pyc	762	0644	editdlrm
versioned.cpython-313.pyc	14800	0644	editdlrm
win32util.cpython-313.pyc	9929	0644	editdlrm
wire.cpython-313.pyc	5550	0644	editdlrm
xfr.cpython-313.pyc	14671	0644	editdlrm
zone.cpython-313.pyc	66218	0644	editdlrm
zonefile.cpython-313.pyc	34318	0644	editdlrm
zonetypes.cpython-313.pyc	1416	0644	editdlrm
_asyncbackend.cpython-313.pyc	4985	0644	editdlrm
_asyncio_backend.cpython-313.pyc	14578	0644	editdlrm
_ddr.cpython-313.pyc	7959	0644	editdlrm
_features.cpython-313.pyc	3236	0644	editdlrm
_immutable_ctx.cpython-313.pyc	3335	0644	editdlrm
_trio_backend.cpython-313.pyc	13751	0644	editdlrm
__init__.cpython-313.pyc	702	0644	editdlrm

� ���j�#�� �SS
Kr"SS5r
g
)�Nc�
�\r
SrS
rSrS/
rS,Sj
rSrSrSr S r S rS-SjrSr S rSrSrSrSrSrSrSrSrSrSrSrSrSrSrSrSrSrSr S r!S!r"S"r#S#r$S$r%S%r&S&r'S'r(S(r)S)r*S*r+S+r,g).�Set�at
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�^�[
5Ul
U
bU
HnURU5
M g
g
)zQInitialize the set. *items*, an iterable or ``None``, the initial set of items. N)�dictr�add)�selfr�items �:/usr/lib/rads/venv/lib/python3.13/site-packages/dns/set.py�__init__�Set.__init__!s/���V�� ������������c
�b�S
[
[URR55
5
S3$)Nzdns.set.Set(�
))�repr�listr�keys�
r s
r�__repr__�Set.__repr__.s'���d�4�� � ���(9�#:�;�<�A�>�>rc�B�XR;
aS
URU
'g
g
)zAdd an item to the set.N�
r�r rs rr �Set.add1s!���z�z�!�#�D�J�J�t��"rc�H�URU
g
![a [e
f=f
)zRemove an item from the set.N)r�KeyError� ValueErrorrs r�remove� Set.remove7s(�� �� � �4� ���
���
�s� �!c�<�URRU
S
5 g
)z'Remove an item from the set if present.N)r�poprs r�discard�Set.discard?s�� � � ���t�T�"rc
�>�URR5upU
$)
z&Remove an arbitrary item from the set.)r�popitem)r �
k�
_s rr"�Set.popDs�����#�#�%����rc
���[
US
5(a URn
OURn
U
RU
5
n[ 5UlUR R UR 5
U$)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�_clone� Set._cloneIsW���4��(�(��#�#�C��.�.�C��k�k�#����F�� �� � ������$�� rc
�"�UR
5$�
z!Make a (shallow) copy of the set.�
r2rs
r�__copy__�Set.__copy___����{�{�}�rc
�"�UR
5$r5r6rs
r�copy�Set.copydr9rc��[
U
[5(d[S
5
e
X
La
gU
RHnUR U5
M g)zQUpdate the set, adding any elements from other which are not already in the set. �other must be a Set instanceN)� isinstancerrrr �r �otherrs r�union_update�Set.union_updateis>�� �%��%�%��;�<�<��=���K�K�D��H�H�T�N� rc���[
U
[5(d[S
5
e
X
La
g[UR5
H!nX!R;
dMURU M# g)zMUpdate the set, removing any elements from other which are not in both sets. r>N)r?rrrrr@s r�intersection_update�Set.intersection_updateusP�� �%��%�%��;�<�<��=������$�D��;�;�&��J�J�t�$�%rc���[
U
[5(d[S
5
e
X
LaURR 5 gU
RHnURU5
M g)zGUpdate the set, removing any elements from other which are in the set. r>N)r?rrr�clearr#r@s r�difference_update�Set.difference_update�sL�� �%��%�%��;�<�<��=��J�J�����������T�"�$rc���[
U
[5(d[S
5
e
X
LaURR 5 gURU
5
nUR U
5
URU5
g)zN)r?rrrrH�intersectionrBrI)r rA�overlaps r�symmetric_difference_update�Set.symmetric_difference_update�s^���%��%�%��;�<�<��=��J�J�����'�'��.�G����e�$��"�"�7�+rc�H�UR
5nURU
5
U$)
zgReturn a new set which is the union of ``self`` and ``other``. Returns the same Set type as this set. )r2rB�r rAr1s r�union� Set.union�s"���k�k�m�������� rc�H�UR
5nURU
5
U$)
znReturn a new set which is the intersection of ``self`` and ``other``. Returns the same Set type as this set. )r2rErQs rrL�Set.intersection�s"���k�k�m������&�� rc�H�UR
5nURU
5
U$)
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. )r2rIrQs r� difference�Set.difference�s"���k�k�m�����e�$�� rc�H�UR
5nURU
5
U$)
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. )r2rNrQs r�symmetric_difference�Set.symmetric_difference�s"���k�k�m���'�'��.�� rc�$�UR
U
5
$�
N�
rR�r rAs r�__or__� Set.__or__�����z�z�%� � rc�$�UR
U
5
$r])
rLr_s r�__and__�Set.__and__�s��� � ��'�'rc�$�UR
U
5
$r]r^r_s r�__add__�Set.__add__�rbrc�$�UR
U
5
$r])
rWr_s r�__sub__�Set.__sub__�s�����u�%�%rc�$�UR
U
5
$r])
rZr_s r�__xor__�Set.__xor__�s���(�(��/�/rc�(�UR
U
5
U$r]�
rBr_s r�__ior__�Set.__ior__�������%� ��rc�(�UR
U
5
U$r])
rEr_s r�__iand__�Set.__iand__�s��� � ��'��rc�(�UR
U
5
U$r]rpr_s r�__iadd__�Set.__iadd__�rsrc�(�UR
U
5
U$r])
rIr_s r�__isub__�Set.__isub__�s�����u�%��rc�(�UR
U
5
U$r])
rNr_s r�__ixor__�Set.__ixor__�s���(�(��/��rc�8�U
HnUR
U5
M g
)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@s rr/� Set.update�s���D��H�H�T�N�rc
�8�URR5 g
)zMake the set empty.N)rrHrs
rrH� Set.clear�s��� � ���rc�4�URU
R:H$r]rr_s r�__eq__� Set.__eq__�s���z�z�U�[�[�(�(rc�.�UR
U
5
(+$r])
r�r_s r�__ne__� Set.__ne__�s���;�;�u�%�%�%rc
�,�[
UR5
$r])�lenrrs
r�__len__�Set.__len__

s���4�:�:��rc
�,�[
UR5
$r])�iterrrs
r�__iter__�Set.__iter__
s���D�J�J��rc�
�[
U
[5(aJ[[R"UR U
RU
RU
R55
$[[R"UR XS
-55
$)N�
) r?�slicer� itertools�islicer�start�stop�step�next)r �
is r�__getitem__�Set.__getitem__
s[���a����� �(�(����Q�W�W�a�f�f�a�f�f�M�N�N�� �(�(����Q�A��>�?�?rc��[
U
[5(a"[X
5
HnURU M gURX
 gr])r?r�rr)r r��elts r�__delitem__�Set.__delitem__
s:���a�����D�G�}���J�J�s�O�%�� � �4�7�#rc��[
U
[5(d[S
5
e
URHnX!R;
dM g g)z6Is this set a subset of *other*? Returns a ``bool``. r>FT�r?rrrr@s r�issubset�Set.issubset
s=���%��%�%��;�<�<��J�J�D��;�;�&���rc��[
U
[5(d[S
5
e
U
RHnX R;
dM g g)z8Is this set a superset of *other*? Returns a ``bool``. r>FTr�r@s r� issuperset�Set.issuperset!
s=���%��%�%��;�<�<��K�K�D��:�:�%�� �rc��[
U
[5(d[S
5
e
U
RHnX R;dM g g)Nr>FTr�r@s r� isdisjoint�Set.isdisjoint.
s;���%��%�%��;�<�<��K�K�D��z�z�!�� �rrr])�returnr)-�__name__� __module__�__qualname__�__firstlineno__�__doc__� __slots__r rr rr#r"r2r7r;rBrErIrNrRrLrWrZr`rdrgrjrmrqrurxr{r~r/rHr�r�r�r�r�r�r�r�r��__static_attributes__�rrrrs����� �I��
?�$��#� � �,� � � %�#� ,�� � � �
!�
(�
!�
&�
0������ ��
)�
&�
�
 �@
�$���rr)r�rr�rr�r�
s�


�$
�_
�_
r