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

Percentage Accurate: 99.7% → 100.0%

Time: 4.0s

Alternatives: 7

Speedup: 1.2×

• 21.2% 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.7% 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 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. Final simplification 100.0%

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

Alternative 2: 51.9% accurate, 0.5× 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 -1.45 \cdot 10^{+15}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq -1.05 \cdot 10^{-106}:\\ \;\;\;\;-2\\ \mathbf{elif}\;x \leq -2.1 \cdot 10^{-130}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \leq -2.55 \cdot 10^{-257}:\\ \;\;\;\;-2\\ \mathbf{elif}\;x \leq -3 \cdot 10^{-293}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \leq 6.6 \cdot 10^{-152}:\\ \;\;\;\;-2\\ \mathbf{elif}\;x \leq 2.4 \cdot 10^{-42}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \leq 2.05 \cdot 10^{+180}:\\ \;\;\;\;-2\\ \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 -1.45e+15)
     t_1
     (if (<= x -1.05e-106)
       -2.0
       (if (<= x -2.1e-130)
         t_0
         (if (<= x -2.55e-257)
           -2.0
           (if (<= x -3e-293)
             t_0
             (if (<= x 6.6e-152)
               -2.0
               (if (<= x 2.4e-42) t_0 (if (<= x 2.05e+180) -2.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 <= -1.45e+15) {
		tmp = t_1;
	} else if (x <= -1.05e-106) {
		tmp = -2.0;
	} else if (x <= -2.1e-130) {
		tmp = t_0;
	} else if (x <= -2.55e-257) {
		tmp = -2.0;
	} else if (x <= -3e-293) {
		tmp = t_0;
	} else if (x <= 6.6e-152) {
		tmp = -2.0;
	} else if (x <= 2.4e-42) {
		tmp = t_0;
	} else if (x <= 2.05e+180) {
		tmp = -2.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 <= (-1.45d+15)) then
        tmp = t_1
    else if (x <= (-1.05d-106)) then
        tmp = -2.0d0
    else if (x <= (-2.1d-130)) then
        tmp = t_0
    else if (x <= (-2.55d-257)) then
        tmp = -2.0d0
    else if (x <= (-3d-293)) then
        tmp = t_0
    else if (x <= 6.6d-152) then
        tmp = -2.0d0
    else if (x <= 2.4d-42) then
        tmp = t_0
    else if (x <= 2.05d+180) then
        tmp = -2.0d0
    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 <= -1.45e+15) {
		tmp = t_1;
	} else if (x <= -1.05e-106) {
		tmp = -2.0;
	} else if (x <= -2.1e-130) {
		tmp = t_0;
	} else if (x <= -2.55e-257) {
		tmp = -2.0;
	} else if (x <= -3e-293) {
		tmp = t_0;
	} else if (x <= 6.6e-152) {
		tmp = -2.0;
	} else if (x <= 2.4e-42) {
		tmp = t_0;
	} else if (x <= 2.05e+180) {
		tmp = -2.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 <= -1.45e+15:
		tmp = t_1
	elif x <= -1.05e-106:
		tmp = -2.0
	elif x <= -2.1e-130:
		tmp = t_0
	elif x <= -2.55e-257:
		tmp = -2.0
	elif x <= -3e-293:
		tmp = t_0
	elif x <= 6.6e-152:
		tmp = -2.0
	elif x <= 2.4e-42:
		tmp = t_0
	elif x <= 2.05e+180:
		tmp = -2.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 <= -1.45e+15)
		tmp = t_1;
	elseif (x <= -1.05e-106)
		tmp = -2.0;
	elseif (x <= -2.1e-130)
		tmp = t_0;
	elseif (x <= -2.55e-257)
		tmp = -2.0;
	elseif (x <= -3e-293)
		tmp = t_0;
	elseif (x <= 6.6e-152)
		tmp = -2.0;
	elseif (x <= 2.4e-42)
		tmp = t_0;
	elseif (x <= 2.05e+180)
		tmp = -2.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 <= -1.45e+15)
		tmp = t_1;
	elseif (x <= -1.05e-106)
		tmp = -2.0;
	elseif (x <= -2.1e-130)
		tmp = t_0;
	elseif (x <= -2.55e-257)
		tmp = -2.0;
	elseif (x <= -3e-293)
		tmp = t_0;
	elseif (x <= 6.6e-152)
		tmp = -2.0;
	elseif (x <= 2.4e-42)
		tmp = t_0;
	elseif (x <= 2.05e+180)
		tmp = -2.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, -1.45e+15], t$95$1, If[LessEqual[x, -1.05e-106], -2.0, If[LessEqual[x, -2.1e-130], t$95$0, If[LessEqual[x, -2.55e-257], -2.0, If[LessEqual[x, -3e-293], t$95$0, If[LessEqual[x, 6.6e-152], -2.0, If[LessEqual[x, 2.4e-42], t$95$0, If[LessEqual[x, 2.05e+180], -2.0, t$95$1]]]]]]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.45e15 or 2.05e180 < x

   1. Initial program 99.9%

      \[\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 x around inf 71.1%

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

   if -1.45e15 < x < -1.05000000000000002e-106 or -2.10000000000000002e-130 < x < -2.54999999999999983e-257 or -3.0000000000000002e-293 < x < 6.59999999999999997e-152 or 2.40000000000000003e-42 < x < 2.05e180

   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 z around inf 60.7%

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

   if -1.05000000000000002e-106 < x < -2.10000000000000002e-130 or -2.54999999999999983e-257 < x < -3.0000000000000002e-293 or 6.59999999999999997e-152 < x < 2.40000000000000003e-42

   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 77.9%

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

4. Final simplification 66.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.45 \cdot 10^{+15}:\\ \;\;\;\;4 \cdot \frac{x}{z}\\ \mathbf{elif}\;x \leq -1.05 \cdot 10^{-106}:\\ \;\;\;\;-2\\ \mathbf{elif}\;x \leq -2.1 \cdot 10^{-130}:\\ \;\;\;\;-4 \cdot \frac{y}{z}\\ \mathbf{elif}\;x \leq -2.55 \cdot 10^{-257}:\\ \;\;\;\;-2\\ \mathbf{elif}\;x \leq -3 \cdot 10^{-293}:\\ \;\;\;\;-4 \cdot \frac{y}{z}\\ \mathbf{elif}\;x \leq 6.6 \cdot 10^{-152}:\\ \;\;\;\;-2\\ \mathbf{elif}\;x \leq 2.4 \cdot 10^{-42}:\\ \;\;\;\;-4 \cdot \frac{y}{z}\\ \mathbf{elif}\;x \leq 2.05 \cdot 10^{+180}:\\ \;\;\;\;-2\\ \mathbf{else}:\\ \;\;\;\;4 \cdot \frac{x}{z}\\ \end{array} \]

Alternative 3: 79.2% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -3.9e+183) (not (<= x 2.7e+180)))
   (* 4.0 (/ x z))
   (- (* -4.0 (/ y z)) 2.0)))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -3.9e+183) || !(x <= 2.7e+180)) {
		tmp = 4.0 * (x / z);
	} else {
		tmp = (-4.0 * (y / z)) - 2.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -3.9e+183) or not (x <= 2.7e+180):
		tmp = 4.0 * (x / z)
	else:
		tmp = (-4.0 * (y / z)) - 2.0
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -3.9e+183) || !(x <= 2.7e+180))
		tmp = Float64(4.0 * Float64(x / z));
	else
		tmp = Float64(Float64(-4.0 * Float64(y / z)) - 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -3.9e+183) || ~((x <= 2.7e+180)))
		tmp = 4.0 * (x / z);
	else
		tmp = (-4.0 * (y / z)) - 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -3.9e+183], N[Not[LessEqual[x, 2.7e+180]], $MachinePrecision]], N[(4.0 * N[(x / z), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 * N[(y / z), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.8999999999999999e183 or 2.70000000000000016e180 < x

   1. Initial program 99.9%

      \[\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 x around inf 86.4%

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

   if -3.8999999999999999e183 < x < 2.70000000000000016e180

   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 z around 0 100.0%

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

   5. Taylor expanded in x around 0 82.9%

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

4. Final simplification 83.7%

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

Alternative 4: 86.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -7.2e+22) (not (<= x 0.135)))
   (- (* 4.0 (/ x z)) 2.0)
   (- (* -4.0 (/ y z)) 2.0)))

C

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

Java

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

Python

def code(x, y, z):
	tmp = 0
	if (x <= -7.2e+22) or not (x <= 0.135):
		tmp = (4.0 * (x / z)) - 2.0
	else:
		tmp = (-4.0 * (y / z)) - 2.0
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -7.2e+22) || !(x <= 0.135))
		tmp = Float64(Float64(4.0 * Float64(x / z)) - 2.0);
	else
		tmp = Float64(Float64(-4.0 * Float64(y / z)) - 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -7.2e+22) || ~((x <= 0.135)))
		tmp = (4.0 * (x / z)) - 2.0;
	else
		tmp = (-4.0 * (y / z)) - 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -7.2e22 or 0.13500000000000001 < 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. 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 85.6%

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

   if -7.2e22 < x < 0.13500000000000001

   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 z around 0 100.0%

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

   5. Taylor expanded in x around 0 96.2%

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

4. Final simplification 90.8%

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

Alternative 5: 86.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.5 \cdot 10^{+106}:\\ \;\;\;\;\frac{4}{\frac{z}{x - y}}\\ \mathbf{elif}\;y \leq 1.24 \cdot 10^{+76}:\\ \;\;\;\;4 \cdot \frac{x}{z} - 2\\ \mathbf{else}:\\ \;\;\;\;-4 \cdot \frac{y}{z} - 2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -1.5e+106)
   (/ 4.0 (/ z (- x y)))
   (if (<= y 1.24e+76) (- (* 4.0 (/ x z)) 2.0) (- (* -4.0 (/ y z)) 2.0))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.5e+106) {
		tmp = 4.0 / (z / (x - y));
	} else if (y <= 1.24e+76) {
		tmp = (4.0 * (x / z)) - 2.0;
	} else {
		tmp = (-4.0 * (y / 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 <= (-1.5d+106)) then
        tmp = 4.0d0 / (z / (x - y))
    else if (y <= 1.24d+76) then
        tmp = (4.0d0 * (x / z)) - 2.0d0
    else
        tmp = ((-4.0d0) * (y / z)) - 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.5e+106) {
		tmp = 4.0 / (z / (x - y));
	} else if (y <= 1.24e+76) {
		tmp = (4.0 * (x / z)) - 2.0;
	} else {
		tmp = (-4.0 * (y / z)) - 2.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -1.5e+106:
		tmp = 4.0 / (z / (x - y))
	elif y <= 1.24e+76:
		tmp = (4.0 * (x / z)) - 2.0
	else:
		tmp = (-4.0 * (y / z)) - 2.0
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -1.5e+106)
		tmp = Float64(4.0 / Float64(z / Float64(x - y)));
	elseif (y <= 1.24e+76)
		tmp = Float64(Float64(4.0 * Float64(x / z)) - 2.0);
	else
		tmp = Float64(Float64(-4.0 * Float64(y / z)) - 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -1.5e+106)
		tmp = 4.0 / (z / (x - y));
	elseif (y <= 1.24e+76)
		tmp = (4.0 * (x / z)) - 2.0;
	else
		tmp = (-4.0 * (y / z)) - 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -1.5e+106], N[(4.0 / N[(z / N[(x - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.24e+76], N[(N[(4.0 * N[(x / z), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision], N[(N[(-4.0 * N[(y / z), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.5e106

   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.9%

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

      2. sub-neg 99.9%

         \[\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.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in z around 0 93.3%

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

      1. associate-*r/ 93.3%

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

      2. associate-/l* 93.2%

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

   6. Simplified 93.2%

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

   if -1.5e106 < y < 1.24e76

   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 inf 92.1%

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

   if 1.24e76 < y

   1. Initial program 99.9%

      \[\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 88.3%

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

4. Final simplification 91.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.5 \cdot 10^{+106}:\\ \;\;\;\;\frac{4}{\frac{z}{x - y}}\\ \mathbf{elif}\;y \leq 1.24 \cdot 10^{+76}:\\ \;\;\;\;4 \cdot \frac{x}{z} - 2\\ \mathbf{else}:\\ \;\;\;\;-4 \cdot \frac{y}{z} - 2\\ \end{array} \]

Alternative 6: 53.1% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -75000:\\ \;\;\;\;-2\\ \mathbf{elif}\;z \leq 2.9 \cdot 10^{+113}:\\ \;\;\;\;-4 \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;-2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -75000.0) -2.0 (if (<= z 2.9e+113) (* -4.0 (/ y z)) -2.0)))

C

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

Python

def code(x, y, z):
	tmp = 0
	if z <= -75000.0:
		tmp = -2.0
	elif z <= 2.9e+113:
		tmp = -4.0 * (y / z)
	else:
		tmp = -2.0
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -75000.0)
		tmp = -2.0;
	elseif (z <= 2.9e+113)
		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 <= -75000.0)
		tmp = -2.0;
	elseif (z <= 2.9e+113)
		tmp = -4.0 * (y / z);
	else
		tmp = -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -75000.0], -2.0, If[LessEqual[z, 2.9e+113], N[(-4.0 * N[(y / z), $MachinePrecision]), $MachinePrecision], -2.0]]

Derivation

1. Split input into 2 regimes

2. if z < -75000 or 2.89999999999999984e113 < z

   1. Initial program 99.9%

      \[\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 inf 70.6%

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

   if -75000 < z < 2.89999999999999984e113

   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.9%

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

      2. sub-neg 99.9%

         \[\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.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in y around inf 44.9%

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

4. Final simplification 56.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -75000:\\ \;\;\;\;-2\\ \mathbf{elif}\;z \leq 2.9 \cdot 10^{+113}:\\ \;\;\;\;-4 \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;-2\\ \end{array} \]

Alternative 7: 34.5% 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. 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 39.3%

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

5. Final simplification 39.3%

   \[\leadsto -2 \]

Developer target: 97.7% 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 2023230 
(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))