~\;j)xdZddlZddlmZddlZgdZdZdZdZ dZ d Z d Z d Z d Zd ZdZdZdZdZy)zC A functionally equivalent parser of the numpy.einsum input parser N) OrderedDict) is_valid_einsum_charhas_valid_einsum_chars_only get_symbolgen_unused_symbolsconvert_to_valid_einsum_charsalpha_canonicalizefind_output_strfind_output_shapepossibly_convert_to_numpyparse_einsum_input4abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZc|tvxs|dvS)uCheck if the character ``x`` is valid for numpy einsum. Examples -------- >>> is_valid_einsum_char("a") True >>> is_valid_einsum_char("Ǵ") False z,->.)_einsum_symbols_basexs ZG:\00. PROJECTS\API\Inventory\templateJSON\kerjaOCR\Lib\site-packages\opt_einsum/parser.pyrrs % % 71;7c4ttt|S)uCheck if ``einsum_str`` contains only valid characters for numpy einsum. Examples -------- >>> has_valid_einsum_chars_only("abAZ") True >>> has_valid_einsum_chars_only("Över") False )allmapr) einsum_strs rrr#s s'4 55rc:|dkr t|St|dzS)uGet the symbol corresponding to int ``i`` - runs through the usual 52 letters before resorting to unicode characters, starting at ``chr(192)``. Examples -------- >>> get_symbol(2) 'c' >>> get_symbol(200) 'Ŕ' >>> get_symbol(20000) '京' 4)rchr)is rrr1s$ 2v#A&& q3w<rc#hKdx}}||kr%t|}|dz }||vr||dz }||kr$yyw)zGenerate ``n`` symbols that are not already in ``used``. Examples -------- >>> list(oe.parser.gen_unused_symbols("abd", 2)) ['c', 'e'] rN)r)usednrcntss rrrEsKKA ' qM Q 9  q 's-22ctt|tdz }t|Dcic]\}}|t|c}}dj fd|DScc}}w)uConvert the str ``einsum_str`` to contain only the alphabetic characters valid for numpy einsum. If there are too many symbols, let the backend throw an error. Examples -------- >>> oe.parser.convert_to_valid_einsum_chars("Ĥěļļö") 'cbdda' z,->c3BK|]}j||ywNget).0rreplacers r z0convert_to_valid_einsum_chars..cs:z!8<<1%z)sortedset enumeraterjoin)rsymbolsrrr+s @rrrWs_S_s5z12G-6w-?@-?TQ:a= -?@H 77:z: ::AsA$ct|D]#}|dvr|vs tt|<%djfd|DS)uAlpha convert an equation in an order-independent canonical way. Examples -------- >>> oe.parser.alpha_canonicalize("dcba") 'abcd' >>> oe.parser.alpha_canonicalize("Ĥěļļö") 'abccd' z.,->r%c3BK|]}j||ywr'r()r*rrenames rr,z%alpha_canonicalize..ws6X6::a#Xr-)rrlenr1)equationnamer5s @rr r fsQ]F 6>  v %c&k2F4L  776X6 66rc|jdddjfdttDS)aU Find the output string for the inputs ``subscripts`` under canonical einstein summation rules. That is, repeated indices are summed over by default. Examples -------- >>> oe.parser.find_output_str("ab,bc") 'ac' >>> oe.parser.find_output_str("a,b") 'ab' >>> oe.parser.find_output_str("a,a,b,b") '' ,r%c3LK|]}j|dk(s|yw)rN)count)r*r#tmp_subscriptss rr,z"find_output_str..s(Z9^=Q=QRS=TXY=Y19s$$)replacer1r.r/) subscriptsr=s @rr r zs6 ''R0N 77ZfS%89Z ZZrc0tfd|DS)aOFind the output shape for given inputs, shapes and output string, taking into account broadcasting. Examples -------- >>> oe.parser.find_output_shape(["ab", "bc"], [(2, 3), (3, 4)], "ac") (2, 4) # Broadcasting is accounted for >>> oe.parser.find_output_shape(["a", "a"], [(4, ), (1, )], "a") (4,) c 3K|]=}tdtDcgc]}|j|c}D?ycc}ww)c38K|]\}}|dk\s ||yw)rN)r*shapelocs rr,z.find_output_shape...s$ ^)Q:5#UX\]U]E#J)Qs  N)maxzipfind)r*crinputsshapess rr,z$find_output_shape..sDphncd ^V5PAaffQi5P)Q ^^hn5PsA AA )tuple)rJrKoutputs`` rr r s# phnp pprcHt|dstj|S|S)aTConvert things without a 'shape' to ndarrays, but leave everything else. Examples -------- >>> oe.parser.possibly_convert_to_numpy(5) array(5) >>> oe.parser.possibly_convert_to_numpy([5, 3]) array([5, 3]) >>> oe.parser.possibly_convert_to_numpy(np.array([5, 3])) array([5, 3]) # Any class with a shape is passed through >>> class Shape: ... def __init__(self, shape): ... self.shape = shape ... >>> myshape = Shape((5, 5)) >>> oe.parser.possibly_convert_to_numpy(myshape) <__main__.Shape object at 0x10f850710> rD)hasattrnp asanyarrayrs rr r s"2 1g }}QrcDd}|D]}|tur|dz }|||z }|S)aConvert user custom subscripts list to subscript string according to `symbol_map`. Examples -------- >>> oe.parser.convert_subscripts(['abc', 'def'], {'abc':'a', 'def':'b'}) 'ab' >>> oe.parser.convert_subscripts([Ellipsis, object], {object:'a'}) '...a' r%...)Ellipsis)old_sub symbol_mapnew_subr#s rconvert_subscriptsrXs;G  = u G z!} $G  Nrc t|}g}g}tt|dzD]B}|j|j d|j|j dDt|r|dnd}|Dcgc] }t |}} t tjj|}|jttt|D cic]\}} | t|c} } dj! fd|D} || dz } | t#| z } | |fScc}wcc} }w#t$r tdwxYw) z:Convert 'interleaved' input to standard einsum input. rNziFor this input type lists must contain either Ellipsis or hashable and comparable object (e.g. int, str).r:c36K|]}t|ywr')rX)r*subrVs rr,z,convert_interleaved_input..sX#,S*=s->)listranger6appendpopr r/ itertoolschain from_iterablediscardrTr0r.r TypeErrorr1rX) operands tmp_operands operand_listsubscript_listp output_listr symbol_setidxsymbolr?rVs @rconvert_interleaved_inputrqsg>LLN 3x=A% &L,,Q/0l..q12''*,&7,r"TK6BCl)!,lHC N66~FG  8$BK6R\K]A^_A^+#vfjo-A^_ XXXJd (jAA x /D` NMN NNs%D:AE,D?E?EEc t|dk(r tdt|dtr1|dj dd}|ddDcgc] }t |}}nt |\}}d|vsd|vrK|jddkDxs|jddkD}|s|jd dk7r td d |vr|j d dj d dj d d}djt|td |D}d}d |vr(|jd \}}|jd } d} n|jd } d} t| D]\} } d | vs | jd dk7s| jddk7r td|| jdk(rd} n1tt|| jdt| dz z } | |kDr| }| dkr td| dk(r| j dd| | <| j d|| d| | <d j| }|dk(rd}n|| d}| r|d j d|zz }nEt|}djtt!|t!|z }|d |z|zz }d |vr|jd \}}n |t|}}|D] }||vstdj#|t|jd t|k7r td|||fScc}w)af A reproduction of einsum c side einsum parsing in python. Returns ------- input_strings : str Parsed input strings output_string : str Parsed output string operands : list of array_like The operands to use in the numpy contraction Examples -------- The operand list is simplified to reduce printing: >>> a = np.random.rand(4, 4) >>> b = np.random.rand(4, 4, 4) >>> parse_einsum_input(('...a,...a->...', a, b)) ('za,xza', 'xz', [a, b]) >>> parse_einsum_input((a, [Ellipsis, 0], b, [Ellipsis, 0])) ('za,xza', 'xz', [a, b]) rzNo input operands r%rN->r^z%Subscripts can only contain one '->'..r:c3FK|]}t|jywr')r6rD)r*rs rr,z%parse_einsum_input..#s;[RZQCLRZs!TFrSzInvalid Ellipses.rCzEllipses lengths do not match.z1Output character '{}' did not appear in the inputzDNumber of einsum subscripts must be equal to the number of operands.)r6 ValueError isinstancestrr>r rqr<r1rrFsplitr0rDr r.r/format)rhr?rinvalidr ellipse_indslongest input_tmp output_subsplit_subscriptsout_subnumr] ellipse_count out_ellipseoutput_subscript normal_indsinput_subscriptschars rr r s4 8},--(1+s#a[((b1 :B12,G,Q-a0,G 9B H zsj0##C(1,L*2B2B32G!2K z''-2DE E j!!#r*223;CCD"Mww1$;[RZ;[8[\]  : $.$4$4T$: !Iz(s3 G)//4 G!"23HCczIIcNa'SYYu-=-B$%899C=&&",$%M$'HSM,?,?(@!$DCST $UM 7*+G 1$$%EFF"a',/KKr,B$S),/KK|]NO?\,]$S)'4*XX./  a<K&xy1K  $!3!3E;!GG GJ /z: ''&-=)>[AQ)Q"RSK $,{: :J z-7-=-=d-C**-79T*! ' 'PWWX\]^ ^!   ! !# &'3x=8bcc -x 77_Hs L>)__doc__rc collectionsrnumpyrP__all__rrrrrrr r r r rXrqr rCrrrse#  N 8 6($ ;7([&p">(" Jn8r