관리-도구
편집 파일: set.pyo
� !`Nc @ s d Z d e f d � � YZ d S( s A simple Set class.t Setc B sL e Z d Z d g Z d$ 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 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 d � Z! d � Z" d � Z# d! � Z$ d" � Z% d# � Z& RS(% s' A simple set class. Sets are not in Python until 2.3, and rdata are not immutable so we cannot use sets.Set anyway. This class implements subset of the 2.3 Set interface using a list as the container. @ivar items: A list of the items which are in the set @type items: listt itemsc C s: g | _ | d k r6 x | D] } | j | � q Wn d S( sv Initialize the set. @param items: the initial set of items @type items: any iterable or None N( R t Nonet add( t selfR t item( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt __init__ s c C s d t | j � S( Ns dns.simpleset.Set(%s)( t reprR ( R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt __repr__* s c C s& | | j k r" | j j | � n d S( s Add an item to the set.N( R t append( R R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyR - s c C s | j j | � d S( s Remove an item from the set.N( R t remove( R R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyR 2 s c C s, y | j j | � Wn t k r' n Xd S( s' Remove an item from the set if present.N( R R t ValueError( R R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt discard6 s c C s. | j } | j | � } t | j � | _ | S( s� 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. ( t __class__t __new__t listR ( R t clst obj( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt _clone= s c C s | j � S( s! Make a (shallow) copy of the set.( R ( R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt __copy__O s c C s | j � S( s! Make a (shallow) copy of the set.( R ( R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt copyS s c C sS t | t � s t d � � n | | k r. d Sx | j D] } | j | � q8 Wd S( s� Update the set, adding any elements from other which are not already in the set. @param other: the collection of items with which to update the set @type other: Set object s other must be a Set instanceN( t isinstanceR R R R ( R t otherR ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt union_updateW s c C sn t | t � s t d � � n | | k r. d Sx9 t | j � D]( } | | j k r> | j j | � q> q> Wd S( s� Update the set, removing any elements from other which are not in both sets. @param other: the collection of items with which to update the set @type other: Set object s other must be a Set instanceN( R R R R R R ( R R R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt intersection_updated s c C s[ t | t � s t d � � n | | k r6 g | _ n! x | j D] } | j | � q@ Wd S( s� Update the set, removing any elements from other which are in the set. @param other: the collection of items with which to update the set @type other: Set object s other must be a Set instanceN( R R R R R ( R R R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt difference_updatet s c C s | j � } | j | � | S( s� Return a new set which is the union of I{self} and I{other}. @param other: the other set @type other: Set object @rtype: the same type as I{self} ( R R ( R R R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt union� s c C s | j � } | j | � | S( s� Return a new set which is the intersection of I{self} and I{other}. @param other: the other set @type other: Set object @rtype: the same type as I{self} ( R R ( R R R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt intersection� s c C s | j � } | j | � | S( s� Return a new set which I{self} - I{other}, i.e. the items in I{self} which are not also in I{other}. @param other: the other set @type other: Set object @rtype: the same type as I{self} ( R R ( R R R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt difference� s c C s | j | � S( N( R ( R R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt __or__� s c C s | j | � S( N( R ( R R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt __and__� s c C s | j | � S( N( R ( R R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt __add__� s c C s | j | � S( N( R ( R R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt __sub__� s c C s | j | � | S( N( R ( R R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt __ior__� s c C s | j | � | S( N( R ( R R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt __iand__� s c C s | j | � | S( N( R ( R R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt __iadd__� s c C s | j | � | S( N( R ( R R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt __isub__� s c C s" x | D] } | j | � q Wd S( s� Update the set, adding any elements from other which are not already in the set. @param other: the collection of items with which to update the set @type other: any iterable typeN( R ( R R R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt update� s c C s g | _ d S( s Make the set empty.N( R ( R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt clear� s c C sR x$ | j D] } | | j k r t Sq Wx$ | j D] } | | j k r1 t Sq1 Wt S( N( R t Falset True( R R R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt __eq__� s c C s | j | � S( N( R) ( R R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt __ne__� s c C s t | j � S( N( t lenR ( R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt __len__� s c C s t | j � S( N( t iterR ( R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt __iter__� s c C s | j | S( N( R ( R t i( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt __getitem__� s c C s | j | =d S( N( R ( R R/ ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt __delitem__� s c C s | j | | !S( N( R ( R R/ t j( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt __getslice__� s c C s | j | | 5d S( N( R ( R R/ R2 ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt __delslice__� s c C sI t | t � s t d � � n x$ | j D] } | | j k r( t Sq( Wt S( s? Is I{self} a subset of I{other}? @rtype: bool s other must be a Set instance( R R R R R' R( ( R R R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt issubset� s c C sI t | t � s t d � � n x$ | j D] } | | j k r( t Sq( Wt S( sA Is I{self} a superset of I{other}? @rtype: bool s other must be a Set instance( R R R R R' R( ( R R R ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt issuperset� s N(' t __name__t __module__t __doc__t __slots__R R R R R R R R R R R R R R R R R R R R! R" R# R$ R% R& R) R* R, R. R0 R1 R3 R4 R5 R6 ( ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyR sH N( R9 t objectR ( ( ( s- /usr/lib64/python2.7/site-packages/dns/set.pyt <module> s