Current File : //lib/python3.9/site-packages/passlib/utils/compat/__pycache__/_ordered_dict.cpython-39.pyc
a
f�Wc� � @ sH d Z zddlmZ W n ey2 ddlmZ Y n0 G dd� de�ZdS )z�passlib.utils.compat._ordered_dict -- backport of collections.OrderedDict for py26
taken from stdlib-suggested recipe at http://code.activestate.com/recipes/576693/
this should be imported from passlib.utils.compat.OrderedDict, not here.
� )� get_identc @ s� e Zd ZdZdd� Zejfdd�Zejfdd�Zdd � Zd
d � Z d d
� Z
d0dd�Z dd� Z dd� Z
dd� Zdd� Zdd� Zdd � Zd d � ZeZe� Zefd d �Zd1d"d#�Zi fd$d%�Zd&d'� Zd(d)� Zed2d*d+��Z d,d-� Z d.d/� Z d!S )3� OrderedDictz)Dictionary that remembers insertion orderc O sp t |�dkr tdt |� ��z
| j W n4 tyZ g | _}||dg|dd�< i | _Y n0 | j|i |�� dS )z�Initialize an ordered dictionary. Signature is the same as for
regular dictionaries, but keyword arguments are not recommended
because their insertion order is arbitrary.
� z$expected at most 1 arguments, got %dN)�len� TypeError�_OrderedDict__root�AttributeError�_OrderedDict__map�_OrderedDict__update)�self�args�kwds�root� r �F/usr/lib/python3.9/site-packages/passlib/utils/compat/_ordered_dict.py�__init__ s
zOrderedDict.__init__c C sF || vr6| j }|d }|||g |d< |d< | j|< || ||� dS )z!od.__setitem__(i, y) <==> od[i]=yr r N)r r )r �key�valueZ dict_setitemr �lastr r r � __setitem__) s
zOrderedDict.__setitem__c C s0 || |� | j �|�\}}}||d< ||d< dS )z od.__delitem__(y) <==> del od[y]r r N)r �pop)r r Z dict_delitem� link_prev� link_nextr r r � __delitem__3 s
zOrderedDict.__delitem__c c s. | j }|d }||ur*|d V |d }qdS )zod.__iter__() <==> iter(od)r � N�r �r r Zcurrr r r �__iter__< s
zOrderedDict.__iter__c c s. | j }|d }||ur*|d V |d }qdS )z#od.__reversed__() <==> reversed(od)r r Nr r r r r � __reversed__D s
zOrderedDict.__reversed__c C sb z@| j �� D ]}|dd�= q | j}||dg|dd�< | j �� W n tyR Y n0 t�| � dS )z.od.clear() -> None. Remove all items from od.N)r �
itervaluesr �clearr �dict)r Znoder r r r r L s zOrderedDict.clearTc C s| | s t d��| j}|r8|d }|d }||d< ||d< n |d }|d }||d< ||d< |d }| j|= t�| |�}||fS )z�od.popitem() -> (k, v), return and remove a (key, value) pair.
Pairs are returned in LIFO order if last is true or FIFO order if false.
zdictionary is emptyr r r )�KeyErrorr r r! r )r r r �linkr r r r r r r �popitemX s
zOrderedDict.popitemc C s t | �S )z od.keys() -> list of keys in od)�list�r r r r �keysq s zOrderedDict.keysc s � fdd�� D �S )z#od.values() -> list of values in odc s g | ] }� | �qS r r ��.0r r& r r �
<listcomp>w � z&OrderedDict.values.<locals>.<listcomp>r r& r r& r �valuesu s zOrderedDict.valuesc s � fdd�� D �S )z.od.items() -> list of (key, value) pairs in odc s g | ]}|� | f�qS r r r( r& r r r* { r+ z%OrderedDict.items.<locals>.<listcomp>r r& r r& r �itemsy s zOrderedDict.itemsc C s t | �S )z0od.iterkeys() -> an iterator over the keys in od)�iterr& r r r �iterkeys} s zOrderedDict.iterkeysc c s | D ]}| | V qdS )z2od.itervalues -> an iterator over the values in odNr �r �kr r r r � s zOrderedDict.itervaluesc c s | D ]}|| | fV qdS )z=od.iteritems -> an iterator over the (key, value) items in odNr r0 r r r � iteritems� s zOrderedDict.iteritemsc O s� t | �dkr tdt | �f ��n | s,td��| d }d}t | �dkrL| d }t|t�rn|D ]}|| ||< qZn<t|d�r�|�� D ]}|| ||< q�n|D ]\}}|||< q�|�� D ]\}}|||< q�dS ) a� od.update(E, **F) -> None. Update od from dict/iterable E and F.
If E is a dict instance, does: for k in E: od[k] = E[k]
If E has a .keys() method, does: for k in E.keys(): od[k] = E[k]
Or if E is an iterable of items, does: for k, v in E: od[k] = v
In either case, this is followed by: for k, v in F.items(): od[k] = v
r z8update() takes at most 2 positional arguments (%d given)z,update() takes at least 1 argument (0 given)r r r r' N)r r �
isinstancer! �hasattrr' r- )r r
r �otherr r r r r �update� s( �
zOrderedDict.updatec C s0 || v r| | }| |= |S || j u r,t|��|S )z�od.pop(k[,d]) -> v, remove specified key and return the corresponding value.
If key is not found, d is returned if given, otherwise KeyError is raised.
)�_OrderedDict__markerr" )r r �default�resultr r r r � s
zOrderedDict.popNc C s || v r| | S || |< |S )zDod.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in odr )r r r8 r r r �
setdefault� s zOrderedDict.setdefaultc C sf t | �t� f}||v rdS d||< z6| s>d| jjf W ||= S d| jj| �� f W ||= S ||= 0 dS )zod.__repr__() <==> repr(od)z...r z%s()z%s(%r)N)�id�
_get_ident� __class__�__name__r- )r Z
_repr_runningZcall_keyr r r �__repr__� s ��zOrderedDict.__repr__c sX � fdd�� D �}t � ��� }t t� �D ]}|�|d� q(|rL� j|f|fS � j|ffS )z%Return state information for picklingc s g | ]}|� | g�qS r r )r) r1 r& r r r* � r+ z*OrderedDict.__reduce__.<locals>.<listcomp>N)�vars�copyr r r= )r r- Z inst_dictr1 r r& r �
__reduce__� s zOrderedDict.__reduce__c C s
| � | �S )z!od.copy() -> a shallow copy of od)r= r& r r r rA � s zOrderedDict.copyc C s | � }|D ] }|||< q
|S )z�OD.fromkeys(S[, v]) -> New ordered dictionary with keys from S
and values equal to v (which defaults to None).
r )�cls�iterabler �dr r r r �fromkeys� s
zOrderedDict.fromkeysc C s6 t |t�r*t| �t|�ko(| �� |�� kS t�| |�S )z�od.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive
while comparison to a regular mapping is order-insensitive.
)r3 r r r- r! �__eq__�r r5 r r r rG � s
zOrderedDict.__eq__c C s
| |k S )Nr rH r r r �__ne__� s zOrderedDict.__ne__)T)N)N) r> �
__module__� __qualname__�__doc__r r! r r r r r r$ r' r, r- r/ r r2 r6 r
�objectr7 r r: r? rB rA � classmethodrF rG rI r r r r r
s4
r N)rL �threadr r< � ImportErrorZ dummy_threadr! r r r r r �<module> s
Mini Shell