\h (SSKJr SrSrSrSrg)) OrderedDictcU(dS/$[US[5(d'[USS5nUVs/sH o S4U-PM sn$[USS5nUVVs/sHo SHo34U-PM M snn$s snfs snnf)z >>> from sympy.multipledispatch.utils import expand_tuples >>> expand_tuples([1, (2, 3)]) [(1, 2), (1, 3)] >>> expand_tuples([1, 2]) [(1, 2)] rN) isinstancetuple expand_tuples)Lresttitems T/var/www/auris/envauris/lib/python3.13/site-packages/sympy/multipledispatch/utils.pyr r s t !e $ $QqrU#%)*T1! T**QqrU#%);Tdd! d T;;+>> from sympy.multipledispatch.utils import _toposort >>> _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] https://en.wikipedia.org/wiki/Toposort#Algorithms c36># UHoT;dM Uv M g7fNr.0vincoming_edgess r _toposort..-sI1.1HQQs  rNc3H># UHnTRUS5v M g7frgetrs rrr8s! 61>  a & &s"zInput has cycles) reverse_dictitemssetrfromkeyspopitemappendrremoveany ValueError) edgeskvalSr n_mrs @r _toposortr+s$"%(N0>0D0D0FG0FfaaSk0FGNIIIA A yy{  1b!Aq)) )) 1  $ $Q '!!$$ " ! 6 666+,, HHsDcb0nUH&nXHnURUS5U4-X'M M( U$)a{Reverses 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)dresultkeyr&s rrr=s?F6C **S"-7FK Mcd0nUH'nU"U5nXB;a/X$'X$RU5 M) U$)aGroup a collection by a key function >>> from sympy.multipledispatch.utils import groupby >>> names = ['Alice', 'Bob', 'Charlie', 'Dan', 'Edith', 'Frank'] >>> groupby(len, names) # doctest: +SKIP {3: ['Bob', 'Dan'], 5: ['Alice', 'Edith', 'Frank'], 7: ['Charlie']} >>> iseven = lambda x: x % 2 == 0 >>> groupby(iseven, [1, 2, 3, 4, 5, 6, 7, 8]) # doctest: +SKIP {False: [1, 3, 5, 7], True: [2, 4, 6, 8]} See Also: ``countby`` )r )funcseqr-r r/s rgroupbyr4Ss= A4j <AF  d  Hr0N) collectionsrr r+rr4rr0rr6s#<*! H, r0