J/Ph#| ddlmZn#e$rdZYnwxYw ddlmZmZmZn #e$rYnwxYwGddeZ dS)) get_identcdS)NzrX/var/www/html/test/jupyter/venv/lib/python3.11/site-packages/patsy/compat_ordereddict.py _get_identrsr)KeysView ValuesView ItemsViewceZdZdZdZejfdZejfdZdZdZ dZ dd Z d Z d Z d Zd ZdZdZdZeZeZefdZddZifdZdZdZeddZdZdZdZdZ dZ!dS) OrderedDictz)Dictionary that remembers insertion orderct|dkrtdt|z |jn*#t$rgx|_}||dg|dd<i|_YnwxYw|j|i|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. z$expected at most 1 arguments, got %dN)len TypeError_OrderedDict__rootAttributeError_OrderedDict__map_OrderedDict__update)selfargskwdsroots r__init__zOrderedDict.__init__%s t99q==BSYYNOO O  KKK   !# #DK$T4(DGDJJJ   t$t$$$$$s<$A#"A#ct||vr&|j}|d}|||gx|d<x|d<|j|<||||dS)z!od.__setitem__(i, y) <==> od[i]=yrrN)rr)rkeyvalue dict_setitemrlasts r __setitem__zOrderedDict.__setitem__5s[ d??;D7D37s2C CDG Cd1g 3 T3&&&&&rcn||||j|\}}}||d<||d<dS)z od.__delitem__(y) <==> del od[y]rrN)rpop)rr dict_delitem link_prev link_nexts r __delitem__zOrderedDict.__delitem__?sF  T3$(JNN3$7$7! 9c !  ! rc#`K|j}|d}||ur|dV|d}||udSdS)zod.__iter__() <==> iter(od)rNrrrcurrs r__iter__zOrderedDict.__iter__HP{Aw$q'MMM7D$rc#`K|j}|d}||ur|dV|d}||udSdS)z#od.__reversed__() <==> reversed(od)rr(Nr)r*s r __reversed__zOrderedDict.__reversed__Pr-rc |jD]}|dd=|j}||dg|dd<|jn#t$rYnwxYwt |dS)z.od.clear() -> None. Remove all items from od.N)r itervaluesrclearrdict)rnoders rr2zOrderedDict.clearXs  --//  GG;DT4(DG J          D  4sA A AATc|std|j}|r|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()KeyErrorrrr3r")rrrlinkr$r%rrs rpopitemzOrderedDict.popitemds  2011 1{  7DQIIaLDGG7DQIDGIaL1g JsOs##Ezrc t|S)zod.keys() -> list of keys in od)listrs rkeyszOrderedDict.keys}Dzzrc fdDS)z#od.values() -> list of values in odc g|] }| Srr.0rrs r z&OrderedDict.values..s***cS ***rrr;s`rvalueszOrderedDict.valuess****T****rc fdDS)z.od.items() -> list of (key, value) pairs in odc$g|] }||f Srrr@s rrBz%OrderedDict.items..s"111Sd3i 111rrr;s`ritemszOrderedDict.itemss1111D1111rc t|S)z0od.iterkeys() -> an iterator over the keys in od)iterr;s riterkeyszOrderedDict.iterkeysr=rc#(K|D] }||V dS)z2od.itervalues -> an iterator over the values in odNrrks rr1zOrderedDict.itervaluess.  Aq'MMMM  rc#,K|D]}|||fVdS)z=od.iteritems -> an iterator over the (key, value) items in odNrrKs r iteritemszOrderedDict.iteritemss6  Ad1g,      rct|dkr tdt|fz|std|d}d}t|dkr|d}t|tr|D] }||||<n@t |dr#|D] }||||<n |D] \}}|||< |D] \}}|||< dS) 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 r(z8update() takes at most 2 positional arguments (%d given)z,update() takes at least 1 argument (0 given)rrrr<N)rr isinstancer3hasattrr<rF)rrrotherrrs rupdatezOrderedDict.updates< t99q=='*-d))6  LJKK KAw t99>>GE eT " " " ' '!#JS  ' UF # # "zz|| ' '!#JS  '$ " " U!S **,,  JCDII  rcX||vr ||}||=|S||jurt||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__markerr6)rrdefaultresults rr"zOrderedDict.pops@ $;;#YFS M dm # #3-- rNc(||vr||S|||<|S)zDod.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in odr)rrrVs r setdefaultzOrderedDict.setdefaults# $;;9 S rct|tf}||vrdSd||< |s|jjd||=S|jjd|d||=S#||=wxYw)zod.__repr__() <==> repr(od)z...rz()())idr __class____name__rF)r _repr_runningcall_keys r__repr__zOrderedDict.__repr__sd88Z\\) } $ $5"# h ( ;!%!8!8!8:h'' $~666 Eh'' h' ' ' ' 'sA%#A%%A*cfdD}t}ttD]}||d|r j|f|fSj|ffS)z%Return state information for picklingc$g|] }||g Srr)rArLrs rrBz*OrderedDict.__reduce__..s!,,,!!T!W,,,rN)varscopyr r"r^)rrF inst_dictrLs` r __reduce__zOrderedDict.__reduce__s,,,,t,,,JJOO%% kmm$$ # #A MM!T " " " "  9NUHi8 8~x''rc,||S)z!od.copy() -> a shallow copy of od)r^r;s rrfzOrderedDict.copys~~d###rc.|}|D]}|||<|S)zOD.fromkeys(S[, v]) -> New ordered dictionary with keys from S and values equal to v (which defaults to None). r)clsiterablerdrs rfromkeyszOrderedDict.fromkeyss. CEE  CAcFFrct|trJt|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. )rPr rrFr3__eq__rrRs rrpzOrderedDict.__eq__s\ e[ ) ) Mt99E *Ltzz||u{{}}/L L{{4'''rc||k SNrrqs r__ne__zOrderedDict.__ne__s5=  rc t|S)z@od.viewkeys() -> a set-like object providing a view on od's keys)r r;s rviewkeyszOrderedDict.viewkeyss~~rc t|S)z an object providing a view on od's values)r r;s r viewvalueszOrderedDict.viewvaluess$rc t|S)zBod.viewitems() -> a set-like object providing a view on od's items)r r;s r viewitemszOrderedDict.viewitems sr)Trs)"r_ __module__ __qualname____doc__rr3r r&r,r/r2r8r<rCrFrIr1rNrSrobjectrUr"rYrbrhrf classmethodrnrprtrvrxrzrrrr r s//%%% 483C''''-1,<!!!!   2+++222  BHvxxH'    &( ( ( ( (((($$$[(((!!!    rr N) threadrr ImportError_abcollr r r r3r rrrrs .......          77777777777   D vvvvv$vvvvvs  #++