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