__ __ __ __ _____ _ _ _____ _ _ _ | \/ | \ \ / / | __ \ (_) | | / ____| | | | | | \ / |_ __\ V / | |__) | __ ___ ____ _| |_ ___ | (___ | |__ ___| | | | |\/| | '__|> < | ___/ '__| \ \ / / _` | __/ _ \ \___ \| '_ \ / _ \ | | | | | | |_ / . \ | | | | | |\ V / (_| | || __/ ____) | | | | __/ | | |_| |_|_(_)_/ \_\ |_| |_| |_| \_/ \__,_|\__\___| |_____/|_| |_|\___V 2.1 if you need WebShell for Seo everyday contact me on Telegram Telegram Address : @jackleetFor_More_Tools:
3
�b�W# � @ s d Z G dd� de�ZdS )zA simple Set class.c @ s e Zd ZdZdgZdDdd�Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
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.d/� Zd0d1� Zd2d3� Z d4d5� Z d6d7� Z d8d9� Z d:d;� Z d<d=� Z!d>d?� Z"d@dA� Z#dBdC� Z$dS )E�Seta' 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: list�itemsNc C s* g | _ |dk r&x|D ]}| j|� qW dS )zvInitialize the set.
@param items: the initial set of items
@type items: any iterable or None
N)r �add)�selfr �item� r �/usr/lib/python3.6/set.py�__init__ s
z Set.__init__c C s dt | j� S )Nzdns.simpleset.Set(%s))�reprr )r r r r �__repr__, s z Set.__repr__c C s || j kr| j j|� dS )zAdd an item to the set.N)r �append)r r r r r r / s
zSet.addc C s | j j|� dS )z Remove an item from the set.N)r �remove)r r r r r r 4 s z
Set.removec C s* y| j j|� W n tk
r$ Y nX dS )z'Remove an item from the set if present.N)r r �
ValueError)r r r r r �discard8 s z Set.discardc C s | j }|j|�}t| 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.
)� __class__�__new__�listr )r �cls�objr r r �_clone? s
z
Set._clonec C s | j � S )z!Make a (shallow) copy of the set.)r )r r r r �__copy__Q s z Set.__copy__c C s | j � S )z!Make a (shallow) copy of the set.)r )r r r r �copyU s zSet.copyc C s< t |t�std��| |kr dS x|jD ]}| j|� q&W dS )z�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
z other must be a Set instanceN)�
isinstancer r
r r )r �otherr r r r � union_updateY s
zSet.union_updatec C sL t |t�std��| |kr dS x(t| j�D ]}||jkr*| jj|� q*W dS )z�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
z other must be a Set instanceN)r r r
r r r )r r r r r r �intersection_updatef s
zSet.intersection_updatec C s@ t |t�std��| |kr"g | _nx|jD ]}| j|� q*W dS )z�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
z other must be a Set instanceN)r r r
r r )r r r r r r �difference_updatev s
zSet.difference_updatec C s | j � }|j|� |S )z�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 r r r �union� s
z Set.unionc C s | j � }|j|� |S )z�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 r r r � intersection� s
zSet.intersectionc C s | j � }|j|� |S )z�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 r r r �
difference� s
zSet.differencec C s
| j |�S )N)r )r r r r r �__or__� s z
Set.__or__c C s
| j |�S )N)r )r r r r r �__and__� s z Set.__and__c C s
| j |�S )N)r )r r r r r �__add__� s z Set.__add__c C s
| j |�S )N)r )r r r r r �__sub__� s z Set.__sub__c C s | j |� | S )N)r )r r r r r �__ior__� s
z Set.__ior__c C s | j |� | S )N)r )r r r r r �__iand__� s
z Set.__iand__c C s | j |� | S )N)r )r r r r r �__iadd__� s
z Set.__iadd__c C s | j |� | S )N)r )r r r r r �__isub__� s
z Set.__isub__c C s x|D ]}| j |� qW dS )z�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 r r r �update� s
z
Set.updatec C s
g | _ dS )zMake the set empty.N)r )r r r r �clear� s z Set.clearc C s@ x | j D ]}||j krdS qW x |j D ]}|| j kr&dS q&W dS )NFT)r )r r r r r r �__eq__� s
z
Set.__eq__c C s | j |� S )N)r) )r r r r r �__ne__� s z
Set.__ne__c C s
t | j�S )N)�lenr )r r r r �__len__� s z Set.__len__c C s
t | j�S )N)�iterr )r r r r �__iter__� s z Set.__iter__c C s
| j | S )N)r )r �ir r r � __getitem__� s zSet.__getitem__c C s | j |= d S )N)r )r r/ r r r � __delitem__� s zSet.__delitem__c C s4 t |t�std��x | jD ]}||jkrdS qW dS )z?Is I{self} a subset of I{other}?
@rtype: bool
z other must be a Set instanceFT)r r r
r )r r r r r r �issubset� s
z Set.issubsetc C s4 t |t�std��x |jD ]}|| jkrdS qW dS )zAIs I{self} a superset of I{other}?
@rtype: bool
z other must be a Set instanceFT)r r r
r )r r r r r r �
issuperset� s
zSet.issuperset)N)%�__name__�
__module__� __qualname__�__doc__� __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. r0 r1 r2 r3 r r r r r sD
r N)r7 �objectr r r r r �<module> s