Diagrams.Color.HSV:lerp from diagrams-contrib-1.3.0.5

Percentage Accurate: 97.7% → 100.0%

Time: 3.2s

Alternatives: 7

Speedup: 1.3×

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

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 97.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(x, z - y, y\right) \end{array} \]

FPCore

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

C

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

Julia

function code(x, y, z)
	return fma(x, Float64(z - y), y)
end

Wolfram

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

Derivation

1. Initial program 96.9%

   \[\left(1 - x\right) \cdot y + x \cdot z \]
2. Step-by-step derivation

   1. sub-neg 96.9%

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

   2. +-commutative 96.9%

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

   3. distribute-rgt1-in 96.9%

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

   4. associate-+l+ 96.9%

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

   5. +-commutative 96.9%

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

   6. *-commutative 96.9%

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

   7. neg-mul-1 96.9%

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

   8. associate-*r* 96.9%

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

   9. *-commutative 96.9%

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

   10. distribute-rgt-out 100.0%

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

   11. fma-def 100.0%

       \[\leadsto \color{blue}{\mathsf{fma}\left(x, y \cdot -1 + z, y\right)} \]

   12. +-commutative 100.0%

       \[\leadsto \mathsf{fma}\left(x, \color{blue}{z + y \cdot -1}, y\right) \]

   13. *-commutative 100.0%

       \[\leadsto \mathsf{fma}\left(x, z + \color{blue}{-1 \cdot y}, y\right) \]

   14. neg-mul-1 100.0%

       \[\leadsto \mathsf{fma}\left(x, z + \color{blue}{\left(-y\right)}, y\right) \]

   15. unsub-neg 100.0%

       \[\leadsto \mathsf{fma}\left(x, \color{blue}{z - y}, y\right) \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(x, z - y, y\right)} \]

4. Final simplification 100.0%

   \[\leadsto \mathsf{fma}\left(x, z - y, y\right) \]

Alternative 2: 85.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1 \cdot 10^{-35} \lor \neg \left(x \leq 1.02 \cdot 10^{-72}\right):\\ \;\;\;\;x \cdot \left(z - y\right)\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1e-35) (not (<= x 1.02e-72))) (* x (- z y)) y))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1e-35) || !(x <= 1.02e-72)) {
		tmp = x * (z - y);
	} else {
		tmp = y;
	}
	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 <= (-1d-35)) .or. (.not. (x <= 1.02d-72))) then
        tmp = x * (z - y)
    else
        tmp = y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1e-35) || !(x <= 1.02e-72)) {
		tmp = x * (z - y);
	} else {
		tmp = y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1e-35) or not (x <= 1.02e-72):
		tmp = x * (z - y)
	else:
		tmp = y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1e-35) || !(x <= 1.02e-72))
		tmp = Float64(x * Float64(z - y));
	else
		tmp = y;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -1e-35) || ~((x <= 1.02e-72)))
		tmp = x * (z - y);
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1e-35], N[Not[LessEqual[x, 1.02e-72]], $MachinePrecision]], N[(x * N[(z - y), $MachinePrecision]), $MachinePrecision], y]

Derivation

1. Split input into 2 regimes

2. if x < -1.00000000000000001e-35 or 1.02e-72 < x

   1. Initial program 94.8%

      \[\left(1 - x\right) \cdot y + x \cdot z \]
   2. Step-by-step derivation

      1. sub-neg 94.8%

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

      2. +-commutative 94.8%

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

      3. distribute-rgt1-in 94.8%

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

      4. associate-+l+ 94.8%

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

      5. +-commutative 94.8%

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

      6. *-commutative 94.8%

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

      7. neg-mul-1 94.8%

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

      8. associate-*r* 94.8%

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

      9. *-commutative 94.8%

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

      10. distribute-rgt-out 100.0%

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

      11. fma-def 100.0%

          \[\leadsto \color{blue}{\mathsf{fma}\left(x, y \cdot -1 + z, y\right)} \]

      12. +-commutative 100.0%

          \[\leadsto \mathsf{fma}\left(x, \color{blue}{z + y \cdot -1}, y\right) \]

      13. *-commutative 100.0%

          \[\leadsto \mathsf{fma}\left(x, z + \color{blue}{-1 \cdot y}, y\right) \]

      14. neg-mul-1 100.0%

          \[\leadsto \mathsf{fma}\left(x, z + \color{blue}{\left(-y\right)}, y\right) \]

      15. unsub-neg 100.0%

          \[\leadsto \mathsf{fma}\left(x, \color{blue}{z - y}, y\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, z - y, y\right)} \]

   4. Taylor expanded in x around inf 94.9%

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

   if -1.00000000000000001e-35 < x < 1.02e-72

   1. Initial program 100.0%

      \[\left(1 - x\right) \cdot y + x \cdot z \]

   2. Taylor expanded in x around 0 68.5%

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

4. Final simplification 84.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1 \cdot 10^{-35} \lor \neg \left(x \leq 1.02 \cdot 10^{-72}\right):\\ \;\;\;\;x \cdot \left(z - y\right)\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \]

Alternative 3: 98.9% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.0) (not (<= x 8.5e-9))) (* x (- z y)) (+ y (* x z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.0) || !(x <= 8.5e-9)) {
		tmp = x * (z - y);
	} else {
		tmp = y + (x * z);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((x <= (-1.0d0)) .or. (.not. (x <= 8.5d-9))) then
        tmp = x * (z - y)
    else
        tmp = y + (x * z)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.0) || !(x <= 8.5e-9)) {
		tmp = x * (z - y);
	} else {
		tmp = y + (x * z);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1.0) or not (x <= 8.5e-9):
		tmp = x * (z - y)
	else:
		tmp = y + (x * z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.0) || !(x <= 8.5e-9))
		tmp = Float64(x * Float64(z - y));
	else
		tmp = Float64(y + Float64(x * z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -1.0) || ~((x <= 8.5e-9)))
		tmp = x * (z - y);
	else
		tmp = y + (x * z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.0], N[Not[LessEqual[x, 8.5e-9]], $MachinePrecision]], N[(x * N[(z - y), $MachinePrecision]), $MachinePrecision], N[(y + N[(x * z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1 or 8.5e-9 < x

   1. Initial program 94.2%

      \[\left(1 - x\right) \cdot y + x \cdot z \]
   2. Step-by-step derivation

      1. sub-neg 94.2%

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

      2. +-commutative 94.2%

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

      3. distribute-rgt1-in 94.2%

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

      4. associate-+l+ 94.2%

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

      5. +-commutative 94.2%

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

      6. *-commutative 94.2%

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

      7. neg-mul-1 94.2%

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

      8. associate-*r* 94.2%

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

      9. *-commutative 94.2%

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

      10. distribute-rgt-out 100.0%

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

      11. fma-def 100.0%

          \[\leadsto \color{blue}{\mathsf{fma}\left(x, y \cdot -1 + z, y\right)} \]

      12. +-commutative 100.0%

          \[\leadsto \mathsf{fma}\left(x, \color{blue}{z + y \cdot -1}, y\right) \]

      13. *-commutative 100.0%

          \[\leadsto \mathsf{fma}\left(x, z + \color{blue}{-1 \cdot y}, y\right) \]

      14. neg-mul-1 100.0%

          \[\leadsto \mathsf{fma}\left(x, z + \color{blue}{\left(-y\right)}, y\right) \]

      15. unsub-neg 100.0%

          \[\leadsto \mathsf{fma}\left(x, \color{blue}{z - y}, y\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, z - y, y\right)} \]

   4. Taylor expanded in x around inf 98.5%

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

   if -1 < x < 8.5e-9

   1. Initial program 100.0%

      \[\left(1 - x\right) \cdot y + x \cdot z \]
   2. Step-by-step derivation

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. distribute-rgt1-in 100.0%

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

      4. associate-+l+ 100.0%

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

      5. +-commutative 100.0%

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

      6. *-commutative 100.0%

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

      7. neg-mul-1 100.0%

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

      8. associate-*r* 100.0%

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

      9. *-commutative 100.0%

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

      10. distribute-rgt-out 100.0%

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

      11. fma-def 100.0%

          \[\leadsto \color{blue}{\mathsf{fma}\left(x, y \cdot -1 + z, y\right)} \]

      12. +-commutative 100.0%

          \[\leadsto \mathsf{fma}\left(x, \color{blue}{z + y \cdot -1}, y\right) \]

      13. *-commutative 100.0%

          \[\leadsto \mathsf{fma}\left(x, z + \color{blue}{-1 \cdot y}, y\right) \]

      14. neg-mul-1 100.0%

          \[\leadsto \mathsf{fma}\left(x, z + \color{blue}{\left(-y\right)}, y\right) \]

      15. unsub-neg 100.0%

          \[\leadsto \mathsf{fma}\left(x, \color{blue}{z - y}, y\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, z - y, y\right)} \]

   4. Taylor expanded in x around 0 100.0%

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

   5. Taylor expanded in z around inf 99.4%

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

4. Final simplification 98.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1 \lor \neg \left(x \leq 8.5 \cdot 10^{-9}\right):\\ \;\;\;\;x \cdot \left(z - y\right)\\ \mathbf{else}:\\ \;\;\;\;y + x \cdot z\\ \end{array} \]

Alternative 4: 53.2% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -8 \cdot 10^{-13}:\\ \;\;\;\;y\\ \mathbf{elif}\;y \leq 7.5 \cdot 10^{+37}:\\ \;\;\;\;x \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(-y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -8e-13) y (if (<= y 7.5e+37) (* x z) (* x (- y)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -8e-13) {
		tmp = y;
	} else if (y <= 7.5e+37) {
		tmp = x * z;
	} else {
		tmp = x * -y;
	}
	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 <= (-8d-13)) then
        tmp = y
    else if (y <= 7.5d+37) then
        tmp = x * z
    else
        tmp = x * -y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -8e-13) {
		tmp = y;
	} else if (y <= 7.5e+37) {
		tmp = x * z;
	} else {
		tmp = x * -y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -8e-13:
		tmp = y
	elif y <= 7.5e+37:
		tmp = x * z
	else:
		tmp = x * -y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -8e-13)
		tmp = y;
	elseif (y <= 7.5e+37)
		tmp = Float64(x * z);
	else
		tmp = Float64(x * Float64(-y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -8e-13)
		tmp = y;
	elseif (y <= 7.5e+37)
		tmp = x * z;
	else
		tmp = x * -y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -8e-13], y, If[LessEqual[y, 7.5e+37], N[(x * z), $MachinePrecision], N[(x * (-y)), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -8.0000000000000002e-13

   1. Initial program 91.2%

      \[\left(1 - x\right) \cdot y + x \cdot z \]

   2. Taylor expanded in x around 0 48.7%

      \[\leadsto \color{blue}{y} \]

   if -8.0000000000000002e-13 < y < 7.5000000000000003e37

   1. Initial program 100.0%

      \[\left(1 - x\right) \cdot y + x \cdot z \]

   2. Taylor expanded in y around 0 69.3%

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

   if 7.5000000000000003e37 < y

   1. Initial program 94.6%

      \[\left(1 - x\right) \cdot y + x \cdot z \]
   2. Step-by-step derivation

      1. sub-neg 94.6%

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

      2. +-commutative 94.6%

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

      3. distribute-rgt1-in 94.6%

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

      4. associate-+l+ 94.6%

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

      5. +-commutative 94.6%

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

      6. *-commutative 94.6%

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

      7. neg-mul-1 94.6%

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

      8. associate-*r* 94.6%

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

      9. *-commutative 94.6%

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

      10. distribute-rgt-out 100.0%

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

      11. fma-def 100.0%

          \[\leadsto \color{blue}{\mathsf{fma}\left(x, y \cdot -1 + z, y\right)} \]

      12. +-commutative 100.0%

          \[\leadsto \mathsf{fma}\left(x, \color{blue}{z + y \cdot -1}, y\right) \]

      13. *-commutative 100.0%

          \[\leadsto \mathsf{fma}\left(x, z + \color{blue}{-1 \cdot y}, y\right) \]

      14. neg-mul-1 100.0%

          \[\leadsto \mathsf{fma}\left(x, z + \color{blue}{\left(-y\right)}, y\right) \]

      15. unsub-neg 100.0%

          \[\leadsto \mathsf{fma}\left(x, \color{blue}{z - y}, y\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, z - y, y\right)} \]

   4. Taylor expanded in x around inf 64.3%

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

   5. Taylor expanded in z around 0 56.6%

      \[\leadsto \color{blue}{-1 \cdot \left(y \cdot x\right)} \]
   6. Step-by-step derivation

      1. associate-*r* 56.6%

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

      2. neg-mul-1 56.6%

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

   7. Simplified 56.6%

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

4. Final simplification 62.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -8 \cdot 10^{-13}:\\ \;\;\;\;y\\ \mathbf{elif}\;y \leq 7.5 \cdot 10^{+37}:\\ \;\;\;\;x \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(-y\right)\\ \end{array} \]

Alternative 5: 54.7% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1 \cdot 10^{-11}:\\ \;\;\;\;y\\ \mathbf{elif}\;y \leq 6.5 \cdot 10^{+24}:\\ \;\;\;\;x \cdot z\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -1e-11) y (if (<= y 6.5e+24) (* x z) y)))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -1e-11) {
		tmp = y;
	} else if (y <= 6.5e+24) {
		tmp = x * z;
	} else {
		tmp = y;
	}
	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 <= (-1d-11)) then
        tmp = y
    else if (y <= 6.5d+24) then
        tmp = x * z
    else
        tmp = y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -1e-11) {
		tmp = y;
	} else if (y <= 6.5e+24) {
		tmp = x * z;
	} else {
		tmp = y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -1e-11:
		tmp = y
	elif y <= 6.5e+24:
		tmp = x * z
	else:
		tmp = y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -1e-11)
		tmp = y;
	elseif (y <= 6.5e+24)
		tmp = Float64(x * z);
	else
		tmp = y;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -1e-11)
		tmp = y;
	elseif (y <= 6.5e+24)
		tmp = x * z;
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -1e-11], y, If[LessEqual[y, 6.5e+24], N[(x * z), $MachinePrecision], y]]

Derivation

1. Split input into 2 regimes

2. if y < -9.99999999999999939e-12 or 6.4999999999999996e24 < y

   1. Initial program 93.0%

      \[\left(1 - x\right) \cdot y + x \cdot z \]

   2. Taylor expanded in x around 0 43.4%

      \[\leadsto \color{blue}{y} \]

   if -9.99999999999999939e-12 < y < 6.4999999999999996e24

   1. Initial program 100.0%

      \[\left(1 - x\right) \cdot y + x \cdot z \]

   2. Taylor expanded in y around 0 70.3%

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

4. Final simplification 58.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1 \cdot 10^{-11}:\\ \;\;\;\;y\\ \mathbf{elif}\;y \leq 6.5 \cdot 10^{+24}:\\ \;\;\;\;x \cdot z\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \]

Alternative 6: 100.0% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 96.9%

   \[\left(1 - x\right) \cdot y + x \cdot z \]
2. Step-by-step derivation

   1. sub-neg 96.9%

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

   2. +-commutative 96.9%

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

   3. distribute-rgt1-in 96.9%

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

   4. associate-+l+ 96.9%

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

   5. +-commutative 96.9%

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

   6. *-commutative 96.9%

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

   7. neg-mul-1 96.9%

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

   8. associate-*r* 96.9%

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

   9. *-commutative 96.9%

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

   10. distribute-rgt-out 100.0%

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

   11. fma-def 100.0%

       \[\leadsto \color{blue}{\mathsf{fma}\left(x, y \cdot -1 + z, y\right)} \]

   12. +-commutative 100.0%

       \[\leadsto \mathsf{fma}\left(x, \color{blue}{z + y \cdot -1}, y\right) \]

   13. *-commutative 100.0%

       \[\leadsto \mathsf{fma}\left(x, z + \color{blue}{-1 \cdot y}, y\right) \]

   14. neg-mul-1 100.0%

       \[\leadsto \mathsf{fma}\left(x, z + \color{blue}{\left(-y\right)}, y\right) \]

   15. unsub-neg 100.0%

       \[\leadsto \mathsf{fma}\left(x, \color{blue}{z - y}, y\right) \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(x, z - y, y\right)} \]

4. Taylor expanded in x around 0 100.0%

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

5. Final simplification 100.0%

   \[\leadsto y + x \cdot \left(z - y\right) \]

Alternative 7: 36.8% accurate, 9.0× speedup

Math

\[\begin{array}{l} \\ y \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := y

Derivation

1. Initial program 96.9%

   \[\left(1 - x\right) \cdot y + x \cdot z \]

2. Taylor expanded in x around 0 31.0%

   \[\leadsto \color{blue}{y} \]

3. Final simplification 31.0%

   \[\leadsto y \]

Developer target: 100.0% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2023182 
(FPCore (x y z)
  :name "Diagrams.Color.HSV:lerp  from diagrams-contrib-1.3.0.5"
  :precision binary64

  :herbie-target
  (- y (* x (- y z)))

  (+ (* (- 1.0 x) y) (* x z)))