a ‘dbç"ã@spzddlmZWney.ddlmZYn0zddlmZmZmZWneyZYn0Gdd„de ƒZ dS)é)Ú get_ident)ÚKeysViewÚ ValuesViewÚ ItemsViewc@seZdZdZdd„Zejfdd„Zejfdd„Zdd „Zd d „Z d d „Z d6dd„Z dd„Z dd„Z dd„Zdd„Zdd„Zdd„Zdd„ZeZeƒZefdd „Zd7d"d#„Zifd$d%„Zd&d'„Zd(d)„Zed8d*d+„ƒZd,d-„Zd.d/„Zd0d1„Zd2d3„Z d4d5„Z!d!S)9Ú OrderedDictz)Dictionary that remembers insertion ordercOspt|ƒdkrtdt|ƒƒ‚z |jWn4tyZg|_}||dg|dd…<i|_Yn0|j|i|¤Ž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ún/home/tom/ab/renpy-build/tmp/install.linux-x86_64/lib/python3.9/site-packages/urllib3/packages/ordered_dict.pyÚ__init__s     zOrderedDict.__init__cCsF||vr6|j}|d}|||g|d<|d<|j|<||||ƒdS)z!od.__setitem__(i, y) <==> od[i]=yrrN)r r )rÚkeyÚvalueZ dict_setitemrÚlastrrrÚ __setitem__,s  zOrderedDict.__setitem__cCs0|||ƒ|j |¡\}}}||d<||d<dS)z od.__delitem__(y) <==> del od[y]rrN)r Úpop)rrZ dict_delitemÚ link_prevÚ link_nextrrrÚ __delitem__6s zOrderedDict.__delitem__ccs.|j}|d}||ur*|dV|d}qdS)zod.__iter__() <==> iter(od)réN©r ©rrÚcurrrrrÚ__iter__?s  zOrderedDict.__iter__ccs.|j}|d}||ur*|dV|d}qdS)z#od.__reversed__() <==> reversed(od)rrNrrrrrÚ __reversed__Gs  zOrderedDict.__reversed__cCsbz@|j ¡D]}|dd…=q |j}||dg|dd…<|j ¡WntyRYn0t |¡dS)z.od.clear() -> None. Remove all items from od.N)r Ú itervaluesr Úclearr Údict)rÚnoderrrrr$Os  zOrderedDict.clearTcCs||s tdƒ‚|j}|r8|d}|d}||d<||d<n |d}|d}||d<||d<|d}|j|=t ||¡}||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 emptyrrr)ÚKeyErrorr r r%r)rrrÚlinkrrrrrrrÚpopitem[s   zOrderedDict.popitemcCst|ƒS)zod.keys() -> list of keys in od)Úlist©rrrrÚkeystszOrderedDict.keyscs‡fdd„ˆDƒS)z#od.values() -> list of values in odcsg|] }ˆ|‘qSrr©Ú.0rr+rrÚ zóz&OrderedDict.values..rr+rr+rÚvaluesxszOrderedDict.valuescs‡fdd„ˆDƒS)z.od.items() -> list of (key, value) pairs in odcsg|]}|ˆ|f‘qSrrr-r+rrr/~r0z%OrderedDict.items..rr+rr+rÚitems|szOrderedDict.itemscCst|ƒS)z0od.iterkeys() -> an iterator over the keys in od)Úiterr+rrrÚiterkeys€szOrderedDict.iterkeysccs|D]}||VqdS)z2od.itervalues -> an iterator over the values in odNr©rÚkrrrr#„szOrderedDict.itervaluesccs|D]}|||fVqdS)z=od.iteritems -> an iterator over the (key, value) items in odNrr5rrrÚ iteritems‰szOrderedDict.iteritemscOsÈt|ƒdkr tdt|ƒfƒ‚n |s,tdƒ‚|d}d}t|ƒdkrL|d}t|tƒrn|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)rrrr,N)rr Ú isinstancer%Úhasattrr,r2)rrrÚotherrrrrrÚupdateŽs( ÿ      zOrderedDict.updatecCs0||vr||}||=|S||jur,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')rrÚdefaultÚresultrrrr±s zOrderedDict.popNcCs||vr||S|||<|S)zDod.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in odr)rrr=rrrÚ setdefault¾szOrderedDict.setdefaultcCsft|ƒtƒf}||vrdSd||<z6|s>d|jjfW||=Sd|jj| ¡fW||=S||=0dS)zod.__repr__() <==> repr(od)z...rz%s()z%s(%r)N)ÚidÚ _get_identÚ __class__Ú__name__r2)rÚ _repr_runningZcall_keyrrrÚ__repr__ÅsýþzOrderedDict.__repr__csX‡fdd„ˆDƒ}tˆƒ ¡}ttƒƒD]}| |d¡q(|rLˆj|f|fSˆj|ffS)z%Return state information for picklingcsg|]}|ˆ|g‘qSrr)r.r6r+rrr/Ôr0z*OrderedDict.__reduce__..N)ÚvarsÚcopyrrrB)rr2Ú inst_dictr6rr+rÚ __reduce__Òs zOrderedDict.__reduce__cCs | |¡S)z!od.copy() -> a shallow copy of od)rBr+rrrrGÜszOrderedDict.copycCs|ƒ}|D] }|||<q |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ÚdrrrrÚfromkeysàs zOrderedDict.fromkeyscCs6t|tƒr*t|ƒt|ƒko(| ¡| ¡kSt ||¡S)z“od.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive while comparison to a regular mapping is order-insensitive. )r8rrr2r%Ú__eq__©rr:rrrrNës  zOrderedDict.__eq__cCs ||k S)NrrOrrrÚ__ne__ôszOrderedDict.__ne__cCst|ƒS)z@od.viewkeys() -> a set-like object providing a view on od's keys)rr+rrrÚviewkeysùszOrderedDict.viewkeyscCst|ƒS)z an object providing a view on od's values)rr+rrrÚ viewvaluesýszOrderedDict.viewvaluescCst|ƒS)zBod.viewitems() -> a set-like object providing a view on od's items)rr+rrrÚ viewitemsszOrderedDict.viewitems)T)N)N)"rCÚ __module__Ú __qualname__Ú__doc__rr%rrr!r"r$r)r,r1r2r4r#r7r;r Úobjectr<rr?rErIrGÚ classmethodrMrNrPrQrRrSrrrrrs:         rN) ÚthreadrrAÚ ImportErrorÚ dummy_threadÚ_abcollrrrr%rrrrrÚs