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

Percentage Accurate: 99.8% → 100.0%

Time: 5.5s

Alternatives: 7

Speedup: 1.2×

• 20.3% 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.8% 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 \frac{x - y}{z} - 2 \end{array} \]

FPCore

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

C

double code(double x, double y, double z) {
	return (4.0 * ((x - y) / z)) - 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 = (4.0d0 * ((x - y) / z)) - 2.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.6%

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

   1. associate-*l/ 99.7%

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

   2. sub-neg 99.7%

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

   3. distribute-rgt-neg-in 99.7%

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

   4. metadata-eval 99.7%

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

3. Simplified 99.7%

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

4. Taylor expanded in z around 0 100.0%

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

5. Final simplification 100.0%

   \[\leadsto 4 \cdot \frac{x - y}{z} - 2 \]

Alternative 2: 53.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := -4 \cdot \frac{y}{z}\\ t_1 := 4 \cdot \frac{x}{z}\\ \mathbf{if}\;x \leq -3.8 \cdot 10^{+69}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 1.5 \cdot 10^{-303}:\\ \;\;\;\;-2\\ \mathbf{elif}\;x \leq 1.15 \cdot 10^{-254}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \leq 8.8 \cdot 10^{-206}:\\ \;\;\;\;-2\\ \mathbf{elif}\;x \leq 2.45 \cdot 10^{+70}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* -4.0 (/ y z))) (t_1 (* 4.0 (/ x z))))
   (if (<= x -3.8e+69)
     t_1
     (if (<= x 1.5e-303)
       -2.0
       (if (<= x 1.15e-254)
         t_0
         (if (<= x 8.8e-206) -2.0 (if (<= x 2.45e+70) t_0 t_1)))))))

C

double code(double x, double y, double z) {
	double t_0 = -4.0 * (y / z);
	double t_1 = 4.0 * (x / z);
	double tmp;
	if (x <= -3.8e+69) {
		tmp = t_1;
	} else if (x <= 1.5e-303) {
		tmp = -2.0;
	} else if (x <= 1.15e-254) {
		tmp = t_0;
	} else if (x <= 8.8e-206) {
		tmp = -2.0;
	} else if (x <= 2.45e+70) {
		tmp = t_0;
	} else {
		tmp = t_1;
	}
	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 = (-4.0d0) * (y / z)
    t_1 = 4.0d0 * (x / z)
    if (x <= (-3.8d+69)) then
        tmp = t_1
    else if (x <= 1.5d-303) then
        tmp = -2.0d0
    else if (x <= 1.15d-254) then
        tmp = t_0
    else if (x <= 8.8d-206) then
        tmp = -2.0d0
    else if (x <= 2.45d+70) then
        tmp = t_0
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = -4.0 * (y / z);
	double t_1 = 4.0 * (x / z);
	double tmp;
	if (x <= -3.8e+69) {
		tmp = t_1;
	} else if (x <= 1.5e-303) {
		tmp = -2.0;
	} else if (x <= 1.15e-254) {
		tmp = t_0;
	} else if (x <= 8.8e-206) {
		tmp = -2.0;
	} else if (x <= 2.45e+70) {
		tmp = t_0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = -4.0 * (y / z)
	t_1 = 4.0 * (x / z)
	tmp = 0
	if x <= -3.8e+69:
		tmp = t_1
	elif x <= 1.5e-303:
		tmp = -2.0
	elif x <= 1.15e-254:
		tmp = t_0
	elif x <= 8.8e-206:
		tmp = -2.0
	elif x <= 2.45e+70:
		tmp = t_0
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(-4.0 * Float64(y / z))
	t_1 = Float64(4.0 * Float64(x / z))
	tmp = 0.0
	if (x <= -3.8e+69)
		tmp = t_1;
	elseif (x <= 1.5e-303)
		tmp = -2.0;
	elseif (x <= 1.15e-254)
		tmp = t_0;
	elseif (x <= 8.8e-206)
		tmp = -2.0;
	elseif (x <= 2.45e+70)
		tmp = t_0;
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = -4.0 * (y / z);
	t_1 = 4.0 * (x / z);
	tmp = 0.0;
	if (x <= -3.8e+69)
		tmp = t_1;
	elseif (x <= 1.5e-303)
		tmp = -2.0;
	elseif (x <= 1.15e-254)
		tmp = t_0;
	elseif (x <= 8.8e-206)
		tmp = -2.0;
	elseif (x <= 2.45e+70)
		tmp = t_0;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(-4.0 * N[(y / z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(4.0 * N[(x / z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -3.8e+69], t$95$1, If[LessEqual[x, 1.5e-303], -2.0, If[LessEqual[x, 1.15e-254], t$95$0, If[LessEqual[x, 8.8e-206], -2.0, If[LessEqual[x, 2.45e+70], t$95$0, t$95$1]]]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -3.80000000000000028e69 or 2.45000000000000014e70 < x

   1. Initial program 98.8%

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

      1. associate-*l/ 99.6%

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

      2. sub-neg 99.6%

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

      3. distribute-rgt-neg-in 99.6%

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

      4. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   4. Taylor expanded in x around inf 69.2%

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

   if -3.80000000000000028e69 < x < 1.50000000000000014e-303 or 1.1499999999999999e-254 < x < 8.7999999999999995e-206

   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. associate-*l/ 99.7%

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

      2. sub-neg 99.7%

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

      3. distribute-rgt-neg-in 99.7%

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

      4. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in z around inf 63.2%

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

   if 1.50000000000000014e-303 < x < 1.1499999999999999e-254 or 8.7999999999999995e-206 < x < 2.45000000000000014e70

   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. associate-*l/ 99.8%

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

      2. sub-neg 99.8%

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

      3. distribute-rgt-neg-in 99.8%

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

      4. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in y around inf 56.4%

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

4. Final simplification 63.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.8 \cdot 10^{+69}:\\ \;\;\;\;4 \cdot \frac{x}{z}\\ \mathbf{elif}\;x \leq 1.5 \cdot 10^{-303}:\\ \;\;\;\;-2\\ \mathbf{elif}\;x \leq 1.15 \cdot 10^{-254}:\\ \;\;\;\;-4 \cdot \frac{y}{z}\\ \mathbf{elif}\;x \leq 8.8 \cdot 10^{-206}:\\ \;\;\;\;-2\\ \mathbf{elif}\;x \leq 2.45 \cdot 10^{+70}:\\ \;\;\;\;-4 \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;4 \cdot \frac{x}{z}\\ \end{array} \]

Alternative 3: 80.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.9 \cdot 10^{+149}:\\ \;\;\;\;-2\\ \mathbf{elif}\;z \leq -4 \cdot 10^{+127} \lor \neg \left(z \leq -3.5 \cdot 10^{+110}\right) \land z \leq 1.85 \cdot 10^{+93}:\\ \;\;\;\;4 \cdot \frac{x - y}{z}\\ \mathbf{else}:\\ \;\;\;\;-2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -3.9e+149)
   -2.0
   (if (or (<= z -4e+127) (and (not (<= z -3.5e+110)) (<= z 1.85e+93)))
     (* 4.0 (/ (- x y) z))
     -2.0)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -3.9e+149) {
		tmp = -2.0;
	} else if ((z <= -4e+127) || (!(z <= -3.5e+110) && (z <= 1.85e+93))) {
		tmp = 4.0 * ((x - y) / 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 <= (-3.9d+149)) then
        tmp = -2.0d0
    else if ((z <= (-4d+127)) .or. (.not. (z <= (-3.5d+110))) .and. (z <= 1.85d+93)) then
        tmp = 4.0d0 * ((x - y) / 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 <= -3.9e+149) {
		tmp = -2.0;
	} else if ((z <= -4e+127) || (!(z <= -3.5e+110) && (z <= 1.85e+93))) {
		tmp = 4.0 * ((x - y) / z);
	} else {
		tmp = -2.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -3.9e+149:
		tmp = -2.0
	elif (z <= -4e+127) or (not (z <= -3.5e+110) and (z <= 1.85e+93)):
		tmp = 4.0 * ((x - y) / z)
	else:
		tmp = -2.0
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -3.9e+149)
		tmp = -2.0;
	elseif ((z <= -4e+127) || (!(z <= -3.5e+110) && (z <= 1.85e+93)))
		tmp = Float64(4.0 * Float64(Float64(x - y) / z));
	else
		tmp = -2.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -3.9e+149)
		tmp = -2.0;
	elseif ((z <= -4e+127) || (~((z <= -3.5e+110)) && (z <= 1.85e+93)))
		tmp = 4.0 * ((x - y) / z);
	else
		tmp = -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -3.9e+149], -2.0, If[Or[LessEqual[z, -4e+127], And[N[Not[LessEqual[z, -3.5e+110]], $MachinePrecision], LessEqual[z, 1.85e+93]]], N[(4.0 * N[(N[(x - y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], -2.0]]

Derivation

1. Split input into 2 regimes

2. if z < -3.8999999999999999e149 or -3.99999999999999982e127 < z < -3.4999999999999999e110 or 1.84999999999999994e93 < z

   1. Initial program 98.8%

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

      1. associate-*l/ 99.8%

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

      2. sub-neg 99.8%

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

      3. distribute-rgt-neg-in 99.8%

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

      4. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in z around inf 79.3%

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

   if -3.8999999999999999e149 < z < -3.99999999999999982e127 or -3.4999999999999999e110 < z < 1.84999999999999994e93

   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. associate-*l/ 99.6%

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

      2. sub-neg 99.6%

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

      3. distribute-rgt-neg-in 99.6%

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

      4. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   4. Taylor expanded in z around 0 84.5%

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

4. Final simplification 82.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3.9 \cdot 10^{+149}:\\ \;\;\;\;-2\\ \mathbf{elif}\;z \leq -4 \cdot 10^{+127} \lor \neg \left(z \leq -3.5 \cdot 10^{+110}\right) \land z \leq 1.85 \cdot 10^{+93}:\\ \;\;\;\;4 \cdot \frac{x - y}{z}\\ \mathbf{else}:\\ \;\;\;\;-2\\ \end{array} \]

Alternative 4: 85.3% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -6.6e+48) (not (<= z 5e-9)))
   (- (* -4.0 (/ y z)) 2.0)
   (* 4.0 (/ (- x y) z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -6.6e+48) || !(z <= 5e-9)) {
		tmp = (-4.0 * (y / z)) - 2.0;
	} else {
		tmp = 4.0 * ((x - y) / 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 ((z <= (-6.6d+48)) .or. (.not. (z <= 5d-9))) then
        tmp = ((-4.0d0) * (y / z)) - 2.0d0
    else
        tmp = 4.0d0 * ((x - y) / z)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -6.6e+48) || !(z <= 5e-9)) {
		tmp = (-4.0 * (y / z)) - 2.0;
	} else {
		tmp = 4.0 * ((x - y) / z);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -6.6e+48) or not (z <= 5e-9):
		tmp = (-4.0 * (y / z)) - 2.0
	else:
		tmp = 4.0 * ((x - y) / z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -6.6e+48) || !(z <= 5e-9))
		tmp = Float64(Float64(-4.0 * Float64(y / z)) - 2.0);
	else
		tmp = Float64(4.0 * Float64(Float64(x - y) / z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -6.6e+48) || ~((z <= 5e-9)))
		tmp = (-4.0 * (y / z)) - 2.0;
	else
		tmp = 4.0 * ((x - y) / z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -6.6e+48], N[Not[LessEqual[z, 5e-9]], $MachinePrecision]], N[(N[(-4.0 * N[(y / z), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision], N[(4.0 * N[(N[(x - y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -6.60000000000000045e48 or 5.0000000000000001e-9 < z

   1. Initial program 99.2%

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

      1. associate-*l/ 99.8%

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

      2. sub-neg 99.8%

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

      3. distribute-rgt-neg-in 99.8%

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

      4. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in z around 0 100.0%

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

   5. Taylor expanded in x around 0 84.9%

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

   if -6.60000000000000045e48 < z < 5.0000000000000001e-9

   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. associate-*l/ 99.6%

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

      2. sub-neg 99.6%

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

      3. distribute-rgt-neg-in 99.6%

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

      4. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   4. Taylor expanded in z around 0 90.3%

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

4. Final simplification 87.6%

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

Alternative 5: 86.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -7.6 \cdot 10^{+25} \lor \neg \left(y \leq 1.06 \cdot 10^{+37}\right):\\ \;\;\;\;-4 \cdot \frac{y}{z} - 2\\ \mathbf{else}:\\ \;\;\;\;\frac{4 \cdot x}{z} - 2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -7.6e+25) (not (<= y 1.06e+37)))
   (- (* -4.0 (/ y z)) 2.0)
   (- (/ (* 4.0 x) z) 2.0)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -7.6e+25) || !(y <= 1.06e+37)) {
		tmp = (-4.0 * (y / z)) - 2.0;
	} else {
		tmp = ((4.0 * x) / z) - 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 ((y <= (-7.6d+25)) .or. (.not. (y <= 1.06d+37))) then
        tmp = ((-4.0d0) * (y / z)) - 2.0d0
    else
        tmp = ((4.0d0 * x) / z) - 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -7.6e+25) || !(y <= 1.06e+37)) {
		tmp = (-4.0 * (y / z)) - 2.0;
	} else {
		tmp = ((4.0 * x) / z) - 2.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -7.6e+25) or not (y <= 1.06e+37):
		tmp = (-4.0 * (y / z)) - 2.0
	else:
		tmp = ((4.0 * x) / z) - 2.0
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -7.6e+25) || !(y <= 1.06e+37))
		tmp = Float64(Float64(-4.0 * Float64(y / z)) - 2.0);
	else
		tmp = Float64(Float64(Float64(4.0 * x) / z) - 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -7.6e+25) || ~((y <= 1.06e+37)))
		tmp = (-4.0 * (y / z)) - 2.0;
	else
		tmp = ((4.0 * x) / z) - 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -7.6e+25], N[Not[LessEqual[y, 1.06e+37]], $MachinePrecision]], N[(N[(-4.0 * N[(y / z), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision], N[(N[(N[(4.0 * x), $MachinePrecision] / z), $MachinePrecision] - 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -7.6000000000000001e25 or 1.06e37 < y

   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. associate-*l/ 99.7%

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

      2. sub-neg 99.7%

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

      3. distribute-rgt-neg-in 99.7%

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

      4. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in z around 0 100.0%

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

   5. Taylor expanded in x around 0 88.2%

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

   if -7.6000000000000001e25 < y < 1.06e37

   1. Initial program 99.3%

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

      1. associate-*l/ 99.7%

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

      2. sub-neg 99.7%

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

      3. distribute-rgt-neg-in 99.7%

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

      4. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in z around 0 100.0%

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

   5. Taylor expanded in x around inf 91.0%

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

      1. associate-*r/ 91.0%

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

   7. Simplified 91.0%

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

4. Final simplification 89.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -7.6 \cdot 10^{+25} \lor \neg \left(y \leq 1.06 \cdot 10^{+37}\right):\\ \;\;\;\;-4 \cdot \frac{y}{z} - 2\\ \mathbf{else}:\\ \;\;\;\;\frac{4 \cdot x}{z} - 2\\ \end{array} \]

Alternative 6: 53.7% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.35 \cdot 10^{+97}:\\ \;\;\;\;-2\\ \mathbf{elif}\;z \leq 1.05 \cdot 10^{+32}:\\ \;\;\;\;-4 \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;-2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -3.35e+97) -2.0 (if (<= z 1.05e+32) (* -4.0 (/ y z)) -2.0)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -3.35e+97) {
		tmp = -2.0;
	} else if (z <= 1.05e+32) {
		tmp = -4.0 * (y / 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 <= (-3.35d+97)) then
        tmp = -2.0d0
    else if (z <= 1.05d+32) then
        tmp = (-4.0d0) * (y / 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 <= -3.35e+97) {
		tmp = -2.0;
	} else if (z <= 1.05e+32) {
		tmp = -4.0 * (y / z);
	} else {
		tmp = -2.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -3.35e+97:
		tmp = -2.0
	elif z <= 1.05e+32:
		tmp = -4.0 * (y / z)
	else:
		tmp = -2.0
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -3.35e+97)
		tmp = -2.0;
	elseif (z <= 1.05e+32)
		tmp = Float64(-4.0 * Float64(y / z));
	else
		tmp = -2.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -3.35e+97)
		tmp = -2.0;
	elseif (z <= 1.05e+32)
		tmp = -4.0 * (y / z);
	else
		tmp = -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -3.35e+97], -2.0, If[LessEqual[z, 1.05e+32], N[(-4.0 * N[(y / z), $MachinePrecision]), $MachinePrecision], -2.0]]

Derivation

1. Split input into 2 regimes

2. if z < -3.34999999999999992e97 or 1.05e32 < z

   1. Initial program 99.1%

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

      1. associate-*l/ 99.8%

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

      2. sub-neg 99.8%

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

      3. distribute-rgt-neg-in 99.8%

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

      4. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in z around inf 69.8%

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

   if -3.34999999999999992e97 < z < 1.05e32

   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. associate-*l/ 99.6%

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

      2. sub-neg 99.6%

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

      3. distribute-rgt-neg-in 99.6%

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

      4. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   4. Taylor expanded in y around inf 48.0%

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

4. Final simplification 57.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3.35 \cdot 10^{+97}:\\ \;\;\;\;-2\\ \mathbf{elif}\;z \leq 1.05 \cdot 10^{+32}:\\ \;\;\;\;-4 \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;-2\\ \end{array} \]

Alternative 7: 34.3% 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 99.6%

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

   1. associate-*l/ 99.7%

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

   2. sub-neg 99.7%

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

   3. distribute-rgt-neg-in 99.7%

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

   4. metadata-eval 99.7%

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

3. Simplified 99.7%

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

4. Taylor expanded in z around inf 38.4%

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

5. Final simplification 38.4%

   \[\leadsto -2 \]

Developer target: 98.2% 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 2023185 
(FPCore (x y z)
  :name "Data.Array.Repa.Algorithms.ColorRamp:rampColorHotToCold from repa-algorithms-3.4.0.1, B"
  :precision binary64

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

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