g# SSKr"SS5rg)Nc \rSrSrSrS/rS,SjrSrSrSr S r S r S-S jr 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).SetatA 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^[5UlUbUHnURU5 M gg)zQInitialize the set. *items*, an iterable or ``None``, the initial set of items. N)dictradd)selfritems @/home/matz/Project1/venv/lib/python3.13/site-packages/dns/set.py__init__ Set.__init__!s/ V   cbS[[URR555S3$)Nz dns.set.Set())reprlistrkeysr s r __repr__ Set.__repr__.s'd4 (9#:;>rcBXR;aSURU'gg)zAdd an item to the set.Nrr r s r r Set.add1s! zz !#DJJt  "rcHURU g![a [ef=f)zRemove an item from the set.N)rKeyError ValueErrorrs r remove Set.remove7s(  4    s !c<URRUS5 g)z'Remove an item from the set if present.N)rpoprs r discard Set.discard?s tT"rc>URR5upU$)z&Remove an arbitrary item from the set.)rpopitem)r k_s r r"Set.popDs##%rc[US5(a URnO URnURU5n[ 5UlUR R UR 5 U$)aMake 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__rrupdate)r clsobjs r _clone Set._cloneIsW 4 ( (##C..Ckk#F  $ rc"UR5$z!Make a (shallow) copy of the set.r2rs r __copy__ Set.__copy___{{}rc"UR5$r5r6rs r copySet.copydr9rc[U[5(d [S5eXLagURHnUR 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 otherr s r union_updateSet.union_updateis> %%%;< < = KKD HHTN rc[U[5(d [S5eXLag[UR5H!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_updateSet.intersection_updateusP %%%;< < = $D;;&JJt$%rc[U[5(d [S5eXLaURR 5 gURHnUR U5 M g)zGUpdate the set, removing any elements from other which are in the set. r>N)r?rrrclearr#r@s r difference_updateSet.difference_updatesL %%%;< < = JJ     T"$rc[U[5(d [S5eXLaURR 5 gUR U5nUR U5 URU5 g)zN)r?rrrrH intersectionrBrI)r rAoverlaps r symmetric_difference_updateSet.symmetric_difference_updates^%%%;< < = JJ   ''.G   e $  " "7 +rcHUR5nURU5 U$)zgReturn a new set which is the union of ``self`` and ``other``. Returns the same Set type as this set. )r2rBr rAr1s r union Set.unions" kkm  rcHUR5nURU5 U$)znReturn a new set which is the intersection of ``self`` and ``other``. Returns the same Set type as this set. )r2rErQs r rLSet.intersections"kkm & rcHUR5nURU5 U$)zReturn 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 differenceSet.differences"kkm e$ rcHUR5nURU5 U$)zReturn 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_differenceSet.symmetric_differences"kkm ''. rc$URU5$NrRr rAs r __or__ Set.__or__zz%  rc$URU5$r])rLr_s r __and__ Set.__and__s  ''rc$URU5$r]r^r_s r __add__ Set.__add__rbrc$URU5$r])rWr_s r __sub__ Set.__sub__su%%rc$URU5$r])rZr_s r __xor__ Set.__xor__s((//rc(URU5 U$r]rBr_s r __ior__ Set.__ior__ %  rc(URU5 U$r])rEr_s r __iand__ Set.__iand__s   ' rc(URU5 U$r]rpr_s r __iadd__ Set.__iadd__rsrc(URU5 U$r])rIr_s r __isub__ Set.__isub__s u% rc(URU5 U$r])rNr_s r __ixor__ Set.__ixor__s ((/ rc8UHnURU5 M g)zUpdate 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.updatesD HHTNrc8URR5 g)zMake the set empty.N)rrHrs r rH Set.clears rc4URUR:H$r]rr_s r __eq__ Set.__eq__szzU[[((rc.URU5(+$r])rr_s r __ne__ Set.__ne__s;;u%%%rc,[UR5$r])lenrrs r __len__ Set.__len__s4::rc,[UR5$r])iterrrs r __iter__ Set.__iter__sDJJrc[U[5(aJ[[R"UR UR URUR55$[[R"UR XS-55$)N) r?slicer itertoolsislicerstartstopstepnext)r is r __getitem__Set.__getitem__s[ a   ((QWWaffaffMN N ((QA>? ?rc[U[5(a"[X5HnURU M gURX gr])r?rrr)r relts r __delitem__Set.__delitem__ s: a  DG}JJsO% 47#rc[U[5(d [S5eURHnX!R;dM g g)z6Is this set a subset of *other*? Returns a ``bool``. r>FTr?rrrr@s r issubset Set.issubsets= %%%;< <JJD;;&rc[U[5(d [S5eURHnX R;dM g g)z8Is this set a superset of *other*? Returns a ``bool``. r>FTrr@s r issupersetSet.issuperset!s= %%%;< <KKD::% rc[U[5(d [S5eURHnX R;dM g g)Nr>FTrr@s r isdisjointSet.isdisjoint.s;%%%;< <KKDzz! rrr])returnr)-__name__ __module__ __qualname____firstlineno____doc__ __slots__r rr rr#r"r2r7r;rBrErIrNrRrLrWrZr`rdrgrjrmrqrurxr{r~r/rHrrrrrrrrr__static_attributes__rr rrs I ?$ #  ,   % # ,   !(!&0 )& @ $  rr)rrrrr rs$__r