B Z*$@sddlmZmZyddlmZWn ek r@ddlmZYnXyddlm Z m Z m Z Wnek rnYnXGddde Z dS))iterkeys iteritems) get_ident)KeysView ValuesView ItemsViewc@seZdZdZddZejfddZejfddZdd Zd d Z d d Z d6ddZ ddZ ddZ ddZddZddZddZddZeZeZefdd Zd7d"d#Zifd$d%Zd&d'Zd(d)Zed8d*d+Zd,d-Zd.d/Zd0d1Zd2d3Z d4d5Z!d!S)9 OrderedDictz)Dictionary that remembers insertion ordercOsnt|dkrtdt|y |jWn6tk r\g|_}||dg|dd<i|_YnX|j||dS)zInitialize an ordered dictionary. Signature is the same as for regular dictionaries, but keyword arguments are not recommended because their insertion order is arbitrary. rz$expected at most 1 arguments, got %dN)len TypeError_OrderedDict__rootAttributeError_OrderedDict__map_OrderedDict__update)selfargskwdsrootr=lib/python3.7/site-packages/statsmodels/compat/ordereddict.py__init__s    zOrderedDict.__init__cCsF||kr6|j}|d}|||g|d<|d<|j|<||||dS)z!od.__setitem__(i, y) <==> od[i]=yrrN)r r)rkeyvalueZ dict_setitemrlastrrr __setitem__/s  zOrderedDict.__setitem__cCs0||||j|\}}}||d<||d<dS)z od.__delitem__(y) <==> del od[y]rrN)rpop)rrZ dict_delitem link_prev link_nextrrr __delitem__9s zOrderedDict.__delitem__ccs2|j}|d}x||k r,|dV|d}qWdS)zod.__iter__() <==> iter(od)rN)r )rrcurrrrr__iter__Bs   zOrderedDict.__iter__ccs2|j}|d}x||k r,|dV|d}qWdS)z#od.__reversed__() <==> reversed(od)rrN)r )rrr rrr __reversed__Js   zOrderedDict.__reversed__cCshyDx|jD]}|dd=qW|j}||dg|dd<|jWntk rXYnXt|dS)z.od.clear() -> None. Remove all items from od.N)r itervaluesr clearr dict)rZnoderrrrr$RszOrderedDict.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 emptyrrr)KeyErrorr rr%r)rrrlinkrrrrrrrpopitem^s   zOrderedDict.popitemcCst|S)zod.keys() -> list of keys in od)list)rrrrkeyswszOrderedDict.keyscsfddDS)z#od.values() -> list of values in odcsg|] }|qSrr).0r)rrr }sz&OrderedDict.values..r)rr)rrvalues{szOrderedDict.valuescsfddDS)z.od.items() -> list of (key, value) pairs in odcsg|]}||fqSrr)r+r)rrrr,sz%OrderedDict.items..r)rr)rritemsszOrderedDict.itemscCst|S)z0od.iterkeys() -> an iterator over the keys in od)iter)rrrrrszOrderedDict.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)rr0rrrrs zOrderedDict.iteritemscOst|dkr tdt|fn |s,td|d}d}t|dkrL|d}t|trrx^|D]}||||<q\WnDt|drx8t|D]}||||<qWnx|D]\}}|||<qWxt|D]\}}|||<qWdS) aod.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 rz8update() takes at most 2 positional arguments (%d given)z,update() takes at least 1 argument (0 given)rrrr*N)r r isinstancer%hasattrrr)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)rrr6rrr setdefaultszOrderedDict.setdefaultcCsVt|tf}||krdSd||<z&|s6d|jjfSd|jj|fS||=XdS)zod.__repr__() <==> repr(od)z...rz%s()z%s(%r)N)id _get_ident __class____name__r.)rZ _repr_runningZcall_keyrrr__repr__szOrderedDict.__repr__cs\fddD}t}xttD]}||dq*W|rPj|f|fSj|ffS)z%Return state information for picklingcsg|]}||gqSrr)r+r0)rrrr,sz*OrderedDict.__reduce__..N)varscopyr rr;)rr.Z inst_dictr0r)rr __reduce__s zOrderedDict.__reduce__cCs ||S)z!od.copy() -> a shallow copy of od)r;)rrrrr?szOrderedDict.copycCs |}x|D] }|||<q W|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. )r1r r r.r%__eq__)rr3rrrrEs  zOrderedDict.__eq__cCs ||k S)Nr)rr3rrr__ne__szOrderedDict.__ne__cCst|S)z@od.viewkeys() -> a set-like object providing a view on od's keys)r)rrrrviewkeysszOrderedDict.viewkeyscCst|S)z an object providing a view on od's values)r)rrrr viewvaluesszOrderedDict.viewvaluescCst|S)zBod.viewitems() -> a set-like object providing a view on od's items)r)rrrr viewitemsszOrderedDict.viewitems)T)N)N)"r< __module__ __qualname____doc__rr%rrr!r"r$r(r*r-r.rr#rr4robjectr5rr8r=r@r? classmethodrDrErFrGrHrIrrrrr s:         r N)ZpythonrrZthreadrr: ImportErrorZ dummy_threadZ_abcollrrrr%r rrrrs