~i)SSKJrJrJr SSKJr SSKrSSKr"SS\5r"SS5r Sr S r S r S r S rS rSr\"5\"54SjrSrSrSrSrg))MappingMutableMappingSequence)urlsplitNcH\rSrSrSrSrSrSrSrSr Sr S r S r S r g ) URIDictz0 Dictionary which uses normalized URIs as keys. c4[U5R5$N)rgeturlselfuris N/home/mande/repo/quber/.venv/lib/python3.13/site-packages/jsonschema/_utils.py normalizeURIDict.normalize s}##%%cZ[5UlURR"U0UD6 gr )dictstoreupdate)rargskwargss r__init__URIDict.__init__s"V  4*6*rc>URURU5$r rrr s r __getitem__URIDict.__getitem__szz$..-..rc>X RURU5'gr r)rrvalues r __setitem__URIDict.__setitem__s*/ 4>>#&'rc<URURU5 gr rr s r __delitem__URIDict.__delitem__s JJt~~c* +rc,[UR5$r )iterrrs r__iter__URIDict.__iter__DJJrc,[UR5$r )lenrr)s r__len__URIDict.__len__s4::rc,[UR5$r )reprrr)s r__repr__URIDict.__repr__"r,r)rN)__name__ __module__ __qualname____firstlineno____doc__rrrr"r%r*r/r3__static_attributes__rrrrs/&+/0,  rrc\rSrSrSrSrSrg)Unset&z? An as-of-yet unset attribute or unprovided default parameter. cg)Nzr;r)s rr3Unset.__repr__+srr;N)r5r6r7r8r9r3r:r;rrr=r=&s rr=cPU(dU$USSRSU55S3$)a" Construct a single string containing indexing operations for the indices. For example for a container ``bar``, [1, 2, "foo"] -> bar[1][2]["foo"] Arguments: container (str): A word to use for the thing being indexed indices (sequence): The indices to format. [z][c38# UHn[U5v M g7fr r2).0indexs r "format_as_index..Bs#EWEDKKW])join) containerindicess rformat_as_indexrN/s0" [$))#EW#EEFa HHrc## URS05nSRURS055nUH2nXB;dM U(a[R"X45(aM.Uv M4 g7f)z Return the set of additional properties for the given ``instance``. Weeds out properties that should have been validated by ``properties`` and / or ``patternProperties``. Assumes ``instance`` is dict-like already. properties|patternPropertiesN)getrKresearch)instanceschemarPpatternspropertys rfind_additional_propertiesrZEsZL"-Jxx #6;.\s5fUT%[[frI)r.rK)extrasverbs r extras_msgrdWs0K1$5&D 995f5 5t ;;rc6[U[5(aU/$U$)zQ Wrap ``thing`` in a list if it's a single str. Otherwise, return it unchanged. ) isinstancestr)things r ensure_listri_s %w Lrc|^[U5[T5:wag[U4SjUR555$)zA Check if two mappings are equal using the semantics of `equal`. Fc3^># UH"upUT;=(a [UTU5v M$ g7fr equal)rEkeyr!twos rrG!_mapping_equal..ps1%JC s -uUCH--%s*-)r.allitemsoneros `r_mapping_equalrujs8 3x3s8 ))+ rcj[U5[U5:wag[S[X555$)zB Check if two sequences are equal using the semantics of `equal`. Fc3<# UHup[X5v M g7fr rl)rEijs rrG"_sequence_equal..|s5}tquQ{{}s)r.rqziprss r_sequence_equalr|vs, 3x3s8 5s3}5 55rcjXLag[U[5(d[U[5(aX:H$[U[5(a [U[5(a [X5$[U[5(a [U[5(a [ X5$[ U5[ U5:H$)z Check if two things are equal evading some Python type hierarchy semantics. Specifically in JSON Schema, evade `bool` inheriting from `int`, recursing into sequences to do the same. T)rfrgrr|rruunboolrss rrmrms z#sz#s33z#x  ZX%>%>s((#wJsG$<$<c'' #;&+ %%rc"USLaU$USLaU$U$)z@ A hack to make True and 1 and False and 0 unique for ``uniq``. TFr;)elementtruefalses rr~r~s"$ E  NrcZ[SU55n[R"USS5n[X5Hup4[ X45(dM g g![ [ 4aG /nUH<n[U5nUHn[ X65(dM g URU5 M> gf=f)z Check if all of a container's elements are unique. Tries to rely on the container being recursively sortable, or otherwise falls back on (slow) brute force. c38# UHn[U5v M g7fr )r~)rErxs rrGuniq..s3AfQiirIr\NFT) sorted itertoolsislicer{rmNotImplementedError TypeErrorr~append)rLsortslicedrxryseenes runiqrs333!!$40%DAQ{{&   + Aq A;;  KKN  s*AAAA5B* B*B*)B*c URUS5(a/$/nSU;a[[[U555$UR S5nUbcUR R U5nUR[URURURS9UUR55 UR S5nUbcUR R U5nUR[URURURS9UUR55 SU;a#U[[[US555- nSU;aiURUSS 9RU5(a+U[XUS5- nS U;aU[XUS 5- nOS U;aU[XUS 5- nS HVnXr;dM [U5H=upURX'S 9RU 5(dM,URU5 M? MX S HDnXr;dM X'H2n [UR!X5S5n U bM#U[XU 5- nM4 MF U$)z Get all indexes of items that get evaluated under the current schema. Covers all keywords related to unevaluatedItems: items, prefixItems, if, then, else, contains, unevaluatedItems, allOf, oneOf, anyOf booleanrr$refNrW _resolver $dynamicRef prefixItemsifrWthenelse)containsunevaluatedItemsallOfoneOfanyOf)is_typelistranger.rSrlookupextend%find_evaluated_item_indexes_by_schemaevolvecontentsresolveris_valid enumeraternextdescend) validatorrVrWevaluated_indexesrefresolved dynamicRefkeywordkv subschemaerrss rrrs++ &E#h-()) **V C &&--c2  1  #,,&//!!!   M*J&&--j9  1  #,,&//!!!   T%F=,A(B"CDD v~   6$<  0 9 9( C C !FVD\"  !%J&!v  !FVF^"  4  !(+##6?#;DDQGG%,,Q/,4 /  #_ I--hBDI<%)N!Y*%-/ rc ^^ TRUS5(a/$/nURS5nUbcTRRU5nUR [ TR URURS9UUR55 URS5nUbcTRRU5nUR [ TR URURS9UUR55 URS5nTRUS5(a#X7R5UR5-- nSH7nURU5=m cMUU U4SjUR55- nM9 S U;aCUH=n US H1n [R"X5(dM URU 5 M3 M? S U;a4US R5Hun m X;aM U[ TUT 5- nM S HNnURU/5H5m [TRUT 55(dM%U[ TUT 5- nM7 MP S U;ajTR US S 9RU5(a,U[ TXS 5- nSU;aU[ TXS5- nU$SU;aU[ TXS5- nU$)z Get all keys of items that get evaluated under the current schema. Covers all keywords related to unevaluatedProperties: properties, additionalProperties, unevaluatedProperties, patternProperties, dependentSchemas, allOf, oneOf, anyOf, if, then, else rrrrrPobject)additionalPropertiesunevaluatedPropertiesc3p># UH+up[TRUT55(dM'Uv M- g7fr )rr)rErnr!rrs rrG9find_evaluated_property_keys_by_schema..4s1 .  ))%;< C.s&6 6rRdependentSchemasrrrrr)rrSrrr&find_evaluated_property_keys_by_schemarrrkeysrrrTrUrrr) rrVrWevaluated_keysrrrrPrrYpatternrs ` @rrrs++ N **V C &&--c2 2  #,,&//!!!   M*J&&--j9 2  #,,&//!!!   L)JX..//+hmmo==DG, ,I 5  &nn.  Ef$ H!"5699W//"))(37! V##)*<#=#C#C#E Hi' D8Y N$F/GR0II--h BCC D8Y N1/ v~   6$<  0 9 9( C C D8D\ N"Hx#  v  D8F^ N rc[US5SL$)z2Whether there are no errors in the given iterator.N)r)errs_its rrras  $ &&r)collections.abcrrr urllib.parserrrTrr=rNrZrdrirur|rmrr~rrrrr;rrrsv==!  n >I,$< 6&$ 8JZYx'r