#R"@sdZyddlmZWn"ek r>ddlmZYnXy ddlmZmZm Z Wnek rsYnXGddde Z dS)zOrdered dictionary) get_ident)KeysView ValuesView ItemsViewc@sreZdZdZddZejddZejddZdd Zd d Z d d Z dddZ ddZ ddZ ddZddZddZddZddZeZeZedd Zd!d"d#Zid$d%Zd&d'Zd(d)Zed!d*d+Zd,d-Zd.d/Zd0d1Zd2d3Z d4d5Z!d!S)6 OrderedDictz)Dictionary that remembers insertion orderc Ost|dkr(tdt|y |jWnAtk rvg|_}||dg|dd od[i]=yrrN)r r )rkeyvalueZ dict_setitemrlastrrr __setitem__.s    &zOrderedDict.__setitem__cCs@||||jj|\}}}||d<||d del od[y]rrN)r pop)rrZ dict_delitem link_prev link_nextrrr __delitem__8s  zOrderedDict.__delitem__ccs=|j}|d}x#||k r8|dV|d}qWdS)zod.__iter__() <==> iter(od)rN)r )rrcurrrrr__iter__As    zOrderedDict.__iter__ccs=|j}|d}x#||k r8|dV|d}qWdS)z#od.__reversed__() <==> reversed(od)rrN)r )rrrrrr __reversed__Is    zOrderedDict.__reversed__c CsyZx$|jjD]}|dd=qW|j}||dg|dd<|jjWntk rnYnXtj|dS)z.od.clear() -> None. Remove all items from od.N)r itervaluesr clearr dict)rZnoderrrrr"Qs  zOrderedDict.clearTcCs|std|j}|rL|d}|d}||d<||d (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 emptyrrr)KeyErrorr r r#r)rrrlinkrrrrrrrpopitem]s             zOrderedDict.popitemcCs t|S)zod.keys() -> list of keys in od)list)rrrrkeysvszOrderedDict.keyscsfddDS)z#od.values() -> list of values in odcsg|]}|qSrr).0r)rrr |s z&OrderedDict.values..r)rr)rrvalueszszOrderedDict.valuescsfddDS)z.od.items() -> list of (key, value) pairs in odcs g|]}||fqSrr)r)r)rrrr*s z%OrderedDict.items..r)rr)rritems~szOrderedDict.itemscCs t|S)z0od.iterkeys() -> an iterator over the keys in od)iter)rrrriterkeysszOrderedDict.iterkeysccsx|D]}||VqWdS)z2od.itervalues -> an iterator over the values in odNr)rkrrrr!s zOrderedDict.itervaluesccs$x|D]}|||fVqWdS)z=od.iteritems -> an iterator over the (key, value) items in odNr)rr/rrr iteritemss zOrderedDict.iteritemscOs t|dkr.tdt|fn|s@td|d}f}t|dkrl|d}t|trxw|D]}|||| 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 rz8update() takes at most 2 positional arguments (%d given)z,update() takes at least 1 argument (0 given)rrr(N)rr isinstancer#hasattrr(r,)rrrotherrrrrrupdates&     zOrderedDict.updatecCs@||kr!||}||=|S||jkr<t||S)zod.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$)rrdefaultresultrrrrs   zOrderedDict.popNcCs"||kr||S|||<|S)zDod.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in odr)rrr6rrr setdefaults  zOrderedDict.setdefaultc Csst|tf}||kr%dSd|| repr(od)z...rz%s()z%s(%r)N)id _get_ident __class____name__r,)rZ _repr_runningZcall_keyrrr__repr__s  zOrderedDict.__repr__cs~fddD}tj}x'ttD]}|j|dq;W|rnj|f|fSj|ffS)z%Return state information for picklingcs g|]}||gqSrr)r)r/)rrrr*s z*OrderedDict.__reduce__..N)varscopyrrr;)rr,Z inst_dictr/r)rr __reduce__szOrderedDict.__reduce__cCs |j|S)z!od.copy() -> a shallow copy of od)r;)rrrrr?szOrderedDict.copycCs(|}x|D]}||| New ordered dictionary with keys from S and values equal to v (which defaults to None). r)clsiterablerdrrrrfromkeyss  zOrderedDict.fromkeyscCsMt|tr=t|t|ko<|j|jkStj||S)zod.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive while comparison to a regular mapping is order-insensitive. )r1rrr,r#__eq__)rr3rrrrEs.zOrderedDict.__eq__cCs ||k S)Nr)rr3rrr__ne__szOrderedDict.__ne__cCs t|S)z@od.viewkeys() -> a set-like object providing a view on od's keys)r)rrrrviewkeysszOrderedDict.viewkeyscCs t|S)z an object providing a view on od's values)r)rrrr viewvaluesszOrderedDict.viewvaluescCs t|S)zBod.viewitems() -> a set-like object providing a view on od's items)r)rrrr viewitemsszOrderedDict.viewitems)"r< __module__ __qualname____doc__rr#rrrr r"r&r(r+r,r.r!r0r4r objectr5rr8r=r@r? classmethodrDrErFrGrHrIrrrrrs:                   rN) rLZthreadrr: ImportErrorZ dummy_threadZ_abcollrrrr#rrrrrs