[Thy 6/SQrSrSrSrSrSrSrSrg) )hashabletransitive_getraises reverse_dictxfailfreezec<[U5 g![a gf=f)NTF)hash TypeError)xs _/var/www/auris/envauris/lib/python3.13/site-packages/torch/fx/experimental/unification/utils.pyrrs# Q s  cf[U5(a X;aXn[U5(aX;aMU$)zYTransitive dict.get >>> d = {1: 2, 2: 3, 3: 4} >>> d.get(1) 2 >>> transitive_get(1, d) 4 )r)keyds r rr s, 3--CHf 3--CH Jc,U"5 g!Ua gf=f)NFT)errlamdas r rrs!  s  c^[U5mTR5VVs0sHupU[U5_M snnmUVs1sH o3T;dM UiM nn/nU(aUR5nUR U5 UR US5H?nUTU;deTUR U5 TU(aM.URU5 MA U(aM[U4SjU55(a [S5eU$s snnfs snf)aTopological sort algorithm by Kahn [1] - O(nodes + vertices) inputs: edges - a dict of the form {a: {b, c}} where b and c depend on a outputs: L - an ordered list of nodes that satisfy the dependencies of edges >>> # xdoctest: +SKIP >>> _toposort({1: (2, 3), 2: (3,)}) [1, 2, 3] Closely follows the wikipedia page [2] [1] Kahn, Arthur B. (1962), "Topological sorting of large networks", Communications of the ACM [2] http://en.wikipedia.org/wiki/Toposort#Algorithms rc3H># UHnTRUS5v M g7f)Nget).0vincoming_edgess r _toposort..?s! 61>  a & &s"zInput has cycles) ritemssetpopappendrremoveaddany ValueError) edgeskvalrSLnmrs @r _toposortr-$s"%(N0>0D0D0FG0FfaaSk0FGN5Eqn4EA5 A EEG  1b!Aq)) )) 1  $ $Q '!!$$a " ! 6 666+,, HH5sD D  D cb0nUH&nXHnURUS5U4-X'M M( U$)ayReverses direction of dependence dict >>> d = {"a": (1, 2), "b": (2, 3), "c": ()} >>> reverse_dict(d) # doctest: +SKIP {1: ('a',), 2: ('a', 'b'), 3: ('b',)} :note: dict order are not deterministic. As we iterate on the input dict, it make the output of this function depend on the dict order. So this function output order should be considered as undeterministic. rr)rresultrr(s r rrDs?F6C **S"-6FK MrcHU"5 [S5e![a gf=f)NzXFailed test passed) Exception)funcs r rrUs*  -..    s  !!cB[U[5(a'[[[UR 555$[U[ 5(a[[[U55$[U[[45(a[[[U55$U$)zFreeze container to hashable form >>> freeze(1) 1 >>> freeze([1, 2]) (1, 2) >>> freeze({1: 2}) # doctest: +SKIP frozenset([(1, 2)]) ) isinstancedict frozensetmaprrrtuplelist)rs r rr]sn!TVQWWY/00!SVQ((!eT]##S^$$ HrN)__all__rrrr-rrrrrr r;s. U  @"  r