o e\@sdZddlmZddlmZddlmZmZmZm Z ddl m Z ddl m Z ddlmZddlmZmZdd lmZgd Zd d d dddddZGdddeZdddZddZdS)a Julia code printer The `JuliaCodePrinter` converts SymPy expressions into Julia expressions. A complete code generator, which uses `julia_code` extensively, can be found in `sympy.utilities.codegen`. The `codegen` module can be used to generate complete source code files. ) annotations)Any)MulPowSRational) _keep_coeff) equal_valued) CodePrinter) precedence PRECEDENCEsearch)3sincostanZcotsecZcscasinacosatanZacotZasecZacscsinhcoshtanhZcothZsechZcschasinhacoshatanhZacothZasechZacschZsincatan2signfloorlogexpZcbrtsqrterferfcZerfi factorialgammaZdigammaZtrigammaZ polygammabetaZairyaiZ airyaiprimeZairybiZ airybiprimebesseljbesselyZbesseliZbesselkZerfinvZerfcinvabsceilZconjZhankelh1Zhankelh2imagreal)ZAbsZceiling conjugateZhankel1Zhankel2imrec seZdZUdZdZdZddddZdd d id d d d d Zded<iffdd Z ddZ ddZ ddZ ddZ ddZddZddZd d!Zd"d#Zd$d%Zd&d'Zfd(d)Zd*d+Zfd,d-Zfd.d/Zfd0d1Zfd2d3Zd4d5Zd6d7Zd8d9Zd:d;Zdd?Z e Z!d@dAZ"dBdCZ#dDdEZ$dFdGZ%dHdIZ&dJdKZ'dLdMZ(dNdOZ)dPdQZ*dRdSZ+dTdUZ,dVdWZ-dXdYZ.dZd[Z/d\d]Z0d^d_Z1d`daZ2dbdcZ3Z4S)dJuliaCodePrinterzD A printer to convert expressions to strings of Julia code. Z_juliaJuliaz&&z||!)andornotNautoTF)orderZ full_prec precisionuser_functionsZhumanZallow_unknown_functionscontractinlinezdict[str, Any]_default_settingscsHt|tttt|_|jtt|di}|j|dS)Nr:) super__init__dictzipknown_fcns_src1Zknown_functionsupdateknown_fcns_src2get)selfsettingsZ userfuncs __class__DD:\Projects\ConvertPro\env\Lib\site-packages\sympy/printing/julia.pyr?Ks  zJuliaCodePrinter.__init__cCs|dS)NrJ)rFprJrJrK_rate_index_positionSz%JuliaCodePrinter._rate_index_positioncCsd|S)Nz%srJ)rFZ codestringrJrJrK_get_statementWrOzJuliaCodePrinter._get_statementcCs d|S)Nz# {}format)rFtextrJrJrK _get_comment[ zJuliaCodePrinter._get_commentcCs d||S)Nz const {} = {}rQ)rFnamevaluerJrJrK_declare_number_const_ z&JuliaCodePrinter._declare_number_constcCs ||SN) indent_code)rFlinesrJrJrK _format_codecrUzJuliaCodePrinter._format_codecs |j\}fddt|DS)Nc3s&|]}tD]}||fVqqdSrZ)range).0jirowsrJrK js$z.)shaper^)rFmatcolsrJrbrK_traverse_matrix_indicesgs z)JuliaCodePrinter._traverse_matrix_indicescCs^g}g}|D]$}t|j|j|jd|jdg\}}}|d|||f|dq||fS)Nzfor %s = %s:%send)map_printlabellowerupperappend)rFindicesZ open_linesZ close_linesravarstartstoprJrJrK_get_loop_opening_endingms  z)JuliaCodePrinter._get_loop_opening_endingcsH|jr|jr|djrdtj |St||\}}|dkr/t| |}d}nd}g}g}g}j dvrA| }nt |}|D]_} | j r| jr| jjr| jjr| jdkrk|t| j| j ddqHt| jdjd krt| jt r|| |t| j| j qH| jr| tjur| jd kr|t| jqH|| qH|ptjg}fd d |D} fd d |D} |D]} | j|vrd | || j| || j<qdd} |s|| || St|d kr|djrdnd} d|| || | | dfStdd|Drdnd} d|| || | | || fS)Nrz%sim-)oldnoneF)evaluatericg|]}|qSrJ parenthesizer_xprecrFrJrK z/JuliaCodePrinter._print_Mul..cr|rJr}rrrJrKrr(%s)cSsH|d}tdt|D]}||djrdnd}d||||f}q |S)Nrri*z.*%s %s %s)r^len is_number)aa_strrraZmulsymrJrJrKmultjoins z-JuliaCodePrinter._print_Mul..multjoin/./rcs|]}|jVqdSrZr)r_ZbirJrJrKrdz.JuliaCodePrinter._print_Mul..z %s %s (%s))rZ is_imaginaryZ as_coeff_Mul is_integerrlrZ ImaginaryUnitr rr8Zas_ordered_factorsrZ make_argsis_commutativeZis_Powr Z is_Rational is_negativerprbaserargs isinstanceInfinityrMrqZOneindexall)rFexprcerrbZ pow_parenritemrZb_strrZdivsymrJrrK _print_MulysV              zJuliaCodePrinter._print_MulcCs,||j}||j}|j}d|||S)Nz{} {} {})rllhsrhsZrel_oprR)rFrlhs_coderhs_codeoprJrJrK_print_Relationals  z"JuliaCodePrinter._print_RelationalcCstdd|jDr dnd}t|}t|jdr d||jS|jrTt|jdr;|jjr/dnd }d |||jfSt|jd rT|jjrGdnd }d || |j|fSd | |j||| |j|fS)NcsrrZrrrJrJrKrdrz.JuliaCodePrinter._print_Pow..^z.^g?zsqrt(%s)grrz 1 %s sqrt(%s)rzz1 %s %sr) rrr r r rlrrrr~)rFrZ powsymbolPRECsymrJrJrK _print_Pows    zJuliaCodePrinter._print_PowcCs(t|}d||j|||j|fS)Nz%s ^ %s)r r~rr rFrrrJrJrK _print_MatPows zJuliaCodePrinter._print_MatPowc|jdrdSt|S)Nr<pi _settingsr>Z_print_NumberSymbolrFrrHrJrK _print_Pi  zJuliaCodePrinter._print_PicCdS)Nr.rJrrJrJrK_print_ImaginaryUnitz%JuliaCodePrinter._print_ImaginaryUnitcr)Nr<rrrrHrJrK _print_Exp1rzJuliaCodePrinter._print_Exp1cr)Nr<Z eulergammarrrHrJrK_print_EulerGammarz"JuliaCodePrinter._print_EulerGammacr)Nr<catalanrrrHrJrK_print_CatalanrzJuliaCodePrinter._print_Catalancr)Nr<ZgoldenrrrHrJrK_print_GoldenRatiorz#JuliaCodePrinter._print_GoldenRatiocCsddlm}ddlm}ddlm}|j}|j}|jdsHt |j|rHg}g}|j D]\} } | ||| | | q*|t ||} | | S|jdr]||sW||r]|||S| |} | |} |d| | fS)Nr) Assignment) Piecewise) IndexedBaser<r;z%s = %s)Zsympy.codegen.astrZ$sympy.functions.elementary.piecewiserZsympy.tensor.indexedrrrrrrrprArlhasZ_doprint_loopsrP)rFrrrrrrZ expressionsZ conditionsrrtemprrrJrJrK_print_Assignment s(        z"JuliaCodePrinter._print_AssignmentcCr)NZInfrJrrJrJrK_print_Infinity'rz JuliaCodePrinter._print_InfinitycCr)Nz-InfrJrrJrJrK_print_NegativeInfinity+rz(JuliaCodePrinter._print_NegativeInfinitycCr)NNaNrJrrJrJrK _print_NaN/rzJuliaCodePrinter._print_NaNcs ddfdd|DdS)NzAny[, c3s|]}|VqdSrZrlr_rrFrJrKrd4z/JuliaCodePrinter._print_list..])joinrrJrrK _print_list3s zJuliaCodePrinter._print_listcCs.t|dkrd||dSd||dS)Nriz(%s,)rrr)rrl stringifyrrJrJrK _print_tuple7s zJuliaCodePrinter._print_tuplecCr)NtruerJrrJrJrK_print_BooleanTrue?rz#JuliaCodePrinter._print_BooleanTruecCr)NfalserJrrJrJrK_print_BooleanFalseCrz$JuliaCodePrinter._print_BooleanFalsecCs t|SrZ)strrnrrJrJrK _print_boolGrYzJuliaCodePrinter._print_boolcstj|jvrd|j|jfS|j|jfdkrd|dS|jdkr,d|jddddS|jdkr?dd fd d |DSd|jddd dd S)Nz zeros(%s, %s))ririz[%s])rrrirw )rowstartrowendcolseprcg|]}|qSrJrrrrJrKrYz6JuliaCodePrinter._print_MatrixBase..z; )rrZrowsepr)rZZerorercrgtabler)rFArJrrK_print_MatrixBaseOs     z"JuliaCodePrinter._print_MatrixBasecCsrddlm}|}|dd|D}|dd|D}|dd|D}d|||||||j|jfS)Nr)MatrixcSsg|]}|ddqS)rrirJr_krJrJrKrbrz;JuliaCodePrinter._print_SparseRepMatrix..cSsg|]}|ddqS)rirJrrJrJrKrcrcSsg|]}|dqS)rJrrJrJrKrdszsparse(%s, %s, %s, %s, %s))Zsympy.matricesrZcol_listrlrcrg)rFrrLIJZAIJrJrJrK_print_SparseRepMatrix^s z'JuliaCodePrinter._print_SparseRepMatrixcCs.|j|jtdddd|jd|jdfS)NZAtomT)strictz[%s,%s]ri)r~parentr rar`rrJrJrK_print_MatrixElementisz%JuliaCodePrinter._print_MatrixElementcsLfdd}|jd||j|jjdd||j|jjddS)Ncs|dd}|d}|d}|}||krdn|}|dkr8|dkr,||kr,dS||kr2|S|d|Sd|||fS)Nrrirrj:)rlr)rZlimlhstepZlstrZhstrrrJrKstrsliceos   z5JuliaCodePrinter._print_MatrixSlice..strslice[r,rir)rlrZrowslicereZcolslice)rFrrrJrrK_print_MatrixSlicens z#JuliaCodePrinter._print_MatrixSlicecs0fdd|jD}d|jjd|fS)NcrrJr)r_rarrJrKrrz3JuliaCodePrinter._print_Indexed..z%s[%s]r)rqrlrrmr)rFrZindsrJrrK_print_IndexedszJuliaCodePrinter._print_IndexedcCs ||jSrZ)rlrmrrJrJrK _print_IdxrYzJuliaCodePrinter._print_IdxcCsd||jdS)Nzeye(%s)r)rlrerrJrJrK_print_Identitysz JuliaCodePrinter._print_IdentitycsdfddjDS)Nz .* csg|] }|tqSrJr~r r_argrrFrJrKrsz;JuliaCodePrinter._print_HadamardProduct..)rrrrJrrK_print_HadamardProductsz'JuliaCodePrinter._print_HadamardProductcCs*t|}d||j|||j|gS)Nz.**)r rr~rr rrJrJrK_print_HadamardPowers   z%JuliaCodePrinter._print_HadamardPowercCs$|jdkr t|jSd|j|jfS)Nriz%s // %s)rrrMrrJrJrK_print_Rationals  z JuliaCodePrinter._print_RationalcCDddlm}m}|j}|tjd|||jtj|}||S)Nr)r!r'r) sympy.functionsr!r'argumentrPir8Halfrl)rFrr!r'rexpr2rJrJrK _print_jn$ zJuliaCodePrinter._print_jncCr)Nr)r!r(r) rr!r(rrrr8rrl)rFrr!r(rrrJrJrK _print_ynrzJuliaCodePrinter._print_ync s|jdjdkr tdg}jdr9fdd|jddD}d|jdj}d||}d |d St|jD]J\}\}}|d krS|d |n|t |jd krf|dkrf|dn |d||} || |t |jd kr|dq>d|S)NrzTzAll Piecewise expressions must contain an (expr, True) statement to be used as a default condition. Without one, the generated expression may not evaluate to anything under some condition.r<cs(g|]\}}d||qS)z ({}) ? ({}) :)rRrl)r_rrrrJrKrs z5JuliaCodePrinter._print_Piecewise..z (%s) ()rzif (%s)rielsez elseif (%s)rj) rZcond ValueErrorrrlrr enumeraterpr) rFrr\ZecpairsZelastpwrarrZcode0rJrrK_print_Piecewises,         z!JuliaCodePrinter._print_Piecewisecs|\}}d}|jr.|\}}|jr |jr t| |d}n|jr.|jr.t| |d}|dfddjDS)Nrwrvz * c3s |] }|tVqdSrZrrrrJrKrdsz1JuliaCodePrinter._print_MatMul..)Z as_coeff_mmulrZ as_real_imagis_zerorrrr)rFrrmrr/r.rJrrK _print_MatMuls      zJuliaCodePrinter._print_MatMulc st|tr||d}d|Sd}dddd|D}fdd|D}fd d|D}g}d }t|D]%\}} | d vrG|| q9|||8}|d ||| f|||7}q9|S) z0Accepts a string of code or a list of code linesTrwz )z ^function z^if ^elseif ^else$z^for )z^end$rrcSsg|]}|dqS)z )lstrip)r_linerJrJrKrrz0JuliaCodePrinter.indent_code..c&g|]ttfddDqS)c3|]}t|VqdSrZr r_r/rrJrKrdr:JuliaCodePrinter.indent_code...intanyr_) inc_regexrrKrcr)c3rrZr rrrJrKrdrrrr) dec_regexrrKrr r)rwrz%s%s)rrr[ splitlinesrr rp) rFcodeZ code_linestabZincreaseZdecreaseprettylevelnrrJ)r!rrKr[s.      zJuliaCodePrinter.indent_code)5__name__ __module__ __qualname____doc__Z printmethodlanguage _operatorsr=__annotations__r?rNrPrTrXr]rhrurrrrrrrrrrrrrrrrZ _print_Tuplerrrrrrrrrrrrrrrrrr[ __classcell__rJrJrHrKr00sx  J      $r0NcKst|||S)a)Converts `expr` to a string of Julia code. Parameters ========== expr : Expr A SymPy expression to be converted. assign_to : optional When given, the argument is used as the name of the variable to which the expression is assigned. Can be a string, ``Symbol``, ``MatrixSymbol``, or ``Indexed`` type. This can be helpful for expressions that generate multi-line statements. precision : integer, optional The precision for numbers such as pi [default=16]. user_functions : dict, optional A dictionary where keys are ``FunctionClass`` instances and values are their string representations. Alternatively, the dictionary value can be a list of tuples i.e. [(argument_test, cfunction_string)]. See below for examples. human : bool, optional If True, the result is a single string that may contain some constant declarations for the number symbols. If False, the same information is returned in a tuple of (symbols_to_declare, not_supported_functions, code_text). [default=True]. contract: bool, optional If True, ``Indexed`` instances are assumed to obey tensor contraction rules and the corresponding nested loops over indices are generated. Setting contract=False will not generate loops, instead the user is responsible to provide values for the indices in the code. [default=True]. inline: bool, optional If True, we try to create single-statement code instead of multiple statements. [default=True]. Examples ======== >>> from sympy import julia_code, symbols, sin, pi >>> x = symbols('x') >>> julia_code(sin(x).series(x).removeO()) 'x .^ 5 / 120 - x .^ 3 / 6 + x' >>> from sympy import Rational, ceiling >>> x, y, tau = symbols("x, y, tau") >>> julia_code((2*tau)**Rational(7, 2)) '8 * sqrt(2) * tau .^ (7 // 2)' Note that element-wise (Hadamard) operations are used by default between symbols. This is because its possible in Julia to write "vectorized" code. It is harmless if the values are scalars. >>> julia_code(sin(pi*x*y), assign_to="s") 's = sin(pi * x .* y)' If you need a matrix product "*" or matrix power "^", you can specify the symbol as a ``MatrixSymbol``. >>> from sympy import Symbol, MatrixSymbol >>> n = Symbol('n', integer=True, positive=True) >>> A = MatrixSymbol('A', n, n) >>> julia_code(3*pi*A**3) '(3 * pi) * A ^ 3' This class uses several rules to decide which symbol to use a product. Pure numbers use "*", Symbols use ".*" and MatrixSymbols use "*". A HadamardProduct can be used to specify componentwise multiplication ".*" of two MatrixSymbols. There is currently there is no easy way to specify scalar symbols, so sometimes the code might have some minor cosmetic issues. For example, suppose x and y are scalars and A is a Matrix, then while a human programmer might write "(x^2*y)*A^3", we generate: >>> julia_code(x**2*y*A**3) '(x .^ 2 .* y) * A ^ 3' Matrices are supported using Julia inline notation. When using ``assign_to`` with matrices, the name can be specified either as a string or as a ``MatrixSymbol``. The dimensions must align in the latter case. >>> from sympy import Matrix, MatrixSymbol >>> mat = Matrix([[x**2, sin(x), ceiling(x)]]) >>> julia_code(mat, assign_to='A') 'A = [x .^ 2 sin(x) ceil(x)]' ``Piecewise`` expressions are implemented with logical masking by default. Alternatively, you can pass "inline=False" to use if-else conditionals. Note that if the ``Piecewise`` lacks a default term, represented by ``(expr, True)`` then an error will be thrown. This is to prevent generating an expression that may not evaluate to anything. >>> from sympy import Piecewise >>> pw = Piecewise((x + 1, x > 0), (x, True)) >>> julia_code(pw, assign_to=tau) 'tau = ((x > 0) ? (x + 1) : (x))' Note that any expression that can be generated normally can also exist inside a Matrix: >>> mat = Matrix([[x**2, pw, sin(x)]]) >>> julia_code(mat, assign_to='A') 'A = [x .^ 2 ((x > 0) ? (x + 1) : (x)) sin(x)]' Custom printing can be defined for certain types by passing a dictionary of "type" : "function" to the ``user_functions`` kwarg. Alternatively, the dictionary value can be a list of tuples i.e., [(argument_test, cfunction_string)]. This can be used to call a custom Julia function. >>> from sympy import Function >>> f = Function('f') >>> g = Function('g') >>> custom_functions = { ... "f": "existing_julia_fcn", ... "g": [(lambda x: x.is_Matrix, "my_mat_fcn"), ... (lambda x: not x.is_Matrix, "my_fcn")] ... } >>> mat = Matrix([[1, x]]) >>> julia_code(f(x) + g(x) + g(mat), user_functions=custom_functions) 'existing_julia_fcn(x) + my_fcn(x) + my_mat_fcn([1 x])' Support for loops is provided through ``Indexed`` types. With ``contract=True`` these expressions will be turned into loops, whereas ``contract=False`` will just print the assignment expression that should be looped over: >>> from sympy import Eq, IndexedBase, Idx >>> len_y = 5 >>> y = IndexedBase('y', shape=(len_y,)) >>> t = IndexedBase('t', shape=(len_y,)) >>> Dy = IndexedBase('Dy', shape=(len_y-1,)) >>> i = Idx('i', len_y-1) >>> e = Eq(Dy[i], (y[i+1]-y[i])/(t[i+1]-t[i])) >>> julia_code(e.rhs, assign_to=e.lhs, contract=False) 'Dy[i] = (y[i + 1] - y[i]) ./ (t[i + 1] - t[i])' )r0Zdoprint)rZ assign_torGrJrJrK julia_codesr0cKstt|fi|dS)z~Prints the Julia representation of the given expression. See `julia_code` for the meaning of the optional arguments. N)printr0)rrGrJrJrKprint_julia_codesr2rZ)r+ __future__rtypingrZ sympy.corerrrrZsympy.core.mulrZsympy.core.numbersr Zsympy.printing.codeprinterr Zsympy.printing.precedencer r r/rrBrDr0r0r2rJrJrJrKs2       W