1jd3 ddlmZddlmZddlmZmZmZmZm Z m Z m Z m Z ddl mZddlmZmZmZddlmZmZmZmZmZmZdeeeeffdZd Zd Zd'd Zd efdZdZdZ dZ!dZ"dedefdZ#Gdde$Z%e%Z&d edefdZ'd(de de(fdZ) d'de e efd eede(deeee*ffd Z+e+d fd!e d eed"e edede f d#Z,d$Z-d%Z.d!e defd&Z/y)))deepcopy) fnmatchcase)SequenceTupleIteratorAnyUnionOptionalMutableMappingMutableSequence)options) InvalidGlobInvalidKeyName PathNotFound) PathSegmentCreatorHintsGlobPath SymmetricIntreturnc tjS#t$rO tt }t fd|}t |cYS#t$rtgcYcYSwxYwwxYw)a Returns an iterator which yields tuple pairs of (node index, node value), regardless of node type. * For dict nodes `node.items()` will be returned. * For sequence nodes (lists/tuples/etc.) a zip between index number and index value will be returned. * Edge cases will result in an empty iterator being returned. make_walkable(node) -> (generator -> (key, value)) c.t|tSN)rlen)inodes .lib/python3.12/site-packages/dpath/segments.pyzmake_walkable..sLCI$>) iteritemsAttributeErrorrangermapzip TypeError enumerate)rindicess` r make_walkabler* sp !DJJL!!  ! !CI&G>HGw% % !R=  ! !s, A4.AA4A0+A4/A00A4cdtttttt df}t ||S)z: Return True if thing is a leaf, otherwise False. N)bytesstrintfloatbooltype isinstance)thingleavess rleafr5#s'S#udDJ 7F eV $$r cX t|xst|dk(S#t$rYywxYw)z\ Same as leaf(thing), but also treats empty sequences and dictionaries as True. rF)r5rr')r3s rleafyr7,s0 E{-c%jAo- s  ))c#BKt|st|D]F\}}d} t|}|'|dk(r"tj st d||fz||fz|fHt|D]\}}t|||fzD]}| yy#t$rYnwxYww)z Yield all valid (segments, value) pairs (from a breadth-first search, right-to-left on sequences). walk(obj) -> (generator -> (segments, value)) NrzREmpty string keys not allowed without dpath.options.ALLOW_EMPTY_STRING_KEYS=True: )r5r*rr'r ALLOW_EMPTY_STRING_KEYSrwalk)objlocationkvlengthfounds rr;r;9s 9!#& 'DAqF Q!fk':Y:Y$&T(0A4'8&:;;qd?Q& & '"#& DAqaQD1        s(B BA#B BBBBsegmentsc|}t|D]b\}}t|rtd|d|dt|tr+t|t r|j r t|}||}d|S)z^ Return the value at the path indicated by segments. get(obj, segments) -> value Path: [])r(r5rr2rr- isdecimalr.)r<rBcurrentrsegments rgetrJTsz G)# 7 =z1#Q78 8 gx (Z-E'J[J[J]'lG'"# Nr c, t||y#YyxYw)zl Return True if the path exists in the obj. Otherwise return False. has(obj, segments) -> bool TF)rJ)r<rBs rhasrLfs  Cs c#6Kd}|D]}|dz }|d|yw)z Yield a tuple of segments for each possible length of segments. Starting from the shortest length of segments and increasing by 1. expand(keys) -> (..., keys[:-2], keys[:-1]) rNr8)rBindex_s rexpandrQss2 E   vsc g}t|D]+}|j|dtt||f-t |S)z For each segment produce a tuple of (segment, type(value)). types(obj, segments) -> ((segment[0], type0), (segment[1], type1), ...) )rQappendr1rJtuple)r<rBresultdepths rtypesrXsG F!: uRy$s3"789: =r c.tdt|S)zi Yield all leaves as (segment, value) pairs. leaves(obj) -> (generator -> (segment, value)) ct|dS)NrN)r7)ps rrzleaves..sE!A$Kr )filterr;)r<s rr4r4s 'c 33r rIc<t|tr t|S|S)z If the segment is an integer, return the string conversion. Otherwise return the segment unchanged. The conversion uses 'str'. int_str(segment) -> str )r2r.r-)rIs rint_strr^s'37| Nr ceZdZdZy)Starzj Used to create a global STAR symbol for tracking stars added when expanding star-star globs. N)__name__ __module__ __qualname____doc__r8r rr`r`s  r r`globcJt|}t|}t|}t|}|}d|vrf|jd}d||dzdvrtd|||k\r"tf||z dzz}|d||z||dzdz}n||dz k(r|d|||dzdz}|t|k(rct ||}|D]Q\}} | turt |trd} nd} t |tr|t| k(rC t|| sySyy#t|}Y"xYw#YyxYw) a Return True if the segments match the given glob, otherwise False. For the purposes of matching, integers are converted to their string equivalent (via str(segment)). This conversion happens on both the segments and the glob. This implies you cannot (with this function) differentiate a list index 0 from a dictionary key '0'. Star-star segments are a special case in that they will expand to 0 or more star segments and the type will be coerced to match that of the segment. A segment is considered to match a glob if the function fnmatch.fnmatchcase returns True. If fnmatchcase returns False or throws an exception the result will be False. match(segments, glob) -> bool z**rNNz3Invalid glob. Only one '**' is permitted per glob: **FT) rUrrOrSTARr&r2r,r.r-r) rBrepath_lenglob_lenss_globss more_starsrsgs rmatchrqsz&XH ;D8}H4yHG t| ZZ  4Q=  STXSYZ[ [ x Hx$7!$; [thing..., None, ...] rN)r1rr$extendr')r3rOvalue expansionextrars rrsrssu  DKM c%j(u !A % I ! Y L   L  sAA AArHrhintscl||}t|}t|tr t|}t|tr t |||t|kr||d||<y|dz|kr ||dz}nd}t|ts t|t r|jrg||<yi||<y)z Create missing path components. If the segment is an int, then it will create a list. Otherwise a dictionary is created. set(obj, segments, value) -> obj rNN)rr2rr.r rsr-rG)rHrBrrwrIr@ segment_nexts r_default_creatorrzsqkG ]F'8$g,'?+w  3u:~&58A;= q56>#AE?LL lC (Z c-J|OeOeOg!GG !GG r r<creatorc|}t|}t|ddD]q\}}t|tr+t|tr|j r t |} ||||}||dz k7sUt|satd|d|d|d} t| tr+t|tr| j r t | } t| t r t|| ||| <|S#| |||||nYxYw)z Set the value in obj at the place indicated by segments. If creator is not None (default _default_creator), then call the creator function to create any missing path components. set(obj, segments, value) -> obj NrSrNrDrErF) rr(r2r-rrGr.r5rrs) r<rBrtr{rwrHr@rrI last_segments rsetr~CsG ]F"(3B-09 G gs # 7H(E'J[J[J]'lG  G '"  ?tG}z1#Q78 8)9,B bool, acc) -> acc F)r;)r<faccpairs rfoldrzs7S  S$  %  J Jr cZtt|}|D]}||||dus|S|S)z Same as fold(), but permits mutating obj. This requires all paths in walk(obj) to be loaded into memory (whereas fold does not). foldm(obj, f(obj, (segments, value), acc) -> bool, acc) -> acc F)rUr;)r<rrpairsrs rfoldmrsA $s) E S$  %  J Jr cDfd}t||t|S)z Return a view of the object where the glob matches. A view retains the same form as the obj, but is limited to only the paths that matched. Views are new objects (a deepcopy of the matching values). view(obj, glob) -> obj' c |\}}t|r0t||s#t||t|t ||yyy)N)rw)rqrLr~rrX)r<rrVrBrtres rrzview..fsD 5 4 vx(FHhuoU3=QR) !r )rr1)r<rers ` rviewrs"S Q S $$r )r8r)0copyrfnmatchrtypingrrrrr r r r dpathr dpath.exceptionsrrr dpath.typesrrrrrrr*r5r7r;rJrLrQrXr4r^objectr`rirqr.rsr1rzr~rrrr8r rrsocccFFMM!8E+s*:$;<!2% 6t$   4 [ [  6  vUDUUp/#:57 #"~x/0#";'#" #"k4/01 #"T&6 4 4;'4'" 4  4  4n(  %n%D%r