Diagrams.ThreeD.Transform:aboutY from diagrams-lib-1.3.0.3

Percentage Accurate: 99.8% → 99.8%

Time: 11.6s

Alternatives: 8

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ x \cdot \cos y + z \cdot \sin y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (+ (* x (cos y)) (* z (sin y))))

C

double code(double x, double y, double z) {
	return (x * cos(y)) + (z * sin(y));
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x * cos(y)) + (z * sin(y))
end function

Java

public static double code(double x, double y, double z) {
	return (x * Math.cos(y)) + (z * Math.sin(y));
}

Python

def code(x, y, z):
	return (x * math.cos(y)) + (z * math.sin(y))

Julia

function code(x, y, z)
	return Float64(Float64(x * cos(y)) + Float64(z * sin(y)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (x * cos(y)) + (z * sin(y));
end

Wolfram

code[x_, y_, z_] := N[(N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision] + N[(z * N[Sin[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x \cdot \cos y + z \cdot \sin y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (+ (* x (cos y)) (* z (sin y))))

C

double code(double x, double y, double z) {
	return (x * cos(y)) + (z * sin(y));
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x * cos(y)) + (z * sin(y))
end function

Java

public static double code(double x, double y, double z) {
	return (x * Math.cos(y)) + (z * Math.sin(y));
}

Python

def code(x, y, z):
	return (x * math.cos(y)) + (z * math.sin(y))

Julia

function code(x, y, z)
	return Float64(Float64(x * cos(y)) + Float64(z * sin(y)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (x * cos(y)) + (z * sin(y));
end

Wolfram

code[x_, y_, z_] := N[(N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision] + N[(z * N[Sin[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(z, \sin y, x \cdot \cos y\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (fma z (sin y) (* x (cos y))))

C

double code(double x, double y, double z) {
	return fma(z, sin(y), (x * cos(y)));
}

Julia

function code(x, y, z)
	return fma(z, sin(y), Float64(x * cos(y)))
end

Wolfram

code[x_, y_, z_] := N[(z * N[Sin[y], $MachinePrecision] + N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.7%

   \[x \cdot \cos y + z \cdot \sin y \]
2. Step-by-step derivation

   1. +-commutative 99.7%

      \[\leadsto \color{blue}{z \cdot \sin y + x \cdot \cos y} \]

   2. fma-def 99.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(z, \sin y, x \cdot \cos y\right)} \]

3. Simplified 99.7%

   \[\leadsto \color{blue}{\mathsf{fma}\left(z, \sin y, x \cdot \cos y\right)} \]

4. Final simplification 99.7%

   \[\leadsto \mathsf{fma}\left(z, \sin y, x \cdot \cos y\right) \]

Alternative 2: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x \cdot \cos y + z \cdot \sin y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (+ (* x (cos y)) (* z (sin y))))

C

double code(double x, double y, double z) {
	return (x * cos(y)) + (z * sin(y));
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x * cos(y)) + (z * sin(y))
end function

Java

public static double code(double x, double y, double z) {
	return (x * Math.cos(y)) + (z * Math.sin(y));
}

Python

def code(x, y, z):
	return (x * math.cos(y)) + (z * math.sin(y))

Julia

function code(x, y, z)
	return Float64(Float64(x * cos(y)) + Float64(z * sin(y)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (x * cos(y)) + (z * sin(y));
end

Wolfram

code[x_, y_, z_] := N[(N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision] + N[(z * N[Sin[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.7%

   \[x \cdot \cos y + z \cdot \sin y \]

2. Final simplification 99.7%

   \[\leadsto x \cdot \cos y + z \cdot \sin y \]

Alternative 3: 71.5% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.05 \cdot 10^{+51} \lor \neg \left(x \leq -5.4 \cdot 10^{-39}\right) \land \left(x \leq -6.8 \cdot 10^{-123} \lor \neg \left(x \leq 4.2 \cdot 10^{-113}\right)\right):\\ \;\;\;\;x \cdot \cos y\\ \mathbf{else}:\\ \;\;\;\;z \cdot \sin y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.05e+51)
         (and (not (<= x -5.4e-39))
              (or (<= x -6.8e-123) (not (<= x 4.2e-113)))))
   (* x (cos y))
   (* z (sin y))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.05e+51) || (!(x <= -5.4e-39) && ((x <= -6.8e-123) || !(x <= 4.2e-113)))) {
		tmp = x * cos(y);
	} else {
		tmp = z * sin(y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((x <= (-1.05d+51)) .or. (.not. (x <= (-5.4d-39))) .and. (x <= (-6.8d-123)) .or. (.not. (x <= 4.2d-113))) then
        tmp = x * cos(y)
    else
        tmp = z * sin(y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.05e+51) || (!(x <= -5.4e-39) && ((x <= -6.8e-123) || !(x <= 4.2e-113)))) {
		tmp = x * Math.cos(y);
	} else {
		tmp = z * Math.sin(y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1.05e+51) or (not (x <= -5.4e-39) and ((x <= -6.8e-123) or not (x <= 4.2e-113))):
		tmp = x * math.cos(y)
	else:
		tmp = z * math.sin(y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.05e+51) || (!(x <= -5.4e-39) && ((x <= -6.8e-123) || !(x <= 4.2e-113))))
		tmp = Float64(x * cos(y));
	else
		tmp = Float64(z * sin(y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -1.05e+51) || (~((x <= -5.4e-39)) && ((x <= -6.8e-123) || ~((x <= 4.2e-113)))))
		tmp = x * cos(y);
	else
		tmp = z * sin(y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.05e+51], And[N[Not[LessEqual[x, -5.4e-39]], $MachinePrecision], Or[LessEqual[x, -6.8e-123], N[Not[LessEqual[x, 4.2e-113]], $MachinePrecision]]]], N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision], N[(z * N[Sin[y], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.0500000000000001e51 or -5.4000000000000001e-39 < x < -6.8000000000000001e-123 or 4.2e-113 < x

   1. Initial program 99.8%

      \[x \cdot \cos y + z \cdot \sin y \]

   2. Taylor expanded in x around inf 83.1%

      \[\leadsto \color{blue}{x \cdot \cos y} \]

   if -1.0500000000000001e51 < x < -5.4000000000000001e-39 or -6.8000000000000001e-123 < x < 4.2e-113

   1. Initial program 99.6%

      \[x \cdot \cos y + z \cdot \sin y \]

   2. Taylor expanded in x around 0 82.1%

      \[\leadsto \color{blue}{z \cdot \sin y} \]
3. Recombined 2 regimes into one program.

4. Final simplification 82.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.05 \cdot 10^{+51} \lor \neg \left(x \leq -5.4 \cdot 10^{-39}\right) \land \left(x \leq -6.8 \cdot 10^{-123} \lor \neg \left(x \leq 4.2 \cdot 10^{-113}\right)\right):\\ \;\;\;\;x \cdot \cos y\\ \mathbf{else}:\\ \;\;\;\;z \cdot \sin y\\ \end{array} \]

Alternative 4: 86.1% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3 \cdot 10^{-27} \lor \neg \left(z \leq 7800000000\right):\\ \;\;\;\;x + z \cdot \sin y\\ \mathbf{else}:\\ \;\;\;\;x \cdot \cos y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -3e-27) (not (<= z 7800000000.0)))
   (+ x (* z (sin y)))
   (* x (cos y))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -3e-27) || !(z <= 7800000000.0)) {
		tmp = x + (z * sin(y));
	} else {
		tmp = x * cos(y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((z <= (-3d-27)) .or. (.not. (z <= 7800000000.0d0))) then
        tmp = x + (z * sin(y))
    else
        tmp = x * cos(y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -3e-27) || !(z <= 7800000000.0)) {
		tmp = x + (z * Math.sin(y));
	} else {
		tmp = x * Math.cos(y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -3e-27) or not (z <= 7800000000.0):
		tmp = x + (z * math.sin(y))
	else:
		tmp = x * math.cos(y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -3e-27) || !(z <= 7800000000.0))
		tmp = Float64(x + Float64(z * sin(y)));
	else
		tmp = Float64(x * cos(y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -3e-27) || ~((z <= 7800000000.0)))
		tmp = x + (z * sin(y));
	else
		tmp = x * cos(y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -3e-27], N[Not[LessEqual[z, 7800000000.0]], $MachinePrecision]], N[(x + N[(z * N[Sin[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -3.0000000000000001e-27 or 7.8e9 < z

   1. Initial program 99.7%

      \[x \cdot \cos y + z \cdot \sin y \]

   2. Taylor expanded in y around 0 90.9%

      \[\leadsto \color{blue}{x} + z \cdot \sin y \]

   if -3.0000000000000001e-27 < z < 7.8e9

   1. Initial program 99.8%

      \[x \cdot \cos y + z \cdot \sin y \]

   2. Taylor expanded in x around inf 91.3%

      \[\leadsto \color{blue}{x \cdot \cos y} \]
3. Recombined 2 regimes into one program.

4. Final simplification 91.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3 \cdot 10^{-27} \lor \neg \left(z \leq 7800000000\right):\\ \;\;\;\;x + z \cdot \sin y\\ \mathbf{else}:\\ \;\;\;\;x \cdot \cos y\\ \end{array} \]

Alternative 5: 74.9% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4.9 \cdot 10^{-5} \lor \neg \left(y \leq 2.5 \cdot 10^{-8}\right):\\ \;\;\;\;x \cdot \cos y\\ \mathbf{else}:\\ \;\;\;\;x + z \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -4.9e-5) (not (<= y 2.5e-8))) (* x (cos y)) (+ x (* z y))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -4.9e-5) || !(y <= 2.5e-8)) {
		tmp = x * cos(y);
	} else {
		tmp = x + (z * y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y <= (-4.9d-5)) .or. (.not. (y <= 2.5d-8))) then
        tmp = x * cos(y)
    else
        tmp = x + (z * y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -4.9e-5) || !(y <= 2.5e-8)) {
		tmp = x * Math.cos(y);
	} else {
		tmp = x + (z * y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -4.9e-5) or not (y <= 2.5e-8):
		tmp = x * math.cos(y)
	else:
		tmp = x + (z * y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -4.9e-5) || !(y <= 2.5e-8))
		tmp = Float64(x * cos(y));
	else
		tmp = Float64(x + Float64(z * y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -4.9e-5) || ~((y <= 2.5e-8)))
		tmp = x * cos(y);
	else
		tmp = x + (z * y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -4.9e-5], N[Not[LessEqual[y, 2.5e-8]], $MachinePrecision]], N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision], N[(x + N[(z * y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -4.9e-5 or 2.4999999999999999e-8 < y

   1. Initial program 99.6%

      \[x \cdot \cos y + z \cdot \sin y \]

   2. Taylor expanded in x around inf 47.7%

      \[\leadsto \color{blue}{x \cdot \cos y} \]

   if -4.9e-5 < y < 2.4999999999999999e-8

   1. Initial program 100.0%

      \[x \cdot \cos y + z \cdot \sin y \]

   2. Taylor expanded in y around 0 99.8%

      \[\leadsto \color{blue}{x + y \cdot z} \]
   3. Step-by-step derivation

      1. +-commutative 99.8%

         \[\leadsto \color{blue}{y \cdot z + x} \]

   4. Simplified 99.8%

      \[\leadsto \color{blue}{y \cdot z + x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 69.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -4.9 \cdot 10^{-5} \lor \neg \left(y \leq 2.5 \cdot 10^{-8}\right):\\ \;\;\;\;x \cdot \cos y\\ \mathbf{else}:\\ \;\;\;\;x + z \cdot y\\ \end{array} \]

Alternative 6: 41.2% accurate, 29.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.05 \cdot 10^{+93}:\\ \;\;\;\;z \cdot y\\ \mathbf{elif}\;z \leq 3.6 \cdot 10^{+244}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;z \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -1.05e+93) (* z y) (if (<= z 3.6e+244) x (* z y))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -1.05e+93) {
		tmp = z * y;
	} else if (z <= 3.6e+244) {
		tmp = x;
	} else {
		tmp = z * y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-1.05d+93)) then
        tmp = z * y
    else if (z <= 3.6d+244) then
        tmp = x
    else
        tmp = z * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -1.05e+93) {
		tmp = z * y;
	} else if (z <= 3.6e+244) {
		tmp = x;
	} else {
		tmp = z * y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -1.05e+93:
		tmp = z * y
	elif z <= 3.6e+244:
		tmp = x
	else:
		tmp = z * y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -1.05e+93)
		tmp = Float64(z * y);
	elseif (z <= 3.6e+244)
		tmp = x;
	else
		tmp = Float64(z * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -1.05e+93)
		tmp = z * y;
	elseif (z <= 3.6e+244)
		tmp = x;
	else
		tmp = z * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -1.05e+93], N[(z * y), $MachinePrecision], If[LessEqual[z, 3.6e+244], x, N[(z * y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.0499999999999999e93 or 3.6e244 < z

   1. Initial program 99.7%

      \[x \cdot \cos y + z \cdot \sin y \]

   2. Taylor expanded in y around 0 37.2%

      \[\leadsto \color{blue}{x + y \cdot z} \]
   3. Step-by-step derivation

      1. +-commutative 37.2%

         \[\leadsto \color{blue}{y \cdot z + x} \]

   4. Simplified 37.2%

      \[\leadsto \color{blue}{y \cdot z + x} \]

   5. Taylor expanded in y around inf 34.0%

      \[\leadsto \color{blue}{y \cdot z} \]

   if -1.0499999999999999e93 < z < 3.6e244

   1. Initial program 99.8%

      \[x \cdot \cos y + z \cdot \sin y \]
   2. Step-by-step derivation

      1. +-commutative 99.8%

         \[\leadsto \color{blue}{z \cdot \sin y + x \cdot \cos y} \]

      2. *-commutative 99.8%

         \[\leadsto \color{blue}{\sin y \cdot z} + x \cdot \cos y \]

      3. add-cube-cbrt 99.3%

         \[\leadsto \color{blue}{\left(\left(\sqrt[3]{\sin y} \cdot \sqrt[3]{\sin y}\right) \cdot \sqrt[3]{\sin y}\right)} \cdot z + x \cdot \cos y \]

      4. associate-*l* 99.4%

         \[\leadsto \color{blue}{\left(\sqrt[3]{\sin y} \cdot \sqrt[3]{\sin y}\right) \cdot \left(\sqrt[3]{\sin y} \cdot z\right)} + x \cdot \cos y \]

      5. fma-def 99.4%

         \[\leadsto \color{blue}{\mathsf{fma}\left(\sqrt[3]{\sin y} \cdot \sqrt[3]{\sin y}, \sqrt[3]{\sin y} \cdot z, x \cdot \cos y\right)} \]

      6. pow2 99.4%

         \[\leadsto \mathsf{fma}\left(\color{blue}{{\left(\sqrt[3]{\sin y}\right)}^{2}}, \sqrt[3]{\sin y} \cdot z, x \cdot \cos y\right) \]

   3. Applied egg-rr 99.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left({\left(\sqrt[3]{\sin y}\right)}^{2}, \sqrt[3]{\sin y} \cdot z, x \cdot \cos y\right)} \]

   4. Taylor expanded in y around 0 44.5%

      \[\leadsto \color{blue}{x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 42.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.05 \cdot 10^{+93}:\\ \;\;\;\;z \cdot y\\ \mathbf{elif}\;z \leq 3.6 \cdot 10^{+244}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;z \cdot y\\ \end{array} \]

Alternative 7: 52.4% accurate, 41.4× speedup

Math

\[\begin{array}{l} \\ x + z \cdot y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (+ x (* z y)))

C

double code(double x, double y, double z) {
	return x + (z * y);
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x + (z * y)
end function

Java

public static double code(double x, double y, double z) {
	return x + (z * y);
}

Python

def code(x, y, z):
	return x + (z * y)

Julia

function code(x, y, z)
	return Float64(x + Float64(z * y))
end

MATLAB

function tmp = code(x, y, z)
	tmp = x + (z * y);
end

Wolfram

code[x_, y_, z_] := N[(x + N[(z * y), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.7%

   \[x \cdot \cos y + z \cdot \sin y \]

2. Taylor expanded in y around 0 46.2%

   \[\leadsto \color{blue}{x + y \cdot z} \]
3. Step-by-step derivation

   1. +-commutative 46.2%

      \[\leadsto \color{blue}{y \cdot z + x} \]

4. Simplified 46.2%

   \[\leadsto \color{blue}{y \cdot z + x} \]

5. Final simplification 46.2%

   \[\leadsto x + z \cdot y \]

Alternative 8: 38.7% accurate, 207.0× speedup

Math

\[\begin{array}{l} \\ x \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 x)

C

double code(double x, double y, double z) {
	return x;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x
end function

Java

public static double code(double x, double y, double z) {
	return x;
}

Python

def code(x, y, z):
	return x

Julia

function code(x, y, z)
	return x
end

MATLAB

function tmp = code(x, y, z)
	tmp = x;
end

Wolfram

code[x_, y_, z_] := x

Derivation

1. Initial program 99.7%

   \[x \cdot \cos y + z \cdot \sin y \]
2. Step-by-step derivation

   1. +-commutative 99.7%

      \[\leadsto \color{blue}{z \cdot \sin y + x \cdot \cos y} \]

   2. *-commutative 99.7%

      \[\leadsto \color{blue}{\sin y \cdot z} + x \cdot \cos y \]

   3. add-cube-cbrt 99.1%

      \[\leadsto \color{blue}{\left(\left(\sqrt[3]{\sin y} \cdot \sqrt[3]{\sin y}\right) \cdot \sqrt[3]{\sin y}\right)} \cdot z + x \cdot \cos y \]

   4. associate-*l* 99.1%

      \[\leadsto \color{blue}{\left(\sqrt[3]{\sin y} \cdot \sqrt[3]{\sin y}\right) \cdot \left(\sqrt[3]{\sin y} \cdot z\right)} + x \cdot \cos y \]

   5. fma-def 99.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\sqrt[3]{\sin y} \cdot \sqrt[3]{\sin y}, \sqrt[3]{\sin y} \cdot z, x \cdot \cos y\right)} \]

   6. pow2 99.1%

      \[\leadsto \mathsf{fma}\left(\color{blue}{{\left(\sqrt[3]{\sin y}\right)}^{2}}, \sqrt[3]{\sin y} \cdot z, x \cdot \cos y\right) \]

3. Applied egg-rr 99.1%

   \[\leadsto \color{blue}{\mathsf{fma}\left({\left(\sqrt[3]{\sin y}\right)}^{2}, \sqrt[3]{\sin y} \cdot z, x \cdot \cos y\right)} \]

4. Taylor expanded in y around 0 35.4%

   \[\leadsto \color{blue}{x} \]

5. Final simplification 35.4%

   \[\leadsto x \]

Reproduce

herbie shell --seed 2023285 
(FPCore (x y z)
  :name "Diagrams.ThreeD.Transform:aboutY from diagrams-lib-1.3.0.3"
  :precision binary64
  (+ (* x (cos y)) (* z (sin y))))