0x1949 Team - FAZEMRX - MANAGER
Edit File: _pmap.cpython-310.pyc
o ���an9 � @ s� d dl mZmZ d dlmZ d dlmZ d dlmZ G dd� de �Z e� e � e� e � dd� Z e i d �Z i d fd d �Zd d � Zd S )� )�Mapping�Hashable)�chain)�pvector�� transformc sD e Zd ZdZdZ� fdd�Zedd� �Zedd� �Zd d � Z ed d � �Z d d� Z e j Z dd� Zdd� Zdd� Zdd� Zdd� Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Ze jZd%d&� ZeZeZ eZ d'd(� Z d)d*� Z d+d,� Z d-d.� Z!d/d0� Z"d1d2� Z#d3d4� Z$d5d6� Z%e%Z&d7d8� Z'd9d:� Z(d;d<� Z)G d=d>� d>e*�Z+d?d@� Z,� Z-S )A�PMapa� Persistent map/dict. Tries to follow the same naming conventions as the built in dict where feasible. Do not instantiate directly, instead use the factory functions :py:func:`m` or :py:func:`pmap` to create an instance. Was originally written as a very close copy of the Clojure equivalent but was later rewritten to closer re-assemble the python dict. This means that a sparse vector (a PVector) of buckets is used. The keys are hashed and the elements inserted at position hash % len(bucket_vector). Whenever the map size exceeds 2/3 of the containing vectors size the map is reallocated to a vector of double the size. This is done to avoid excessive hash collisions. This structure corresponds most closely to the built in dict type and is intended as a replacement. Where the semantics are the same (more or less) the same function names have been used but for some cases it is not possible, for example assignments and deletion of values. PMap implements the Mapping protocol and is Hashable. It also supports dot-notation for element access. Random access and insert is log32(n) where n is the size of the map. The following are examples of some common operations on persistent maps >>> m1 = m(a=1, b=3) >>> m2 = m1.set('c', 3) >>> m3 = m2.remove('a') >>> m1 == {'a': 1, 'b': 3} True >>> m2 == {'a': 1, 'b': 3, 'c': 3} True >>> m3 == {'b': 3, 'c': 3} True >>> m3['c'] 3 >>> m3.c 3 )�_size�_buckets� __weakref__� _cached_hashc s t t| ��| �}||_||_|S �N)�superr �__new__r r )�cls�size�buckets�self�� __class__� �2/usr/lib/python3/dist-packages/pyrsistent/_pmap.pyr / s z PMap.__new__c C s t |�t| � }| | }||fS r )�hash�len)r �key�index�bucketr r r � _get_bucket5 s zPMap._get_bucketc C s: t �| |�\}}|r|D ] \}}||kr| S q t|��r )r r �KeyError)r r �_r �k�vr r r �_getitem; s �z PMap._getitemc C � t �| j|�S r )r r" r �r r r r r � __getitem__E � zPMap.__getitem__c C s8 t �| |�\}}|r|D ] \}}||kr dS q dS dS )NTF)r r )r r r r r r r r � _containsH s �zPMap._containsc C s | � | j|�S r )r' r r$ r r r � __contains__T r& zPMap.__contains__c C � | � � S r )�iterkeys�r r r r �__iter__Y � z PMap.__iter__c C s< z| | W S t y } z td�t| �j|��|�d }~ww )Nz{0} has no attribute '{1}')r �AttributeError�format�type�__name__)r r �er r r � __getattr__\ s ����zPMap.__getattr__c c s � | � � D ]\}}|V qd S r �� iteritems)r r r r r r r* d � ��z PMap.iterkeysc c s � | � � D ]\}}|V qd S r r4 )r r r! r r r � itervaluesk r6 zPMap.itervaluesc c s. � | j D ]}|r|D ] \}}||fV q qd S r )r )r r r r! r r r r5 o s � ��zPMap.iteritemsc C � t | �� �S r )r r7 r+ r r r �valuesu � z PMap.valuesc C r8 r )r r* r+ r r r �keysx r: z PMap.keysc C r8 r )r r5 r+ r r r �items{ r: z PMap.itemsc C � | j S r �r r+ r r r �__len__~ � z PMap.__len__c C s d� tt| ���S )Nz pmap({0}))r/ �str�dictr+ r r r �__repr__� s z PMap.__repr__c C s� | |u rdS t |t�s tS t| �t|�krdS t |t�rBt| d�r.t|d�r.| j|jkr.dS | j|jkr6dS t| � � �t|� � �kS t |t�rOt| � � �|kS t| � � �t|� � �kS )NTFr ) � isinstancer �NotImplementedr r �hasattrr r rB r5 r< �r �otherr r r �__eq__� s z PMap.__eq__c C s t d��)NzPMaps are not orderable)� TypeErrorrG r r r �__lt__� r- z PMap.__lt__c C r) r )rC r+ r r r �__str__� r- z PMap.__str__c C s" t | d�stt| �� ��| _| jS )Nr )rF r � frozensetr5 r r+ r r r �__hash__� s z PMap.__hash__c C s | � � �||��� S )a4 Return a new PMap with key and val inserted. >>> m1 = m(a=1, b=2) >>> m2 = m1.set('a', 3) >>> m3 = m1.set('c' ,4) >>> m1 == {'a': 1, 'b': 2} True >>> m2 == {'a': 3, 'b': 2} True >>> m3 == {'a': 1, 'b': 2, 'c': 4} True )�evolver�set� persistent�r r �valr r r rP � s zPMap.setc C s | � � �|��� S )z� Return a new PMap without the element specified by key. Raises KeyError if the element is not present. >>> m1 = m(a=1, b=2) >>> m1.remove('a') pmap({'b': 2}) )rO �removerQ r$ r r r rT � s z PMap.removec C s$ z| � |�W S ty | Y S w )a Return a new PMap without the element specified by key. Returns reference to itself if element is not present. >>> m1 = m(a=1, b=2) >>> m1.discard('a') pmap({'b': 2}) >>> m1 is m1.discard('c') True )rT r r$ r r r �discard� s �z PMap.discardc G s | j dd� g|�R � S )a, Return a new PMap with the items in Mappings inserted. If the same key is present in multiple maps the rightmost (last) value is inserted. >>> m1 = m(a=1, b=2) >>> m1.update(m(a=2, c=3), {'a': 17, 'd': 35}) == {'a': 17, 'b': 2, 'c': 3, 'd': 35} True c S s |S r r )�l�rr r r �<lambda>� s z PMap.update.<locals>.<lambda>)� update_with)r �mapsr r r �update� s z PMap.updatec G sN | � � }|D ] }|�� D ]\}}|�|||v r ||| |�n|� q q|�� S )a% Return a new PMap with the items in Mappings maps inserted. If the same key is present in multiple maps the values will be merged using merge_fn going from left to right. >>> from operator import add >>> m1 = m(a=1, b=2) >>> m1.update_with(add, m(a=2)) == {'a': 3, 'b': 2} True The reverse behaviour of the regular merge. Keep the leftmost element instead of the rightmost. >>> m1 = m(a=1) >>> m1.update_with(lambda l, r: l, m(a=2), {'a':3}) pmap({'a': 1}) )rO r< rP rQ )r � update_fnrZ rO �mapr �valuer r r rY � s $�zPMap.update_withc C s | � |�S r )r[ rG r r r �__add__� � z PMap.__add__c C s t t| �ffS r )�pmaprB r+ r r r � __reduce__� s zPMap.__reduce__c G s t | |�S )a� Transform arbitrarily complex combinations of PVectors and PMaps. A transformation consists of two parts. One match expression that specifies which elements to transform and one transformation function that performs the actual transformation. >>> from pyrsistent import freeze, ny >>> news_paper = freeze({'articles': [{'author': 'Sara', 'content': 'A short article'}, ... {'author': 'Steve', 'content': 'A slightly longer article'}], ... 'weather': {'temperature': '11C', 'wind': '5m/s'}}) >>> short_news = news_paper.transform(['articles', ny, 'content'], lambda c: c[:25] + '...' if len(c) > 25 else c) >>> very_short_news = news_paper.transform(['articles', ny, 'content'], lambda c: c[:15] + '...' if len(c) > 15 else c) >>> very_short_news.articles[0].content 'A short article' >>> very_short_news.articles[1].content 'A slightly long...' When nothing has been transformed the original data structure is kept >>> short_news is news_paper True >>> very_short_news is news_paper False >>> very_short_news.articles[0] is news_paper.articles[0] True r )r �transformationsr r r r � s zPMap.transformc C s | S r r r+ r r r �copy s z PMap.copyc @ sh e Zd ZdZdd� Zdd� Zdd� Zdd � Zd d � Zd d � Z dd� Z dd� Z dd� Z dd� Z dd� ZdS )z PMap._Evolver)�_buckets_evolverr �_original_pmapc C s || _ |j�� | _|j| _d S r )rf r rO re r )r � original_pmapr r r �__init__ s zPMap._Evolver.__init__c C r# r )r r" re r$ r r r r% $ r& zPMap._Evolver.__getitem__c C s | � ||� d S r )rP rR r r r � __setitem__' s zPMap._Evolver.__setitem__c s� t | j�d| j k r| �dt | j� � |�f}t�| j|�\}}|r[|D ] \� }� |krD|�ur@� �fdd�|D �}|| j|< | S q%|g}|�|� || j|< | jd7 _| S |g| j|< | jd7 _| S )Ngq= ףp�?� c s( g | ]\}}|� kr||fn|�f�qS r r )�.0�k2�v2�r rS r r � <listcomp>4 s ( z%PMap._Evolver.set.<locals>.<listcomp>� )r re r � _reallocater r �extend)r r rS �kvr r r! � new_bucketr rn r rP * s( � �zPMap._Evolver.setc C s� |d g }| j �� }t�dd� |D ��D ] \}}t|�| }|| r,|| �||f� q||fg||< qt� �� | _ | j �|� d S )Nc s s � | ]}|r|V qd S r r )rk �xr r r � <genexpr>F s � z,PMap._Evolver._reallocate.<locals>.<genexpr>) re rQ r � from_iterabler �appendr rO rr )r �new_size�new_listr r r! r r r r rq C s zPMap._Evolver._reallocatec C s | j �� S r )re �is_dirtyr+ r r r r{ R r` zPMap._Evolver.is_dirtyc C s" | � � rt| j| j�� �| _| jS r )r{ r r re rQ rf r+ r r r rQ U s zPMap._Evolver.persistentc C r= r r> r+ r r r r? [ r@ zPMap._Evolver.__len__c C r# r )r r' re r$ r r r r( ^ r& zPMap._Evolver.__contains__c C s | � |� d S r )rT r$ r r r � __delitem__a r& zPMap._Evolver.__delitem__c sj t �| j� �\}}|r.� fdd�|D �}t|�t|�kr.|r |nd | j|< | jd8 _| S td�� ���)Nc s g | ] \}}|� kr||f�qS r r )rk r r! �r r r ro h s z(PMap._Evolver.remove.<locals>.<listcomp>rp z{0})r r re r r r r/ )r r r r rt r r} r rT d s zPMap._Evolver.removeN)r1 � __module__� __qualname__� __slots__rh r% ri rP rq r{ rQ r? r( r| rT r r r r �_Evolver s r� c C s | � | �S )a- Create a new evolver for this pmap. For a discussion on evolvers in general see the documentation for the pvector evolver. Create the evolver and perform various mutating updates to it: >>> m1 = m(a=1, b=2) >>> e = m1.evolver() >>> e['c'] = 3 >>> len(e) 3 >>> del e['a'] The underlying pmap remains the same: >>> m1 == {'a': 1, 'b': 2} True The changes are kept in the evolver. An updated pmap can be created using the persistent() function on the evolver. >>> m2 = e.persistent() >>> m2 == {'b': 2, 'c': 3} True The new pmap will share data with the original pmap in the same way that would have been done if only using operations on the pmap. )r� r+ r r r rO p s z PMap.evolver).r1 r~ r �__doc__r� r � staticmethodr r" r% r' r( r �getr, r3 r* r7 r5 r9 r; r< r? rC rI �__ne__rK �__le__�__gt__�__ge__rL rN rP rT rU r[ rY r_ �__or__rb r rd �objectr� rO � __classcell__r r r r r sV % Tr c C s� |r|}nz dt | � p d}W n ty d}Y nw |d g }t| t�s)t| �} | �� D ]!\}}t|�}|| }|| }|rG|�||f� q-||fg||< q-tt | �t � � |��S )Nrj � ) r � ExceptionrD r rB r< r rx r r rr ) �initial�pre_sizer r r r! �hr r r r r �_turbo_mapping� s$ � r� c C s | s|dkrt S t| |�S )a� Create new persistent map, inserts all elements in initial into the newly created map. The optional argument pre_size may be used to specify an initial size of the underlying bucket vector. This may have a positive performance impact in the cases where you know beforehand that a large number of elements will be inserted into the map eventually since it will reduce the number of reallocations required. >>> pmap({'a': 13, 'b': 14}) == {'a': 13, 'b': 14} True r )� _EMPTY_PMAPr� )r� r� r r r ra � s ra c K s t | �S )z� Creates a new persistent map. Inserts all key value arguments into the newly created map. >>> m(a=13, b=14) == {'a': 13, 'b': 14} True )ra )�kwargsr r r �m� s r� N)�collections.abcr r � itertoolsr �pyrsistent._pvectorr �pyrsistent._transformationsr r� r �registerr� r� ra r� r r r r �<module> s