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

Percentage Accurate: 95.3% → 98.9%

Time: 15.2s

Alternatives: 18

Speedup: 0.9×

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

Specification

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b)))

C

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

Fortran

real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    code = ((x * 2.0d0) - (((y * 9.0d0) * z) * t)) + ((a * 27.0d0) * b)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 95.3% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b)))

C

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

Fortran

real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    code = ((x * 2.0d0) - (((y * 9.0d0) * z) * t)) + ((a * 27.0d0) * b)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.9% accurate, 0.1× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq 2 \cdot 10^{-267}:\\ \;\;\;\;\mathsf{fma}\left(a, 27 \cdot b, \mathsf{fma}\left(x, 2, y \cdot \left(z \cdot \left(t \cdot -9\right)\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(a, 27 \cdot b, \mathsf{fma}\left(x, 2, t \cdot \left(y \cdot \left(z \cdot -9\right)\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= z 2e-267)
   (fma a (* 27.0 b) (fma x 2.0 (* y (* z (* t -9.0)))))
   (fma a (* 27.0 b) (fma x 2.0 (* t (* y (* z -9.0)))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= 2e-267) {
		tmp = fma(a, (27.0 * b), fma(x, 2.0, (y * (z * (t * -9.0)))));
	} else {
		tmp = fma(a, (27.0 * b), fma(x, 2.0, (t * (y * (z * -9.0)))));
	}
	return tmp;
}

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= 2e-267)
		tmp = fma(a, Float64(27.0 * b), fma(x, 2.0, Float64(y * Float64(z * Float64(t * -9.0)))));
	else
		tmp = fma(a, Float64(27.0 * b), fma(x, 2.0, Float64(t * Float64(y * Float64(z * -9.0)))));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, 2e-267], N[(a * N[(27.0 * b), $MachinePrecision] + N[(x * 2.0 + N[(y * N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a * N[(27.0 * b), $MachinePrecision] + N[(x * 2.0 + N[(t * N[(y * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 2: 98.0% accurate, 0.1× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;t \leq 2 \cdot 10^{-195}:\\ \;\;\;\;\left(x \cdot 2 - \left(y \cdot 9\right) \cdot \left(z \cdot t\right)\right) + a \cdot \left(27 \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(a, 27 \cdot b, \mathsf{fma}\left(x, 2, t \cdot \left(y \cdot \left(z \cdot -9\right)\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= t 2e-195)
   (+ (- (* x 2.0) (* (* y 9.0) (* z t))) (* a (* 27.0 b)))
   (fma a (* 27.0 b) (fma x 2.0 (* t (* y (* z -9.0)))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (t <= 2e-195) {
		tmp = ((x * 2.0) - ((y * 9.0) * (z * t))) + (a * (27.0 * b));
	} else {
		tmp = fma(a, (27.0 * b), fma(x, 2.0, (t * (y * (z * -9.0)))));
	}
	return tmp;
}

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (t <= 2e-195)
		tmp = Float64(Float64(Float64(x * 2.0) - Float64(Float64(y * 9.0) * Float64(z * t))) + Float64(a * Float64(27.0 * b)));
	else
		tmp = fma(a, Float64(27.0 * b), fma(x, 2.0, Float64(t * Float64(y * Float64(z * -9.0)))));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[t, 2e-195], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(N[(y * 9.0), $MachinePrecision] * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a * N[(27.0 * b), $MachinePrecision] + N[(x * 2.0 + N[(t * N[(y * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 3: 48.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := 27 \cdot \left(a \cdot b\right)\\ t_2 := -9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \mathbf{if}\;z \leq -2.15 \cdot 10^{-38}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;z \leq -5.1 \cdot 10^{-86}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq -2.25 \cdot 10^{-163}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;z \leq -7 \cdot 10^{-195}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq -7.2 \cdot 10^{-203}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;z \leq 10^{-295}:\\ \;\;\;\;b \cdot \left(a \cdot 27\right)\\ \mathbf{elif}\;z \leq 5.5 \cdot 10^{-243}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq 6.2 \cdot 10^{-233}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;z \leq 3 \cdot 10^{-70}:\\ \;\;\;\;x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;t_2\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* 27.0 (* a b))) (t_2 (* -9.0 (* t (* z y)))))
   (if (<= z -2.15e-38)
     t_2
     (if (<= z -5.1e-86)
       (* x 2.0)
       (if (<= z -2.25e-163)
         t_1
         (if (<= z -7e-195)
           (* x 2.0)
           (if (<= z -7.2e-203)
             t_2
             (if (<= z 1e-295)
               (* b (* a 27.0))
               (if (<= z 5.5e-243)
                 (* x 2.0)
                 (if (<= z 6.2e-233)
                   t_1
                   (if (<= z 3e-70) (* x 2.0) t_2)))))))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 27.0 * (a * b);
	double t_2 = -9.0 * (t * (z * y));
	double tmp;
	if (z <= -2.15e-38) {
		tmp = t_2;
	} else if (z <= -5.1e-86) {
		tmp = x * 2.0;
	} else if (z <= -2.25e-163) {
		tmp = t_1;
	} else if (z <= -7e-195) {
		tmp = x * 2.0;
	} else if (z <= -7.2e-203) {
		tmp = t_2;
	} else if (z <= 1e-295) {
		tmp = b * (a * 27.0);
	} else if (z <= 5.5e-243) {
		tmp = x * 2.0;
	} else if (z <= 6.2e-233) {
		tmp = t_1;
	} else if (z <= 3e-70) {
		tmp = x * 2.0;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = 27.0d0 * (a * b)
    t_2 = (-9.0d0) * (t * (z * y))
    if (z <= (-2.15d-38)) then
        tmp = t_2
    else if (z <= (-5.1d-86)) then
        tmp = x * 2.0d0
    else if (z <= (-2.25d-163)) then
        tmp = t_1
    else if (z <= (-7d-195)) then
        tmp = x * 2.0d0
    else if (z <= (-7.2d-203)) then
        tmp = t_2
    else if (z <= 1d-295) then
        tmp = b * (a * 27.0d0)
    else if (z <= 5.5d-243) then
        tmp = x * 2.0d0
    else if (z <= 6.2d-233) then
        tmp = t_1
    else if (z <= 3d-70) then
        tmp = x * 2.0d0
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 27.0 * (a * b);
	double t_2 = -9.0 * (t * (z * y));
	double tmp;
	if (z <= -2.15e-38) {
		tmp = t_2;
	} else if (z <= -5.1e-86) {
		tmp = x * 2.0;
	} else if (z <= -2.25e-163) {
		tmp = t_1;
	} else if (z <= -7e-195) {
		tmp = x * 2.0;
	} else if (z <= -7.2e-203) {
		tmp = t_2;
	} else if (z <= 1e-295) {
		tmp = b * (a * 27.0);
	} else if (z <= 5.5e-243) {
		tmp = x * 2.0;
	} else if (z <= 6.2e-233) {
		tmp = t_1;
	} else if (z <= 3e-70) {
		tmp = x * 2.0;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = 27.0 * (a * b)
	t_2 = -9.0 * (t * (z * y))
	tmp = 0
	if z <= -2.15e-38:
		tmp = t_2
	elif z <= -5.1e-86:
		tmp = x * 2.0
	elif z <= -2.25e-163:
		tmp = t_1
	elif z <= -7e-195:
		tmp = x * 2.0
	elif z <= -7.2e-203:
		tmp = t_2
	elif z <= 1e-295:
		tmp = b * (a * 27.0)
	elif z <= 5.5e-243:
		tmp = x * 2.0
	elif z <= 6.2e-233:
		tmp = t_1
	elif z <= 3e-70:
		tmp = x * 2.0
	else:
		tmp = t_2
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(27.0 * Float64(a * b))
	t_2 = Float64(-9.0 * Float64(t * Float64(z * y)))
	tmp = 0.0
	if (z <= -2.15e-38)
		tmp = t_2;
	elseif (z <= -5.1e-86)
		tmp = Float64(x * 2.0);
	elseif (z <= -2.25e-163)
		tmp = t_1;
	elseif (z <= -7e-195)
		tmp = Float64(x * 2.0);
	elseif (z <= -7.2e-203)
		tmp = t_2;
	elseif (z <= 1e-295)
		tmp = Float64(b * Float64(a * 27.0));
	elseif (z <= 5.5e-243)
		tmp = Float64(x * 2.0);
	elseif (z <= 6.2e-233)
		tmp = t_1;
	elseif (z <= 3e-70)
		tmp = Float64(x * 2.0);
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = 27.0 * (a * b);
	t_2 = -9.0 * (t * (z * y));
	tmp = 0.0;
	if (z <= -2.15e-38)
		tmp = t_2;
	elseif (z <= -5.1e-86)
		tmp = x * 2.0;
	elseif (z <= -2.25e-163)
		tmp = t_1;
	elseif (z <= -7e-195)
		tmp = x * 2.0;
	elseif (z <= -7.2e-203)
		tmp = t_2;
	elseif (z <= 1e-295)
		tmp = b * (a * 27.0);
	elseif (z <= 5.5e-243)
		tmp = x * 2.0;
	elseif (z <= 6.2e-233)
		tmp = t_1;
	elseif (z <= 3e-70)
		tmp = x * 2.0;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-9.0 * N[(t * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -2.15e-38], t$95$2, If[LessEqual[z, -5.1e-86], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, -2.25e-163], t$95$1, If[LessEqual[z, -7e-195], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, -7.2e-203], t$95$2, If[LessEqual[z, 1e-295], N[(b * N[(a * 27.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 5.5e-243], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, 6.2e-233], t$95$1, If[LessEqual[z, 3e-70], N[(x * 2.0), $MachinePrecision], t$95$2]]]]]]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 4: 48.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := 27 \cdot \left(a \cdot b\right)\\ t_2 := t \cdot \left(y \cdot \left(z \cdot -9\right)\right)\\ \mathbf{if}\;z \leq -2.9 \cdot 10^{-38}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;z \leq -5.6 \cdot 10^{-86}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq -3.25 \cdot 10^{-164}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;z \leq -1.7 \cdot 10^{-195}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq -7.2 \cdot 10^{-203}:\\ \;\;\;\;-9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \mathbf{elif}\;z \leq 2.7 \cdot 10^{-293}:\\ \;\;\;\;b \cdot \left(a \cdot 27\right)\\ \mathbf{elif}\;z \leq 7.1 \cdot 10^{-242}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq 5.4 \cdot 10^{-232}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;z \leq 8 \cdot 10^{-71}:\\ \;\;\;\;x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;t_2\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* 27.0 (* a b))) (t_2 (* t (* y (* z -9.0)))))
   (if (<= z -2.9e-38)
     t_2
     (if (<= z -5.6e-86)
       (* x 2.0)
       (if (<= z -3.25e-164)
         t_1
         (if (<= z -1.7e-195)
           (* x 2.0)
           (if (<= z -7.2e-203)
             (* -9.0 (* t (* z y)))
             (if (<= z 2.7e-293)
               (* b (* a 27.0))
               (if (<= z 7.1e-242)
                 (* x 2.0)
                 (if (<= z 5.4e-232)
                   t_1
                   (if (<= z 8e-71) (* x 2.0) t_2)))))))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 27.0 * (a * b);
	double t_2 = t * (y * (z * -9.0));
	double tmp;
	if (z <= -2.9e-38) {
		tmp = t_2;
	} else if (z <= -5.6e-86) {
		tmp = x * 2.0;
	} else if (z <= -3.25e-164) {
		tmp = t_1;
	} else if (z <= -1.7e-195) {
		tmp = x * 2.0;
	} else if (z <= -7.2e-203) {
		tmp = -9.0 * (t * (z * y));
	} else if (z <= 2.7e-293) {
		tmp = b * (a * 27.0);
	} else if (z <= 7.1e-242) {
		tmp = x * 2.0;
	} else if (z <= 5.4e-232) {
		tmp = t_1;
	} else if (z <= 8e-71) {
		tmp = x * 2.0;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = 27.0d0 * (a * b)
    t_2 = t * (y * (z * (-9.0d0)))
    if (z <= (-2.9d-38)) then
        tmp = t_2
    else if (z <= (-5.6d-86)) then
        tmp = x * 2.0d0
    else if (z <= (-3.25d-164)) then
        tmp = t_1
    else if (z <= (-1.7d-195)) then
        tmp = x * 2.0d0
    else if (z <= (-7.2d-203)) then
        tmp = (-9.0d0) * (t * (z * y))
    else if (z <= 2.7d-293) then
        tmp = b * (a * 27.0d0)
    else if (z <= 7.1d-242) then
        tmp = x * 2.0d0
    else if (z <= 5.4d-232) then
        tmp = t_1
    else if (z <= 8d-71) then
        tmp = x * 2.0d0
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 27.0 * (a * b);
	double t_2 = t * (y * (z * -9.0));
	double tmp;
	if (z <= -2.9e-38) {
		tmp = t_2;
	} else if (z <= -5.6e-86) {
		tmp = x * 2.0;
	} else if (z <= -3.25e-164) {
		tmp = t_1;
	} else if (z <= -1.7e-195) {
		tmp = x * 2.0;
	} else if (z <= -7.2e-203) {
		tmp = -9.0 * (t * (z * y));
	} else if (z <= 2.7e-293) {
		tmp = b * (a * 27.0);
	} else if (z <= 7.1e-242) {
		tmp = x * 2.0;
	} else if (z <= 5.4e-232) {
		tmp = t_1;
	} else if (z <= 8e-71) {
		tmp = x * 2.0;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = 27.0 * (a * b)
	t_2 = t * (y * (z * -9.0))
	tmp = 0
	if z <= -2.9e-38:
		tmp = t_2
	elif z <= -5.6e-86:
		tmp = x * 2.0
	elif z <= -3.25e-164:
		tmp = t_1
	elif z <= -1.7e-195:
		tmp = x * 2.0
	elif z <= -7.2e-203:
		tmp = -9.0 * (t * (z * y))
	elif z <= 2.7e-293:
		tmp = b * (a * 27.0)
	elif z <= 7.1e-242:
		tmp = x * 2.0
	elif z <= 5.4e-232:
		tmp = t_1
	elif z <= 8e-71:
		tmp = x * 2.0
	else:
		tmp = t_2
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(27.0 * Float64(a * b))
	t_2 = Float64(t * Float64(y * Float64(z * -9.0)))
	tmp = 0.0
	if (z <= -2.9e-38)
		tmp = t_2;
	elseif (z <= -5.6e-86)
		tmp = Float64(x * 2.0);
	elseif (z <= -3.25e-164)
		tmp = t_1;
	elseif (z <= -1.7e-195)
		tmp = Float64(x * 2.0);
	elseif (z <= -7.2e-203)
		tmp = Float64(-9.0 * Float64(t * Float64(z * y)));
	elseif (z <= 2.7e-293)
		tmp = Float64(b * Float64(a * 27.0));
	elseif (z <= 7.1e-242)
		tmp = Float64(x * 2.0);
	elseif (z <= 5.4e-232)
		tmp = t_1;
	elseif (z <= 8e-71)
		tmp = Float64(x * 2.0);
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = 27.0 * (a * b);
	t_2 = t * (y * (z * -9.0));
	tmp = 0.0;
	if (z <= -2.9e-38)
		tmp = t_2;
	elseif (z <= -5.6e-86)
		tmp = x * 2.0;
	elseif (z <= -3.25e-164)
		tmp = t_1;
	elseif (z <= -1.7e-195)
		tmp = x * 2.0;
	elseif (z <= -7.2e-203)
		tmp = -9.0 * (t * (z * y));
	elseif (z <= 2.7e-293)
		tmp = b * (a * 27.0);
	elseif (z <= 7.1e-242)
		tmp = x * 2.0;
	elseif (z <= 5.4e-232)
		tmp = t_1;
	elseif (z <= 8e-71)
		tmp = x * 2.0;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(y * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -2.9e-38], t$95$2, If[LessEqual[z, -5.6e-86], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, -3.25e-164], t$95$1, If[LessEqual[z, -1.7e-195], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, -7.2e-203], N[(-9.0 * N[(t * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.7e-293], N[(b * N[(a * 27.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 7.1e-242], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, 5.4e-232], t$95$1, If[LessEqual[z, 8e-71], N[(x * 2.0), $MachinePrecision], t$95$2]]]]]]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 5: 50.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := 27 \cdot \left(a \cdot b\right)\\ t_2 := y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\\ \mathbf{if}\;z \leq -3 \cdot 10^{-38}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;z \leq -5.2 \cdot 10^{-86}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq -5.8 \cdot 10^{-163}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;z \leq -2.3 \cdot 10^{-194}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq -7.2 \cdot 10^{-203}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;z \leq 7.8 \cdot 10^{-295}:\\ \;\;\;\;b \cdot \left(a \cdot 27\right)\\ \mathbf{elif}\;z \leq 1.5 \cdot 10^{-242}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq 6.2 \cdot 10^{-233}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;z \leq 9 \cdot 10^{-71}:\\ \;\;\;\;x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;t \cdot \left(y \cdot \left(z \cdot -9\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* 27.0 (* a b))) (t_2 (* y (* t (* z -9.0)))))
   (if (<= z -3e-38)
     t_2
     (if (<= z -5.2e-86)
       (* x 2.0)
       (if (<= z -5.8e-163)
         t_1
         (if (<= z -2.3e-194)
           (* x 2.0)
           (if (<= z -7.2e-203)
             t_2
             (if (<= z 7.8e-295)
               (* b (* a 27.0))
               (if (<= z 1.5e-242)
                 (* x 2.0)
                 (if (<= z 6.2e-233)
                   t_1
                   (if (<= z 9e-71) (* x 2.0) (* t (* y (* z -9.0))))))))))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 27.0 * (a * b);
	double t_2 = y * (t * (z * -9.0));
	double tmp;
	if (z <= -3e-38) {
		tmp = t_2;
	} else if (z <= -5.2e-86) {
		tmp = x * 2.0;
	} else if (z <= -5.8e-163) {
		tmp = t_1;
	} else if (z <= -2.3e-194) {
		tmp = x * 2.0;
	} else if (z <= -7.2e-203) {
		tmp = t_2;
	} else if (z <= 7.8e-295) {
		tmp = b * (a * 27.0);
	} else if (z <= 1.5e-242) {
		tmp = x * 2.0;
	} else if (z <= 6.2e-233) {
		tmp = t_1;
	} else if (z <= 9e-71) {
		tmp = x * 2.0;
	} else {
		tmp = t * (y * (z * -9.0));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = 27.0d0 * (a * b)
    t_2 = y * (t * (z * (-9.0d0)))
    if (z <= (-3d-38)) then
        tmp = t_2
    else if (z <= (-5.2d-86)) then
        tmp = x * 2.0d0
    else if (z <= (-5.8d-163)) then
        tmp = t_1
    else if (z <= (-2.3d-194)) then
        tmp = x * 2.0d0
    else if (z <= (-7.2d-203)) then
        tmp = t_2
    else if (z <= 7.8d-295) then
        tmp = b * (a * 27.0d0)
    else if (z <= 1.5d-242) then
        tmp = x * 2.0d0
    else if (z <= 6.2d-233) then
        tmp = t_1
    else if (z <= 9d-71) then
        tmp = x * 2.0d0
    else
        tmp = t * (y * (z * (-9.0d0)))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 27.0 * (a * b);
	double t_2 = y * (t * (z * -9.0));
	double tmp;
	if (z <= -3e-38) {
		tmp = t_2;
	} else if (z <= -5.2e-86) {
		tmp = x * 2.0;
	} else if (z <= -5.8e-163) {
		tmp = t_1;
	} else if (z <= -2.3e-194) {
		tmp = x * 2.0;
	} else if (z <= -7.2e-203) {
		tmp = t_2;
	} else if (z <= 7.8e-295) {
		tmp = b * (a * 27.0);
	} else if (z <= 1.5e-242) {
		tmp = x * 2.0;
	} else if (z <= 6.2e-233) {
		tmp = t_1;
	} else if (z <= 9e-71) {
		tmp = x * 2.0;
	} else {
		tmp = t * (y * (z * -9.0));
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = 27.0 * (a * b)
	t_2 = y * (t * (z * -9.0))
	tmp = 0
	if z <= -3e-38:
		tmp = t_2
	elif z <= -5.2e-86:
		tmp = x * 2.0
	elif z <= -5.8e-163:
		tmp = t_1
	elif z <= -2.3e-194:
		tmp = x * 2.0
	elif z <= -7.2e-203:
		tmp = t_2
	elif z <= 7.8e-295:
		tmp = b * (a * 27.0)
	elif z <= 1.5e-242:
		tmp = x * 2.0
	elif z <= 6.2e-233:
		tmp = t_1
	elif z <= 9e-71:
		tmp = x * 2.0
	else:
		tmp = t * (y * (z * -9.0))
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(27.0 * Float64(a * b))
	t_2 = Float64(y * Float64(t * Float64(z * -9.0)))
	tmp = 0.0
	if (z <= -3e-38)
		tmp = t_2;
	elseif (z <= -5.2e-86)
		tmp = Float64(x * 2.0);
	elseif (z <= -5.8e-163)
		tmp = t_1;
	elseif (z <= -2.3e-194)
		tmp = Float64(x * 2.0);
	elseif (z <= -7.2e-203)
		tmp = t_2;
	elseif (z <= 7.8e-295)
		tmp = Float64(b * Float64(a * 27.0));
	elseif (z <= 1.5e-242)
		tmp = Float64(x * 2.0);
	elseif (z <= 6.2e-233)
		tmp = t_1;
	elseif (z <= 9e-71)
		tmp = Float64(x * 2.0);
	else
		tmp = Float64(t * Float64(y * Float64(z * -9.0)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = 27.0 * (a * b);
	t_2 = y * (t * (z * -9.0));
	tmp = 0.0;
	if (z <= -3e-38)
		tmp = t_2;
	elseif (z <= -5.2e-86)
		tmp = x * 2.0;
	elseif (z <= -5.8e-163)
		tmp = t_1;
	elseif (z <= -2.3e-194)
		tmp = x * 2.0;
	elseif (z <= -7.2e-203)
		tmp = t_2;
	elseif (z <= 7.8e-295)
		tmp = b * (a * 27.0);
	elseif (z <= 1.5e-242)
		tmp = x * 2.0;
	elseif (z <= 6.2e-233)
		tmp = t_1;
	elseif (z <= 9e-71)
		tmp = x * 2.0;
	else
		tmp = t * (y * (z * -9.0));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(y * N[(t * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -3e-38], t$95$2, If[LessEqual[z, -5.2e-86], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, -5.8e-163], t$95$1, If[LessEqual[z, -2.3e-194], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, -7.2e-203], t$95$2, If[LessEqual[z, 7.8e-295], N[(b * N[(a * 27.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.5e-242], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, 6.2e-233], t$95$1, If[LessEqual[z, 9e-71], N[(x * 2.0), $MachinePrecision], N[(t * N[(y * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 6: 50.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := 27 \cdot \left(a \cdot b\right)\\ \mathbf{if}\;z \leq -1.65 \cdot 10^{-38}:\\ \;\;\;\;-9 \cdot \left(z \cdot \left(y \cdot t\right)\right)\\ \mathbf{elif}\;z \leq -4.5 \cdot 10^{-86}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq -2.8 \cdot 10^{-165}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;z \leq -3.3 \cdot 10^{-195}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq -7 \cdot 10^{-204}:\\ \;\;\;\;y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\\ \mathbf{elif}\;z \leq 1.6 \cdot 10^{-295}:\\ \;\;\;\;b \cdot \left(a \cdot 27\right)\\ \mathbf{elif}\;z \leq 9 \cdot 10^{-242}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq 6.6 \cdot 10^{-232}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;z \leq 6.5 \cdot 10^{-70}:\\ \;\;\;\;x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;t \cdot \left(y \cdot \left(z \cdot -9\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* 27.0 (* a b))))
   (if (<= z -1.65e-38)
     (* -9.0 (* z (* y t)))
     (if (<= z -4.5e-86)
       (* x 2.0)
       (if (<= z -2.8e-165)
         t_1
         (if (<= z -3.3e-195)
           (* x 2.0)
           (if (<= z -7e-204)
             (* y (* t (* z -9.0)))
             (if (<= z 1.6e-295)
               (* b (* a 27.0))
               (if (<= z 9e-242)
                 (* x 2.0)
                 (if (<= z 6.6e-232)
                   t_1
                   (if (<= z 6.5e-70)
                     (* x 2.0)
                     (* t (* y (* z -9.0))))))))))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 27.0 * (a * b);
	double tmp;
	if (z <= -1.65e-38) {
		tmp = -9.0 * (z * (y * t));
	} else if (z <= -4.5e-86) {
		tmp = x * 2.0;
	} else if (z <= -2.8e-165) {
		tmp = t_1;
	} else if (z <= -3.3e-195) {
		tmp = x * 2.0;
	} else if (z <= -7e-204) {
		tmp = y * (t * (z * -9.0));
	} else if (z <= 1.6e-295) {
		tmp = b * (a * 27.0);
	} else if (z <= 9e-242) {
		tmp = x * 2.0;
	} else if (z <= 6.6e-232) {
		tmp = t_1;
	} else if (z <= 6.5e-70) {
		tmp = x * 2.0;
	} else {
		tmp = t * (y * (z * -9.0));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = 27.0d0 * (a * b)
    if (z <= (-1.65d-38)) then
        tmp = (-9.0d0) * (z * (y * t))
    else if (z <= (-4.5d-86)) then
        tmp = x * 2.0d0
    else if (z <= (-2.8d-165)) then
        tmp = t_1
    else if (z <= (-3.3d-195)) then
        tmp = x * 2.0d0
    else if (z <= (-7d-204)) then
        tmp = y * (t * (z * (-9.0d0)))
    else if (z <= 1.6d-295) then
        tmp = b * (a * 27.0d0)
    else if (z <= 9d-242) then
        tmp = x * 2.0d0
    else if (z <= 6.6d-232) then
        tmp = t_1
    else if (z <= 6.5d-70) then
        tmp = x * 2.0d0
    else
        tmp = t * (y * (z * (-9.0d0)))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 27.0 * (a * b);
	double tmp;
	if (z <= -1.65e-38) {
		tmp = -9.0 * (z * (y * t));
	} else if (z <= -4.5e-86) {
		tmp = x * 2.0;
	} else if (z <= -2.8e-165) {
		tmp = t_1;
	} else if (z <= -3.3e-195) {
		tmp = x * 2.0;
	} else if (z <= -7e-204) {
		tmp = y * (t * (z * -9.0));
	} else if (z <= 1.6e-295) {
		tmp = b * (a * 27.0);
	} else if (z <= 9e-242) {
		tmp = x * 2.0;
	} else if (z <= 6.6e-232) {
		tmp = t_1;
	} else if (z <= 6.5e-70) {
		tmp = x * 2.0;
	} else {
		tmp = t * (y * (z * -9.0));
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = 27.0 * (a * b)
	tmp = 0
	if z <= -1.65e-38:
		tmp = -9.0 * (z * (y * t))
	elif z <= -4.5e-86:
		tmp = x * 2.0
	elif z <= -2.8e-165:
		tmp = t_1
	elif z <= -3.3e-195:
		tmp = x * 2.0
	elif z <= -7e-204:
		tmp = y * (t * (z * -9.0))
	elif z <= 1.6e-295:
		tmp = b * (a * 27.0)
	elif z <= 9e-242:
		tmp = x * 2.0
	elif z <= 6.6e-232:
		tmp = t_1
	elif z <= 6.5e-70:
		tmp = x * 2.0
	else:
		tmp = t * (y * (z * -9.0))
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(27.0 * Float64(a * b))
	tmp = 0.0
	if (z <= -1.65e-38)
		tmp = Float64(-9.0 * Float64(z * Float64(y * t)));
	elseif (z <= -4.5e-86)
		tmp = Float64(x * 2.0);
	elseif (z <= -2.8e-165)
		tmp = t_1;
	elseif (z <= -3.3e-195)
		tmp = Float64(x * 2.0);
	elseif (z <= -7e-204)
		tmp = Float64(y * Float64(t * Float64(z * -9.0)));
	elseif (z <= 1.6e-295)
		tmp = Float64(b * Float64(a * 27.0));
	elseif (z <= 9e-242)
		tmp = Float64(x * 2.0);
	elseif (z <= 6.6e-232)
		tmp = t_1;
	elseif (z <= 6.5e-70)
		tmp = Float64(x * 2.0);
	else
		tmp = Float64(t * Float64(y * Float64(z * -9.0)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = 27.0 * (a * b);
	tmp = 0.0;
	if (z <= -1.65e-38)
		tmp = -9.0 * (z * (y * t));
	elseif (z <= -4.5e-86)
		tmp = x * 2.0;
	elseif (z <= -2.8e-165)
		tmp = t_1;
	elseif (z <= -3.3e-195)
		tmp = x * 2.0;
	elseif (z <= -7e-204)
		tmp = y * (t * (z * -9.0));
	elseif (z <= 1.6e-295)
		tmp = b * (a * 27.0);
	elseif (z <= 9e-242)
		tmp = x * 2.0;
	elseif (z <= 6.6e-232)
		tmp = t_1;
	elseif (z <= 6.5e-70)
		tmp = x * 2.0;
	else
		tmp = t * (y * (z * -9.0));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.65e-38], N[(-9.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -4.5e-86], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, -2.8e-165], t$95$1, If[LessEqual[z, -3.3e-195], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, -7e-204], N[(y * N[(t * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.6e-295], N[(b * N[(a * 27.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 9e-242], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, 6.6e-232], t$95$1, If[LessEqual[z, 6.5e-70], N[(x * 2.0), $MachinePrecision], N[(t * N[(y * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 7: 50.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := 27 \cdot \left(a \cdot b\right)\\ \mathbf{if}\;z \leq -5.2 \cdot 10^{-38}:\\ \;\;\;\;z \cdot \left(t \cdot \left(y \cdot -9\right)\right)\\ \mathbf{elif}\;z \leq -3.8 \cdot 10^{-86}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq -4.4 \cdot 10^{-166}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;z \leq -2.5 \cdot 10^{-195}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq -2.25 \cdot 10^{-203}:\\ \;\;\;\;y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\\ \mathbf{elif}\;z \leq 1.16 \cdot 10^{-295}:\\ \;\;\;\;b \cdot \left(a \cdot 27\right)\\ \mathbf{elif}\;z \leq 6 \cdot 10^{-242}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq 7.8 \cdot 10^{-233}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;z \leq 1.7 \cdot 10^{-70}:\\ \;\;\;\;x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;t \cdot \left(y \cdot \left(z \cdot -9\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* 27.0 (* a b))))
   (if (<= z -5.2e-38)
     (* z (* t (* y -9.0)))
     (if (<= z -3.8e-86)
       (* x 2.0)
       (if (<= z -4.4e-166)
         t_1
         (if (<= z -2.5e-195)
           (* x 2.0)
           (if (<= z -2.25e-203)
             (* y (* t (* z -9.0)))
             (if (<= z 1.16e-295)
               (* b (* a 27.0))
               (if (<= z 6e-242)
                 (* x 2.0)
                 (if (<= z 7.8e-233)
                   t_1
                   (if (<= z 1.7e-70)
                     (* x 2.0)
                     (* t (* y (* z -9.0))))))))))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 27.0 * (a * b);
	double tmp;
	if (z <= -5.2e-38) {
		tmp = z * (t * (y * -9.0));
	} else if (z <= -3.8e-86) {
		tmp = x * 2.0;
	} else if (z <= -4.4e-166) {
		tmp = t_1;
	} else if (z <= -2.5e-195) {
		tmp = x * 2.0;
	} else if (z <= -2.25e-203) {
		tmp = y * (t * (z * -9.0));
	} else if (z <= 1.16e-295) {
		tmp = b * (a * 27.0);
	} else if (z <= 6e-242) {
		tmp = x * 2.0;
	} else if (z <= 7.8e-233) {
		tmp = t_1;
	} else if (z <= 1.7e-70) {
		tmp = x * 2.0;
	} else {
		tmp = t * (y * (z * -9.0));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = 27.0d0 * (a * b)
    if (z <= (-5.2d-38)) then
        tmp = z * (t * (y * (-9.0d0)))
    else if (z <= (-3.8d-86)) then
        tmp = x * 2.0d0
    else if (z <= (-4.4d-166)) then
        tmp = t_1
    else if (z <= (-2.5d-195)) then
        tmp = x * 2.0d0
    else if (z <= (-2.25d-203)) then
        tmp = y * (t * (z * (-9.0d0)))
    else if (z <= 1.16d-295) then
        tmp = b * (a * 27.0d0)
    else if (z <= 6d-242) then
        tmp = x * 2.0d0
    else if (z <= 7.8d-233) then
        tmp = t_1
    else if (z <= 1.7d-70) then
        tmp = x * 2.0d0
    else
        tmp = t * (y * (z * (-9.0d0)))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 27.0 * (a * b);
	double tmp;
	if (z <= -5.2e-38) {
		tmp = z * (t * (y * -9.0));
	} else if (z <= -3.8e-86) {
		tmp = x * 2.0;
	} else if (z <= -4.4e-166) {
		tmp = t_1;
	} else if (z <= -2.5e-195) {
		tmp = x * 2.0;
	} else if (z <= -2.25e-203) {
		tmp = y * (t * (z * -9.0));
	} else if (z <= 1.16e-295) {
		tmp = b * (a * 27.0);
	} else if (z <= 6e-242) {
		tmp = x * 2.0;
	} else if (z <= 7.8e-233) {
		tmp = t_1;
	} else if (z <= 1.7e-70) {
		tmp = x * 2.0;
	} else {
		tmp = t * (y * (z * -9.0));
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = 27.0 * (a * b)
	tmp = 0
	if z <= -5.2e-38:
		tmp = z * (t * (y * -9.0))
	elif z <= -3.8e-86:
		tmp = x * 2.0
	elif z <= -4.4e-166:
		tmp = t_1
	elif z <= -2.5e-195:
		tmp = x * 2.0
	elif z <= -2.25e-203:
		tmp = y * (t * (z * -9.0))
	elif z <= 1.16e-295:
		tmp = b * (a * 27.0)
	elif z <= 6e-242:
		tmp = x * 2.0
	elif z <= 7.8e-233:
		tmp = t_1
	elif z <= 1.7e-70:
		tmp = x * 2.0
	else:
		tmp = t * (y * (z * -9.0))
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(27.0 * Float64(a * b))
	tmp = 0.0
	if (z <= -5.2e-38)
		tmp = Float64(z * Float64(t * Float64(y * -9.0)));
	elseif (z <= -3.8e-86)
		tmp = Float64(x * 2.0);
	elseif (z <= -4.4e-166)
		tmp = t_1;
	elseif (z <= -2.5e-195)
		tmp = Float64(x * 2.0);
	elseif (z <= -2.25e-203)
		tmp = Float64(y * Float64(t * Float64(z * -9.0)));
	elseif (z <= 1.16e-295)
		tmp = Float64(b * Float64(a * 27.0));
	elseif (z <= 6e-242)
		tmp = Float64(x * 2.0);
	elseif (z <= 7.8e-233)
		tmp = t_1;
	elseif (z <= 1.7e-70)
		tmp = Float64(x * 2.0);
	else
		tmp = Float64(t * Float64(y * Float64(z * -9.0)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = 27.0 * (a * b);
	tmp = 0.0;
	if (z <= -5.2e-38)
		tmp = z * (t * (y * -9.0));
	elseif (z <= -3.8e-86)
		tmp = x * 2.0;
	elseif (z <= -4.4e-166)
		tmp = t_1;
	elseif (z <= -2.5e-195)
		tmp = x * 2.0;
	elseif (z <= -2.25e-203)
		tmp = y * (t * (z * -9.0));
	elseif (z <= 1.16e-295)
		tmp = b * (a * 27.0);
	elseif (z <= 6e-242)
		tmp = x * 2.0;
	elseif (z <= 7.8e-233)
		tmp = t_1;
	elseif (z <= 1.7e-70)
		tmp = x * 2.0;
	else
		tmp = t * (y * (z * -9.0));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -5.2e-38], N[(z * N[(t * N[(y * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -3.8e-86], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, -4.4e-166], t$95$1, If[LessEqual[z, -2.5e-195], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, -2.25e-203], N[(y * N[(t * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.16e-295], N[(b * N[(a * 27.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 6e-242], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, 7.8e-233], t$95$1, If[LessEqual[z, 1.7e-70], N[(x * 2.0), $MachinePrecision], N[(t * N[(y * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 8: 77.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := 27 \cdot \left(a \cdot b\right) + x \cdot 2\\ \mathbf{if}\;z \leq -4 \cdot 10^{-76}:\\ \;\;\;\;x \cdot 2 - 9 \cdot \left(z \cdot \left(y \cdot t\right)\right)\\ \mathbf{elif}\;z \leq 4.5 \cdot 10^{-213}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;z \leq 8.5 \cdot 10^{-69}:\\ \;\;\;\;x \cdot 2 + t \cdot \left(z \cdot \left(y \cdot -9\right)\right)\\ \mathbf{elif}\;z \leq 1.7 \cdot 10^{-36}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;a \cdot \left(27 \cdot b\right) + t \cdot \left(y \cdot \left(z \cdot -9\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (+ (* 27.0 (* a b)) (* x 2.0))))
   (if (<= z -4e-76)
     (- (* x 2.0) (* 9.0 (* z (* y t))))
     (if (<= z 4.5e-213)
       t_1
       (if (<= z 8.5e-69)
         (+ (* x 2.0) (* t (* z (* y -9.0))))
         (if (<= z 1.7e-36)
           t_1
           (+ (* a (* 27.0 b)) (* t (* y (* z -9.0))))))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (27.0 * (a * b)) + (x * 2.0);
	double tmp;
	if (z <= -4e-76) {
		tmp = (x * 2.0) - (9.0 * (z * (y * t)));
	} else if (z <= 4.5e-213) {
		tmp = t_1;
	} else if (z <= 8.5e-69) {
		tmp = (x * 2.0) + (t * (z * (y * -9.0)));
	} else if (z <= 1.7e-36) {
		tmp = t_1;
	} else {
		tmp = (a * (27.0 * b)) + (t * (y * (z * -9.0)));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (27.0d0 * (a * b)) + (x * 2.0d0)
    if (z <= (-4d-76)) then
        tmp = (x * 2.0d0) - (9.0d0 * (z * (y * t)))
    else if (z <= 4.5d-213) then
        tmp = t_1
    else if (z <= 8.5d-69) then
        tmp = (x * 2.0d0) + (t * (z * (y * (-9.0d0))))
    else if (z <= 1.7d-36) then
        tmp = t_1
    else
        tmp = (a * (27.0d0 * b)) + (t * (y * (z * (-9.0d0))))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (27.0 * (a * b)) + (x * 2.0);
	double tmp;
	if (z <= -4e-76) {
		tmp = (x * 2.0) - (9.0 * (z * (y * t)));
	} else if (z <= 4.5e-213) {
		tmp = t_1;
	} else if (z <= 8.5e-69) {
		tmp = (x * 2.0) + (t * (z * (y * -9.0)));
	} else if (z <= 1.7e-36) {
		tmp = t_1;
	} else {
		tmp = (a * (27.0 * b)) + (t * (y * (z * -9.0)));
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = (27.0 * (a * b)) + (x * 2.0)
	tmp = 0
	if z <= -4e-76:
		tmp = (x * 2.0) - (9.0 * (z * (y * t)))
	elif z <= 4.5e-213:
		tmp = t_1
	elif z <= 8.5e-69:
		tmp = (x * 2.0) + (t * (z * (y * -9.0)))
	elif z <= 1.7e-36:
		tmp = t_1
	else:
		tmp = (a * (27.0 * b)) + (t * (y * (z * -9.0)))
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(27.0 * Float64(a * b)) + Float64(x * 2.0))
	tmp = 0.0
	if (z <= -4e-76)
		tmp = Float64(Float64(x * 2.0) - Float64(9.0 * Float64(z * Float64(y * t))));
	elseif (z <= 4.5e-213)
		tmp = t_1;
	elseif (z <= 8.5e-69)
		tmp = Float64(Float64(x * 2.0) + Float64(t * Float64(z * Float64(y * -9.0))));
	elseif (z <= 1.7e-36)
		tmp = t_1;
	else
		tmp = Float64(Float64(a * Float64(27.0 * b)) + Float64(t * Float64(y * Float64(z * -9.0))));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = (27.0 * (a * b)) + (x * 2.0);
	tmp = 0.0;
	if (z <= -4e-76)
		tmp = (x * 2.0) - (9.0 * (z * (y * t)));
	elseif (z <= 4.5e-213)
		tmp = t_1;
	elseif (z <= 8.5e-69)
		tmp = (x * 2.0) + (t * (z * (y * -9.0)));
	elseif (z <= 1.7e-36)
		tmp = t_1;
	else
		tmp = (a * (27.0 * b)) + (t * (y * (z * -9.0)));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 9: 97.1% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := a \cdot \left(27 \cdot b\right)\\ \mathbf{if}\;z \leq 2 \cdot 10^{+71}:\\ \;\;\;\;\left(x \cdot 2 - \left(y \cdot 9\right) \cdot \left(z \cdot t\right)\right) + t_1\\ \mathbf{else}:\\ \;\;\;\;t_1 + t \cdot \left(y \cdot \left(z \cdot -9\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* a (* 27.0 b))))
   (if (<= z 2e+71)
     (+ (- (* x 2.0) (* (* y 9.0) (* z t))) t_1)
     (+ t_1 (* t (* y (* z -9.0)))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = a * (27.0 * b);
	double tmp;
	if (z <= 2e+71) {
		tmp = ((x * 2.0) - ((y * 9.0) * (z * t))) + t_1;
	} else {
		tmp = t_1 + (t * (y * (z * -9.0)));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = a * (27.0d0 * b)
    if (z <= 2d+71) then
        tmp = ((x * 2.0d0) - ((y * 9.0d0) * (z * t))) + t_1
    else
        tmp = t_1 + (t * (y * (z * (-9.0d0))))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = a * (27.0 * b);
	double tmp;
	if (z <= 2e+71) {
		tmp = ((x * 2.0) - ((y * 9.0) * (z * t))) + t_1;
	} else {
		tmp = t_1 + (t * (y * (z * -9.0)));
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = a * (27.0 * b)
	tmp = 0
	if z <= 2e+71:
		tmp = ((x * 2.0) - ((y * 9.0) * (z * t))) + t_1
	else:
		tmp = t_1 + (t * (y * (z * -9.0)))
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(a * Float64(27.0 * b))
	tmp = 0.0
	if (z <= 2e+71)
		tmp = Float64(Float64(Float64(x * 2.0) - Float64(Float64(y * 9.0) * Float64(z * t))) + t_1);
	else
		tmp = Float64(t_1 + Float64(t * Float64(y * Float64(z * -9.0))));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = a * (27.0 * b);
	tmp = 0.0;
	if (z <= 2e+71)
		tmp = ((x * 2.0) - ((y * 9.0) * (z * t))) + t_1;
	else
		tmp = t_1 + (t * (y * (z * -9.0)));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 10: 98.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -1.55 \cdot 10^{-253}:\\ \;\;\;\;\left(x \cdot 2 - \left(y \cdot 9\right) \cdot \left(z \cdot t\right)\right) + a \cdot \left(27 \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x \cdot 2 - t \cdot \left(z \cdot \left(y \cdot 9\right)\right)\right) + b \cdot \left(a \cdot 27\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -1.55e-253)
   (+ (- (* x 2.0) (* (* y 9.0) (* z t))) (* a (* 27.0 b)))
   (+ (- (* x 2.0) (* t (* z (* y 9.0)))) (* b (* a 27.0)))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -1.55e-253) {
		tmp = ((x * 2.0) - ((y * 9.0) * (z * t))) + (a * (27.0 * b));
	} else {
		tmp = ((x * 2.0) - (t * (z * (y * 9.0)))) + (b * (a * 27.0));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    real(8) :: tmp
    if (z <= (-1.55d-253)) then
        tmp = ((x * 2.0d0) - ((y * 9.0d0) * (z * t))) + (a * (27.0d0 * b))
    else
        tmp = ((x * 2.0d0) - (t * (z * (y * 9.0d0)))) + (b * (a * 27.0d0))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -1.55e-253) {
		tmp = ((x * 2.0) - ((y * 9.0) * (z * t))) + (a * (27.0 * b));
	} else {
		tmp = ((x * 2.0) - (t * (z * (y * 9.0)))) + (b * (a * 27.0));
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if z <= -1.55e-253:
		tmp = ((x * 2.0) - ((y * 9.0) * (z * t))) + (a * (27.0 * b))
	else:
		tmp = ((x * 2.0) - (t * (z * (y * 9.0)))) + (b * (a * 27.0))
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -1.55e-253)
		tmp = Float64(Float64(Float64(x * 2.0) - Float64(Float64(y * 9.0) * Float64(z * t))) + Float64(a * Float64(27.0 * b)));
	else
		tmp = Float64(Float64(Float64(x * 2.0) - Float64(t * Float64(z * Float64(y * 9.0)))) + Float64(b * Float64(a * 27.0)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (z <= -1.55e-253)
		tmp = ((x * 2.0) - ((y * 9.0) * (z * t))) + (a * (27.0 * b));
	else
		tmp = ((x * 2.0) - (t * (z * (y * 9.0)))) + (b * (a * 27.0));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -1.55e-253], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(N[(y * 9.0), $MachinePrecision] * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(t * N[(z * N[(y * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b * N[(a * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 11: 98.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq 1.5 \cdot 10^{-240}:\\ \;\;\;\;\left(27 \cdot \left(a \cdot b\right) + x \cdot 2\right) - y \cdot \left(t \cdot \left(z \cdot 9\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x \cdot 2 - t \cdot \left(z \cdot \left(y \cdot 9\right)\right)\right) + b \cdot \left(a \cdot 27\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= z 1.5e-240)
   (- (+ (* 27.0 (* a b)) (* x 2.0)) (* y (* t (* z 9.0))))
   (+ (- (* x 2.0) (* t (* z (* y 9.0)))) (* b (* a 27.0)))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= 1.5e-240) {
		tmp = ((27.0 * (a * b)) + (x * 2.0)) - (y * (t * (z * 9.0)));
	} else {
		tmp = ((x * 2.0) - (t * (z * (y * 9.0)))) + (b * (a * 27.0));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    real(8) :: tmp
    if (z <= 1.5d-240) then
        tmp = ((27.0d0 * (a * b)) + (x * 2.0d0)) - (y * (t * (z * 9.0d0)))
    else
        tmp = ((x * 2.0d0) - (t * (z * (y * 9.0d0)))) + (b * (a * 27.0d0))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= 1.5e-240) {
		tmp = ((27.0 * (a * b)) + (x * 2.0)) - (y * (t * (z * 9.0)));
	} else {
		tmp = ((x * 2.0) - (t * (z * (y * 9.0)))) + (b * (a * 27.0));
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if z <= 1.5e-240:
		tmp = ((27.0 * (a * b)) + (x * 2.0)) - (y * (t * (z * 9.0)))
	else:
		tmp = ((x * 2.0) - (t * (z * (y * 9.0)))) + (b * (a * 27.0))
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= 1.5e-240)
		tmp = Float64(Float64(Float64(27.0 * Float64(a * b)) + Float64(x * 2.0)) - Float64(y * Float64(t * Float64(z * 9.0))));
	else
		tmp = Float64(Float64(Float64(x * 2.0) - Float64(t * Float64(z * Float64(y * 9.0)))) + Float64(b * Float64(a * 27.0)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (z <= 1.5e-240)
		tmp = ((27.0 * (a * b)) + (x * 2.0)) - (y * (t * (z * 9.0)));
	else
		tmp = ((x * 2.0) - (t * (z * (y * 9.0)))) + (b * (a * 27.0));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, 1.5e-240], N[(N[(N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision] + N[(x * 2.0), $MachinePrecision]), $MachinePrecision] - N[(y * N[(t * N[(z * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(t * N[(z * N[(y * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b * N[(a * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 12: 75.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := 27 \cdot \left(a \cdot b\right)\\ \mathbf{if}\;b \leq -1.4 \cdot 10^{+74}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b \leq 1.1 \cdot 10^{-22}:\\ \;\;\;\;x \cdot 2 + t \cdot \left(z \cdot \left(y \cdot -9\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t_1 + x \cdot 2\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* 27.0 (* a b))))
   (if (<= b -1.4e+74)
     t_1
     (if (<= b 1.1e-22)
       (+ (* x 2.0) (* t (* z (* y -9.0))))
       (+ t_1 (* x 2.0))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 27.0 * (a * b);
	double tmp;
	if (b <= -1.4e+74) {
		tmp = t_1;
	} else if (b <= 1.1e-22) {
		tmp = (x * 2.0) + (t * (z * (y * -9.0)));
	} else {
		tmp = t_1 + (x * 2.0);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = 27.0d0 * (a * b)
    if (b <= (-1.4d+74)) then
        tmp = t_1
    else if (b <= 1.1d-22) then
        tmp = (x * 2.0d0) + (t * (z * (y * (-9.0d0))))
    else
        tmp = t_1 + (x * 2.0d0)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 27.0 * (a * b);
	double tmp;
	if (b <= -1.4e+74) {
		tmp = t_1;
	} else if (b <= 1.1e-22) {
		tmp = (x * 2.0) + (t * (z * (y * -9.0)));
	} else {
		tmp = t_1 + (x * 2.0);
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = 27.0 * (a * b)
	tmp = 0
	if b <= -1.4e+74:
		tmp = t_1
	elif b <= 1.1e-22:
		tmp = (x * 2.0) + (t * (z * (y * -9.0)))
	else:
		tmp = t_1 + (x * 2.0)
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(27.0 * Float64(a * b))
	tmp = 0.0
	if (b <= -1.4e+74)
		tmp = t_1;
	elseif (b <= 1.1e-22)
		tmp = Float64(Float64(x * 2.0) + Float64(t * Float64(z * Float64(y * -9.0))));
	else
		tmp = Float64(t_1 + Float64(x * 2.0));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = 27.0 * (a * b);
	tmp = 0.0;
	if (b <= -1.4e+74)
		tmp = t_1;
	elseif (b <= 1.1e-22)
		tmp = (x * 2.0) + (t * (z * (y * -9.0)));
	else
		tmp = t_1 + (x * 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -1.4e+74], t$95$1, If[LessEqual[b, 1.1e-22], N[(N[(x * 2.0), $MachinePrecision] + N[(t * N[(z * N[(y * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 + N[(x * 2.0), $MachinePrecision]), $MachinePrecision]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 13: 76.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := 27 \cdot \left(a \cdot b\right)\\ \mathbf{if}\;b \leq -1.9 \cdot 10^{+67}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b \leq 9.5 \cdot 10^{+18}:\\ \;\;\;\;x \cdot 2 - 9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t_1 + x \cdot 2\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* 27.0 (* a b))))
   (if (<= b -1.9e+67)
     t_1
     (if (<= b 9.5e+18)
       (- (* x 2.0) (* 9.0 (* t (* z y))))
       (+ t_1 (* x 2.0))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 27.0 * (a * b);
	double tmp;
	if (b <= -1.9e+67) {
		tmp = t_1;
	} else if (b <= 9.5e+18) {
		tmp = (x * 2.0) - (9.0 * (t * (z * y)));
	} else {
		tmp = t_1 + (x * 2.0);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = 27.0d0 * (a * b)
    if (b <= (-1.9d+67)) then
        tmp = t_1
    else if (b <= 9.5d+18) then
        tmp = (x * 2.0d0) - (9.0d0 * (t * (z * y)))
    else
        tmp = t_1 + (x * 2.0d0)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 27.0 * (a * b);
	double tmp;
	if (b <= -1.9e+67) {
		tmp = t_1;
	} else if (b <= 9.5e+18) {
		tmp = (x * 2.0) - (9.0 * (t * (z * y)));
	} else {
		tmp = t_1 + (x * 2.0);
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = 27.0 * (a * b)
	tmp = 0
	if b <= -1.9e+67:
		tmp = t_1
	elif b <= 9.5e+18:
		tmp = (x * 2.0) - (9.0 * (t * (z * y)))
	else:
		tmp = t_1 + (x * 2.0)
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(27.0 * Float64(a * b))
	tmp = 0.0
	if (b <= -1.9e+67)
		tmp = t_1;
	elseif (b <= 9.5e+18)
		tmp = Float64(Float64(x * 2.0) - Float64(9.0 * Float64(t * Float64(z * y))));
	else
		tmp = Float64(t_1 + Float64(x * 2.0));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = 27.0 * (a * b);
	tmp = 0.0;
	if (b <= -1.9e+67)
		tmp = t_1;
	elseif (b <= 9.5e+18)
		tmp = (x * 2.0) - (9.0 * (t * (z * y)));
	else
		tmp = t_1 + (x * 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -1.9e+67], t$95$1, If[LessEqual[b, 9.5e+18], N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(t * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 + N[(x * 2.0), $MachinePrecision]), $MachinePrecision]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 14: 75.2% accurate, 1.3× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -9 \cdot 10^{-35}:\\ \;\;\;\;z \cdot \left(t \cdot \left(y \cdot -9\right)\right)\\ \mathbf{elif}\;z \leq 1.26 \cdot 10^{+71}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right) + x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;t \cdot \left(y \cdot \left(z \cdot -9\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -9e-35)
   (* z (* t (* y -9.0)))
   (if (<= z 1.26e+71) (+ (* 27.0 (* a b)) (* x 2.0)) (* t (* y (* z -9.0))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -9e-35) {
		tmp = z * (t * (y * -9.0));
	} else if (z <= 1.26e+71) {
		tmp = (27.0 * (a * b)) + (x * 2.0);
	} else {
		tmp = t * (y * (z * -9.0));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    real(8) :: tmp
    if (z <= (-9d-35)) then
        tmp = z * (t * (y * (-9.0d0)))
    else if (z <= 1.26d+71) then
        tmp = (27.0d0 * (a * b)) + (x * 2.0d0)
    else
        tmp = t * (y * (z * (-9.0d0)))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -9e-35) {
		tmp = z * (t * (y * -9.0));
	} else if (z <= 1.26e+71) {
		tmp = (27.0 * (a * b)) + (x * 2.0);
	} else {
		tmp = t * (y * (z * -9.0));
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if z <= -9e-35:
		tmp = z * (t * (y * -9.0))
	elif z <= 1.26e+71:
		tmp = (27.0 * (a * b)) + (x * 2.0)
	else:
		tmp = t * (y * (z * -9.0))
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -9e-35)
		tmp = Float64(z * Float64(t * Float64(y * -9.0)));
	elseif (z <= 1.26e+71)
		tmp = Float64(Float64(27.0 * Float64(a * b)) + Float64(x * 2.0));
	else
		tmp = Float64(t * Float64(y * Float64(z * -9.0)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (z <= -9e-35)
		tmp = z * (t * (y * -9.0));
	elseif (z <= 1.26e+71)
		tmp = (27.0 * (a * b)) + (x * 2.0);
	else
		tmp = t * (y * (z * -9.0));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -9e-35], N[(z * N[(t * N[(y * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.26e+71], N[(N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision] + N[(x * 2.0), $MachinePrecision]), $MachinePrecision], N[(t * N[(y * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 15: 47.7% accurate, 1.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;b \leq -7 \cdot 10^{-48} \lor \neg \left(b \leq 1.05 \cdot 10^{+14}\right):\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot 2\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= b -7e-48) (not (<= b 1.05e+14))) (* 27.0 (* a b)) (* x 2.0)))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -7e-48) || !(b <= 1.05e+14)) {
		tmp = 27.0 * (a * b);
	} else {
		tmp = x * 2.0;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    real(8) :: tmp
    if ((b <= (-7d-48)) .or. (.not. (b <= 1.05d+14))) then
        tmp = 27.0d0 * (a * b)
    else
        tmp = x * 2.0d0
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -7e-48) || !(b <= 1.05e+14)) {
		tmp = 27.0 * (a * b);
	} else {
		tmp = x * 2.0;
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if (b <= -7e-48) or not (b <= 1.05e+14):
		tmp = 27.0 * (a * b)
	else:
		tmp = x * 2.0
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((b <= -7e-48) || !(b <= 1.05e+14))
		tmp = Float64(27.0 * Float64(a * b));
	else
		tmp = Float64(x * 2.0);
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((b <= -7e-48) || ~((b <= 1.05e+14)))
		tmp = 27.0 * (a * b);
	else
		tmp = x * 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[b, -7e-48], N[Not[LessEqual[b, 1.05e+14]], $MachinePrecision]], N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision], N[(x * 2.0), $MachinePrecision]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 16: 47.6% accurate, 1.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;b \leq -6.6 \cdot 10^{-48}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{elif}\;b \leq 50000000000000:\\ \;\;\;\;x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;a \cdot \left(27 \cdot b\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= b -6.6e-48)
   (* 27.0 (* a b))
   (if (<= b 50000000000000.0) (* x 2.0) (* a (* 27.0 b)))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (b <= -6.6e-48) {
		tmp = 27.0 * (a * b);
	} else if (b <= 50000000000000.0) {
		tmp = x * 2.0;
	} else {
		tmp = a * (27.0 * b);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    real(8) :: tmp
    if (b <= (-6.6d-48)) then
        tmp = 27.0d0 * (a * b)
    else if (b <= 50000000000000.0d0) then
        tmp = x * 2.0d0
    else
        tmp = a * (27.0d0 * b)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (b <= -6.6e-48) {
		tmp = 27.0 * (a * b);
	} else if (b <= 50000000000000.0) {
		tmp = x * 2.0;
	} else {
		tmp = a * (27.0 * b);
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if b <= -6.6e-48:
		tmp = 27.0 * (a * b)
	elif b <= 50000000000000.0:
		tmp = x * 2.0
	else:
		tmp = a * (27.0 * b)
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (b <= -6.6e-48)
		tmp = Float64(27.0 * Float64(a * b));
	elseif (b <= 50000000000000.0)
		tmp = Float64(x * 2.0);
	else
		tmp = Float64(a * Float64(27.0 * b));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (b <= -6.6e-48)
		tmp = 27.0 * (a * b);
	elseif (b <= 50000000000000.0)
		tmp = x * 2.0;
	else
		tmp = a * (27.0 * b);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[b, -6.6e-48], N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 50000000000000.0], N[(x * 2.0), $MachinePrecision], N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 17: 47.7% accurate, 1.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;b \leq -6.1 \cdot 10^{-49}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{elif}\;b \leq 25000000000000:\\ \;\;\;\;x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;b \cdot \left(a \cdot 27\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= b -6.1e-49)
   (* 27.0 (* a b))
   (if (<= b 25000000000000.0) (* x 2.0) (* b (* a 27.0)))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (b <= -6.1e-49) {
		tmp = 27.0 * (a * b);
	} else if (b <= 25000000000000.0) {
		tmp = x * 2.0;
	} else {
		tmp = b * (a * 27.0);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    real(8) :: tmp
    if (b <= (-6.1d-49)) then
        tmp = 27.0d0 * (a * b)
    else if (b <= 25000000000000.0d0) then
        tmp = x * 2.0d0
    else
        tmp = b * (a * 27.0d0)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (b <= -6.1e-49) {
		tmp = 27.0 * (a * b);
	} else if (b <= 25000000000000.0) {
		tmp = x * 2.0;
	} else {
		tmp = b * (a * 27.0);
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if b <= -6.1e-49:
		tmp = 27.0 * (a * b)
	elif b <= 25000000000000.0:
		tmp = x * 2.0
	else:
		tmp = b * (a * 27.0)
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (b <= -6.1e-49)
		tmp = Float64(27.0 * Float64(a * b));
	elseif (b <= 25000000000000.0)
		tmp = Float64(x * 2.0);
	else
		tmp = Float64(b * Float64(a * 27.0));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (b <= -6.1e-49)
		tmp = 27.0 * (a * b);
	elseif (b <= 25000000000000.0)
		tmp = x * 2.0;
	else
		tmp = b * (a * 27.0);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[b, -6.1e-49], N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 25000000000000.0], N[(x * 2.0), $MachinePrecision], N[(b * N[(a * 27.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 18: 31.1% accurate, 5.7× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ x \cdot 2 \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b) :precision binary64 (* x 2.0))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	return x * 2.0;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    code = x * 2.0d0
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	return x * 2.0;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	return x * 2.0

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	return Float64(x * 2.0)
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp = code(x, y, z, t, a, b)
	tmp = x * 2.0;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := N[(x * 2.0), $MachinePrecision]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Developer target: 94.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y < 7.590524218811189 \cdot 10^{-161}:\\ \;\;\;\;\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + a \cdot \left(27 \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x \cdot 2 - 9 \cdot \left(y \cdot \left(t \cdot z\right)\right)\right) + \left(a \cdot 27\right) \cdot b\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (< y 7.590524218811189e-161)
   (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* a (* 27.0 b)))
   (+ (- (* x 2.0) (* 9.0 (* y (* t z)))) (* (* a 27.0) b))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y < 7.590524218811189e-161) {
		tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b));
	} else {
		tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    real(8) :: tmp
    if (y < 7.590524218811189d-161) then
        tmp = ((x * 2.0d0) - (((y * 9.0d0) * z) * t)) + (a * (27.0d0 * b))
    else
        tmp = ((x * 2.0d0) - (9.0d0 * (y * (t * z)))) + ((a * 27.0d0) * b)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y < 7.590524218811189e-161) {
		tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b));
	} else {
		tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if y < 7.590524218811189e-161:
		tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b))
	else:
		tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b)
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (y < 7.590524218811189e-161)
		tmp = Float64(Float64(Float64(x * 2.0) - Float64(Float64(Float64(y * 9.0) * z) * t)) + Float64(a * Float64(27.0 * b)));
	else
		tmp = Float64(Float64(Float64(x * 2.0) - Float64(9.0 * Float64(y * Float64(t * z)))) + Float64(Float64(a * 27.0) * b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (y < 7.590524218811189e-161)
		tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b));
	else
		tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Less[y, 7.590524218811189e-161], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(y * N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]]

Reproduce

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

  :herbie-target
  (if (< y 7.590524218811189e-161) (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* a (* 27.0 b))) (+ (- (* x 2.0) (* 9.0 (* y (* t z)))) (* (* a 27.0) b)))

  (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b)))