Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, I

Percentage Accurate: 91.1% → 97.1%

Time: 11.8s

Alternatives: 9

Speedup: 0.7×

• 28.7% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))

C

double code(double x, double y, double z, double t, double a) {
	return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = ((x * y) - ((z * 9.0d0) * t)) / (a * 2.0d0)
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}

Python

def code(x, y, z, t, a):
	return ((x * y) - ((z * 9.0) * t)) / (a * 2.0)

Julia

function code(x, y, z, t, a)
	return Float64(Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) / Float64(a * 2.0))
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]

Initial Program: 91.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))

C

double code(double x, double y, double z, double t, double a) {
	return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = ((x * y) - ((z * 9.0d0) * t)) / (a * 2.0d0)
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}

Python

def code(x, y, z, t, a):
	return ((x * y) - ((z * 9.0) * t)) / (a * 2.0)

Julia

function code(x, y, z, t, a)
	return Float64(Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) / Float64(a * 2.0))
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]

Alternative 1: 97.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} t_1 := \mathsf{fma}\left(-t, \frac{z \cdot 4.5}{a}, x \cdot \frac{y}{a \cdot 2}\right)\\ t_2 := x \cdot y - \left(z \cdot 9\right) \cdot t\\ \mathbf{if}\;t\_2 \leq -5 \cdot 10^{+293}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+228}:\\ \;\;\;\;\frac{t\_2}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (- t) (/ (* z 4.5) a) (* x (/ y (* a 2.0)))))
        (t_2 (- (* x y) (* (* z 9.0) t))))
   (if (<= t_2 -5e+293) t_1 (if (<= t_2 2e+228) (/ t_2 (* a 2.0)) t_1))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(-t, ((z * 4.5) / a), (x * (y / (a * 2.0))));
	double t_2 = (x * y) - ((z * 9.0) * t);
	double tmp;
	if (t_2 <= -5e+293) {
		tmp = t_1;
	} else if (t_2 <= 2e+228) {
		tmp = t_2 / (a * 2.0);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	t_1 = fma(Float64(-t), Float64(Float64(z * 4.5) / a), Float64(x * Float64(y / Float64(a * 2.0))))
	t_2 = Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t))
	tmp = 0.0
	if (t_2 <= -5e+293)
		tmp = t_1;
	elseif (t_2 <= 2e+228)
		tmp = Float64(t_2 / Float64(a * 2.0));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[((-t) * N[(N[(z * 4.5), $MachinePrecision] / a), $MachinePrecision] + N[(x * N[(y / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+293], t$95$1, If[LessEqual[t$95$2, 2e+228], N[(t$95$2 / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -5.00000000000000033e293 or 1.9999999999999998e228 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t))

   1. Initial program 79.0%

      \[\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2}} \]

      2. lift--.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y - \left(z \cdot 9\right) \cdot t}}{a \cdot 2} \]

      3. div-sub N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{a \cdot 2} - \frac{\left(z \cdot 9\right) \cdot t}{a \cdot 2}} \]

      4. sub-neg N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{a \cdot 2} + \left(\mathsf{neg}\left(\frac{\left(z \cdot 9\right) \cdot t}{a \cdot 2}\right)\right)} \]

      5. +-commutative N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{\left(z \cdot 9\right) \cdot t}{a \cdot 2}\right)\right) + \frac{x \cdot y}{a \cdot 2}} \]

      6. lift-*.f64 N/A

         \[\leadsto \left(\mathsf{neg}\left(\frac{\color{blue}{\left(z \cdot 9\right) \cdot t}}{a \cdot 2}\right)\right) + \frac{x \cdot y}{a \cdot 2} \]

      7. *-commutative N/A

         \[\leadsto \left(\mathsf{neg}\left(\frac{\color{blue}{t \cdot \left(z \cdot 9\right)}}{a \cdot 2}\right)\right) + \frac{x \cdot y}{a \cdot 2} \]

      8. associate-/l* N/A

         \[\leadsto \left(\mathsf{neg}\left(\color{blue}{t \cdot \frac{z \cdot 9}{a \cdot 2}}\right)\right) + \frac{x \cdot y}{a \cdot 2} \]

      9. distribute-lft-neg-in N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(t\right)\right) \cdot \frac{z \cdot 9}{a \cdot 2}} + \frac{x \cdot y}{a \cdot 2} \]

      10. lower-fma.f64 N/A

          \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{neg}\left(t\right), \frac{z \cdot 9}{a \cdot 2}, \frac{x \cdot y}{a \cdot 2}\right)} \]

      11. lower-neg.f64 N/A

          \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{neg}\left(t\right)}, \frac{z \cdot 9}{a \cdot 2}, \frac{x \cdot y}{a \cdot 2}\right) \]

      12. lift-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), \frac{z \cdot 9}{\color{blue}{a \cdot 2}}, \frac{x \cdot y}{a \cdot 2}\right) \]

      13. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), \frac{z \cdot 9}{\color{blue}{2 \cdot a}}, \frac{x \cdot y}{a \cdot 2}\right) \]

      14. associate-/r* N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), \color{blue}{\frac{\frac{z \cdot 9}{2}}{a}}, \frac{x \cdot y}{a \cdot 2}\right) \]

      15. lower-/.f64 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), \color{blue}{\frac{\frac{z \cdot 9}{2}}{a}}, \frac{x \cdot y}{a \cdot 2}\right) \]

      16. lift-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), \frac{\frac{\color{blue}{z \cdot 9}}{2}}{a}, \frac{x \cdot y}{a \cdot 2}\right) \]

      17. associate-/l* N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), \frac{\color{blue}{z \cdot \frac{9}{2}}}{a}, \frac{x \cdot y}{a \cdot 2}\right) \]

      18. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), \frac{\color{blue}{z \cdot \frac{9}{2}}}{a}, \frac{x \cdot y}{a \cdot 2}\right) \]

      19. metadata-eval N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), \frac{z \cdot \color{blue}{\frac{9}{2}}}{a}, \frac{x \cdot y}{a \cdot 2}\right) \]

      20. lift-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), \frac{z \cdot \frac{9}{2}}{a}, \frac{\color{blue}{x \cdot y}}{a \cdot 2}\right) \]

      21. associate-/l* N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), \frac{z \cdot \frac{9}{2}}{a}, \color{blue}{x \cdot \frac{y}{a \cdot 2}}\right) \]

      22. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), \frac{z \cdot \frac{9}{2}}{a}, \color{blue}{x \cdot \frac{y}{a \cdot 2}}\right) \]

   4. Applied rewrites 97.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-t, \frac{z \cdot 4.5}{a}, x \cdot \frac{y}{a \cdot 2}\right)} \]

   if -5.00000000000000033e293 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 1.9999999999999998e228

   1. Initial program 99.1%

      \[\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2} \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 74.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\ [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} t_1 := \left(z \cdot 9\right) \cdot t\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+40}:\\ \;\;\;\;t \cdot \left(-4.5 \cdot \frac{z}{a}\right)\\ \mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+20}:\\ \;\;\;\;\frac{x \cdot y}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;t \cdot \frac{z \cdot -4.5}{a}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* (* z 9.0) t)))
   (if (<= t_1 -1e+40)
     (* t (* -4.5 (/ z a)))
     (if (<= t_1 4e+20) (/ (* x y) (* a 2.0)) (* t (/ (* z -4.5) a))))))

C

assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double t_1 = (z * 9.0) * t;
	double tmp;
	if (t_1 <= -1e+40) {
		tmp = t * (-4.5 * (z / a));
	} else if (t_1 <= 4e+20) {
		tmp = (x * y) / (a * 2.0);
	} else {
		tmp = t * ((z * -4.5) / a);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (z * 9.0d0) * t
    if (t_1 <= (-1d+40)) then
        tmp = t * ((-4.5d0) * (z / a))
    else if (t_1 <= 4d+20) then
        tmp = (x * y) / (a * 2.0d0)
    else
        tmp = t * ((z * (-4.5d0)) / a)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (z * 9.0) * t;
	double tmp;
	if (t_1 <= -1e+40) {
		tmp = t * (-4.5 * (z / a));
	} else if (t_1 <= 4e+20) {
		tmp = (x * y) / (a * 2.0);
	} else {
		tmp = t * ((z * -4.5) / a);
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	t_1 = (z * 9.0) * t
	tmp = 0
	if t_1 <= -1e+40:
		tmp = t * (-4.5 * (z / a))
	elif t_1 <= 4e+20:
		tmp = (x * y) / (a * 2.0)
	else:
		tmp = t * ((z * -4.5) / a)
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	t_1 = Float64(Float64(z * 9.0) * t)
	tmp = 0.0
	if (t_1 <= -1e+40)
		tmp = Float64(t * Float64(-4.5 * Float64(z / a)));
	elseif (t_1 <= 4e+20)
		tmp = Float64(Float64(x * y) / Float64(a * 2.0));
	else
		tmp = Float64(t * Float64(Float64(z * -4.5) / a));
	end
	return tmp
end

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	t_1 = (z * 9.0) * t;
	tmp = 0.0;
	if (t_1 <= -1e+40)
		tmp = t * (-4.5 * (z / a));
	elseif (t_1 <= 4e+20)
		tmp = (x * y) / (a * 2.0);
	else
		tmp = t * ((z * -4.5) / a);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+40], N[(t * N[(-4.5 * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 4e+20], N[(N[(x * y), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(t * N[(N[(z * -4.5), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -1.00000000000000003e40

   1. Initial program 85.9%

      \[\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{-9}{2} \cdot \frac{t \cdot z}{a}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{-9}{2} \cdot \frac{t \cdot z}{a}} \]

      2. associate-/l* N/A

         \[\leadsto \frac{-9}{2} \cdot \color{blue}{\left(t \cdot \frac{z}{a}\right)} \]

      3. lower-*.f64 N/A

         \[\leadsto \frac{-9}{2} \cdot \color{blue}{\left(t \cdot \frac{z}{a}\right)} \]

      4. lower-/.f64 77.6

         \[\leadsto -4.5 \cdot \left(t \cdot \color{blue}{\frac{z}{a}}\right) \]

   5. Applied rewrites 77.6%

      \[\leadsto \color{blue}{-4.5 \cdot \left(t \cdot \frac{z}{a}\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 77.6%

      \[\leadsto t \cdot \color{blue}{\left(\frac{z}{a} \cdot -4.5\right)} \]

   if -1.00000000000000003e40 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 4e20

   1. Initial program 94.6%

      \[\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \frac{\color{blue}{x \cdot y}}{a \cdot 2} \]
   4. Step-by-step derivation

      1. lower-*.f64 72.9

         \[\leadsto \frac{\color{blue}{x \cdot y}}{a \cdot 2} \]

   5. Applied rewrites 72.9%

      \[\leadsto \frac{\color{blue}{x \cdot y}}{a \cdot 2} \]

   if 4e20 < (*.f64 (*.f64 z #s(literal 9 binary64)) t)

   1. Initial program 87.6%

      \[\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{-9}{2} \cdot \frac{t \cdot z}{a}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{-9}{2} \cdot \frac{t \cdot z}{a}} \]

      2. associate-/l* N/A

         \[\leadsto \frac{-9}{2} \cdot \color{blue}{\left(t \cdot \frac{z}{a}\right)} \]

      3. lower-*.f64 N/A

         \[\leadsto \frac{-9}{2} \cdot \color{blue}{\left(t \cdot \frac{z}{a}\right)} \]

      4. lower-/.f64 76.4

         \[\leadsto -4.5 \cdot \left(t \cdot \color{blue}{\frac{z}{a}}\right) \]

   5. Applied rewrites 76.4%

      \[\leadsto \color{blue}{-4.5 \cdot \left(t \cdot \frac{z}{a}\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 76.3%

      \[\leadsto \frac{z \cdot -4.5}{a} \cdot \color{blue}{t} \]
3. Recombined 3 regimes into one program.

4. Final simplification 74.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(z \cdot 9\right) \cdot t \leq -1 \cdot 10^{+40}:\\ \;\;\;\;t \cdot \left(-4.5 \cdot \frac{z}{a}\right)\\ \mathbf{elif}\;\left(z \cdot 9\right) \cdot t \leq 4 \cdot 10^{+20}:\\ \;\;\;\;\frac{x \cdot y}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;t \cdot \frac{z \cdot -4.5}{a}\\ \end{array} \]
5. Add Preprocessing

Developer Target 1: 93.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a < -2.090464557976709 \cdot 10^{+86}:\\ \;\;\;\;0.5 \cdot \frac{y \cdot x}{a} - 4.5 \cdot \frac{t}{\frac{a}{z}}\\ \mathbf{elif}\;a < 2.144030707833976 \cdot 10^{+99}:\\ \;\;\;\;\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{a} \cdot \left(x \cdot 0.5\right) - \frac{t}{a} \cdot \left(z \cdot 4.5\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (< a -2.090464557976709e+86)
   (- (* 0.5 (/ (* y x) a)) (* 4.5 (/ t (/ a z))))
   (if (< a 2.144030707833976e+99)
     (/ (- (* x y) (* z (* 9.0 t))) (* a 2.0))
     (- (* (/ y a) (* x 0.5)) (* (/ t a) (* z 4.5))))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a < -2.090464557976709e+86) {
		tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
	} else if (a < 2.144030707833976e+99) {
		tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
	} else {
		tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (a < (-2.090464557976709d+86)) then
        tmp = (0.5d0 * ((y * x) / a)) - (4.5d0 * (t / (a / z)))
    else if (a < 2.144030707833976d+99) then
        tmp = ((x * y) - (z * (9.0d0 * t))) / (a * 2.0d0)
    else
        tmp = ((y / a) * (x * 0.5d0)) - ((t / a) * (z * 4.5d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a < -2.090464557976709e+86) {
		tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
	} else if (a < 2.144030707833976e+99) {
		tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
	} else {
		tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if a < -2.090464557976709e+86:
		tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)))
	elif a < 2.144030707833976e+99:
		tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0)
	else:
		tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a < -2.090464557976709e+86)
		tmp = Float64(Float64(0.5 * Float64(Float64(y * x) / a)) - Float64(4.5 * Float64(t / Float64(a / z))));
	elseif (a < 2.144030707833976e+99)
		tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0));
	else
		tmp = Float64(Float64(Float64(y / a) * Float64(x * 0.5)) - Float64(Float64(t / a) * Float64(z * 4.5)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (a < -2.090464557976709e+86)
		tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
	elseif (a < 2.144030707833976e+99)
		tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
	else
		tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Less[a, -2.090464557976709e+86], N[(N[(0.5 * N[(N[(y * x), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision] - N[(4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Less[a, 2.144030707833976e+99], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y / a), $MachinePrecision] * N[(x * 0.5), $MachinePrecision]), $MachinePrecision] - N[(N[(t / a), $MachinePrecision] * N[(z * 4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Reproduce

herbie shell --seed 2024223 
(FPCore (x y z t a)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, I"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< a -209046455797670900000000000000000000000000000000000000000000000000000000000000000000000) (- (* 1/2 (/ (* y x) a)) (* 9/2 (/ t (/ a z)))) (if (< a 2144030707833976000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (- (* x y) (* z (* 9 t))) (* a 2)) (- (* (/ y a) (* x 1/2)) (* (/ t a) (* z 9/2))))))

  (/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))