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 ú
z s z&OrderedDict.values..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..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__..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 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 Ú s