o e)@sdZddlZddlmZddlZgdZdZddZdd Z d d Z d d Z ddZ ddZ ddZddZddZddZddZddZdS)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_input4abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZcCs|tvp|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_basexrAD:\Projects\ConvertPro\env\Lib\site-packages\opt_einsum/parser.pyrs rcCsttt|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_strrrrr#s rcCs|dkrt|St|dS)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)irrrr1s rccsJd}}||kr#t|}|d7}||vrq|V|d7}||ks dSdS)zGenerate ``n`` symbols that are not already in ``used``. Examples -------- >>> list(oe.parser.gen_unused_symbols("abd", 2)) ['c', 'e'] rNr)usednrZcntsrrrrEsrcs>tt|td}ddt|Ddfdd|DS)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,->cSi|] \}}|t|qSrr).0rrrrr bz1convert_to_valid_einsum_chars..c3|] }||VqdSNgetr rreplacerrr cz0convert_to_valid_einsum_chars..)sortedset enumeratejoin)rsymbolsrr)rrWs rcsJt|D]}|dvr q|vrtt|<qdfdd|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#c3r$r%r&r(renamerrr+wr,z%alpha_canonicalize..)rrlenr0)Zequationnamerr2rrfs rcs,|dddfddttDS)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#c3s"|] }|dkr|VqdS)rN)count)r rZtmp_subscriptsrrr+s z"find_output_str..)replacer0r-r.) subscriptsrr8rr zs  r cstfdd|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,) c3s6|]tddtfddDDVqdS)css$|] \}}|dkr||VqdS)rNr)r shapelocrrrr+s"z.find_output_shape...csg|]}|qSr)findr(crr sz/find_output_shape...N)maxzip)r inputsshapesr>rr+s& z$find_output_shape..)tuple)rDrEoutputrrCrr s r cCst|ds t|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> r;)hasattrnpZ asanyarrayrrrrr s  r cCs0d}|D]}|tur|d7}q|||7}q|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)Zold_sub symbol_mapZnew_subrrrrconvert_subscriptss   rMcst|}g}g}tt|dD]}||d||dqt|r+|dnd}dd|D}zttj|}| t ddt t |DWn t yYt d wd fd d |D}|duru|d 7}|t|7}||fS)z:Convert 'interleaved' input to standard einsum input. rNcSg|]}t|qSrr r(rrrr@z-convert_interleaved_input..cSrrr)r idxsymbolrrrr!r"z-convert_interleaved_input..ziFor this input type lists must contain either Ellipsis or hashable and comparable object (e.g. int, str).r6c3s|]}t|VqdSr%)rM)r subrLrrr+z,convert_interleaved_input..->)listranger4appendpopr. itertoolschain from_iterablediscardrKr/r- TypeErrorr0rM)operandsZ tmp_operandsZ operand_listZsubscript_listpZ output_listZ symbol_setr:rrVrconvert_interleaved_inputs(  rdcCst|dkr tdt|dtr%|ddd}dd|ddD}nt|\}}d |vs3d |vrN|d dkp@|d dk}|sJ|d dkrNtd d |vr'|d dddd d}dt|t dd|D}d}d |vr| d \}}| d}d} n| d}d} t |D]\\} } d | vr| d dks| ddkrtd|| j dkrd} nt t|| j dt| d} | |kr| }| dkrtd| dkr| dd|| <q| d|| d|| <qd|}|dkrd} n|| d} | r|d |d| 7}nt |}dtt|t| }|d | |7}d |vr4| d \}}n|t |}}|D]}||vrKtd|q=t| dt|kr]td|||fS)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#cSrPrrQr(rrrr@rRz&parse_einsum_input..rN->rXz%Subscripts can only contain one '->'..r6css|]}t|jVqdSr%)r4r;r(rrrr+#rWz%parse_einsum_input..TFrJzInvalid Ellipses.rzEllipses lengths do not match.z1Output character '{}' did not appear in the inputzDNumber of einsum subscripts must be equal to the number of operands.)r4 ValueError isinstancestrr9rdr7r0rrAsplitr/r;r r-r.format)rbr:invalidrZ ellipse_indslongestZ input_tmpZ output_subZsplit_subscriptsZout_subnumrUZ ellipse_countZ out_ellipseZoutput_subscriptZ normal_indsZinput_subscriptscharrrrr sl          r )__doc__r] collectionsrnumpyrI__all__rrrrrrrr r r rMrdr rrrrs$  %