Data.Array.Repa.Algorithms.ColorRamp:rampColorHotToCold from repa-algorithms-3.4.0.1, B

Percentage Accurate: 99.9% → 100.0%

Time: 5.5s

Alternatives: 8

Speedup: 1.2×

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

Specification

Math

\[\begin{array}{l} \\ \frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (/ (* 4.0 (- (- x y) (* z 0.5))) z))

C

double code(double x, double y, double z) {
	return (4.0 * ((x - y) - (z * 0.5))) / z;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (4.0d0 * ((x - y) - (z * 0.5d0))) / z
end function

Java

public static double code(double x, double y, double z) {
	return (4.0 * ((x - y) - (z * 0.5))) / z;
}

Python

def code(x, y, z):
	return (4.0 * ((x - y) - (z * 0.5))) / z

Julia

function code(x, y, z)
	return Float64(Float64(4.0 * Float64(Float64(x - y) - Float64(z * 0.5))) / z)
end

MATLAB

function tmp = code(x, y, z)
	tmp = (4.0 * ((x - y) - (z * 0.5))) / z;
end

Wolfram

code[x_, y_, z_] := N[(N[(4.0 * N[(N[(x - y), $MachinePrecision] - N[(z * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]

Initial Program: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (/ (* 4.0 (- (- x y) (* z 0.5))) z))

C

double code(double x, double y, double z) {
	return (4.0 * ((x - y) - (z * 0.5))) / z;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (4.0d0 * ((x - y) - (z * 0.5d0))) / z
end function

Java

public static double code(double x, double y, double z) {
	return (4.0 * ((x - y) - (z * 0.5))) / z;
}

Python

def code(x, y, z):
	return (4.0 * ((x - y) - (z * 0.5))) / z

Julia

function code(x, y, z)
	return Float64(Float64(4.0 * Float64(Float64(x - y) - Float64(z * 0.5))) / z)
end

MATLAB

function tmp = code(x, y, z)
	tmp = (4.0 * ((x - y) - (z * 0.5))) / z;
end

Wolfram

code[x_, y_, z_] := N[(N[(4.0 * N[(N[(x - y), $MachinePrecision] - N[(z * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ -4 \cdot \left(\frac{y - x}{z} - -0.5\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (* -4.0 (- (/ (- y x) z) -0.5)))

C

double code(double x, double y, double z) {
	return -4.0 * (((y - x) / z) - -0.5);
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (-4.0d0) * (((y - x) / z) - (-0.5d0))
end function

Java

public static double code(double x, double y, double z) {
	return -4.0 * (((y - x) / z) - -0.5);
}

Python

def code(x, y, z):
	return -4.0 * (((y - x) / z) - -0.5)

Julia

function code(x, y, z)
	return Float64(-4.0 * Float64(Float64(Float64(y - x) / z) - -0.5))
end

MATLAB

function tmp = code(x, y, z)
	tmp = -4.0 * (((y - x) / z) - -0.5);
end

Wolfram

code[x_, y_, z_] := N[(-4.0 * N[(N[(N[(y - x), $MachinePrecision] / z), $MachinePrecision] - -0.5), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
2. Step-by-step derivation

   1. remove-double-neg 100.0%

      \[\leadsto \frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{\color{blue}{-\left(-z\right)}} \]

   2. neg-mul-1 100.0%

      \[\leadsto \frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{\color{blue}{-1 \cdot \left(-z\right)}} \]

   3. times-frac 100.0%

      \[\leadsto \color{blue}{\frac{4}{-1} \cdot \frac{\left(x - y\right) - z \cdot 0.5}{-z}} \]

   4. metadata-eval 100.0%

      \[\leadsto \color{blue}{-4} \cdot \frac{\left(x - y\right) - z \cdot 0.5}{-z} \]

   5. div-sub 100.0%

      \[\leadsto -4 \cdot \color{blue}{\left(\frac{x - y}{-z} - \frac{z \cdot 0.5}{-z}\right)} \]

   6. distribute-frac-neg2 100.0%

      \[\leadsto -4 \cdot \left(\color{blue}{\left(-\frac{x - y}{z}\right)} - \frac{z \cdot 0.5}{-z}\right) \]

   7. distribute-frac-neg 100.0%

      \[\leadsto -4 \cdot \left(\color{blue}{\frac{-\left(x - y\right)}{z}} - \frac{z \cdot 0.5}{-z}\right) \]

   8. sub-neg 100.0%

      \[\leadsto -4 \cdot \left(\frac{-\color{blue}{\left(x + \left(-y\right)\right)}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

   9. +-commutative 100.0%

      \[\leadsto -4 \cdot \left(\frac{-\color{blue}{\left(\left(-y\right) + x\right)}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

   10. distribute-neg-out 100.0%

       \[\leadsto -4 \cdot \left(\frac{\color{blue}{\left(-\left(-y\right)\right) + \left(-x\right)}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

   11. remove-double-neg 100.0%

       \[\leadsto -4 \cdot \left(\frac{\color{blue}{y} + \left(-x\right)}{z} - \frac{z \cdot 0.5}{-z}\right) \]

   12. sub-neg 100.0%

       \[\leadsto -4 \cdot \left(\frac{\color{blue}{y - x}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

   13. *-commutative 100.0%

       \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \frac{\color{blue}{0.5 \cdot z}}{-z}\right) \]

   14. neg-mul-1 100.0%

       \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \frac{0.5 \cdot z}{\color{blue}{-1 \cdot z}}\right) \]

   15. times-frac 100.0%

       \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \color{blue}{\frac{0.5}{-1} \cdot \frac{z}{z}}\right) \]

   16. metadata-eval 100.0%

       \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \color{blue}{-0.5} \cdot \frac{z}{z}\right) \]

   17. *-inverses 100.0%

       \[\leadsto -4 \cdot \left(\frac{y - x}{z} - -0.5 \cdot \color{blue}{1}\right) \]

   18. metadata-eval 100.0%

       \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \color{blue}{-0.5}\right) \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{-4 \cdot \left(\frac{y - x}{z} - -0.5\right)} \]
4. Add Preprocessing

5. Final simplification 100.0%

   \[\leadsto -4 \cdot \left(\frac{y - x}{z} - -0.5\right) \]
6. Add Preprocessing

Alternative 2: 53.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x \cdot \frac{4}{z}\\ t_1 := -4 \cdot \frac{y}{z}\\ \mathbf{if}\;x \leq -8.5 \cdot 10^{+78}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 1.36 \cdot 10^{-268}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 2.2 \cdot 10^{-170}:\\ \;\;\;\;-2\\ \mathbf{elif}\;x \leq 9 \cdot 10^{+144}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* x (/ 4.0 z))) (t_1 (* -4.0 (/ y z))))
   (if (<= x -8.5e+78)
     t_0
     (if (<= x 1.36e-268)
       t_1
       (if (<= x 2.2e-170) -2.0 (if (<= x 9e+144) t_1 t_0))))))

C

double code(double x, double y, double z) {
	double t_0 = x * (4.0 / z);
	double t_1 = -4.0 * (y / z);
	double tmp;
	if (x <= -8.5e+78) {
		tmp = t_0;
	} else if (x <= 1.36e-268) {
		tmp = t_1;
	} else if (x <= 2.2e-170) {
		tmp = -2.0;
	} else if (x <= 9e+144) {
		tmp = t_1;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = x * (4.0d0 / z)
    t_1 = (-4.0d0) * (y / z)
    if (x <= (-8.5d+78)) then
        tmp = t_0
    else if (x <= 1.36d-268) then
        tmp = t_1
    else if (x <= 2.2d-170) then
        tmp = -2.0d0
    else if (x <= 9d+144) then
        tmp = t_1
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = x * (4.0 / z);
	double t_1 = -4.0 * (y / z);
	double tmp;
	if (x <= -8.5e+78) {
		tmp = t_0;
	} else if (x <= 1.36e-268) {
		tmp = t_1;
	} else if (x <= 2.2e-170) {
		tmp = -2.0;
	} else if (x <= 9e+144) {
		tmp = t_1;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = x * (4.0 / z)
	t_1 = -4.0 * (y / z)
	tmp = 0
	if x <= -8.5e+78:
		tmp = t_0
	elif x <= 1.36e-268:
		tmp = t_1
	elif x <= 2.2e-170:
		tmp = -2.0
	elif x <= 9e+144:
		tmp = t_1
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x * Float64(4.0 / z))
	t_1 = Float64(-4.0 * Float64(y / z))
	tmp = 0.0
	if (x <= -8.5e+78)
		tmp = t_0;
	elseif (x <= 1.36e-268)
		tmp = t_1;
	elseif (x <= 2.2e-170)
		tmp = -2.0;
	elseif (x <= 9e+144)
		tmp = t_1;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x * (4.0 / z);
	t_1 = -4.0 * (y / z);
	tmp = 0.0;
	if (x <= -8.5e+78)
		tmp = t_0;
	elseif (x <= 1.36e-268)
		tmp = t_1;
	elseif (x <= 2.2e-170)
		tmp = -2.0;
	elseif (x <= 9e+144)
		tmp = t_1;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x * N[(4.0 / z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-4.0 * N[(y / z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -8.5e+78], t$95$0, If[LessEqual[x, 1.36e-268], t$95$1, If[LessEqual[x, 2.2e-170], -2.0, If[LessEqual[x, 9e+144], t$95$1, t$95$0]]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -8.50000000000000079e78 or 8.99999999999999935e144 < x

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 76.1%

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

      1. *-commutative 76.1%

         \[\leadsto \color{blue}{\frac{x}{z} \cdot 4} \]

      2. associate-*l/ 76.1%

         \[\leadsto \color{blue}{\frac{x \cdot 4}{z}} \]

      3. associate-*r/ 75.9%

         \[\leadsto \color{blue}{x \cdot \frac{4}{z}} \]

   5. Simplified 75.9%

      \[\leadsto \color{blue}{x \cdot \frac{4}{z}} \]

   if -8.50000000000000079e78 < x < 1.3599999999999999e-268 or 2.20000000000000015e-170 < x < 8.99999999999999935e144

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 49.9%

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

      1. *-commutative 49.9%

         \[\leadsto \color{blue}{\frac{y}{z} \cdot -4} \]

   5. Simplified 49.9%

      \[\leadsto \color{blue}{\frac{y}{z} \cdot -4} \]

   if 1.3599999999999999e-268 < x < 2.20000000000000015e-170

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf 62.2%

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

4. Final simplification 60.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -8.5 \cdot 10^{+78}:\\ \;\;\;\;x \cdot \frac{4}{z}\\ \mathbf{elif}\;x \leq 1.36 \cdot 10^{-268}:\\ \;\;\;\;-4 \cdot \frac{y}{z}\\ \mathbf{elif}\;x \leq 2.2 \cdot 10^{-170}:\\ \;\;\;\;-2\\ \mathbf{elif}\;x \leq 9 \cdot 10^{+144}:\\ \;\;\;\;-4 \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{4}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 53.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x \cdot 4}{z}\\ t_1 := -4 \cdot \frac{y}{z}\\ \mathbf{if}\;x \leq -5.5 \cdot 10^{+80}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 7.2 \cdot 10^{-269}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 7.2 \cdot 10^{-171}:\\ \;\;\;\;-2\\ \mathbf{elif}\;x \leq 9 \cdot 10^{+144}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (/ (* x 4.0) z)) (t_1 (* -4.0 (/ y z))))
   (if (<= x -5.5e+80)
     t_0
     (if (<= x 7.2e-269)
       t_1
       (if (<= x 7.2e-171) -2.0 (if (<= x 9e+144) t_1 t_0))))))

C

double code(double x, double y, double z) {
	double t_0 = (x * 4.0) / z;
	double t_1 = -4.0 * (y / z);
	double tmp;
	if (x <= -5.5e+80) {
		tmp = t_0;
	} else if (x <= 7.2e-269) {
		tmp = t_1;
	} else if (x <= 7.2e-171) {
		tmp = -2.0;
	} else if (x <= 9e+144) {
		tmp = t_1;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = (x * 4.0d0) / z
    t_1 = (-4.0d0) * (y / z)
    if (x <= (-5.5d+80)) then
        tmp = t_0
    else if (x <= 7.2d-269) then
        tmp = t_1
    else if (x <= 7.2d-171) then
        tmp = -2.0d0
    else if (x <= 9d+144) then
        tmp = t_1
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (x * 4.0) / z;
	double t_1 = -4.0 * (y / z);
	double tmp;
	if (x <= -5.5e+80) {
		tmp = t_0;
	} else if (x <= 7.2e-269) {
		tmp = t_1;
	} else if (x <= 7.2e-171) {
		tmp = -2.0;
	} else if (x <= 9e+144) {
		tmp = t_1;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (x * 4.0) / z
	t_1 = -4.0 * (y / z)
	tmp = 0
	if x <= -5.5e+80:
		tmp = t_0
	elif x <= 7.2e-269:
		tmp = t_1
	elif x <= 7.2e-171:
		tmp = -2.0
	elif x <= 9e+144:
		tmp = t_1
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(x * 4.0) / z)
	t_1 = Float64(-4.0 * Float64(y / z))
	tmp = 0.0
	if (x <= -5.5e+80)
		tmp = t_0;
	elseif (x <= 7.2e-269)
		tmp = t_1;
	elseif (x <= 7.2e-171)
		tmp = -2.0;
	elseif (x <= 9e+144)
		tmp = t_1;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (x * 4.0) / z;
	t_1 = -4.0 * (y / z);
	tmp = 0.0;
	if (x <= -5.5e+80)
		tmp = t_0;
	elseif (x <= 7.2e-269)
		tmp = t_1;
	elseif (x <= 7.2e-171)
		tmp = -2.0;
	elseif (x <= 9e+144)
		tmp = t_1;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(x * 4.0), $MachinePrecision] / z), $MachinePrecision]}, Block[{t$95$1 = N[(-4.0 * N[(y / z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -5.5e+80], t$95$0, If[LessEqual[x, 7.2e-269], t$95$1, If[LessEqual[x, 7.2e-171], -2.0, If[LessEqual[x, 9e+144], t$95$1, t$95$0]]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -5.49999999999999967e80 or 8.99999999999999935e144 < x

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 76.1%

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

      1. *-commutative 76.1%

         \[\leadsto \color{blue}{\frac{x}{z} \cdot 4} \]

      2. associate-*l/ 76.1%

         \[\leadsto \color{blue}{\frac{x \cdot 4}{z}} \]

   5. Simplified 76.1%

      \[\leadsto \color{blue}{\frac{x \cdot 4}{z}} \]

   if -5.49999999999999967e80 < x < 7.19999999999999996e-269 or 7.20000000000000006e-171 < x < 8.99999999999999935e144

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 49.9%

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

      1. *-commutative 49.9%

         \[\leadsto \color{blue}{\frac{y}{z} \cdot -4} \]

   5. Simplified 49.9%

      \[\leadsto \color{blue}{\frac{y}{z} \cdot -4} \]

   if 7.19999999999999996e-269 < x < 7.20000000000000006e-171

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf 62.2%

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

4. Final simplification 60.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -5.5 \cdot 10^{+80}:\\ \;\;\;\;\frac{x \cdot 4}{z}\\ \mathbf{elif}\;x \leq 7.2 \cdot 10^{-269}:\\ \;\;\;\;-4 \cdot \frac{y}{z}\\ \mathbf{elif}\;x \leq 7.2 \cdot 10^{-171}:\\ \;\;\;\;-2\\ \mathbf{elif}\;x \leq 9 \cdot 10^{+144}:\\ \;\;\;\;-4 \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot 4}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 81.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -3 \cdot 10^{+97} \lor \neg \left(y \leq 1.02 \cdot 10^{+105}\right):\\ \;\;\;\;-4 \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;-4 \cdot \left(0.5 - \frac{x}{z}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -3e+97) (not (<= y 1.02e+105)))
   (* -4.0 (/ y z))
   (* -4.0 (- 0.5 (/ x z)))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -3e+97) || !(y <= 1.02e+105)) {
		tmp = -4.0 * (y / z);
	} else {
		tmp = -4.0 * (0.5 - (x / z));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y <= (-3d+97)) .or. (.not. (y <= 1.02d+105))) then
        tmp = (-4.0d0) * (y / z)
    else
        tmp = (-4.0d0) * (0.5d0 - (x / z))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -3e+97) || !(y <= 1.02e+105)) {
		tmp = -4.0 * (y / z);
	} else {
		tmp = -4.0 * (0.5 - (x / z));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -3e+97) or not (y <= 1.02e+105):
		tmp = -4.0 * (y / z)
	else:
		tmp = -4.0 * (0.5 - (x / z))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -3e+97) || !(y <= 1.02e+105))
		tmp = Float64(-4.0 * Float64(y / z));
	else
		tmp = Float64(-4.0 * Float64(0.5 - Float64(x / z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -3e+97) || ~((y <= 1.02e+105)))
		tmp = -4.0 * (y / z);
	else
		tmp = -4.0 * (0.5 - (x / z));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -3e+97], N[Not[LessEqual[y, 1.02e+105]], $MachinePrecision]], N[(-4.0 * N[(y / z), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(0.5 - N[(x / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.9999999999999998e97 or 1.02e105 < y

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 80.3%

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

      1. *-commutative 80.3%

         \[\leadsto \color{blue}{\frac{y}{z} \cdot -4} \]

   5. Simplified 80.3%

      \[\leadsto \color{blue}{\frac{y}{z} \cdot -4} \]

   if -2.9999999999999998e97 < y < 1.02e105

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Step-by-step derivation

      1. remove-double-neg 100.0%

         \[\leadsto \frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{\color{blue}{-\left(-z\right)}} \]

      2. neg-mul-1 100.0%

         \[\leadsto \frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{\color{blue}{-1 \cdot \left(-z\right)}} \]

      3. times-frac 100.0%

         \[\leadsto \color{blue}{\frac{4}{-1} \cdot \frac{\left(x - y\right) - z \cdot 0.5}{-z}} \]

      4. metadata-eval 100.0%

         \[\leadsto \color{blue}{-4} \cdot \frac{\left(x - y\right) - z \cdot 0.5}{-z} \]

      5. div-sub 100.0%

         \[\leadsto -4 \cdot \color{blue}{\left(\frac{x - y}{-z} - \frac{z \cdot 0.5}{-z}\right)} \]

      6. distribute-frac-neg2 100.0%

         \[\leadsto -4 \cdot \left(\color{blue}{\left(-\frac{x - y}{z}\right)} - \frac{z \cdot 0.5}{-z}\right) \]

      7. distribute-frac-neg 100.0%

         \[\leadsto -4 \cdot \left(\color{blue}{\frac{-\left(x - y\right)}{z}} - \frac{z \cdot 0.5}{-z}\right) \]

      8. sub-neg 100.0%

         \[\leadsto -4 \cdot \left(\frac{-\color{blue}{\left(x + \left(-y\right)\right)}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      9. +-commutative 100.0%

         \[\leadsto -4 \cdot \left(\frac{-\color{blue}{\left(\left(-y\right) + x\right)}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      10. distribute-neg-out 100.0%

          \[\leadsto -4 \cdot \left(\frac{\color{blue}{\left(-\left(-y\right)\right) + \left(-x\right)}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      11. remove-double-neg 100.0%

          \[\leadsto -4 \cdot \left(\frac{\color{blue}{y} + \left(-x\right)}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      12. sub-neg 100.0%

          \[\leadsto -4 \cdot \left(\frac{\color{blue}{y - x}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      13. *-commutative 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \frac{\color{blue}{0.5 \cdot z}}{-z}\right) \]

      14. neg-mul-1 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \frac{0.5 \cdot z}{\color{blue}{-1 \cdot z}}\right) \]

      15. times-frac 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \color{blue}{\frac{0.5}{-1} \cdot \frac{z}{z}}\right) \]

      16. metadata-eval 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \color{blue}{-0.5} \cdot \frac{z}{z}\right) \]

      17. *-inverses 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - -0.5 \cdot \color{blue}{1}\right) \]

      18. metadata-eval 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \color{blue}{-0.5}\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{-4 \cdot \left(\frac{y - x}{z} - -0.5\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 84.8%

      \[\leadsto -4 \cdot \color{blue}{\left(0.5 - \frac{x}{z}\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 83.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3 \cdot 10^{+97} \lor \neg \left(y \leq 1.02 \cdot 10^{+105}\right):\\ \;\;\;\;-4 \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;-4 \cdot \left(0.5 - \frac{x}{z}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 85.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4 \cdot 10^{+78} \lor \neg \left(x \leq 9 \cdot 10^{+144}\right):\\ \;\;\;\;-4 \cdot \left(0.5 - \frac{x}{z}\right)\\ \mathbf{else}:\\ \;\;\;\;-4 \cdot \left(\frac{y}{z} - -0.5\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -4e+78) (not (<= x 9e+144)))
   (* -4.0 (- 0.5 (/ x z)))
   (* -4.0 (- (/ y z) -0.5))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -4e+78) || !(x <= 9e+144)) {
		tmp = -4.0 * (0.5 - (x / z));
	} else {
		tmp = -4.0 * ((y / z) - -0.5);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((x <= (-4d+78)) .or. (.not. (x <= 9d+144))) then
        tmp = (-4.0d0) * (0.5d0 - (x / z))
    else
        tmp = (-4.0d0) * ((y / z) - (-0.5d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -4e+78) || !(x <= 9e+144)) {
		tmp = -4.0 * (0.5 - (x / z));
	} else {
		tmp = -4.0 * ((y / z) - -0.5);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -4e+78) or not (x <= 9e+144):
		tmp = -4.0 * (0.5 - (x / z))
	else:
		tmp = -4.0 * ((y / z) - -0.5)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -4e+78) || !(x <= 9e+144))
		tmp = Float64(-4.0 * Float64(0.5 - Float64(x / z)));
	else
		tmp = Float64(-4.0 * Float64(Float64(y / z) - -0.5));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -4e+78) || ~((x <= 9e+144)))
		tmp = -4.0 * (0.5 - (x / z));
	else
		tmp = -4.0 * ((y / z) - -0.5);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -4e+78], N[Not[LessEqual[x, 9e+144]], $MachinePrecision]], N[(-4.0 * N[(0.5 - N[(x / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(N[(y / z), $MachinePrecision] - -0.5), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -4.00000000000000003e78 or 8.99999999999999935e144 < x

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Step-by-step derivation

      1. remove-double-neg 100.0%

         \[\leadsto \frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{\color{blue}{-\left(-z\right)}} \]

      2. neg-mul-1 100.0%

         \[\leadsto \frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{\color{blue}{-1 \cdot \left(-z\right)}} \]

      3. times-frac 100.0%

         \[\leadsto \color{blue}{\frac{4}{-1} \cdot \frac{\left(x - y\right) - z \cdot 0.5}{-z}} \]

      4. metadata-eval 100.0%

         \[\leadsto \color{blue}{-4} \cdot \frac{\left(x - y\right) - z \cdot 0.5}{-z} \]

      5. div-sub 100.0%

         \[\leadsto -4 \cdot \color{blue}{\left(\frac{x - y}{-z} - \frac{z \cdot 0.5}{-z}\right)} \]

      6. distribute-frac-neg2 100.0%

         \[\leadsto -4 \cdot \left(\color{blue}{\left(-\frac{x - y}{z}\right)} - \frac{z \cdot 0.5}{-z}\right) \]

      7. distribute-frac-neg 100.0%

         \[\leadsto -4 \cdot \left(\color{blue}{\frac{-\left(x - y\right)}{z}} - \frac{z \cdot 0.5}{-z}\right) \]

      8. sub-neg 100.0%

         \[\leadsto -4 \cdot \left(\frac{-\color{blue}{\left(x + \left(-y\right)\right)}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      9. +-commutative 100.0%

         \[\leadsto -4 \cdot \left(\frac{-\color{blue}{\left(\left(-y\right) + x\right)}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      10. distribute-neg-out 100.0%

          \[\leadsto -4 \cdot \left(\frac{\color{blue}{\left(-\left(-y\right)\right) + \left(-x\right)}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      11. remove-double-neg 100.0%

          \[\leadsto -4 \cdot \left(\frac{\color{blue}{y} + \left(-x\right)}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      12. sub-neg 100.0%

          \[\leadsto -4 \cdot \left(\frac{\color{blue}{y - x}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      13. *-commutative 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \frac{\color{blue}{0.5 \cdot z}}{-z}\right) \]

      14. neg-mul-1 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \frac{0.5 \cdot z}{\color{blue}{-1 \cdot z}}\right) \]

      15. times-frac 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \color{blue}{\frac{0.5}{-1} \cdot \frac{z}{z}}\right) \]

      16. metadata-eval 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \color{blue}{-0.5} \cdot \frac{z}{z}\right) \]

      17. *-inverses 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - -0.5 \cdot \color{blue}{1}\right) \]

      18. metadata-eval 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \color{blue}{-0.5}\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{-4 \cdot \left(\frac{y - x}{z} - -0.5\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 90.5%

      \[\leadsto -4 \cdot \color{blue}{\left(0.5 - \frac{x}{z}\right)} \]

   if -4.00000000000000003e78 < x < 8.99999999999999935e144

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Step-by-step derivation

      1. remove-double-neg 100.0%

         \[\leadsto \frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{\color{blue}{-\left(-z\right)}} \]

      2. neg-mul-1 100.0%

         \[\leadsto \frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{\color{blue}{-1 \cdot \left(-z\right)}} \]

      3. times-frac 100.0%

         \[\leadsto \color{blue}{\frac{4}{-1} \cdot \frac{\left(x - y\right) - z \cdot 0.5}{-z}} \]

      4. metadata-eval 100.0%

         \[\leadsto \color{blue}{-4} \cdot \frac{\left(x - y\right) - z \cdot 0.5}{-z} \]

      5. div-sub 100.0%

         \[\leadsto -4 \cdot \color{blue}{\left(\frac{x - y}{-z} - \frac{z \cdot 0.5}{-z}\right)} \]

      6. distribute-frac-neg2 100.0%

         \[\leadsto -4 \cdot \left(\color{blue}{\left(-\frac{x - y}{z}\right)} - \frac{z \cdot 0.5}{-z}\right) \]

      7. distribute-frac-neg 100.0%

         \[\leadsto -4 \cdot \left(\color{blue}{\frac{-\left(x - y\right)}{z}} - \frac{z \cdot 0.5}{-z}\right) \]

      8. sub-neg 100.0%

         \[\leadsto -4 \cdot \left(\frac{-\color{blue}{\left(x + \left(-y\right)\right)}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      9. +-commutative 100.0%

         \[\leadsto -4 \cdot \left(\frac{-\color{blue}{\left(\left(-y\right) + x\right)}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      10. distribute-neg-out 100.0%

          \[\leadsto -4 \cdot \left(\frac{\color{blue}{\left(-\left(-y\right)\right) + \left(-x\right)}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      11. remove-double-neg 100.0%

          \[\leadsto -4 \cdot \left(\frac{\color{blue}{y} + \left(-x\right)}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      12. sub-neg 100.0%

          \[\leadsto -4 \cdot \left(\frac{\color{blue}{y - x}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      13. *-commutative 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \frac{\color{blue}{0.5 \cdot z}}{-z}\right) \]

      14. neg-mul-1 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \frac{0.5 \cdot z}{\color{blue}{-1 \cdot z}}\right) \]

      15. times-frac 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \color{blue}{\frac{0.5}{-1} \cdot \frac{z}{z}}\right) \]

      16. metadata-eval 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \color{blue}{-0.5} \cdot \frac{z}{z}\right) \]

      17. *-inverses 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - -0.5 \cdot \color{blue}{1}\right) \]

      18. metadata-eval 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \color{blue}{-0.5}\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{-4 \cdot \left(\frac{y - x}{z} - -0.5\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 87.1%

      \[\leadsto -4 \cdot \left(\color{blue}{\frac{y}{z}} - -0.5\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 88.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4 \cdot 10^{+78} \lor \neg \left(x \leq 9 \cdot 10^{+144}\right):\\ \;\;\;\;-4 \cdot \left(0.5 - \frac{x}{z}\right)\\ \mathbf{else}:\\ \;\;\;\;-4 \cdot \left(\frac{y}{z} - -0.5\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 84.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.3 \cdot 10^{+66}:\\ \;\;\;\;\frac{4 \cdot \left(x - y\right)}{z}\\ \mathbf{elif}\;x \leq 9 \cdot 10^{+144}:\\ \;\;\;\;-4 \cdot \left(\frac{y}{z} - -0.5\right)\\ \mathbf{else}:\\ \;\;\;\;-4 \cdot \left(0.5 - \frac{x}{z}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -3.3e+66)
   (/ (* 4.0 (- x y)) z)
   (if (<= x 9e+144) (* -4.0 (- (/ y z) -0.5)) (* -4.0 (- 0.5 (/ x z))))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -3.3e+66) {
		tmp = (4.0 * (x - y)) / z;
	} else if (x <= 9e+144) {
		tmp = -4.0 * ((y / z) - -0.5);
	} else {
		tmp = -4.0 * (0.5 - (x / z));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= (-3.3d+66)) then
        tmp = (4.0d0 * (x - y)) / z
    else if (x <= 9d+144) then
        tmp = (-4.0d0) * ((y / z) - (-0.5d0))
    else
        tmp = (-4.0d0) * (0.5d0 - (x / z))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -3.3e+66) {
		tmp = (4.0 * (x - y)) / z;
	} else if (x <= 9e+144) {
		tmp = -4.0 * ((y / z) - -0.5);
	} else {
		tmp = -4.0 * (0.5 - (x / z));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -3.3e+66:
		tmp = (4.0 * (x - y)) / z
	elif x <= 9e+144:
		tmp = -4.0 * ((y / z) - -0.5)
	else:
		tmp = -4.0 * (0.5 - (x / z))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -3.3e+66)
		tmp = Float64(Float64(4.0 * Float64(x - y)) / z);
	elseif (x <= 9e+144)
		tmp = Float64(-4.0 * Float64(Float64(y / z) - -0.5));
	else
		tmp = Float64(-4.0 * Float64(0.5 - Float64(x / z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -3.3e+66)
		tmp = (4.0 * (x - y)) / z;
	elseif (x <= 9e+144)
		tmp = -4.0 * ((y / z) - -0.5);
	else
		tmp = -4.0 * (0.5 - (x / z));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -3.3e+66], N[(N[(4.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[x, 9e+144], N[(-4.0 * N[(N[(y / z), $MachinePrecision] - -0.5), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(0.5 - N[(x / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -3.3000000000000001e66

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0 88.4%

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

      1. associate-*r/ 88.4%

         \[\leadsto \color{blue}{\frac{4 \cdot \left(x - y\right)}{z}} \]

   5. Simplified 88.4%

      \[\leadsto \color{blue}{\frac{4 \cdot \left(x - y\right)}{z}} \]

   if -3.3000000000000001e66 < x < 8.99999999999999935e144

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Step-by-step derivation

      1. remove-double-neg 100.0%

         \[\leadsto \frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{\color{blue}{-\left(-z\right)}} \]

      2. neg-mul-1 100.0%

         \[\leadsto \frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{\color{blue}{-1 \cdot \left(-z\right)}} \]

      3. times-frac 100.0%

         \[\leadsto \color{blue}{\frac{4}{-1} \cdot \frac{\left(x - y\right) - z \cdot 0.5}{-z}} \]

      4. metadata-eval 100.0%

         \[\leadsto \color{blue}{-4} \cdot \frac{\left(x - y\right) - z \cdot 0.5}{-z} \]

      5. div-sub 100.0%

         \[\leadsto -4 \cdot \color{blue}{\left(\frac{x - y}{-z} - \frac{z \cdot 0.5}{-z}\right)} \]

      6. distribute-frac-neg2 100.0%

         \[\leadsto -4 \cdot \left(\color{blue}{\left(-\frac{x - y}{z}\right)} - \frac{z \cdot 0.5}{-z}\right) \]

      7. distribute-frac-neg 100.0%

         \[\leadsto -4 \cdot \left(\color{blue}{\frac{-\left(x - y\right)}{z}} - \frac{z \cdot 0.5}{-z}\right) \]

      8. sub-neg 100.0%

         \[\leadsto -4 \cdot \left(\frac{-\color{blue}{\left(x + \left(-y\right)\right)}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      9. +-commutative 100.0%

         \[\leadsto -4 \cdot \left(\frac{-\color{blue}{\left(\left(-y\right) + x\right)}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      10. distribute-neg-out 100.0%

          \[\leadsto -4 \cdot \left(\frac{\color{blue}{\left(-\left(-y\right)\right) + \left(-x\right)}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      11. remove-double-neg 100.0%

          \[\leadsto -4 \cdot \left(\frac{\color{blue}{y} + \left(-x\right)}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      12. sub-neg 100.0%

          \[\leadsto -4 \cdot \left(\frac{\color{blue}{y - x}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      13. *-commutative 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \frac{\color{blue}{0.5 \cdot z}}{-z}\right) \]

      14. neg-mul-1 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \frac{0.5 \cdot z}{\color{blue}{-1 \cdot z}}\right) \]

      15. times-frac 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \color{blue}{\frac{0.5}{-1} \cdot \frac{z}{z}}\right) \]

      16. metadata-eval 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \color{blue}{-0.5} \cdot \frac{z}{z}\right) \]

      17. *-inverses 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - -0.5 \cdot \color{blue}{1}\right) \]

      18. metadata-eval 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \color{blue}{-0.5}\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{-4 \cdot \left(\frac{y - x}{z} - -0.5\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 87.8%

      \[\leadsto -4 \cdot \left(\color{blue}{\frac{y}{z}} - -0.5\right) \]

   if 8.99999999999999935e144 < x

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Step-by-step derivation

      1. remove-double-neg 100.0%

         \[\leadsto \frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{\color{blue}{-\left(-z\right)}} \]

      2. neg-mul-1 100.0%

         \[\leadsto \frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{\color{blue}{-1 \cdot \left(-z\right)}} \]

      3. times-frac 100.0%

         \[\leadsto \color{blue}{\frac{4}{-1} \cdot \frac{\left(x - y\right) - z \cdot 0.5}{-z}} \]

      4. metadata-eval 100.0%

         \[\leadsto \color{blue}{-4} \cdot \frac{\left(x - y\right) - z \cdot 0.5}{-z} \]

      5. div-sub 100.0%

         \[\leadsto -4 \cdot \color{blue}{\left(\frac{x - y}{-z} - \frac{z \cdot 0.5}{-z}\right)} \]

      6. distribute-frac-neg2 100.0%

         \[\leadsto -4 \cdot \left(\color{blue}{\left(-\frac{x - y}{z}\right)} - \frac{z \cdot 0.5}{-z}\right) \]

      7. distribute-frac-neg 100.0%

         \[\leadsto -4 \cdot \left(\color{blue}{\frac{-\left(x - y\right)}{z}} - \frac{z \cdot 0.5}{-z}\right) \]

      8. sub-neg 100.0%

         \[\leadsto -4 \cdot \left(\frac{-\color{blue}{\left(x + \left(-y\right)\right)}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      9. +-commutative 100.0%

         \[\leadsto -4 \cdot \left(\frac{-\color{blue}{\left(\left(-y\right) + x\right)}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      10. distribute-neg-out 100.0%

          \[\leadsto -4 \cdot \left(\frac{\color{blue}{\left(-\left(-y\right)\right) + \left(-x\right)}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      11. remove-double-neg 100.0%

          \[\leadsto -4 \cdot \left(\frac{\color{blue}{y} + \left(-x\right)}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      12. sub-neg 100.0%

          \[\leadsto -4 \cdot \left(\frac{\color{blue}{y - x}}{z} - \frac{z \cdot 0.5}{-z}\right) \]

      13. *-commutative 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \frac{\color{blue}{0.5 \cdot z}}{-z}\right) \]

      14. neg-mul-1 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \frac{0.5 \cdot z}{\color{blue}{-1 \cdot z}}\right) \]

      15. times-frac 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \color{blue}{\frac{0.5}{-1} \cdot \frac{z}{z}}\right) \]

      16. metadata-eval 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \color{blue}{-0.5} \cdot \frac{z}{z}\right) \]

      17. *-inverses 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - -0.5 \cdot \color{blue}{1}\right) \]

      18. metadata-eval 100.0%

          \[\leadsto -4 \cdot \left(\frac{y - x}{z} - \color{blue}{-0.5}\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{-4 \cdot \left(\frac{y - x}{z} - -0.5\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 93.0%

      \[\leadsto -4 \cdot \color{blue}{\left(0.5 - \frac{x}{z}\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 88.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.3 \cdot 10^{+66}:\\ \;\;\;\;\frac{4 \cdot \left(x - y\right)}{z}\\ \mathbf{elif}\;x \leq 9 \cdot 10^{+144}:\\ \;\;\;\;-4 \cdot \left(\frac{y}{z} - -0.5\right)\\ \mathbf{else}:\\ \;\;\;\;-4 \cdot \left(0.5 - \frac{x}{z}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 53.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -7.5 \cdot 10^{+51}:\\ \;\;\;\;-2\\ \mathbf{elif}\;z \leq 2.1 \cdot 10^{+80}:\\ \;\;\;\;x \cdot \frac{4}{z}\\ \mathbf{else}:\\ \;\;\;\;-2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -7.5e+51) -2.0 (if (<= z 2.1e+80) (* x (/ 4.0 z)) -2.0)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -7.5e+51) {
		tmp = -2.0;
	} else if (z <= 2.1e+80) {
		tmp = x * (4.0 / z);
	} else {
		tmp = -2.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-7.5d+51)) then
        tmp = -2.0d0
    else if (z <= 2.1d+80) then
        tmp = x * (4.0d0 / z)
    else
        tmp = -2.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -7.5e+51) {
		tmp = -2.0;
	} else if (z <= 2.1e+80) {
		tmp = x * (4.0 / z);
	} else {
		tmp = -2.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -7.5e+51:
		tmp = -2.0
	elif z <= 2.1e+80:
		tmp = x * (4.0 / z)
	else:
		tmp = -2.0
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -7.5e+51)
		tmp = -2.0;
	elseif (z <= 2.1e+80)
		tmp = Float64(x * Float64(4.0 / z));
	else
		tmp = -2.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -7.5e+51)
		tmp = -2.0;
	elseif (z <= 2.1e+80)
		tmp = x * (4.0 / z);
	else
		tmp = -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -7.5e+51], -2.0, If[LessEqual[z, 2.1e+80], N[(x * N[(4.0 / z), $MachinePrecision]), $MachinePrecision], -2.0]]

Derivation

1. Split input into 2 regimes

2. if z < -7.4999999999999999e51 or 2.10000000000000001e80 < z

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf 66.6%

      \[\leadsto \color{blue}{-2} \]

   if -7.4999999999999999e51 < z < 2.10000000000000001e80

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 46.7%

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

      1. *-commutative 46.7%

         \[\leadsto \color{blue}{\frac{x}{z} \cdot 4} \]

      2. associate-*l/ 46.7%

         \[\leadsto \color{blue}{\frac{x \cdot 4}{z}} \]

      3. associate-*r/ 46.6%

         \[\leadsto \color{blue}{x \cdot \frac{4}{z}} \]

   5. Simplified 46.6%

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

4. Final simplification 54.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -7.5 \cdot 10^{+51}:\\ \;\;\;\;-2\\ \mathbf{elif}\;z \leq 2.1 \cdot 10^{+80}:\\ \;\;\;\;x \cdot \frac{4}{z}\\ \mathbf{else}:\\ \;\;\;\;-2\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 34.0% accurate, 11.0× speedup

Math

\[\begin{array}{l} \\ -2 \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := -2.0

Derivation

1. Initial program 100.0%

   \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
2. Add Preprocessing

3. Taylor expanded in z around inf 31.5%

   \[\leadsto \color{blue}{-2} \]

4. Final simplification 31.5%

   \[\leadsto -2 \]
5. Add Preprocessing

Developer target: 98.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (- (* 4.0 (/ x z)) (+ 2.0 (* 4.0 (/ y z)))))

C

double code(double x, double y, double z) {
	return (4.0 * (x / z)) - (2.0 + (4.0 * (y / z)));
}

Fortran

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

Java

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

Python

def code(x, y, z):
	return (4.0 * (x / z)) - (2.0 + (4.0 * (y / z)))

Julia

function code(x, y, z)
	return Float64(Float64(4.0 * Float64(x / z)) - Float64(2.0 + Float64(4.0 * Float64(y / z))))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (4.0 * (x / z)) - (2.0 + (4.0 * (y / z)));
end

Wolfram

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

Reproduce

herbie shell --seed 2024082 
(FPCore (x y z)
  :name "Data.Array.Repa.Algorithms.ColorRamp:rampColorHotToCold from repa-algorithms-3.4.0.1, B"
  :precision binary64

  :alt
  (- (* 4.0 (/ x z)) (+ 2.0 (* 4.0 (/ y z))))

  (/ (* 4.0 (- (- x y) (* z 0.5))) z))