mò
!`Nc@s dZd
e
f
d„ƒYZdS(sA simple Set class.tSetcBsL
tZ
dZd
g
Zed„
Zd„Zd„Zd„Zd„Z	d„Z
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&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: listtitemscCs<g|_
|
d
j	o"
x|
D]}|i|ƒ

qWn

d
S(svInitialize the set.

        @param items: the initial set of items
        @type items: any iterable or None
        N(tselfR
tNonetitemtadd(RR
R((t+/usr/lib/python2.4/site-packages/dns/set.pyt__init__s	



c

Csd
t|iƒ
S(Nsdns.simpleset.Set(%s)(treprRR
(
R((Rt__repr__*s
cCs(|
|ijo
|ii|
ƒ

n

d
S(sAdd an item to the set.N(RRR
tappend(RR((RR-s


cCs|i
i|
ƒ

d
S(sRemove an item from the set.N(RR
tremoveR(RR((RR2s

cCs.y|i
i|
ƒ

Wntj
o



n
Xd
S(s'Remove an item from the set if present.N(RR
RRt
ValueError(RR((Rtdiscard6s





c
Cs.|i
}|i|ƒ
}
t|iƒ
|
_|
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.
        N(Rt	__class__tclst__new__tobjtlistR
(RRR((Rt_clone=s
	


c


Cs
|i
ƒS(s!Make a (shallow) copy of the set.N(RR(
R((Rt__copy__Os

c


Cs
|i
ƒS(s!Make a (shallow) copy of the set.N(RR(
R((RtcopySs

cCsZt|
tƒp
td
ƒ
‚
n

||
jo
dSn

x|
iD]}|i|ƒ

q?WdS(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
        sother must be a Set instanceN(t
isinstancetotherRRRR
RR(RRR((Rtunion_updateWs







cCswt|
tƒp
td
ƒ
‚
n

||
jo
dSn

x;t|iƒ
D]*}||
ijo
|ii|ƒ

qE
qEWdS(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
        sother must be a Set instanceN(	RRRRRRR
RR(RRR((Rtintersection_updateds






cCs_t|
tƒp
td
ƒ
‚
n

||
jo

g|_n"
x|
iD]}|i|ƒ

qDWdS(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
        sother must be a Set instanceN(RRRRRR
RR
(RRR((Rtdifference_updatets







cCs|i
ƒ}|i|
ƒ

|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}
        N(RRRRR(RRR((Rtunion‚s


cCs|i
ƒ}|i|
ƒ

|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}
        N(RRRRR(RRR((RtintersectionŽs


cCs|i
ƒ}|i|
ƒ

|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}
        N(RRRRR(RRR((Rt
differencešs


cCs
|i
|
ƒ
S(
N(RRR(RR((Rt__or__§s
cCs
|i
|
ƒ
S(
N(RRR(RR((Rt__and__ªs
cCs
|i
|
ƒ
S(
N(RRR(RR((Rt__add__­s
cCs
|i
|
ƒ
S(
N(RRR(RR((Rt__sub__°s
cCs|i
|
ƒ

|S(
N(RRR(RR((Rt__ior__³s


cCs|i
|
ƒ

|S(
N(RRR(RR((Rt__iand__·s


cCs|i
|
ƒ

|S(
N(RRR(RR((Rt__iadd__»s


cCs|i
|
ƒ

|S(
N(RRR(RR((Rt__isub__¿s


cCs"x|
D]}|i|ƒ

qWd
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(RRRR(RRR((RtupdateÃs

c

Cs
g|_
d
S(sMake the set empty.N(RR
(
R((RtclearËs

cCs\x)|i
D]}||
i
jo
tSq

q
Wx)|
i
D]}||i
jo
tSq6
q6WtS(
N(RR
RRtFalsetTrue(RRR((Rt__eq__Ïs







cCs|i
|
ƒ
S(
N(RR*R(RR((Rt__ne__Ús
c

Cs
t|iƒ
S(
N(tlenRR
(
R((Rt__len__Ýs
c

Cs
t|iƒ
S(
N(titerRR
(
R((Rt__iter__às
cCs|i
|
S(
N(RR
t
i(RR0((Rt__getitem__ãs
cCs|i
|
=dS(
N(RR
R0(RR0((Rt__delitem__æs
cCs|i
|
|!S(
N(RR
R0t
j(RR0R3((Rt__getslice__és
cCs|i
|
|5dS(
N(RR
R0R3(RR0R3((Rt__delslice__ìs
cCsPt|
tƒp
td
ƒ
‚
n

x)|iD]}||
ijo
tSq*
q*WtS(s?Is I{self} a subset of I{other}?

        @rtype: bool
        sother must be a Set instanceN(	RRRRRR
RR(R)(RRR((Rtissubsetïs





cCsPt|
tƒp
td
ƒ
‚
n

x)|
iD]}||ijo
tSq*
q*WtS(sAIs I{self} a superset of I{other}?

        @rtype: bool
        sother must be a Set instanceN(	RRRRR
RRR(R)(RRR((Rt
issupersetüs





('t__name__t
__module__t__doc__t	__slots__RRR	RRR
RRRRRRRRRRRR R!R"R#R$R%R&R'R*R+R-R/R1R2R4R5R6R7(((RRsH									
					
																			
N(R:tobjectR(
R((Rt
?s