U Kv f#@spzddlmZWnek r,ddZYnXzddlmZmZmZWnek rZYnXGdddeZ dS)) get_identcCsdS)Nzrrr od[i]=yrr N)r r)rkeyvalueZ dict_setitemrlastrrr __setitem__3s  zOrderedDict.__setitem__cCs0||||j|\}}}||d<||d<dS)z od.__delitem__(y) <==> del od[y]r rN)rpop)rrZ dict_delitem link_prev link_nextrrr __delitem__=s zOrderedDict.__delitem__ccs.|j}|d}||k r*|dV|d}qdS)zod.__iter__() <==> iter(od)r Nr rrcurrrrr__iter__Fs  zOrderedDict.__iter__ccs.|j}|d}||k r*|dV|d}qdS)z#od.__reversed__() <==> reversed(od)rrNrr rrr __reversed__Ns  zOrderedDict.__reversed__cCsdz@|jD]}|dd=q |j}||dg|dd<|jWntk rTYnXt|dS)z.od.clear() -> None. Remove all items from od.N)r itervaluesr clearrdict)rnoderrrrr%Vs zOrderedDict.clearTcCs||s td|j}|r8|d}|d}||d<||d<n |d}|d}||d<||d<|d}|j|=t||}||fS)zod.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 emptyrr r)KeyErrorr rr&r)rrrlinkrrrrrrrpopitembs   zOrderedDict.popitemcCst|S)zod.keys() -> list of keys in od)listrrrrkeys{szOrderedDict.keyscsfddDS)z#od.values() -> list of values in odcsg|] }|qSrr.0rr,rr sz&OrderedDict.values..rr,rr,rvaluesszOrderedDict.valuescsfddDS)z.od.items() -> list of (key, value) pairs in odcsg|]}||fqSrrr.r,rrr0sz%OrderedDict.items..rr,rr,ritemsszOrderedDict.itemscCst|S)z0od.iterkeys() -> an iterator over the keys in od)iterr,rrriterkeysszOrderedDict.iterkeysccs|D]}||VqdS)z2od.itervalues -> an iterator over the values in odNrrkrrrr$szOrderedDict.itervaluesccs|D]}|||fVqdS)z=od.iteritems -> an iterator over the (key, value) items in odNrr5rrr iteritemsszOrderedDict.iteritemscOst|dkr tdt|fn |s,td|d}d}t|dkrL|d}t|trn|D]}||||<qZn 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 r-N)r r isinstancer&hasattrr-r2)rrrotherrrrrrupdates(       zOrderedDict.updatecCs0||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)rrr=rrr setdefaultszOrderedDict.setdefaultcCs^t|tf}||krdSd||<z.|s:d|jjfWSd|jj|fWS||=XdS)zod.__repr__() <==> repr(od)z...r z%s()z%s(%r)N)idr __class____name__r2)rZ _repr_runningZcall_keyrrr__repr__szOrderedDict.__repr__csXfddD}t}ttD]}||dq(|rLj|f|fSj|ffS)z%Return state information for picklingcsg|]}||gqSrr)r/r6r,rrr0sz*OrderedDict.__reduce__..N)varscopyr rrA)rr2 inst_dictr6rr,r __reduce__s zOrderedDict.__reduce__cCs ||S)z!od.copy() -> a shallow copy of od)rAr,rrrrEszOrderedDict.copycCs|}|D] }|||<q |S)zOD.fromkeys(S[, v]) -> New ordered dictionary with keys from S and values equal to v (which defaults to None). r)clsiterablerdrrrrfromkeyss zOrderedDict.fromkeyscCs6t|tr*t|t|ko(||kSt||S)zod.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive while comparison to a regular mapping is order-insensitive. )r8r r r2r&__eq__rr:rrrrLs  zOrderedDict.__eq__cCs ||k S)NrrMrrr__ne__szOrderedDict.__ne__cCst|S)z@od.viewkeys() -> a set-like object providing a view on od's keys)rr,rrrviewkeysszOrderedDict.viewkeyscCst|S)z an object providing a view on od's values)rr,rrr viewvaluesszOrderedDict.viewvaluescCst|S)zBod.viewitems() -> a set-like object providing a view on od's items)rr,rrr viewitemsszOrderedDict.viewitems)T)N)N)"rB __module__ __qualname____doc__rr&rrr"r#r%r*r-r1r2r4r$r7r;robjectr<rr?rCrGrE classmethodrKrLrNrOrPrQrrrrr s:         r N) threadrr ImportError_abcollrrrr&r rrrrs