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

Percentage Accurate: 99.9% → 99.9%

Time: 7.5s

Alternatives: 7

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

Alternative 2: 98.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{4 \cdot \left(\left(x + y \cdot 0.25\right) - z\right)}{y}\\ \mathbf{if}\;t\_0 \leq -2 \cdot 10^{+17} \lor \neg \left(t\_0 \leq 2\right):\\ \;\;\;\;\frac{x - z}{y} \cdot 4\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{4}{y}, x, 2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (/ (* 4.0 (- (+ x (* y 0.25)) z)) y)))
   (if (or (<= t_0 -2e+17) (not (<= t_0 2.0)))
     (* (/ (- x z) y) 4.0)
     (fma (/ 4.0 y) x 2.0))))

C

double code(double x, double y, double z) {
	double t_0 = (4.0 * ((x + (y * 0.25)) - z)) / y;
	double tmp;
	if ((t_0 <= -2e+17) || !(t_0 <= 2.0)) {
		tmp = ((x - z) / y) * 4.0;
	} else {
		tmp = fma((4.0 / y), x, 2.0);
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(4.0 * Float64(Float64(x + Float64(y * 0.25)) - z)) / y)
	tmp = 0.0
	if ((t_0 <= -2e+17) || !(t_0 <= 2.0))
		tmp = Float64(Float64(Float64(x - z) / y) * 4.0);
	else
		tmp = fma(Float64(4.0 / y), x, 2.0);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(4.0 * N[(N[(x + N[(y * 0.25), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]}, If[Or[LessEqual[t$95$0, -2e+17], N[Not[LessEqual[t$95$0, 2.0]], $MachinePrecision]], N[(N[(N[(x - z), $MachinePrecision] / y), $MachinePrecision] * 4.0), $MachinePrecision], N[(N[(4.0 / y), $MachinePrecision] * x + 2.0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 4 binary64) (-.f64 (+.f64 x (*.f64 y #s(literal 1/4 binary64))) z)) y) < -2e17 or 2 < (/.f64 (*.f64 #s(literal 4 binary64) (-.f64 (+.f64 x (*.f64 y #s(literal 1/4 binary64))) z)) y)

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 99.4

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

   5. Applied rewrites 99.4%

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

   if -2e17 < (/.f64 (*.f64 #s(literal 4 binary64) (-.f64 (+.f64 x (*.f64 y #s(literal 1/4 binary64))) z)) y) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

         \[\leadsto \color{blue}{4 \cdot \frac{x + \frac{1}{4} \cdot y}{y} + 1} \]

      2. associate-*r/ N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. metadata-eval N/A

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

      6. associate-*r/ N/A

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

      7. *-commutative N/A

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

   5. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{4}{y}, x, 2\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{4 \cdot \left(\left(x + y \cdot 0.25\right) - z\right)}{y} \leq -2 \cdot 10^{+17} \lor \neg \left(\frac{4 \cdot \left(\left(x + y \cdot 0.25\right) - z\right)}{y} \leq 2\right):\\ \;\;\;\;\frac{x - z}{y} \cdot 4\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{4}{y}, x, 2\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 66.2% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{4 \cdot \left(\left(x + y \cdot 0.25\right) - z\right)}{y}\\ \mathbf{if}\;t\_0 \leq -2 \cdot 10^{+17} \lor \neg \left(t\_0 \leq 2\right):\\ \;\;\;\;\frac{-4 \cdot z}{y}\\ \mathbf{else}:\\ \;\;\;\;2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (/ (* 4.0 (- (+ x (* y 0.25)) z)) y)))
   (if (or (<= t_0 -2e+17) (not (<= t_0 2.0))) (/ (* -4.0 z) y) 2.0)))

C

double code(double x, double y, double z) {
	double t_0 = (4.0 * ((x + (y * 0.25)) - z)) / y;
	double tmp;
	if ((t_0 <= -2e+17) || !(t_0 <= 2.0)) {
		tmp = (-4.0 * z) / y;
	} 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) :: t_0
    real(8) :: tmp
    t_0 = (4.0d0 * ((x + (y * 0.25d0)) - z)) / y
    if ((t_0 <= (-2d+17)) .or. (.not. (t_0 <= 2.0d0))) then
        tmp = ((-4.0d0) * z) / y
    else
        tmp = 2.0d0
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z):
	t_0 = (4.0 * ((x + (y * 0.25)) - z)) / y
	tmp = 0
	if (t_0 <= -2e+17) or not (t_0 <= 2.0):
		tmp = (-4.0 * z) / y
	else:
		tmp = 2.0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(4.0 * Float64(Float64(x + Float64(y * 0.25)) - z)) / y)
	tmp = 0.0
	if ((t_0 <= -2e+17) || !(t_0 <= 2.0))
		tmp = Float64(Float64(-4.0 * z) / y);
	else
		tmp = 2.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (4.0 * ((x + (y * 0.25)) - z)) / y;
	tmp = 0.0;
	if ((t_0 <= -2e+17) || ~((t_0 <= 2.0)))
		tmp = (-4.0 * z) / y;
	else
		tmp = 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(4.0 * N[(N[(x + N[(y * 0.25), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]}, If[Or[LessEqual[t$95$0, -2e+17], N[Not[LessEqual[t$95$0, 2.0]], $MachinePrecision]], N[(N[(-4.0 * z), $MachinePrecision] / y), $MachinePrecision], 2.0]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 4 binary64) (-.f64 (+.f64 x (*.f64 y #s(literal 1/4 binary64))) z)) y) < -2e17 or 2 < (/.f64 (*.f64 #s(literal 4 binary64) (-.f64 (+.f64 x (*.f64 y #s(literal 1/4 binary64))) z)) y)

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

      1. associate-*r/ N/A

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

      2. associate-*l/ N/A

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

      3. metadata-eval N/A

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

      4. distribute-neg-frac N/A

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

      5. metadata-eval N/A

         \[\leadsto \left(\mathsf{neg}\left(\frac{\color{blue}{4 \cdot 1}}{y}\right)\right) \cdot z \]

      6. associate-*r/ N/A

         \[\leadsto \left(\mathsf{neg}\left(\color{blue}{4 \cdot \frac{1}{y}}\right)\right) \cdot z \]

      7. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(4 \cdot \frac{1}{y}\right)\right) \cdot z} \]

      8. associate-*r/ N/A

         \[\leadsto \left(\mathsf{neg}\left(\color{blue}{\frac{4 \cdot 1}{y}}\right)\right) \cdot z \]

      9. metadata-eval N/A

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

      10. distribute-neg-frac N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 58.5

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

   5. Applied rewrites 58.5%

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

   7. Applied rewrites 58.7%

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

   if -2e17 < (/.f64 (*.f64 #s(literal 4 binary64) (-.f64 (+.f64 x (*.f64 y #s(literal 1/4 binary64))) z)) y) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{2} \]
   4. Step-by-step derivation

   5. Applied rewrites 96.0%

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

4. Final simplification 70.6%

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

Alternative 4: 66.2% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{4 \cdot \left(\left(x + y \cdot 0.25\right) - z\right)}{y}\\ \mathbf{if}\;t\_0 \leq -2 \cdot 10^{+17} \lor \neg \left(t\_0 \leq 2\right):\\ \;\;\;\;\frac{-4}{y} \cdot z\\ \mathbf{else}:\\ \;\;\;\;2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (/ (* 4.0 (- (+ x (* y 0.25)) z)) y)))
   (if (or (<= t_0 -2e+17) (not (<= t_0 2.0))) (* (/ -4.0 y) z) 2.0)))

C

double code(double x, double y, double z) {
	double t_0 = (4.0 * ((x + (y * 0.25)) - z)) / y;
	double tmp;
	if ((t_0 <= -2e+17) || !(t_0 <= 2.0)) {
		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) :: t_0
    real(8) :: tmp
    t_0 = (4.0d0 * ((x + (y * 0.25d0)) - z)) / y
    if ((t_0 <= (-2d+17)) .or. (.not. (t_0 <= 2.0d0))) 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 t_0 = (4.0 * ((x + (y * 0.25)) - z)) / y;
	double tmp;
	if ((t_0 <= -2e+17) || !(t_0 <= 2.0)) {
		tmp = (-4.0 / y) * z;
	} else {
		tmp = 2.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (4.0 * ((x + (y * 0.25)) - z)) / y
	tmp = 0
	if (t_0 <= -2e+17) or not (t_0 <= 2.0):
		tmp = (-4.0 / y) * z
	else:
		tmp = 2.0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(4.0 * Float64(Float64(x + Float64(y * 0.25)) - z)) / y)
	tmp = 0.0
	if ((t_0 <= -2e+17) || !(t_0 <= 2.0))
		tmp = Float64(Float64(-4.0 / y) * z);
	else
		tmp = 2.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (4.0 * ((x + (y * 0.25)) - z)) / y;
	tmp = 0.0;
	if ((t_0 <= -2e+17) || ~((t_0 <= 2.0)))
		tmp = (-4.0 / y) * z;
	else
		tmp = 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(4.0 * N[(N[(x + N[(y * 0.25), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]}, If[Or[LessEqual[t$95$0, -2e+17], N[Not[LessEqual[t$95$0, 2.0]], $MachinePrecision]], N[(N[(-4.0 / y), $MachinePrecision] * z), $MachinePrecision], 2.0]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 4 binary64) (-.f64 (+.f64 x (*.f64 y #s(literal 1/4 binary64))) z)) y) < -2e17 or 2 < (/.f64 (*.f64 #s(literal 4 binary64) (-.f64 (+.f64 x (*.f64 y #s(literal 1/4 binary64))) z)) y)

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

      1. associate-*r/ N/A

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

      2. associate-*l/ N/A

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

      3. metadata-eval N/A

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

      4. distribute-neg-frac N/A

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

      5. metadata-eval N/A

         \[\leadsto \left(\mathsf{neg}\left(\frac{\color{blue}{4 \cdot 1}}{y}\right)\right) \cdot z \]

      6. associate-*r/ N/A

         \[\leadsto \left(\mathsf{neg}\left(\color{blue}{4 \cdot \frac{1}{y}}\right)\right) \cdot z \]

      7. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(4 \cdot \frac{1}{y}\right)\right) \cdot z} \]

      8. associate-*r/ N/A

         \[\leadsto \left(\mathsf{neg}\left(\color{blue}{\frac{4 \cdot 1}{y}}\right)\right) \cdot z \]

      9. metadata-eval N/A

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

      10. distribute-neg-frac N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 58.5

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

   5. Applied rewrites 58.5%

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

   if -2e17 < (/.f64 (*.f64 #s(literal 4 binary64) (-.f64 (+.f64 x (*.f64 y #s(literal 1/4 binary64))) z)) y) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{2} \]
   4. Step-by-step derivation

   5. Applied rewrites 96.0%

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

4. Final simplification 70.5%

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

Alternative 5: 84.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -6.6 \cdot 10^{+131} \lor \neg \left(x \leq 2.5 \cdot 10^{+115}\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{4}{y}, x, 2\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-4, \frac{z}{y}, 2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -6.6e+131) (not (<= x 2.5e+115)))
   (fma (/ 4.0 y) x 2.0)
   (fma -4.0 (/ z y) 2.0)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -6.6e+131) || !(x <= 2.5e+115)) {
		tmp = fma((4.0 / y), x, 2.0);
	} else {
		tmp = fma(-4.0, (z / y), 2.0);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -6.6e+131) || !(x <= 2.5e+115))
		tmp = fma(Float64(4.0 / y), x, 2.0);
	else
		tmp = fma(-4.0, Float64(z / y), 2.0);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -6.5999999999999997e131 or 2.50000000000000004e115 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

         \[\leadsto \color{blue}{4 \cdot \frac{x + \frac{1}{4} \cdot y}{y} + 1} \]

      2. associate-*r/ N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. metadata-eval N/A

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

      6. associate-*r/ N/A

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

      7. *-commutative N/A

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

   5. Applied rewrites 85.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{4}{y}, x, 2\right)} \]

   if -6.5999999999999997e131 < x < 2.50000000000000004e115

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. div-sub N/A

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

      3. sub-neg N/A

         \[\leadsto 4 \cdot \color{blue}{\left(\frac{\frac{1}{4} \cdot y}{y} + \left(\mathsf{neg}\left(\frac{z}{y}\right)\right)\right)} + 1 \]

      4. distribute-lft-in N/A

         \[\leadsto \color{blue}{\left(4 \cdot \frac{\frac{1}{4} \cdot y}{y} + 4 \cdot \left(\mathsf{neg}\left(\frac{z}{y}\right)\right)\right)} + 1 \]

      5. associate-/l* N/A

         \[\leadsto \left(\color{blue}{\frac{4 \cdot \left(\frac{1}{4} \cdot y\right)}{y}} + 4 \cdot \left(\mathsf{neg}\left(\frac{z}{y}\right)\right)\right) + 1 \]

      6. associate-*r* N/A

         \[\leadsto \left(\frac{\color{blue}{\left(4 \cdot \frac{1}{4}\right) \cdot y}}{y} + 4 \cdot \left(\mathsf{neg}\left(\frac{z}{y}\right)\right)\right) + 1 \]

      7. metadata-eval N/A

         \[\leadsto \left(\frac{\color{blue}{1} \cdot y}{y} + 4 \cdot \left(\mathsf{neg}\left(\frac{z}{y}\right)\right)\right) + 1 \]

      8. *-lft-identity N/A

         \[\leadsto \left(\frac{\color{blue}{y}}{y} + 4 \cdot \left(\mathsf{neg}\left(\frac{z}{y}\right)\right)\right) + 1 \]

      9. *-inverses N/A

         \[\leadsto \left(\color{blue}{1} + 4 \cdot \left(\mathsf{neg}\left(\frac{z}{y}\right)\right)\right) + 1 \]

      10. distribute-neg-frac N/A

          \[\leadsto \left(1 + 4 \cdot \color{blue}{\frac{\mathsf{neg}\left(z\right)}{y}}\right) + 1 \]

      11. neg-mul-1 N/A

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

      12. associate-*r/ N/A

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

      13. associate-*l/ N/A

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

      14. metadata-eval N/A

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

      15. associate-*r/ N/A

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

      16. neg-mul-1 N/A

          \[\leadsto \left(1 + \left(4 \cdot \frac{1}{y}\right) \cdot \color{blue}{\left(\mathsf{neg}\left(z\right)\right)}\right) + 1 \]

      17. distribute-rgt-neg-in N/A

          \[\leadsto \left(1 + \color{blue}{\left(\mathsf{neg}\left(\left(4 \cdot \frac{1}{y}\right) \cdot z\right)\right)}\right) + 1 \]

      18. +-commutative N/A

          \[\leadsto \color{blue}{\left(\left(\mathsf{neg}\left(\left(4 \cdot \frac{1}{y}\right) \cdot z\right)\right) + 1\right)} + 1 \]

      19. associate-+l+ N/A

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\left(4 \cdot \frac{1}{y}\right) \cdot z\right)\right) + \left(1 + 1\right)} \]

      20. metadata-eval N/A

          \[\leadsto \left(\mathsf{neg}\left(\left(4 \cdot \frac{1}{y}\right) \cdot z\right)\right) + \color{blue}{2} \]

   5. Applied rewrites 91.3%

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

4. Final simplification 89.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -6.6 \cdot 10^{+131} \lor \neg \left(x \leq 2.5 \cdot 10^{+115}\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{4}{y}, x, 2\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-4, \frac{z}{y}, 2\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 80.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.02 \cdot 10^{+152} \lor \neg \left(x \leq 3.5 \cdot 10^{+143}\right):\\ \;\;\;\;\frac{x}{y} \cdot 4\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-4, \frac{z}{y}, 2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.02e+152) (not (<= x 3.5e+143)))
   (* (/ x y) 4.0)
   (fma -4.0 (/ z y) 2.0)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.02e+152) || !(x <= 3.5e+143)) {
		tmp = (x / y) * 4.0;
	} else {
		tmp = fma(-4.0, (z / y), 2.0);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.02e+152) || !(x <= 3.5e+143))
		tmp = Float64(Float64(x / y) * 4.0);
	else
		tmp = fma(-4.0, Float64(z / y), 2.0);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1.01999999999999999e152 or 3.50000000000000008e143 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 76.6

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

   5. Applied rewrites 76.6%

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

   if -1.01999999999999999e152 < x < 3.50000000000000008e143

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. div-sub N/A

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

      3. sub-neg N/A

         \[\leadsto 4 \cdot \color{blue}{\left(\frac{\frac{1}{4} \cdot y}{y} + \left(\mathsf{neg}\left(\frac{z}{y}\right)\right)\right)} + 1 \]

      4. distribute-lft-in N/A

         \[\leadsto \color{blue}{\left(4 \cdot \frac{\frac{1}{4} \cdot y}{y} + 4 \cdot \left(\mathsf{neg}\left(\frac{z}{y}\right)\right)\right)} + 1 \]

      5. associate-/l* N/A

         \[\leadsto \left(\color{blue}{\frac{4 \cdot \left(\frac{1}{4} \cdot y\right)}{y}} + 4 \cdot \left(\mathsf{neg}\left(\frac{z}{y}\right)\right)\right) + 1 \]

      6. associate-*r* N/A

         \[\leadsto \left(\frac{\color{blue}{\left(4 \cdot \frac{1}{4}\right) \cdot y}}{y} + 4 \cdot \left(\mathsf{neg}\left(\frac{z}{y}\right)\right)\right) + 1 \]

      7. metadata-eval N/A

         \[\leadsto \left(\frac{\color{blue}{1} \cdot y}{y} + 4 \cdot \left(\mathsf{neg}\left(\frac{z}{y}\right)\right)\right) + 1 \]

      8. *-lft-identity N/A

         \[\leadsto \left(\frac{\color{blue}{y}}{y} + 4 \cdot \left(\mathsf{neg}\left(\frac{z}{y}\right)\right)\right) + 1 \]

      9. *-inverses N/A

         \[\leadsto \left(\color{blue}{1} + 4 \cdot \left(\mathsf{neg}\left(\frac{z}{y}\right)\right)\right) + 1 \]

      10. distribute-neg-frac N/A

          \[\leadsto \left(1 + 4 \cdot \color{blue}{\frac{\mathsf{neg}\left(z\right)}{y}}\right) + 1 \]

      11. neg-mul-1 N/A

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

      12. associate-*r/ N/A

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

      13. associate-*l/ N/A

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

      14. metadata-eval N/A

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

      15. associate-*r/ N/A

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

      16. neg-mul-1 N/A

          \[\leadsto \left(1 + \left(4 \cdot \frac{1}{y}\right) \cdot \color{blue}{\left(\mathsf{neg}\left(z\right)\right)}\right) + 1 \]

      17. distribute-rgt-neg-in N/A

          \[\leadsto \left(1 + \color{blue}{\left(\mathsf{neg}\left(\left(4 \cdot \frac{1}{y}\right) \cdot z\right)\right)}\right) + 1 \]

      18. +-commutative N/A

          \[\leadsto \color{blue}{\left(\left(\mathsf{neg}\left(\left(4 \cdot \frac{1}{y}\right) \cdot z\right)\right) + 1\right)} + 1 \]

      19. associate-+l+ N/A

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\left(4 \cdot \frac{1}{y}\right) \cdot z\right)\right) + \left(1 + 1\right)} \]

      20. metadata-eval N/A

          \[\leadsto \left(\mathsf{neg}\left(\left(4 \cdot \frac{1}{y}\right) \cdot z\right)\right) + \color{blue}{2} \]

   5. Applied rewrites 88.9%

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

4. Final simplification 85.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.02 \cdot 10^{+152} \lor \neg \left(x \leq 3.5 \cdot 10^{+143}\right):\\ \;\;\;\;\frac{x}{y} \cdot 4\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-4, \frac{z}{y}, 2\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 34.1% accurate, 31.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%

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

3. Taylor expanded in y around inf

   \[\leadsto \color{blue}{2} \]
4. Step-by-step derivation

5. Applied rewrites 32.6%

   \[\leadsto \color{blue}{2} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2024324 
(FPCore (x y z)
  :name "Data.Array.Repa.Algorithms.ColorRamp:rampColorHotToCold from repa-algorithms-3.4.0.1, C"
  :precision binary64
  (+ 1.0 (/ (* 4.0 (- (+ x (* y 0.25)) z)) y)))