>ie<hddlmZddlmZddlmZmZmZddlm Z m Z m Z m Z m Z ddlmZmZmZmZdZdZdZd Zd Zd:d Zd:d Zd;ddZe d?d@d$Ze dAd'Zd edfdBd)ZdCd+Zefd,Z e d-Z!dDd1Z"d2Z#dEd3Z$d:d4Z%d5Z&d6Z'Gd7d8Z(d9Z)d S)F) annotations) defaultdict) CollectionIterableMapping)AnyLiteralTypeVarcastoverload)GraphKey NoDefault no_defaultcH t|dS#t$rYdSwxYw)zIs x hashable? Examples -------- >>> ishashable(1) True >>> ishashable([1]) False See Also -------- iskey TF)hash TypeErrorxs )lib/python3.11/site-packages/dask/core.py ishashabler s9 Qt uus  !!c\t|tuo|ot|dS)zIs x a runnable task? A task is a tuple with a callable first argument Examples -------- >>> inc = lambda x: x + 1 >>> istask((inc, 1)) True >>> istask(1) False r)typetuplecallablers ristaskr s) 77e  4 4hqtnn4ct|rdS ||vrdSn#t$rYnwxYwt|tr|D]}t ||rdSdS)zWhether ``x`` has anything to compute. Returns True if: - ``x`` is a task - ``x`` is a key in ``dsk`` - ``x`` is a list that contains any tasks or keys TF)r Exception isinstancelist has_tasks)dskris rr"r"1sayyt 884       !T  Aa   tt  5s  ''c#K|D]_}t|rt|Ed{V't|trtVt|Ed{V[|V`dS)z(A generator to preorder-traverse a task.N)rpreorder_traversalr r!)taskitems rr&r&Gs $<< )$// / / / / / / / / d # # JJJ)$// / / / / / / / /JJJJrc~t|tr'tdt||DS|S)Nc3<K|]\}}t||VdSN)lists_to_tuples).0rks r z"lists_to_tuples..Vs0FFtq!_Q**FFFFFFr)r r!rzip)reskeyss rr,r,Ts?$GFFs3~~FFFFFF JrNct|trfd|DSt|r#|d|dd}}|fd|DSt|s|S|vr|S|S)aDo the actual work of collecting data and executing a function Examples -------- >>> inc = lambda x: x + 1 >>> add = lambda x, y: x + y >>> cache = {'x': 1, 'y': 2} Compute tasks against a cache >>> _execute_task((add, 'x', 1), cache) # Compute task in naive manner 2 >>> _execute_task((add, (inc, 'x'), 1), cache) # Support nested computation 3 Also grab data from cache >>> _execute_task('x', cache) 1 Support nested lists >>> list(_execute_task(['x', 'y'], cache)) [1, 2] >>> list(map(list, _execute_task([['x', 'y'], ['y', 'x']], cache))) [[1, 2], [2, 1]] >>> _execute_task('foo', cache) # Passes through on non-keys 'foo' c0g|]}t|S _execute_taskr-acaches r z!_execute_task..ys#555A a''555rrNc38K|]}t|VdSr+r7r9s rr0z _execute_task..s-<>> inc = lambda x: x + 1 >>> d = {'x': 1, 'y': (inc, 'x')} >>> get(d, 'x') 1 >>> get(d, 'y') 2 z is not a key in the graph)r r!flattenKeyErrortoposortr8r,)r#outr;r/keyr'results rgetrIs(T22 =WS\\\== C<<a;;;<< <  }}}3xtU++c 3 & &F#t. -- MrFr3Collection[Key]tasks Iterable[Any]as_listboolcg}|rg}|D]}t|}|tur5|r3t|dr||ddO|tur||n|t ur(|| ||vr||#t$rYwxYw|}||r|nt|S)aReturns the keys in `keys` that are also in `tasks` Examples -------- >>> inc = lambda x: x + 1 >>> add = lambda x, y: x + y >>> dsk = {'x': 1, ... 'y': (inc, 'x'), ... 'z': (add, 'x', 'y'), ... 'w': (inc, 'z'), ... 'a': (add, (inc, 'x'), 1)} >>> keys_in_tasks(dsk, ['x', 'y', 'j']) # doctest: +SKIP {'x', 'y'} rr=N) rrrextendr!dictvaluesappendrset)r3rKrMretworkwtyps r keys_in_tasksrYs  C   Aq''Ce|||hqtnn| AabbE"""" A AHHJJ''''Dyy 1  D! " '33s3xx's)C CCrGobjectreturnct|}|tur,tdtt|DS|tt t thvS)zReturn True if the given object is a potential dask key; False otherwise. The definition of a key in a Dask graph is any str, bytes, int, float, or tuple thereof. See Also -------- ishashable validate_key dask.typing.Key c34K|]}t|VdSr+)iskey)r-r$s rr0ziskey..s(66588666666r)rrallr bytesintfloatstr)rGrXs rr^r^sS s))C e||66T%%5%5666666 5#uc* **rNonecjt|s#tdt|d|ddS)z"Validate the format of a dask key.zUnexpected key type z (value: )N)r^rrrGs r validate_keyrhsE ::MKtCyyKK3KKKLLLMMr.r#r Key | Noner'Key | NoDefaultLiteral[False]set[Key]cdSr+r6r#rGr'rMs rget_dependenciesro Cr Literal[True] list[Key]cdSr+r6rns rrororprset[Key] | list[Key]ct| ||}n|tur|}ntdt||g|S)aGet the immediate tasks on which this task depends Examples -------- >>> inc = lambda x: x + 1 >>> add = lambda x, y: x + y >>> dsk = {'x': 1, ... 'y': (inc, 'x'), ... 'z': (add, 'x', 'y'), ... 'w': (inc, 'z'), ... 'a': (add, (inc, 'x'), 1)} >>> get_dependencies(dsk, 'x') set() >>> get_dependencies(dsk, 'y') {'x'} >>> get_dependencies(dsk, 'z') # doctest: +SKIP {'x', 'y'} >>> get_dependencies(dsk, 'w') # Only direct dependencies {'z'} >>> get_dependencies(dsk, 'a') # Ignore non-keys {'x'} >>> get_dependencies(dsk, task=(inc, 'x')) # provide tasks directly {'x'} NzProvide either key or task)rM)r ValueErrorrY)r#rGr'rMr?s rrorosMH #h Z  5666 seW 5 5 55r/tuple[dict[Key, set[Key]], dict[Key, set[Key]]]cjfdD}t|}||fS)aNGet dependencies and dependents from dask dask graph >>> inc = lambda x: x + 1 >>> dsk = {'a': 1, 'b': (inc, 'a'), 'c': (inc, 'b')} >>> dependencies, dependents = get_deps(dsk) >>> dependencies {'a': set(), 'b': {'a'}, 'c': {'b'}} >>> dependents # doctest: +SKIP {'a': {'b'}, 'b': {'c'}, 'c': set()} c:i|]\}}|t|S))r'ro)r-r/vr#s r zget_deps../s-MMMAA'!444MMMr)items reverse_dict)r# dependencies dependentss` rget_depsr$s?NMMMMMMLl++J  ##rc#Kt|tr|VdS|D].}t||rt||Ed{V*|V/dS)aJ >>> list(flatten([1])) [1] >>> list(flatten([[1, 2], [1, 2]])) [1, 2, 1, 2] >>> list(flatten([[[1], [2]], [[1], [2]]])) [1, 2, 1, 2] >>> list(flatten(((1, 2), (1, 2)))) # Don't flatten tuples [(1, 2), (1, 2)] >>> list(flatten((1, 2, [3, 4]))) # support heterogeneous [1, 2, 3, 4] ) containerN)r rcrC)seqrr(s rrCrC4s$#s   D$ ** "49===========   rT_dMapping[T_, Iterable[T_]]dict[T_, set[T_]]ctt}tj}|D]$\}}|||D]}||||%t |S)z >>> a, b, c = 'abc' >>> d = {a: [b, c], b: [c]} >>> reverse_dict(d) # doctest: +SKIP {'a': set([]), 'b': set(['a']}, 'c': set(['a', 'b'])} )rrTaddr}rQ)rrH_addr/valsvals rr~r~Ssu(33'7'7F 7D7799!!4q  ! !C Da  ! <<rcTt|}|tur|rt|dsE |tur|krSn#t$rYnwxYw|turfd|DS|Sg}h}|ddD]}t|}|tur)|r't|drt |}n1|turfd|D}n ||vr}n#t $rYnwxYw|||ddt|zS)zPerform a substitution on a task Examples -------- >>> def inc(x): ... return x + 1 >>> subs((inc, 'x'), 'x', 1) # doctest: +ELLIPSIS (, 1) rc2g|]}t|Sr6subsr-rrGrs rr<zsubs..ws%444!DC%%444rr=Nc2g|]}t|Sr6rrs rr<zsubs..s%22243$$222r)rrrrr!rrrS)r'rGr type_tasknewargshash_keyr?type_args `` rrrdsT I   4 HT!W,=,=  DII%%$#++     D    44444t444 4 GuHABBx  99 u   #a&)9)9 sC%%CC   22222c222CC (??C    s 8eGnn $$s#A AA#C** C76C7c|}nt|ts|g}|sg}t}t}fdD|D]/}||vr|g}|r!|d} | |vr|$|| g} | D]o} | |vrg| |vrMi} |d} |d| kr1t |  | |<|d| k1t |  | | <t| t fdD}|g}|| | |dkrE||d}t|| j } || | |dkE| |r|ccSd d|D}td|z| | q| r| | nU|s|| || || ||!1|rgS|S) Nc2i|]}|t|Sr6rz)r-r/r#s rr|z_toposort..s&AAA+C33AAArcHi|]}||Sr6) intersection)r-r/rinplays rr|z_toposort..s-UUUQ 3 3LO D DUUUrrrgz->c34K|]}t|VdSr+)rc)r-rs rr0z_toposort..s(-D-Dc!ff-D-D-D-D-D-DrzCycle detected in Dask: %s)r r!rTpoprlenr~rSmin __getitem__reversejoin RuntimeErrorrPremove)r#r3 returncyclerordered completedseenrGnodescur next_nodesnxt prioritiesprevrcycledepsrs` ` @r _toposortrs | d # #v I 55DAAAASAAA == )   9 )Ci  HHSMMMJ#C($ +$ +i''d{{ &( $Ry#Bi3..7::6FJuyy{{3$Bi3..+.z??*: 3"%Z%1UUUUUfUUU&& "'  T***"eAh..$.eBi#8D#&t1G#H#H#HD!LL... #eAh..  &U#(LLLLL$(II-D-De-D-D-D$D$DE"./Ke/S"T"TT%%c***  Z((((#(NN3''' c""" C    s9 t Nrc$t||S)z:Return a list of keys of dask sorted in topological order.)rr)r#rs rrErEs S| 4 4 44rc&t||dS)axReturn a list of nodes that form a cycle if Dask is not a DAG. Returns an empty list if no cycle is found. ``keys`` may be a single key or list of keys. Examples -------- >>> inc = lambda x: x + 1 >>> d = {'x': (inc, 'z'), 'y': (inc, 'x'), 'z': (inc, 'y')} >>> getcycle(d, 'x') ['x', 'z', 'y', 'x'] See Also -------- isdag T)r3rrrr3s rgetcyclers& QTt 4 4 44rc$t|| S)anDoes Dask form a directed acyclic graph when calculating keys? ``keys`` may be a single key or list of keys. Examples -------- >>> inc = lambda x: x + 1 >>> inc = lambda x: x + 1 >>> isdag({'x': 0, 'y': (inc, 'x')}, 'y') True >>> isdag({'x': (inc, 'y'), 'y': (inc, 'x')}, 'y') False See Also -------- getcycle )rrs risdagrs&4   rc.eZdZdZdZdZdZdZdZdS)literalzBA small serializable object to wrap literal values without copyingdatac||_dSr+r)selfrs r__init__zliteral.__init__s  rc:dt|jjzS)Nzliteral)rr__name__rs r__repr__zliteral.__repr__s!DOO$<<>> add = lambda x, y: x + y >>> quote((add, 1, 2)) (literal,) )rrr!rQrrs rquoter)sAayyDGGtOOtAww$ } Hrr+)F)r3rJrKrLrMrN)rGrZr[rN)rGrZr[rd)...) r#r rGrir'rjrMrkr[rl) r#r rGrir'rjrMrqr[rr) r#r rGrir'rjrMrNr[rt)r#r r[rw)rrr[r)NFN)* __future__r collectionsrcollections.abcrrrtypingrr r r r dask.typingr rrrrrr"r&r,r8rIrYr^rhrorr!rCrr~rrrErrrrr6rrrs""""""######999999999988888888888888999999999999,555",    ++++\:"("("("("(J++++$MMMM  !    & +6+6+6+6+6\ $ $ $ $  8 WT]]"$%$%$%NXXXXv5555 555,!!!,$      r