← Back
Editing: ordered_dict.cpython-36.pyc
3 �Pf�" � @ st yd dl mZ W n ek r0 d dlmZ Y nX yd dlmZmZmZ W n ek r^ Y nX G dd� de �Z dS )� )� get_ident)�KeysView� ValuesView� ItemsViewc @ s e Zd ZdZdd� Zejfdd�Zejfdd�Zdd � Zd d � Z d d � Z d6dd�Z dd� Z dd� Z dd� Zdd� Zdd� Zdd � Zd d � ZeZe� Zefd d �Zd7d"d#�Zi fd$d%�Zd&d'� Zd(d)� Zed8d*d+��Z d,d-� Z d.d/� Z d0d1� Z d2d3� Z d4d5� Z!d!S )9� OrderedDictz)Dictionary that remembers insertion orderc O sn t |�dkr tdt |� ��y | j W n6 tk r\ g | _}||dg|dd�< i | _Y nX | j||� 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 �"/usr/lib/python3.6/ordered_dict.py�__init__ s zOrderedDict.__init__c C sF || kr6| 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 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__6 s zOrderedDict.__delitem__c c s2 | j }|d }x ||k r,|d V |d }qW dS )zod.__iter__() <==> iter(od)r � N)r )r r �currr r r �__iter__? s zOrderedDict.__iter__c c s2 | j }|d }x ||k r,|d V |d }qW dS )z#od.__reversed__() <==> reversed(od)r r N)r )r r r r r r � __reversed__G s zOrderedDict.__reversed__c C sh yDx | j j� D ]}|dd�= qW | j}||dg|dd�< | j j� W n tk rX Y nX tj| � dS )z.od.clear() -> None. Remove all items from od.N)r � itervaluesr �clearr �dict)r Znoder r r r r" O s zOrderedDict.clearTc C s| | s t d��| j}|r8|d }|d }||d< ||d< n |d }|d }||d< ||d< |d }| j|= tj| |�}||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 �popitem[ s zOrderedDict.popitemc C s t | �S )z od.keys() -> list of keys in od)�list)r r r r �keyst 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>z s z&OrderedDict.values.<locals>.<listcomp>r )r r )r r �valuesx 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* ~ s z%OrderedDict.items.<locals>.<listcomp>r )r r )r r �items| s zOrderedDict.itemsc C s t | �S )z0od.iterkeys() -> an iterator over the keys in od)�iter)r r r r �iterkeys� s zOrderedDict.iterkeysc c s x| D ]}| | V qW dS )z2od.itervalues -> an iterator over the values in odNr )r �kr r r r! � s zOrderedDict.itervaluesc c s x| D ]}|| | fV qW dS )z=od.iteritems -> an iterator over the (key, value) items in odNr )r r/ r r r � iteritems� s zOrderedDict.iteritemsc O s� t | �dkr tdt | �f ��n | s,td��| d }f }t | �dkrL| d }t|t�rrx^|D ]}|| ||< q\W nDt|d�r�x8|j� D ]}|| ||< q�W nx|D ]\}}|||< q�W x |j� D ]\}}|||< q�W 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( N)r r � isinstancer# �hasattrr( r, )r r r �otherr r r r r �update� s& zOrderedDict.updatec C s0 || kr| | }| |= |S || j kr,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 || kr| | S || |< |S )zDod.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in odr )r r r6 r r r � setdefault� s zOrderedDict.setdefaultc C sV t | �t� f}||krdS d||< z&| s6d| jjf S d| jj| j� f S ||= X 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 s\ � fdd�� D �}t � �j� }x t t� �D ]}|j|d� q*W |rP� j|f|fS � j|ffS )z%Return state information for picklingc s g | ]}|� | g�qS r r )r) r/ )r r r r* � s z*OrderedDict.__reduce__.<locals>.<listcomp>N)�vars�copyr r r; )r r, Z inst_dictr/ r )r r � __reduce__� s zOrderedDict.__reduce__c C s | j | �S )z!od.copy() -> a shallow copy of od)r; )r r r r r? � s zOrderedDict.copyc C s | � }x|D ] }|||< q W |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(| j� |j� kS tj| |�S )z�od.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive while comparison to a regular mapping is order-insensitive. )r1 r r r, r# �__eq__)r r3 r r r rE � s zOrderedDict.__eq__c C s | |k S )Nr )r r3 r r r �__ne__� s zOrderedDict.__ne__c C s t | �S )z@od.viewkeys() -> a set-like object providing a view on od's keys)r )r r r r �viewkeys� s zOrderedDict.viewkeysc C s t | �S )z<od.viewvalues() -> an object providing a view on od's values)r )r r r r � viewvalues� s zOrderedDict.viewvaluesc C s t | �S )zBod.viewitems() -> a set-like object providing a view on od's items)r )r r r r � viewitems s zOrderedDict.viewitems)T)N)N)"r< � __module__� __qualname__�__doc__r r# r r r r r" r& r( r+ r, r. r! r0 r4 r �objectr5 r r8 r= r@ r? � classmethodrD rE rF rG rH rI r r r r r s: r N) Zthreadr r: � ImportErrorZ dummy_threadZ_abcollr r r r# r r r r r �<module> s
Save File
Cancel