%h SSKJr SSKJr SSKrSSKJr SSK J r SSK J r SSK Jr SS K Jr SS K Jr SS K Jr \R$(aSSKr\R*"S 5r\R*"S 5r\R*"S5rS*Sjr"SS\\\5r"SS\\\45r"SS\\\4\\\45r"SS\\\45r"SS\R@\\45r!"SS\\\45r""SS\\\4\\\45r#"SS\\\4\\\45r$"S S!\\\4\\\45r%"S"S#\\\4\"\\45r&"S$S%\\\4\\\45r'"S&S'\RP\)5r*SS(K J+r+ S+S)jr,g),) annotationsNdeepcopy) exceptions)_missing)ImmutableDictMixin)ImmutableListMixin)ImmutableMultiDictMixin)UpdateDictMixinKVTc#^# [U[5(aURSS9ShvN g[U[R5(aOUR5H:up[U[ [ [45(aUHnX4v M M5X4v M< gUShvN gN~N7f)zqIterates over the items of a mapping yielding keys and values without dropping any from more complex structures. TmultiN) isinstance MultiDictitemscabcMappinglisttupleset)mappingkeyvaluevs Z/var/www/auris/envauris/lib/python3.13/site-packages/werkzeug/datastructures/structures.pyiter_multi_itemsr!s'9%%==t=,,, GT\\ * *!--/JC%$s!344A&Lj * - s"(B-B)A8B-#B+$B-+B-c"\rSrSrSrSSjrSrg) ImmutableList-z>An immutable :class:`list`. .. versionadded:: 0.5 :private: c^[U5RS[RU5S3$N())type__name__r__repr__selfs r r+ImmutableList.__repr__5*t*%%&a d(;'>Nreturnstr)r* __module__ __qualname____firstlineno____doc__r+__static_attributes__r1r0r r#r#-s ?r0r#c\rSrSrSr\R S Sj5r\R S Sj5r\R S Sj5r\R SSj5r\R SSj5rSSS jjrS rg)TypeConversionDict9zWorks like a regular dict but the :meth:`get` method can perform type conversions. :class:`MultiDict` and :class:`CombinedMultiDict` are subclasses of this class and provide the same feature. .. versionadded:: 0.5 cgNr1r-rs r getTypeConversionDict.getA'*r0cgr>r1r-rdefaults r r@rAC,/r0cgr>r1rDs r r@rAE03r0cgr>r1r-rr)s r r@rAGFIr0cgr>r1r-rrEr)s r r@rAIKNr0Nc|XnUcU$U"U5$![a Us$f=f![[4a Us$f=f)a~Return the default value if the requested data doesn't exist. If `type` is provided and is a callable it should convert the value, return it or raise a :exc:`ValueError` if that is not possible. In this case the function will return the default as if the value was not found: >>> d = TypeConversionDict(foo='42', bar='blub') >>> d.get('foo', type=int) 42 >>> d.get('bar', -1, type=int) -1 :param key: The key to be looked up. :param default: The default value to be returned if the key can't be looked up. If not further specified `None` is returned. :param type: A callable that is used to cast the value in the :class:`MultiDict`. If a :exc:`ValueError` or a :exc:`TypeError` is raised by this callable the default value is returned. .. versionchanged:: 3.0.2 Returns the default value on :exc:`TypeError`, too. )KeyError ValueError TypeError)r-rrEr)rvs r r@rAKsX< B <I 8O N I& N s& ##;;r1rrr3V | NonerrrErr3rrrrErr3V | Trr4r)cabc.Callable[[V], T]r3zT | Nonerr4rErr)rZr3rNNrrrE V | T | Noner)cabc.Callable[[V], T] | Noner3r^) r*r5r6r7r8toverloadr@r9r1r0r r;r;9sZZ**ZZ//ZZ33ZZIIZZNN!%-1 ) ))+ )  ))r0r;c,\rSrSrSrSSjrSSjrSrg) ImmutableTypeConversionDictwzdWorks like a :class:`TypeConversionDict` but does not support modifications. .. versionadded:: 0.5 c[U5$zReturn a shallow mutable copy of this object. Keep in mind that the standard library's :func:`copy` function is a no-op for this class like for any other python immutable type (eg: :class:`tuple`). )r;r,s r copy ImmutableTypeConversionDict.copy~s "$''r0cU$r>r1r,s r __copy__$ImmutableTypeConversionDict.__copy__ r0r1N)r3zTypeConversionDict[K, V]r3te.Selfr*r5r6r7r8rgrjr9r1r0r rcrcws (r0rccj^\rSrSrSrS)S*U4SjjjrS+SjrS,U4SjjrS-U4SjjrS.U4Sjjr S/U4Sjjr S/U4S jjr \ RS0S j5r\ RS1S j5rS)S2U4S jjjrS3U4S jjr\ RS4Sj5r\ RS5Sj5rS)S6SjjrS)S7U4SjjjrS8S9U4SjjjrS:U4SjjrS;U4SjjrSSjjr\ RS?Sj5r\ RS@Sj5rSASBSjjrSCSjrSDSjrSESjr\ RS.Sj5r\ RS5Sj5r\ RSFS j5r\4SGU4S!jjjrSHU4S"jjrS0U4S#jjrSIU4S$jjr S=S%jr!S>S&jr"SJS'jr#S(r$U=r%$)KraA :class:`MultiDict` is a dictionary subclass customized to deal with multiple values for the same key which is for example used by the parsing functions in the wrappers. This is necessary because some HTML form elements pass multiple values for the same key. :class:`MultiDict` implements all standard dictionary methods. Internally, it saves all values for a key as a list, but the standard dict access methods will only return the first value for a key. If you want to gain access to the other values, too, you have to use the `list` methods as explained below. Basic Usage: >>> d = MultiDict([('a', 'b'), ('a', 'c')]) >>> d MultiDict([('a', 'b'), ('a', 'c')]) >>> d['a'] 'b' >>> d.getlist('a') ['b', 'c'] >>> 'a' in d True It behaves like a normal dict thus all dict functions will only return the first value when multiple values for one key are found. From Werkzeug 0.3 onwards, the `KeyError` raised by this class is also a subclass of the :exc:`~exceptions.BadRequest` HTTP exception and will render a page for a ``400 BAD REQUEST`` if caught in a catch-all for HTTP exceptions. A :class:`MultiDict` can be constructed from an iterable of ``(key, value)`` tuples, a dict, a :class:`MultiDict` or from Werkzeug 0.2 onwards some keyword parameters. :param mapping: the initial value for the :class:`MultiDict`. Either a regular dict, an iterable of ``(key, value)`` tuples or `None`. .. versionchanged:: 3.1 Implement ``|`` and ``|=`` operators. c$>Uc[TU]5 g[U[5(a%[TU]SUR 555 g[U[ R 5(ag0nUR5HAup4[U[[[45(a[U5nU(dM9OU/nXBU'MC [TU]U5 g0nUH&up4URU/5RU5 M( [TU]U5 g)Nc32# UH upXSS4v M g7fr>r1).0kvss r %MultiDict.__init__..sE_EAaAZ_s) super__init__rrlistsrrrrrr setdefaultappend)r-rtmprr __class__s r rzMultiDict.__init__s ? G    + + G EW]]_E E  . .C%mmo edE3%788 KE  !#GE C. G S !C% sB'..u5& G S !r0c4[UR55$r>)dictr{r,s r __getstate__MultiDict.__getstate__sDJJL!!r0c@>[TU]5 [TU] U5 gr>)ryclearupdate)r-rrs r __setstate__MultiDict.__setstate__s   ur0c >[TU]5$r>)ry__iter__r-rs r rMultiDict.__iter__s w!!r0c>X;a#[TU]U5n[U5S:aUS$[R"U5e)zReturn the first data value for this key; raises KeyError if not found. :param key: The key to be looked up. :raise KeyError: if the key does not exist. r)ry __getitem__lenrBadRequestKeyError)r-rlstrs r rMultiDict.__getitem__s> ;'%c*C3x!|1v ++C00r0c&>[TU]X/5 g)zxLike :meth:`add` but removes an existing key first. :param key: the key for the value. :param value: the value to set. N)ry __setitem__r-rrrs r rMultiDict.__setitem__s C)r0cD>[TU]U/5RU5 g)zyAdds a new value for the key. .. versionadded:: 0.6 :param key: the key for the value. :param value: the value to add. N)ryr|r}rs r add MultiDict.adds 3#**51r0cgr>r1r?s r getlistMultiDict.getlist*-r0cgr>r1rJs r rrGJr0c>[TU]U5nUc [U5$/nUHnUR U"U55 M U$![a /s$f=f![ [ 4a MFf=f)aReturn the list of items for a given key. If that key is not in the `MultiDict`, the return value will be an empty list. Just like `get`, `getlist` accepts a `type` parameter. All items will be converted with the callable defined there. :param key: The key to be looked up. :param type: Callable to convert each value. If a ``ValueError`` or ``TypeError`` is raised, the value is omitted. :return: a :class:`list` of all the values for the key. .. versionchanged:: 3.1 Catches ``TypeError`` in addition to ``ValueError``. )ryrrPrr}rQrR)r-rr)rSresultitemrs r rrs  '-c2B <8OD  d4j)   I  *  s"AA AAA+*A+c8>[TU]U[U55 g)aRemove the old values for a key and add new ones. Note that the list you pass the values in will be shallow-copied before it is inserted in the dictionary. >>> d = MultiDict() >>> d.setlist('foo', ['1', '2']) >>> d['foo'] '1' >>> d.getlist('foo') ['1', '2'] :param key: The key for which the values are set. :param new_list: An iterable with the new values for the key. Old values are removed first. N)ryrr)r-rnew_listrs r setlistMultiDict.setlist$s Ch0r0cgr>r1r?s r r|MultiDict.setdefault6rr0cgr>r1rDs r r|r836r0cX;aX U'X$)aReturns the value for the key if it is in the dict, otherwise it returns `default` and sets that value for `key`. :param key: The key to be looked up. :param default: The default value to be returned if the key is not in the dict. If not further specified it's `None`. r1rDs r r|r:s ?Iyr0cp>X;a"[TU]U[U=(d S55 [TU] U5$)a0Like `setdefault` but sets multiple values. The list returned is not a copy, but the list that is actually used internally. This means that you can put new values into the dict by appending items to the list: >>> d = MultiDict({"foo": 1}) >>> d.setlistdefault("foo").extend([2, 3]) >>> d.getlist("foo") [1, 2, 3] :param key: The key to be looked up. :param default_list: An iterable of default values. It is either copied (in case it was a list) or converted into a list before returned. :return: a :class:`list` r1)ryrrr)r-r default_listrs r setlistdefaultMultiDict.setlistdefaultGs3& ? G T,*<"%= >w"3''r0c#z># [TU]5H$up#U(aUHnX$4v M MX#S4v M& g7f)zReturn an iterator of ``(key, value)`` pairs. :param multi: If set to `True` the iterator returned will have a pair for each value of each key. Otherwise it will only contain pairs for the first value of each key. rN)ryr)r-rrvaluesrrs r rMultiDict.items_s=!7=?KC#E*$$!9n$ +s8;c#Z># [TU]5HupU[U54v M g7f)zmReturn a iterator of ``(key, values)`` pairs, where values is the list of all values associated with the key.N)ryrr)r-rrrs r r{MultiDict.listsos) !7=?KCtF|# #+s(+c#F># [TU]5H nUSv M g7f)zAReturns an iterator of the first value on every key's value list.rNryr)r-rrs r rMultiDict.valuesws"gn&F)O's!c >[TU]5$)zReturn an iterator of all values associated with a key. Zipping :meth:`keys` and this is the same as calling :meth:`lists`: >>> d = MultiDict({"foo": [1, 2, 3]}) >>> zip(d.keys(), d.listvalues()) == d.lists() True rrs r listvaluesMultiDict.listvalues~sw~r0c$URU5$)z%Return a shallow copy of this object.rr,s r rgMultiDict.copys~~d##r0cRUR[URSS9U55$)z"Return a deep copy of this object.F)flat)rrto_dictr-memos r rMultiDict.deepcopys#~~ht|||'?FGGr0cgr>r1r,s r rMultiDict.to_dicts%(r0cgr>r1r-rs r rrsCFr0ctU(a[UR55$[UR55$)a|Return the contents as regular dict. If `flat` is `True` the returned dict will only have the first item present, if `flat` is `False` all values will be returned as lists. :param flat: If set to `False` the dict returned will have lists with all the values in it. Otherwise it will only contain the first value for each key. :return: a :class:`dict` )rrr{rs r rrs)  % %DJJL!!r0cN[U5Hup#URX#5 M g)aupdate() extends rather than replaces existing key lists: >>> a = MultiDict({'x': 1}) >>> b = MultiDict({'x': 2, 'y': 3}) >>> a.update(b) >>> a MultiDict([('y', 3), ('x', 1), ('x', 2)]) If the value list for a key in ``other_dict`` is empty, no new values will be added to the dict and the key will not be created: >>> x = {'empty_list': []} >>> y = MultiDict() >>> y.update(x) >>> y MultiDict([]) Nr!rr-rrrs r rMultiDict.updates!2+73JC HHS 4r0c[U[R5(d[$UR 5nUR U5 U$r>)rrrNotImplementedrgr)r-otherrSs r __or__MultiDict.__or__s7%..! ! YY[ % r0c[U[R[R45(d[$UR U5 U$r>)rrrIterablerr)r-rs r __ior__MultiDict.__ior__s5%$,, !>??! ! E r0cgr>r1r?s r pop MultiDict.pop #r0cgr>r1rDs r rrrFr0cgr>r1rDs r rrrHr0c>[TU]U5n[U5S:Xa[R"U5eUS$![ a% U[ LaUs$[R"U5Sef=f)aOPop the first item for a list on the dict. Afterwards the key is removed from the dict, so additional values are discarded: >>> d = MultiDict({"foo": [1, 2, 3]}) >>> d.pop("foo") 1 >>> "foo" in d False :param key: the key to pop. :param default: if provided the value to return if the key was not in the dictionary. rN)ryrrrrrPr)r-rrErrs r rrsj( ?'+c"C3x1} 33C88q6M ?h&//4$ >  ?s8<A+A+c>[TU]5n[US5S:Xa[R"US5eUSUSS4$![ a)n[R"UR S5SeSnAff=f)zPop an item from the dict.r rN)rypopitemrrrrPargs)r-rers r rMultiDict.popitems~ E7?$D47|q  33DG<<7DGAJ& & E//q : D EsAA A<$A77A<c$>[TU]U/5$)zPop the list for a key from the dict. If the key is not in the dict an empty list is returned. .. versionchanged:: 0.5 If the key does no longer exist a list is returned instead of raising an error. )ryr)r-rrs r poplistMultiDict.poplist sw{3##r0c>[TU]5$![a)n[R"UR S5SeSnAff=f)z*Pop a ``(key, list)`` tuple from the dict.rN)ryrrPrrr)r-rrs r popitemlistMultiDict.popitemlistsC E7?$ $ E//q : D Es  A$?Ac"UR5$r>)rgr,s r rjMultiDict.__copy__syy{r0c URUS9$)N)rrrs r __deepcopy__MultiDict.__deepcopy__s}}$}''r0cf[U5RS[URSS95<S3$)Nr'Trr()r)r*rrr,s r r+MultiDict.__repr__!s1t*%%&aTZZdZ-C(D'GqIIr0r1r>rzkMultiDict[K, V] | cabc.Mapping[K, V | list[V] | tuple[V, ...] | set[V]] | cabc.Iterable[tuple[K, V]] | Noner3Noner3t.Any)rrr3rr3zcabc.Iterator[K]rrr3rrrrrr3rrrr3list[V]rrr)rZr3zlist[T]rrr)r_r3zlist[V] | list[T]rrrcabc.Iterable[V]r3rrrr3rrV)rrrErUr3rU)rrrzcabc.Iterable[V] | Noner3rFrboolr3cabc.Iterable[tuple[K, V]]r3 cabc.Iterable[tuple[K, list[V]]]r3rr3zcabc.Iterable[list[V]]rm)rrr3rnr3z dict[K, V])rzt.Literal[False]r3zdict[K, list[V]])T)rrr3zdict[K, V] | dict[K, list[V]]rdMultiDict[K, V] | cabc.Mapping[K, V | list[V] | tuple[V, ...] | set[V]] | cabc.Iterable[tuple[K, V]]r3r)rz5cabc.Mapping[K, V | list[V] | tuple[V, ...] | set[V]]r3MultiDict[K, V])rzRcabc.Mapping[K, V | list[V] | tuple[V, ...] | set[V]] | cabc.Iterable[tuple[K, V]]r3rnrWrrrErXr3rXr3z tuple[K, V]r3ztuple[K, list[V]]r2)&r*r5r6r7r8rzrrrrrrr`rarrr|rrr{rrrgrrrrrrrrrrrjrr+r9 __classcell__rs@r rrs)d " " "">"" 1*2ZZ--ZZJJ;?8 <1$ZZ--ZZ66 ?C(($;( ((0%% $ $HZZ((ZZFF "! )! !8J   )   ZZ##ZZ//ZZ33"? ??  ??B E$E(JJr0rc0\rSrSrSrSrSSjrS SjrSrg) _omd_bucketi%zWraps values in the :class:`OrderedMultiDict`. This makes it possible to keep an order over multiple different keys. It requires a lot of extra memory and slows down access a lot, but makes it possible to access elements in O(1) and iterate in O(n). )prevrrnextcURUlX lX0lSUlUR cXlURbXRlXlgr>) _last_bucketrrrr _first_bucket)r-omdrrs r rz_omd_bucket.__init__.sP.1.>.>  .2    $ $     '$(   !r0c6UR(aURURlUR(aURURlURULaURUlURULaURUlggr>)rrrr)r-rs r unlink_omd_bucket.unlink:sg 99!YYDIIN 99!YYDIIN    $ $ C    t ##yyC  $r0)rrrrN)r_OrderedMultiDict[K, V]rrrrr3r)rrr3r) r*r5r6r7r8 __slots__rzrr9r1r0r rr%s 1I  )r0rc^\rSrSrSrS!S"U4SjjjrS#SjrSrS$SjrS%Sjr S&Sjr S'S jr S(S jr S)S jr S*S jrS+S jrS,SjrS-S.SjjrS/SjrS0SjrS(Sjr\R,S1Sj5r\R,S2Sj5rS!S3SjjrS4SjrS!S5SjjrS6SjrS1Sjr\R,S'Sj5r\R,S7Sj5r\R,S8Sj5r\4S9SjjrS:SjrS;SjrS r U=r!$)<_OrderedMultiDictiEa{Works like a regular :class:`MultiDict` but preserves the order of the fields. To convert the ordered multi dict into a list you can use the :meth:`items` method and pass it ``multi=True``. In general an :class:`OrderedMultiDict` is an order of magnitude slower than a :class:`MultiDict`. .. admonition:: note Due to a limitation in Python you cannot convert an ordered multi dict into a regular dict by using ``dict(multidict)``. Instead you have to use the :meth:`to_dict` method, otherwise the internal bucket objects are exposed. .. deprecated:: 3.1 Will be removed in Werkzeug 3.2. Use ``MultiDict`` instead. Nc>SSKnURS[SS9 [TU]5 SUlSUlUbURU5 gg)Nr^'OrderedMultiDict' is deprecated and will be removed in Werkzeug 3.2. Use 'MultiDict' instead.r stacklevel)warningswarnDeprecationWarningryrzrrr)r-rr"rs r rz_OrderedMultiDict.__init__XsX   -   7;6:   KK  r0c[U[5(d[$[U[5(ab[ UR SS95n[ UR SS95nUHupE[ U5upgXF:wdXW:wdM g [ U5 g[U5[U5:wagUR5HupURU5U :wdM g g![a gf=f![a gf=f)NTrF) rrrriterrr StopIterationrr{r) r-riter1iter2k1v1k2v2rrs r __eq___OrderedMultiDict.__eq__os%++! ! e. / /$/0E401E #FB!%[FBx28$$  U  t9E "::)rr)r-rrrs r r_OrderedMultiDict.__setstate__s#  JC HHS !r0c|X;a"[RX5SR$[R"U5eNr)rrrrrr?s r r_OrderedMultiDict.__getitem__s4 ;##D.q177 7++C00r0cHURU5 URX5 gr>rrr-rrs r r_OrderedMultiDict.__setitem__s S r0c&URU5 gr>)rr?s r __delitem___OrderedMultiDict.__delitem__s   r0c0SUR55$)Nc3*# UH upUv M g7fr>r1)rtr_s r rw)_OrderedMultiDict.keys..s/,,rr,s r keys_OrderedMultiDict.keyss/$**,//r0c4[UR55$r>)r'rKr,s r r_OrderedMultiDict.__iter__sDIIK  r0c0SUR55$)Nc3*# UH upUv M g7fr>r1)rtrrs r rw+_OrderedMultiDict.values..s5 *# rIrJr,s r r_OrderedMultiDict.valuess5 55r0c#Z# URnU(a0Ub,URUR4v URnUbM+gg[ 5nUbWURU;a5UR UR5 URUR4v URnUbMVgg7fr>)rrrrrr)r-rptr returned_keyss r r_OrderedMultiDict.itemss   /ggsyy((hh/ EM/77-/!%%cgg.''399,,hh /sAB+A#B+)B+c# # [5nURnUbfURU;aDURURUR54v UR UR5 UR nUbMegg7fr>)rrrrrr)r-rUrTs r r{_OrderedMultiDict.listssf   owwm+ggt||CGG444!!#''*((C os A=BBc#F# UR5H upUv M g7fr>r{)r-_keyrs r r_OrderedMultiDict.listvaluess JJLLDL)!cb[RX/5R[XU55 gr>)rr|r}rr@s r r_OrderedMultiDict.adds" 2&--k$U.KLr0cgr>r1r?s r r_OrderedMultiDict.getlistrr0cgr>r1rJs r rrarr0c&[RX5nUcUVs/sHoDRPM sn$/nUH%nUR U"UR55 M' U$![a /s$f=fs snf![ [ 4a MUf=fr>)rrrPrr}rQrR)r-rr)rSxrrs r rras  !!$,B <%'(RGGR( (D  d4::./   I )  *  s'A%A7!A<% A43A4<BBcZURU5 UHnURX5 M gr>r?)r-rrrs r r_OrderedMultiDict.setlists$ SE HHS r0c[S5e)Nz5setlistdefault is unsupported for ordered multi dicts)rR)r-rrs r r _OrderedMultiDict.setlistdefaultsOPPr0cN[U5Hup#URX#5 M gr>rrs r r_OrderedMultiDict.updates!+73JC HHS 4r0c[RXS5nUHnURU5 M UVs/sHoDRPM sn$s snfNr1)rrrr)r-rbucketsbucketrds r r_OrderedMultiDict.poplistsB48HHT4KF MM$ !()A)))sA cgr>r1r?s r r_OrderedMultiDict.poprr0cgr>r1rDs r rrqrFr0cgr>r1rDs r rrqrHr0c[RX5nUHnUR U5 M USR$![a% U[LaUs$[R "U5Sef=fr<)rrrPrrrrr)r-rrErmrns r rrqsp ?hht)GF MM$ qz ?h&//4$ >  ?sAA/A/c[RU5upUHnUR U5 M XSR4$![a)n[R"UR S5SeSnAff=fr<rrrPrrrrr)r-rrmrrns r r_OrderedMultiDict.popitemst E<<-LCF MM$ AJ$$$$  E//q : D EsA A6 $A11A6c[RU5upUHnUR U5 M XVs/sHoURPM sn4$![a)n[R"UR S5SeSnAff=fs snfr<rv)r-rrmrrnrds r r_OrderedMultiDict.popitemlist!s E<<-LCF MM$ g.gWWg...  E//q : D E /sAB B$A>>B)rrr>r)robjectr3rr4t.SupportsIndexr3rr)rrr3rrrrr3zcabc.Iterable[K]rrrrrrrrrr)rrrrr3 t.NoReturnrrVrWr r r )"r*r5r6r7r8rzr/__hash__r5rrrrrCrKrrrr{rrr`rarrrrrrrrrr9r rs@r rrEsU2 ! ! !!.2H;,! 1 0!6 MZZ--ZZJJ;?8 &! Q ! ) !  !* ZZ##ZZ//ZZ33"      ( % / /r0rc|^\rSrSrSrSSjrSS U4Sjjjr\SS!Sjj5rS"Sjr \ RS#Sj5r \ RS$Sj5r \ RS%S j5r \ RS&S j5r \ RS'S j5r S(S)S jjr \ RS*S j5r \ RS+Sj5r SS,Sjjr S-SjrS.SjrS/Sjr\ RS0Sj5r\ RS1Sj5rS2S3SjjrS4SjrS5SjrS6SjrS7SjrS8SjrS9SjrS:SjrSrU=r$);CombinedMultiDicti0aA read only :class:`MultiDict` that you can pass multiple :class:`MultiDict` instances as sequence and it will combine the return values of all wrapped dicts: >>> from werkzeug.datastructures import CombinedMultiDict, MultiDict >>> post = MultiDict([('foo', 'bar')]) >>> get = MultiDict([('blub', 'blah')]) >>> combined = CombinedMultiDict([get, post]) >>> combined['foo'] 'bar' >>> combined['blub'] 'blah' This works for all read operations and will raise a `TypeError` for methods that usually change data which isn't possible. From Werkzeug 0.3 onwards, the `KeyError` raised by this class is also a subclass of the :exc:`~exceptions.BadRequest` HTTP exception and will render a page for a ``400 BAD REQUEST`` if caught in a catch-all for HTTP exceptions. c2[U5UR44$r>)r)dictsr3s r r5CombinedMultiDict.__reduce_ex__GsDzDJJ=((r0cT>[TU]5 [U=(d S5Ulgrl)ryrzrr)r-rrs r rzCombinedMultiDict.__init__Js ,0",= r0c6[SUR<S35e)Nzcannot create z instances by fromkeys)rRr*)clsrKrs r fromkeysCombinedMultiDict.fromkeysNs.(88NOPPr0cjURHnX;dM X!s $ [R"U5er>)rrrr-rds r rCombinedMultiDict.__getitem__Rs/Axv ++C00r0cgr>r1r?s r r@CombinedMultiDict.getXrBr0cgr>r1rDs r r@rZrFr0cgr>r1rDs r r@r\rHr0cgr>r1rJs r r@r^rKr0cgr>r1rMs r r@r`rNr0cURHnX;dM Ub U"XA5s $XAs $ U$![[4a M7f=fr>)rrQrR)r-rrEr)rs r r@rbsW Ax#!#AF|+v ' 2! !s 1AAcgr>r1r?s r rCombinedMultiDict.getlistrrr0cgr>r1rJs r rrtrr0cp/nURH#nURURX55 M% U$r>)rextendr)r-rr)rSrs r rrvs1A IIaii* + r0c:[SUR55$)zpThis function exists so __len__ can be implemented more efficiently, saving one list creation from an iterator. c36# UHoHo"v M M g7fr>r1)rtrrus r rw/CombinedMultiDict._keys_impl..s4j!Q1!1js)rrr,s r _keys_implCombinedMultiDict._keys_impl~s4djj444r0c"UR5$r>)rr,s r rKCombinedMultiDict.keyss  r0c4[UR55$r>)r'rr,s r rCombinedMultiDict.__iter__sDOO%&&r0cgr>r1r,s r rCombinedMultiDict.itemsrr0cgr>r1)r-rs r rrsQTr0c## [5nURHHnURU5H0upEU(aXE4v MXB;dMURU5 XE4v M2 MJ g7fr>)rrrr)r-rfoundrrrs r rrsTAggen *$%IIcN*$ -s AA&A&c#F# UR5H upUv M g7fr>rJ)r-rGrs r rCombinedMultiDict.valuess HAK%r]c0nURH=nUR5H&up4URU/5RU5 M( M? UR 5$r>)rr{r|rr)r-rSrrrs r r{CombinedMultiDict.listssN!A wwy  c2&--f5 )xxzr0c0SUR55$)Nc3*# UH oSv M g7f)r Nr1)rtrds r rw/CombinedMultiDict.listvalues..s+l!lrIrZr,s r rCombinedMultiDict.listvaluess+djjl++r0c[U5$)aReturn a shallow mutable copy of this object. This returns a :class:`MultiDict` representing the data at the time of copying. The copy will no longer reflect changes to the wrapped dicts. .. versionchanged:: 0.15 Return a mutable :class:`MultiDict`. rr,s r rgCombinedMultiDict.copysr0c4[UR55$r>)rrr,s r __len__CombinedMultiDict.__len__s4??$%%r0c8URH nX;dM g g)NTFrrs r __contains__CombinedMultiDict.__contains__sAxr0cN[U5RSUR<S3$r&)r)r*rr,s r r+CombinedMultiDict.__repr__s$t*%%&a ~Q77r0rr{r>)rz%cabc.Iterable[MultiDict[K, V]] | Noner3r)rKrrrr3r~rrTrVrWrYr[r\r]rrr)r3zset[K]r}r)r3r)rzt.Literal[True]r3rr)rrr3z=cabc.Iterable[tuple[K, V]] | cabc.Iterable[tuple[K, list[V]]]rrrr3r r3int)rrr3rr2)r*r5r6r7r8r5rz classmethodrrr`rar@rrrKrrrr{rrgrrr+r9r rs@r rr0s|,)>>QQ1 ZZ**ZZ//ZZ33ZZIIZZNN!%-1  +    ZZ--ZZJJ;?8 5 !'ZZ66ZZTT! % % F %, & 88r0rc6\rSrSrSrSSjrS SjrS SjrSrg) ImmutableDictiz3An immutable :class:`dict`. .. versionadded:: 0.5 c^[U5RS[RU5S3$r&)r)r*rr+r,s r r+ImmutableDict.__repr__r/r0c[U5$rf)rr,s r rgImmutableDict.copys Dzr0cU$r>r1r,s r rjImmutableDict.__copy__rlr0r1Nr2rrm) r*r5r6r7r8r+rgrjr9r1r0r rrs ?r0rc,\rSrSrSrSSjrSSjrSrg) ImmutableMultiDictiz8An immutable :class:`MultiDict`. .. versionadded:: 0.5 c[U5$rfrr,s r rgImmutableMultiDict.copys r0cU$r>r1r,s r rjImmutableMultiDict.__copy__rlr0r1Nrrmror1r0r rrs r0rcZ^\rSrSrSrSS U4SjjjrS SjrS SjrS SjrSr U=r $) _ImmutableOrderedMultiDictizAn immutable :class:`OrderedMultiDict`. .. deprecated:: 3.1 Will be removed in Werkzeug 3.2. Use ``ImmutableMultiDict`` instead. .. versionadded:: 0.6 c~>[TU]5 Ub+[U5Hup#[R XU5 M ggr>)ryrzr!rr)r-rrurrs r rz#_ImmutableOrderedMultiDict.__init__s<   (1!%%dq12 r0c2[URSS95$r2) enumeraterr,s r _iter_hashitems*_ImmutableOrderedMultiDict._iter_hashitemss$/00r0c[U5$rf)rr,s r rg_ImmutableOrderedMultiDict.copys !&&r0cU$r>r1r,s r rj#_ImmutableOrderedMultiDict.__copy__ rlr0r1r>r)r3zcabc.Iterable[t.Any])r3rrm) r*r5r6r7r8rzrrgrjr9r rs@r rrs?  2  2  2 21'r0rcR^\rSrSrSrSSU4SjjjrSU4SjjrSrU=r$) CallbackDictizoA dict that calls a function passed every time something is changed. The function is passed the dict instance. cT>Uc[TU]5 O[TU]U5 X lgr>)ryrz on_update)r-initialrrs r rzCallbackDict.__init__s' ? G   G W %"r0cT>S[U5RS[TU] 5S3$)N< >)r)r*ryr+rs r r+CallbackDict.__repr__s,4:&&'q)9);(>r0)rr\)rz6cabc.Mapping[K, V] | cabc.Iterable[tuple[K, V]] | Noner%cabc.Callable[[te.Self], None] | Noner3rr2) r*r5r6r7r8rzr+r9r rs@r rrsB KO;? #G #9 #  # #??r0rc\rSrSrSrSSSjjrSSjrSSjrSSjrSSjr SS jr SS jr SS jr SS S jjr S!S jrS"SjrS#SjrS$SjrS%SjrS&SjrS'SjrS(SjrS!SjrS!SjrSrg)) HeaderSeti#agSimilar to the :class:`ETags` class this implements a set-like structure. Unlike :class:`ETags` this is case insensitive and used for vary, allow, and content-language headers. If not constructed using the :func:`parse_set_header` function the instantiation works like this: >>> hs = HeaderSet(['foo', 'bar', 'baz']) >>> hs HeaderSet(['foo', 'bar', 'baz']) Nc[U=(d S5UlURVs1sHo3R5iM snUlX lgs snfrl)r_headerslower_setr)r-headersrrds r rzHeaderSet.__init__0s< W]+ (, 6 1WWY 6 "7sAc(URU45 g)zAdd a new header to the set.N)rr-headers r r HeaderSet.add9s VIr0cNUR5nX R;a [U5eURRU5 [ UR 5H(up2UR5U:XdMUR U O UR bUR U5 gg)aRemove a header from the set. This raises an :exc:`KeyError` if the header is not in the set. .. versionchanged:: 0.5 In older versions a :exc:`IndexError` was raised instead of a :exc:`KeyError` if the object was missing. :param header: the header to be removed. N)rrrPremoverrr)r-rridxs r rHeaderSet.remove=slln ii 6" " !$--0HCyy{f$MM#&1 >> % NN4  &r0cSnUH\nUR5nX@R;dM$URRU5 URR U5 SnM^ U(a UR bUR U5 ggg)zvAdd all the headers from the iterable to the set. :param iterable: updates the set with the items from the iterable. FTN)rrrr}rr)r-iterable inserted_anyrrs r rHeaderSet.updateRsp  F,,.C))# $$V, c"#  DNN6 NN4 7> % NN4  &r0cdU(a[UR5$[UR5$)amReturn the set as real python set type. When calling this, all the items are converted to lowercase and the ordering is lost. :param preserve_casing: if set to `True` the items in the set returned will have the original case like in the :class:`HeaderSet`, otherwise they will be lowercase. )rrr)r-preserve_casings r as_setHeaderSet.as_sets$ t}}% %499~r0chSR[[RUR55$)z2Convert the header set into an HTTP header string.z, )joinmaphttpquote_header_valuerr,s r to_headerHeaderSet.to_headers"yyT44dmmDEEr0c URU$r>)r)r-rs r rHeaderSet.__getitem__s}}S!!r0cURRU5nURRUR 55 UR bUR U5 ggr>)rrrrrr)r-rrSs r rCHeaderSet.__delitem__sI ]]  s # $ >> % NN4  &r0c URUnURRUR55 X RU'URR UR55 UR bUR U5 ggr>)rrrrrr)r-rrolds r rHeaderSet.__setitem__semmC  %" c ekkm$ >> % NN4  &r0c<UR5UR;$r>)rrrs r rHeaderSet.__contains__s||~**r0c,[UR5$r>)rrr,s r rHeaderSet.__len__s499~r0c,[UR5$r>)r'rr,s r rHeaderSet.__iter__sDMM""r0c,[UR5$r>)rrr,s r __bool__HeaderSet.__bool__sDIIr0c"UR5$r>)rr,s r __str__HeaderSet.__str__s~~r0cN[U5RSUR<S3$r&)r)r*rr,s r r+HeaderSet.__repr__s%t*%%&a '8::r0)rrrr\)rzcabc.Iterable[str] | Nonerrr3r)rr4r3r)r-rnrr4r3r)r-rnrzcabc.Iterable[str]r3r)rr4r3r)r-rnr3rr)r rr3zset[str]r2)rr|r3r4)r-rnrr|r3r)r-rnrr|rr4r3r)rr4r3rr)r3zcabc.Iterator[str])r3r)r*r5r6r7r8rzrrrrrrrr rrrCrrrrr!r$r+r9r1r0r rr#s .2;?#*#9#  #!* !  ! F"! !+# ;r0r)rcSSKnUS:XaURS[SS9 [$US:XaURS[SS9 [$[ U5e)NrOrderedMultiDictrrr ImmutableOrderedMultiDictzp'ImmutableOrderedMultiDict' is deprecated and will be removed in Werkzeug 3.2. Use 'ImmutableMultiDict' instead.)r"r#r$rrAttributeError)namer"s r __getattr__r-sj !!  -   !  **  ?   *)  r0)rrr3zcabc.Iterator[tuple[K, V]])r,r4r3r)- __future__rcollections.abcabcrtypingr`rgrr _internalrmixinsr r r r TYPE_CHECKINGtyping_extensionsteTypeVarrrrr!rr#rr;rcrGenericrrrrrrr MutableSetr4rrr-r1r0r r;s" &&+#??"IIcNIIcNIIcN %  . ?&Q ?;ad;|"4QT":