 CodeGeneration - Maple Programming Help

Home : Support : Online Help : Programming : Code Generation Package : Julia : CodeGeneration/Julia

CodeGeneration

 Julia
 translate Maple code to Julia code

 Calling Sequence Julia(x, cgopts)

Parameters

 x - expression, list, rtable, procedure, or module cgopts - (optional) one or more CodeGeneration options

Description

 • The Julia(x, cgopts) calling sequence translates Maple code to Julia code.
 - If the parameter x is an algebraic expression, then a Julia statement assigning the expression to a variable is generated.
 - If x is a list, Maple Array, or rtable of algebraic expressions, then a sequence of Julia statements assigning the elements to a Julia array is produced.  Only the initialized elements of the rtable or Maple Array are translated.
 - If x is a list of equations $\mathrm{nm}=\mathrm{expr}$, where $\mathrm{nm}$ is a name and $\mathrm{expr}$ is an algebraic expression, then this is understood as a sequence of assignment statements.  In this case, the equivalent sequence of Julia assignment statements is generated.
 - If x is a procedure, then a Julia function is generated which is equivalent to the procedure, along with any necessary import statements.
 • The parameter cgopts may include one or more CodeGeneration options, as described in CodeGenerationOptions.

Examples

For a description of the options used in the following examples, see CodeGenerationOptions.

 > $\mathrm{with}\left(\mathrm{CodeGeneration}\right):$

Translate a simple expression and assign it to the name $w$ in the target code.

 > $\mathrm{Julia}\left(x+yz-2xz,\mathrm{resultname}="w"\right)$
 w = -2 * x * z + y * z + x

Translate a list and assign it to an array with the name $w$ in the target code.

 > $\mathrm{Julia}\left(\left[\left[x,2y\right],\left[5,z\right]\right],\mathrm{resultname}="w"\right)$
 w = [[x,2 * y],[5,z]]

Translate a computation sequence.  Optimize the input first.

 > $\mathrm{cs}≔\left[s=1.0+x,t=\mathrm{ln}\left(s\right)\mathrm{exp}\left(-x\right),r=\mathrm{exp}\left(-x\right)+xt\right]:$
 > $\mathrm{Julia}\left(\mathrm{cs},\mathrm{optimize}\right)$
 s = 0.10e1 + x t1 = log(s) t2 = exp(-x) t = t2 * t1 r = x * t + t2

Declare that $x$ is a float and $y$ is an integer. Return the result in a string.

 > $s≔\mathrm{Julia}\left(x+y+1,\mathrm{declare}=\left[x::\mathrm{float},y::'\mathrm{integer}'\right],\mathrm{output}=\mathrm{string}\right)$
 ${s}{≔}{"cg = x + y + 1"}$ (1)

Translate a procedure.  Assume that all untyped variables have type integer.

 > f := proc(x, y, z) return x*y-y*z+x*z; end proc:
 > $\mathrm{Julia}\left(f,\mathrm{defaulttype}=\mathrm{integer}\right)$
 function f(x, y, z)     return(y * x - y * z + x * z) end

Translate a procedure containing an implicit return.  A new variable is created to hold the return value.

 > f := proc(n)   local x, i;   x := 0.0;   for i to n do     x := x + i;   end do; end proc:
 > $\mathrm{Julia}\left(f\right)$
 function f(n)     x = 0.0e0     for i = 1:n         x = x + i         cgret = x     end     return(cgret) end

Translate a linear combination of hyperbolic trigonometric functions.

 > $\mathrm{Julia}\left(2\mathrm{cosh}\left(x\right)-7\mathrm{tanh}\left(x\right)\right)$
 cg0 = 2 * cosh(x) - 7 * tanh(x)

Translate a procedure with no return value containing a printf statement.

 > f := proc(a::integer, p::integer)   printf("The integer remainder of %d divided by %d is: %d\n", a, p, irem(a, p)); end proc:
 > $\mathrm{Julia}\left(f\right)$
 function f(a, p)     printf("The integer remainder of %d divided by %d is: %d\n", a, p, a % p) end

Translate a procedure involving linear algebra.

 > detHilbert := proc(M, n :: posint) uses LinearAlgebra;    return Determinant( HilbertMatrix( n ) ); end proc:
 > $\mathrm{Julia}\left(\mathrm{detHilbert}\right)$
 function detHilbert(M, n)     return(det(LinearAlgebra:-HilbertMatrix(n))) end

Compatibility

 • The CodeGeneration[Julia] command was introduced in Maple 2016.