0x1949 Team - FAZEMRX - MANAGER
Edit File: _pbag.cpython-310.pyc
o ���aJ � @ s� d dl mZmZmZmZ d dlmZ d dlmZ dd� Z G dd� de �Z e� e � e� e � e� e � e� e � dd � Z d d � Ze e� �Zd S ) � )� Container�Iterable�Sized�Hashable)�reduce)�pmapc C s | � || �|d�d �S )Nr � )�set�get)�counters�element� r �2/usr/lib/python3/dist-packages/pyrsistent/_pbag.py�_add_to_counters s r c @ s� e Zd ZdZdZdd� Zdd� Zdd� Zd d � Zd d � Z d d� Z dd� Z dd� Z dd� Z dd� Zdd� ZeZeZeZdd� Zdd � Zd d � Zd d � Zd!d"� Zd#S )$�PBaga� A persistent bag/multiset type. Requires elements to be hashable, and allows duplicates, but has no ordering. Bags are hashable. Do not instantiate directly, instead use the factory functions :py:func:`b` or :py:func:`pbag` to create an instance. Some examples: >>> s = pbag([1, 2, 3, 1]) >>> s2 = s.add(4) >>> s3 = s2.remove(1) >>> s pbag([1, 1, 2, 3]) >>> s2 pbag([1, 1, 2, 3, 4]) >>> s3 pbag([1, 2, 3, 4]) )�_counts� __weakref__c C s || _ d S )N�r )�self�countsr r r �__init__# s z PBag.__init__c C s t t| j|��S )z� Add an element to the bag. >>> s = pbag([1]) >>> s2 = s.add(1) >>> s3 = s.add(2) >>> s2 pbag([1, 1]) >>> s3 pbag([1, 2]) )r r r �r r r r r �add& s zPBag.addc C s |r t tt|| j��S | S )z� Update bag with all elements in iterable. >>> s = pbag([1]) >>> s.update([1, 2]) pbag([1, 1, 2]) )r r r r )r �iterabler r r �update4 s z PBag.updatec C sT || j vr t|��| j | dkr| j �|�}t|�S | j �|| j | d �}t|�S )z� Remove an element from the bag. >>> s = pbag([1, 1, 2]) >>> s2 = s.remove(1) >>> s3 = s.remove(2) >>> s2 pbag([1, 2]) >>> s3 pbag([1, 1]) r )r �KeyError�remover r )r r �newcr r r r A s �z PBag.removec C s | j �|d�S )z� Return the number of times an element appears. >>> pbag([]).count('non-existent') 0 >>> pbag([1, 1, 2]).count(1) 2 r )r r r r r r �countU s z PBag.countc C s t | j�� �S )ze Return the length including duplicates. >>> len(pbag([1, 1, 2])) 3 )�sumr � itervalues�r r r r �__len__a s z PBag.__len__c c s. � | j �� D ]\}}t|�D ]}|V qqdS )z� Return an iterator of all elements, including duplicates. >>> list(pbag([1, 1, 2])) [1, 1, 2] >>> list(pbag([1, 2])) [1, 2] N)r � iteritems�range)r �eltr �ir r r �__iter__j s � ��z PBag.__iter__c C s || j v S )z� Check if an element is in the bag. >>> 1 in pbag([1, 1, 2]) True >>> 0 in pbag([1, 2]) False r )r r% r r r � __contains__w s zPBag.__contains__c C s d� t| ��S )Nz pbag({0}))�format�listr! r r r �__repr__� s z PBag.__repr__c C s t |�tur td��| j|jkS )z� Check if two bags are equivalent, honoring the number of duplicates, and ignoring insertion order. >>> pbag([1, 1, 2]) == pbag([1, 2]) False >>> pbag([2, 1, 0]) == pbag([0, 1, 2]) True z Can only compare PBag with PBags)�typer � TypeErrorr �r �otherr r r �__eq__� s z PBag.__eq__c C s t d��)NzPBags are not orderable)r- r. r r r �__lt__� s z PBag.__lt__c C sJ t |t�stS | j�� }|j�� D ] \}}| �|�| ||< qt|�� �S )z� Combine elements from two PBags. >>> pbag([1, 2, 2]) + pbag([2, 3, 3]) pbag([1, 2, 2, 2, 3, 3]) )� isinstancer �NotImplementedr �evolverr# r � persistent)r r/ �result�elem� other_countr r r �__add__� s z PBag.__add__c C sj t |t�stS | j�� }|j�� D ] \}}| �|�| }|dkr%|||< q|| v r.|�|� qt|�� �S )z� Remove elements from one PBag that are present in another. >>> pbag([1, 2, 2, 2, 3]) - pbag([2, 3, 3, 4]) pbag([1, 2, 2]) r ) r2 r r3 r r4 r# r r r5 )r r/ r6 r7 r8 �newcountr r r �__sub__� s � z PBag.__sub__c C sT t |t�stS | j�� }|j�� D ]\}}| �|�}t||�}|||< qt|�� �S )z� Union: Keep elements that are present in either of two PBags. >>> pbag([1, 2, 2, 2]) | pbag([2, 3, 3]) pbag([1, 2, 2, 2, 3, 3]) ) r2 r r3 r r4 r# r �maxr5 )r r/ r6 r7 r8 r r: r r r �__or__� s z PBag.__or__c C sX t |t�stS t� �� }| j�� D ]\}}t||�|��}|dkr%|||< qt|� � �S )z� Intersection: Only keep elements that are present in both PBags. >>> pbag([1, 2, 2, 2]) & pbag([2, 3, 3]) pbag([2]) r ) r2 r r3 r r4 r r# �minr r5 )r r/ r6 r7 r r: r r r �__and__� s � z PBag.__and__c C s t | j�S )z� Hash based on value of elements. >>> m = pmap({pbag([1, 2]): "it's here!"}) >>> m[pbag([2, 1])] "it's here!" >>> pbag([1, 1, 2]) in m False )�hashr r! r r r �__hash__� s z PBag.__hash__N)�__name__� __module__� __qualname__�__doc__� __slots__r r r r r r" r' r( r+ r0 r1 �__le__�__gt__�__ge__r9 r; r= r? rA r r r r r s, r c G s t | �S )z� Construct a persistent bag. Takes an arbitrary number of arguments to insert into the new persistent bag. >>> b(1, 2, 3, 2) pbag([1, 2, 2, 3]) )�pbag��elementsr r r �b� s rM c C s | st S ttt| t� ��S )z� Convert an iterable to a persistent bag. Takes an iterable with elements to insert. >>> pbag([1, 2, 3, 2]) pbag([1, 2, 2, 3]) )� _EMPTY_PBAGr r r r rK r r r rJ � s rJ N)�collections.abcr r r r � functoolsr �pyrsistent._pmapr r �objectr �registerrM rJ rN r r r r �<module> s `