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

Percentage Accurate: 98.2% → 100.0%

Time: 4.6s

Alternatives: 6

Speedup: 1.3×

• 20.2% 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: 98.2% 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, 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 98.4%

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

   1. remove-double-neg 98.4%

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

   2. distribute-rgt-neg-out 98.4%

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

   3. neg-sub0 98.4%

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

   4. neg-sub0 98.4%

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

   5. *-commutative 98.4%

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

   6. distribute-lft-neg-in 98.4%

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

   7. remove-double-neg 98.4%

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

   8. distribute-rgt-out-- 98.4%

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

   9. *-lft-identity 98.4%

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

   10. associate-+l- 98.4%

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

   11. distribute-lft-out-- 100.0%

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

3. Simplified 100.0%

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

5. Final simplification 100.0%

   \[\leadsto y + x \cdot \left(z - y\right) \]
6. Add Preprocessing

Alternative 2: 61.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.3 \cdot 10^{-13}:\\ \;\;\;\;x \cdot z\\ \mathbf{elif}\;x \leq 6.8 \cdot 10^{-40}:\\ \;\;\;\;y\\ \mathbf{elif}\;x \leq 25000000000000 \lor \neg \left(x \leq 1.9 \cdot 10^{+132}\right):\\ \;\;\;\;x \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(-x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -2.3e-13)
   (* x z)
   (if (<= x 6.8e-40)
     y
     (if (or (<= x 25000000000000.0) (not (<= x 1.9e+132)))
       (* x z)
       (* y (- x))))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -2.3e-13) {
		tmp = x * z;
	} else if (x <= 6.8e-40) {
		tmp = y;
	} else if ((x <= 25000000000000.0) || !(x <= 1.9e+132)) {
		tmp = x * z;
	} else {
		tmp = y * -x;
	}
	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 <= (-2.3d-13)) then
        tmp = x * z
    else if (x <= 6.8d-40) then
        tmp = y
    else if ((x <= 25000000000000.0d0) .or. (.not. (x <= 1.9d+132))) then
        tmp = x * z
    else
        tmp = y * -x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -2.3e-13) {
		tmp = x * z;
	} else if (x <= 6.8e-40) {
		tmp = y;
	} else if ((x <= 25000000000000.0) || !(x <= 1.9e+132)) {
		tmp = x * z;
	} else {
		tmp = y * -x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -2.3e-13:
		tmp = x * z
	elif x <= 6.8e-40:
		tmp = y
	elif (x <= 25000000000000.0) or not (x <= 1.9e+132):
		tmp = x * z
	else:
		tmp = y * -x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -2.3e-13)
		tmp = Float64(x * z);
	elseif (x <= 6.8e-40)
		tmp = y;
	elseif ((x <= 25000000000000.0) || !(x <= 1.9e+132))
		tmp = Float64(x * z);
	else
		tmp = Float64(y * Float64(-x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -2.3e-13)
		tmp = x * z;
	elseif (x <= 6.8e-40)
		tmp = y;
	elseif ((x <= 25000000000000.0) || ~((x <= 1.9e+132)))
		tmp = x * z;
	else
		tmp = y * -x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -2.3e-13], N[(x * z), $MachinePrecision], If[LessEqual[x, 6.8e-40], y, If[Or[LessEqual[x, 25000000000000.0], N[Not[LessEqual[x, 1.9e+132]], $MachinePrecision]], N[(x * z), $MachinePrecision], N[(y * (-x)), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.29999999999999979e-13 or 6.79999999999999968e-40 < x < 2.5e13 or 1.90000000000000003e132 < x

   1. Initial program 96.6%

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

      1. remove-double-neg 96.6%

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

      2. distribute-rgt-neg-out 96.6%

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

      3. neg-sub0 96.6%

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

      4. neg-sub0 96.6%

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

      5. *-commutative 96.6%

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

      6. distribute-lft-neg-in 96.6%

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

      7. remove-double-neg 96.6%

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

      8. distribute-rgt-out-- 96.6%

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

      9. *-lft-identity 96.6%

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

      10. associate-+l- 96.6%

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

      11. distribute-lft-out-- 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around 0 61.3%

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

   if -2.29999999999999979e-13 < x < 6.79999999999999968e-40

   1. Initial program 100.0%

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

      1. remove-double-neg 100.0%

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

      2. distribute-rgt-neg-out 100.0%

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

      3. neg-sub0 100.0%

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

      4. neg-sub0 100.0%

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

      5. *-commutative 100.0%

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

      6. distribute-lft-neg-in 100.0%

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

      7. remove-double-neg 100.0%

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

      8. distribute-rgt-out-- 100.0%

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

      9. *-lft-identity 100.0%

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

      10. associate-+l- 100.0%

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

      11. distribute-lft-out-- 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around inf 72.6%

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

   6. Taylor expanded in x around 0 72.5%

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

   if 2.5e13 < x < 1.90000000000000003e132

   1. Initial program 100.0%

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

      1. remove-double-neg 100.0%

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

      2. distribute-rgt-neg-out 100.0%

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

      3. neg-sub0 100.0%

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

      4. neg-sub0 100.0%

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

      5. *-commutative 100.0%

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

      6. distribute-lft-neg-in 100.0%

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

      7. remove-double-neg 100.0%

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

      8. distribute-rgt-out-- 100.0%

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

      9. *-lft-identity 100.0%

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

      10. associate-+l- 100.0%

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

      11. distribute-lft-out-- 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around inf 99.8%

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

   6. Taylor expanded in z around 0 67.0%

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

      1. associate-*r* 67.0%

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

      2. neg-mul-1 67.0%

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

   8. Simplified 67.0%

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

4. Final simplification 66.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.3 \cdot 10^{-13}:\\ \;\;\;\;x \cdot z\\ \mathbf{elif}\;x \leq 6.8 \cdot 10^{-40}:\\ \;\;\;\;y\\ \mathbf{elif}\;x \leq 25000000000000 \lor \neg \left(x \leq 1.9 \cdot 10^{+132}\right):\\ \;\;\;\;x \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(-x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -450000000000 \lor \neg \left(x \leq 4.2 \cdot 10^{-11}\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 -450000000000.0) (not (<= x 4.2e-11)))
   (* x (- z y))
   (+ y (* x z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -450000000000.0) || !(x <= 4.2e-11)) {
		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 <= (-450000000000.0d0)) .or. (.not. (x <= 4.2d-11))) 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 <= -450000000000.0) || !(x <= 4.2e-11)) {
		tmp = x * (z - y);
	} else {
		tmp = y + (x * z);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -450000000000.0) or not (x <= 4.2e-11):
		tmp = x * (z - y)
	else:
		tmp = y + (x * z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -450000000000.0) || !(x <= 4.2e-11))
		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 <= -450000000000.0) || ~((x <= 4.2e-11)))
		tmp = x * (z - y);
	else
		tmp = y + (x * z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -450000000000.0], N[Not[LessEqual[x, 4.2e-11]], $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 < -4.5e11 or 4.1999999999999997e-11 < x

   1. Initial program 97.1%

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

      1. remove-double-neg 97.1%

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

      2. distribute-rgt-neg-out 97.1%

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

      3. neg-sub0 97.1%

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

      4. neg-sub0 97.1%

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

      5. *-commutative 97.1%

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

      6. distribute-lft-neg-in 97.1%

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

      7. remove-double-neg 97.1%

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

      8. distribute-rgt-out-- 97.1%

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

      9. *-lft-identity 97.1%

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

      10. associate-+l- 97.1%

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

      11. distribute-lft-out-- 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around inf 99.6%

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

   if -4.5e11 < x < 4.1999999999999997e-11

   1. Initial program 100.0%

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

      1. remove-double-neg 100.0%

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

      2. distribute-rgt-neg-out 100.0%

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

      3. neg-sub0 100.0%

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

      4. neg-sub0 100.0%

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

      5. *-commutative 100.0%

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

      6. distribute-lft-neg-in 100.0%

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

      7. remove-double-neg 100.0%

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

      8. distribute-rgt-out-- 100.0%

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

      9. *-lft-identity 100.0%

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

      10. associate-+l- 100.0%

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

      11. distribute-lft-out-- 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around 0 99.3%

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

      1. mul-1-neg 99.3%

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

      2. distribute-rgt-neg-out 99.3%

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

   7. Simplified 99.3%

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

      1. *-commutative 99.3%

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

      2. cancel-sign-sub 99.3%

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

      3. *-commutative 99.3%

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

      4. +-commutative 99.3%

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

   9. Applied egg-rr 99.3%

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

4. Final simplification 99.5%

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

Alternative 4: 84.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.5 \cdot 10^{-13} \lor \neg \left(x \leq 9.6 \cdot 10^{-12}\right):\\ \;\;\;\;x \cdot \left(z - y\right)\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.5e-13) (not (<= x 9.6e-12))) (* x (- z y)) y))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.5e-13) || !(x <= 9.6e-12)) {
		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 <= (-1.5d-13)) .or. (.not. (x <= 9.6d-12))) 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 <= -1.5e-13) || !(x <= 9.6e-12)) {
		tmp = x * (z - y);
	} else {
		tmp = y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1.5e-13) or not (x <= 9.6e-12):
		tmp = x * (z - y)
	else:
		tmp = y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.5e-13) || !(x <= 9.6e-12))
		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 <= -1.5e-13) || ~((x <= 9.6e-12)))
		tmp = x * (z - y);
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.5e-13], N[Not[LessEqual[x, 9.6e-12]], $MachinePrecision]], N[(x * N[(z - y), $MachinePrecision]), $MachinePrecision], y]

Derivation

1. Split input into 2 regimes

2. if x < -1.49999999999999992e-13 or 9.59999999999999948e-12 < x

   1. Initial program 97.2%

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

      1. remove-double-neg 97.2%

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

      2. distribute-rgt-neg-out 97.2%

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

      3. neg-sub0 97.2%

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

      4. neg-sub0 97.2%

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

      5. *-commutative 97.2%

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

      6. distribute-lft-neg-in 97.2%

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

      7. remove-double-neg 97.2%

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

      8. distribute-rgt-out-- 97.2%

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

      9. *-lft-identity 97.2%

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

      10. associate-+l- 97.2%

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

      11. distribute-lft-out-- 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around inf 99.0%

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

   if -1.49999999999999992e-13 < x < 9.59999999999999948e-12

   1. Initial program 100.0%

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

      1. remove-double-neg 100.0%

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

      2. distribute-rgt-neg-out 100.0%

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

      3. neg-sub0 100.0%

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

      4. neg-sub0 100.0%

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

      5. *-commutative 100.0%

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

      6. distribute-lft-neg-in 100.0%

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

      7. remove-double-neg 100.0%

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

      8. distribute-rgt-out-- 100.0%

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

      9. *-lft-identity 100.0%

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

      10. associate-+l- 100.0%

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

      11. distribute-lft-out-- 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around inf 71.5%

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

   6. Taylor expanded in x around 0 71.4%

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

4. Final simplification 86.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.5 \cdot 10^{-13} \lor \neg \left(x \leq 9.6 \cdot 10^{-12}\right):\\ \;\;\;\;x \cdot \left(z - y\right)\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 61.4% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -9.4e-14) (not (<= x 9e-40))) (* x z) y))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -9.4e-14) || !(x <= 9e-40)) {
		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 ((x <= (-9.4d-14)) .or. (.not. (x <= 9d-40))) 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 ((x <= -9.4e-14) || !(x <= 9e-40)) {
		tmp = x * z;
	} else {
		tmp = y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -9.4e-14) or not (x <= 9e-40):
		tmp = x * z
	else:
		tmp = y
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -9.4e-14) || ~((x <= 9e-40)))
		tmp = x * z;
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -9.4000000000000003e-14 or 9.0000000000000002e-40 < x

   1. Initial program 97.3%

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

      1. remove-double-neg 97.3%

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

      2. distribute-rgt-neg-out 97.3%

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

      3. neg-sub0 97.3%

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

      4. neg-sub0 97.3%

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

      5. *-commutative 97.3%

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

      6. distribute-lft-neg-in 97.3%

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

      7. remove-double-neg 97.3%

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

      8. distribute-rgt-out-- 97.3%

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

      9. *-lft-identity 97.3%

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

      10. associate-+l- 97.3%

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

      11. distribute-lft-out-- 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around 0 56.2%

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

   if -9.4000000000000003e-14 < x < 9.0000000000000002e-40

   1. Initial program 100.0%

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

      1. remove-double-neg 100.0%

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

      2. distribute-rgt-neg-out 100.0%

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

      3. neg-sub0 100.0%

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

      4. neg-sub0 100.0%

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

      5. *-commutative 100.0%

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

      6. distribute-lft-neg-in 100.0%

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

      7. remove-double-neg 100.0%

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

      8. distribute-rgt-out-- 100.0%

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

      9. *-lft-identity 100.0%

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

      10. associate-+l- 100.0%

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

      11. distribute-lft-out-- 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around inf 72.6%

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

   6. Taylor expanded in x around 0 72.5%

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

4. Final simplification 63.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -9.4 \cdot 10^{-14} \lor \neg \left(x \leq 9 \cdot 10^{-40}\right):\\ \;\;\;\;x \cdot z\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 37.1% 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 98.4%

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

   1. remove-double-neg 98.4%

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

   2. distribute-rgt-neg-out 98.4%

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

   3. neg-sub0 98.4%

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

   4. neg-sub0 98.4%

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

   5. *-commutative 98.4%

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

   6. distribute-lft-neg-in 98.4%

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

   7. remove-double-neg 98.4%

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

   8. distribute-rgt-out-- 98.4%

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

   9. *-lft-identity 98.4%

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

   10. associate-+l- 98.4%

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

   11. distribute-lft-out-- 100.0%

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

3. Simplified 100.0%

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

5. Taylor expanded in y around inf 60.2%

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

6. Taylor expanded in x around 0 33.1%

   \[\leadsto \color{blue}{y} \]
7. Add Preprocessing

Developer Target 1: 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 2024137 
(FPCore (x y z)
  :name "Diagrams.Color.HSV:lerp  from diagrams-contrib-1.3.0.5"
  :precision binary64

  :alt
  (! :herbie-platform default (- y (* x (- y z))))

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