+ Bi)^RIHtHtHt^RIHt^RIt^RIt!RR]4t!RR4t Rt R t R t R t R tR tRt]!4]!43RltRtRtRtRtR#))MappingMutableMappingSequence)urlsplitNcTa]tRt^toRtRtRtRtRtRt Rt Rt R t R t VtR #) URIDictz0 Dictionary which uses normalized URIs as keys. c4\V4P4#N)rgeturlselfuris&&O/var/www/html/photoedit/myenv/lib/python3.14/site-packages/jsonschema/_utils.py normalizeURIDict.normalize s}##%%c\\4VnVPP!V/VBR#r )dictstoreupdate)r argskwargss&*,r__init__URIDict.__init__s"V  4*6*rcFVPVPV4,#r rrr s&&r __getitem__URIDict.__getitem__szz$..-..rc@W PVPV4&R#r r)r rvalues&&&r __setitem__URIDict.__setitem__s*/ 4>>#&'rc>VPVPV4R#r rr s&&r __delitem__URIDict.__delitem__s JJt~~c* +rc,\VP4#r )iterrr s&r__iter__URIDict.__iter__DJJrc,\VP4#r )lenrr(s&r__len__URIDict.__len__s4::rc,\VP4#r )reprrr(s&r__repr__URIDict.__repr__"r+r)rN)__name__ __module__ __qualname____firstlineno____doc__rrrr!r$r)r.r2__static_attributes____classdictcell__ __classdict__s@rrrs7&+/0,   rrc*a]tRt^&toRtRtRtVtR#)Unsetz? An as-of-yet unset attribute or unprovided default parameter. cR#)zr(s&rr2Unset.__repr__+srr@N)r4r5r6r7r8r2r9r:r;s@rr>r>&srr>cRV'gV#V RRPRV44 R2#)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"TFp\V4xK R#5ir r1).0indexs& r "format_as_index..Bs#EWEDKKW])join) containerindicess&&rformat_as_indexrO/s0" [$))#EW#EEFa HHrc#"VPR/4pRPVPR/44pVF5pWB9gK V'd\P!W44'dK1VxK7 R#5i)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)getrLresearch)instanceschemarQpatternspropertys&& rfind_additional_propertiesr[EsZL"-Jxx #6;.\s5fUT%[[frJ)r-rL)extrasverbs& r extras_msgrdWs0K1$5&D 995f5 5t ;;rc8\V\4'dV.#V#)zQ Wrap ``thing`` in a list if it's a single str. Otherwise, return it unchanged. ) isinstancestr)things&r ensure_listri_s %w Lrca\V4\S48wdR#\;QJd-V3RlVP44F 'dK R# R#!V3RlVP444#)zA Check if two mappings are equal using the semantics of `equal`. Fc3h<"TF'wrVS9;'d\VSV,4xK) R#5ir equal)rFkeyr twos& rrH!_mapping_equal..ps4%JC s --uUCH--%s22T)r-allitemsoneros&fr_mapping_equalrujs_ 3x3s8 3))+3333))+ rc\V4\V48wdR#\;QJd%R\W44F 'dK R# R#!R\W444#)zB Check if two sequences are equal using the semantics of `equal`. Fc3<"TFwr\W4xK R#5ir rl)rFijs& rrH"_sequence_equal..|s5}tquQ{{}sT)r-rqziprss&&r_sequence_equalr|vsH 3x3s8 35s3}53353535s3}5 55rczWJdR#\V\4'g\V\4'dW8H#\V\4'd"\V\4'd \W4#\V\4'd"\V\4'd \ W4#\ V4\ V48H#)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&VRJdV#VRJdV#V#)z@ A hack to make True and 1 and False and 0 unique for ``uniq``. TFr@)elementtruefalses&&&rr~r~s"$ E  Nrch\RV44p\P!V^R4p\W4Fwr4\ W44'gKR# R# \ \ 3dK.pTF>p\T4pTFp\ Y64'gKR# TPT4K@ R#i;i)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"TFp\V4xK R#5ir )r~)rFrxs& rrHuniq..s3AfQiirJNFT) sorted itertoolsislicer{rmNotImplementedError TypeErrorr~append)rMsortslicedrxryseenes& runiqrs333!!$40%DAQ{{&   + Aq A;;  KKN  s*AAAA6B1B1B10B1c lVPVR4'd.#.pRV9d\\\V444#VP R4pVegVP P V4pVP\VPVPVPR7VVP44VP R4pVegVP P V4pVP\VPVPVPR7VVP44RV9d,V\\\VR,444, pRV9dVPVR,R 7PV4'd=V\WVR,4, pR V9dV\WVR ,4, pM!R V9dV\WVR ,4, pR F_pWr9gK \V4FEwrVPW',R 7PV 4'gK4VPV4KG Ka R FNpWr9gK W',F7p \VP!W4R4p V eK$V\WV 4, pK9 KP V#)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$refNrX _resolver $dynamicRef prefixItemsifrXthenelse)containsunevaluatedItemsallOfoneOfanyOf)is_typelistranger-rTrlookupextend%find_evaluated_item_indexes_by_schemaevolvecontentsresolveris_valid enumeraternextdescend) validatorrWrXevaluated_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 Xaa SPVR4'd.#.pVPR4pVegSPPV4pVP \ SP VPVPR7VVP44VPR4pVegSPPV4pVP \ SP VPVPR7VVP44VPR4pSPVR4'd,W7P4VP4,, pRF<pVPV4;o fKVV V3RlVP44, pK> RV9dIVFBp VR,F2p \P!W4'gK!VPV 4K4 KD R V9d>VR ,P4F"wp o W9dKV\ SVS 4, pK$ RFSpVPV.4F:o \SPVS 44'gK&V\ SVS 4, pK< KU R V9dSP VR ,R 7PV4'd>V\ SWR ,4, pR V9dV\ SWR ,4, pV#R V9dV\ SWR ,4, pV#)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 rrrrrQobjectc3r<"TF,wr\SPVS44'gK(VxK. R#5ir )rr)rFrnr rrs& rrH9find_evaluated_property_keys_by_schema..4s1 .  ))%;< C.s%7 7rSdependentSchemasrrrr)additionalPropertiesunevaluatedPropertiesr)rrTrrr&find_evaluated_property_keys_by_schemarrrkeysrrrUrVrrr) rrWrXevaluated_keysrrrrQrrZpatternrs f&& @rrrs ++ N **V C &&--c2 2  #,,&//!!!   M*J&&--j9 2  #,,&//!!!   L)JX..//+hmmo==DG, ,I 5  &nn.  Ef$ H!"56699W//"))(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\VR4RJ#)z2Whether there are no errors in the given iterator.N)r)errs_its&rrras  $ &&r)collections.abcrrr urllib.parserrrUrr>rOr[rdrirur|rmrr~rrrrr@rrrsv==!  n >I,$< 6&$ 8JZYx'r