g PSrSSKJr "SS\5rg!\a SSKJr Nf=f)zpasslib.utils.compat._ordered_dict -- backport of collections.OrderedDict for py26 taken from stdlib-suggested recipe at http://code.activestate.com/recipes/576693/ this should be imported from passlib.utils.compat.OrderedDict, not here. ) get_identc\rSrSrSrSr\R4Sjr\R4SjrSr Sr Sr SS jr S r S rS rS rSrSrSr\r\"5r\4SjrSSjr04SjrSrSr\SSj5rSrSrSr g) OrderedDict z)Dictionary that remembers insertion orderc[U5S:a[S[U5-5eUR UR "U0UD6 g![a /=UlnX3S/USS&0UlN6f=f)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 [/home/matz/Project1/venv/lib/python3.13/site-packages/passlib/utils/compat/_ordered_dict.py__init__OrderedDict.__init__su t9q=BSYNO O  KK t$t$  !# #DK$4(DGDJ s A!A+*A+cxX;a,URnUSnXTU/=US'=US'URU'U"XU5 g)z!od.__setitem__(i, y) <==> od[i]=yrrN)r r )rkeyvalue dict_setitemrlasts r __setitem__OrderedDict.__setitem__)sI ?;;D7D37s2C CDG Cd1g 3T&c`U"X5 URRU5up4nXCS'X4S'g)z od.__delitem__(y) <==> del od[y]rrN)r pop)rr dict_delitem link_prev link_nexts r __delitem__OrderedDict.__delitem__3s1 T$(JJNN3$7! c !  ! rc#\# URnUSnX!LaUSv USnX!LaMgg7f)zod.__iter__() <==> iter(od)rNr rrcurrs r__iter__OrderedDict.__iter__<7{{Awq'M7D&,,c#\# URnUSnX!LaUSv USnX!LaMgg7f)z#od.__reversed__() <==> reversed(od)rr&Nr'r(s r __reversed__OrderedDict.__reversed__Dr,r-cURR5HnUSS2 M URnX"S/USS&URR5 [ RU5 g![a N"f=f)z.od.clear() -> None. Remove all items from od.N)r itervaluesr clearr dict)rnoders rr3OrderedDict.clearLsn  --/G0;;D4(DG JJ    4   sAA++ A87A8cU(d [S5eURnU(aUSnUSnX$S'XBS'OUSnUSnXRS'X%S'USnURU [R X5nXg4$)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 r r4r)rrrlinkr!r"rrs rpopitemOrderedDict.popitemXs 01 1{{ 7DQIaLG7DQIGaL1g JJsO#zrc[U5$)zod.keys() -> list of keys in od)listrs rkeysOrderedDict.keysq Dzrc6UVs/sHoUPM sn$s snf)z#od.values() -> list of values in odrrs rvaluesOrderedDict.valuesus%)*TcS T***sc8UVs/sHoX4PM sn$s snf)z.od.items() -> list of (key, value) pairs in odrCrDs ritemsOrderedDict.itemsys,01DSdi D111sc[U5$)z0od.iterkeys() -> an iterator over the keys in od)iterr>s riterkeysOrderedDict.iterkeys}rArc#*# UH nXv M g7f)z2od.itervalues -> an iterator over the values in odNrCrks rr2OrderedDict.itervaluessA'Msc#.# UH nXU4v M g7f)z=od.iteritems -> an iterator over the (key, value) items in odNrCrOs r iteritemsOrderedDict.iteritemssA1g, sc[U5S:a[S[U54-5eU(d [S5eUSnSn[U5S:XaUSn[U[5(aUH nX4X$'M O>[ US5(aUR 5H nX4X$'M OUH upEXRU'M UR 5H upEXRU'M g) a[od.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)rrCrr?N)r r isinstancer4hasattrr?rH)rrrotherrrs rupdateOrderedDict.updates t9q=369$i\BC CJK KAw t9>GE eT " "!J  UF # #zz|!J $$ !S $**,JCI'rcRX;aXnX U$X RLa [U5eU$)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__markerr8)rrdefaultresults rrOrderedDict.pops3 ;YF M mm #3- rNc X;aX$X U'U$)zDod.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in odrC)rrr]s r setdefaultOrderedDict.setdefaults ;9 S rc[U5[54nX!;agSX'U(dURR<S3X $URR<SUR 5<S3X $!X f=f)zod.__repr__() <==> repr(od)z...rz()())id _get_ident __class____name__rH)r _repr_runningcall_keys r__repr__OrderedDict.__repr__sjd8Z\)  $"#  (!%!8!8:' $~~66 E' 's A2+A22A6c UVs/sHoX/PM nn[U5R5n[[55HnURUS5 M U(aURU4U4$URU44$s snf)z%Return state information for picklingN)varscopyrrrh)rrPrH inst_dicts r __reduce__OrderedDict.__reduce__su'+,t!TWt,JOO% km$A MM!T "% NNUHi8 8~~x'' -sBc$URU5$)z!od.copy() -> a shallow copy of od)rhr>s rrpOrderedDict.copys~~d##rc.U"5nUHnX#U'M U$)zpOD.fromkeys(S[, v]) -> New ordered dictionary with keys from S and values equal to v (which defaults to None). rC)clsiterablerdrs rfromkeysOrderedDict.fromkeyss! ECcFrc[U[5(a?[U5[U5:H=(a! UR5UR5:H$[R X5$)zod.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive while comparison to a regular mapping is order-insensitive. )rVrr rHr4__eq__rrXs rr}OrderedDict.__eq__sI e[ ) )t9c%j(JTZZ\U[[]-J J{{4''rc X:X+$NrCr~s r__ne__OrderedDict.__ne__s   r)__map__root)Tr)!ri __module__ __qualname____firstlineno____doc__rr4rr#r*r/r3r:r?rErHrLr2rSrYrobjectr\rrarlrrrp classmethodrzr}r__static_attributes__rCrrrr s3% 483C3C'-1,<,<! 2+2  >HxH' &( (($(!rrN)rthreadrrg ImportError dummy_threadr4rrCrrrs45.e!$e!545s  %%