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

Percentage Accurate: 98.0% → 100.0%

Time: 5.5s

Alternatives: 7

Speedup: 1.3×

• 20.9% 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.0% 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 97.6%

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

   1. remove-double-neg 97.6%

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

   2. distribute-rgt-neg-out 97.6%

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

   3. neg-sub0 97.6%

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

   4. neg-sub0 97.6%

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

   5. *-commutative 97.6%

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

   6. distribute-lft-neg-in 97.6%

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

   7. remove-double-neg 97.6%

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

   8. distribute-rgt-out-- 97.6%

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

   9. *-lft-identity 97.6%

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

   10. associate-+l- 97.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. Final simplification 100.0%

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

Alternative 2: 61.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \left(-x\right)\\ \mathbf{if}\;x \leq -1.7 \cdot 10^{+180}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq -1.1 \cdot 10^{-35}:\\ \;\;\;\;x \cdot z\\ \mathbf{elif}\;x \leq 1:\\ \;\;\;\;y\\ \mathbf{elif}\;x \leq 2.9 \cdot 10^{+256}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;x \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* y (- x))))
   (if (<= x -1.7e+180)
     t_0
     (if (<= x -1.1e-35)
       (* x z)
       (if (<= x 1.0) y (if (<= x 2.9e+256) t_0 (* x z)))))))

C

double code(double x, double y, double z) {
	double t_0 = y * -x;
	double tmp;
	if (x <= -1.7e+180) {
		tmp = t_0;
	} else if (x <= -1.1e-35) {
		tmp = x * z;
	} else if (x <= 1.0) {
		tmp = y;
	} else if (x <= 2.9e+256) {
		tmp = t_0;
	} else {
		tmp = 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) :: t_0
    real(8) :: tmp
    t_0 = y * -x
    if (x <= (-1.7d+180)) then
        tmp = t_0
    else if (x <= (-1.1d-35)) then
        tmp = x * z
    else if (x <= 1.0d0) then
        tmp = y
    else if (x <= 2.9d+256) then
        tmp = t_0
    else
        tmp = x * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = y * -x;
	double tmp;
	if (x <= -1.7e+180) {
		tmp = t_0;
	} else if (x <= -1.1e-35) {
		tmp = x * z;
	} else if (x <= 1.0) {
		tmp = y;
	} else if (x <= 2.9e+256) {
		tmp = t_0;
	} else {
		tmp = x * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = y * -x
	tmp = 0
	if x <= -1.7e+180:
		tmp = t_0
	elif x <= -1.1e-35:
		tmp = x * z
	elif x <= 1.0:
		tmp = y
	elif x <= 2.9e+256:
		tmp = t_0
	else:
		tmp = x * z
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(y * Float64(-x))
	tmp = 0.0
	if (x <= -1.7e+180)
		tmp = t_0;
	elseif (x <= -1.1e-35)
		tmp = Float64(x * z);
	elseif (x <= 1.0)
		tmp = y;
	elseif (x <= 2.9e+256)
		tmp = t_0;
	else
		tmp = Float64(x * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = y * -x;
	tmp = 0.0;
	if (x <= -1.7e+180)
		tmp = t_0;
	elseif (x <= -1.1e-35)
		tmp = x * z;
	elseif (x <= 1.0)
		tmp = y;
	elseif (x <= 2.9e+256)
		tmp = t_0;
	else
		tmp = x * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(y * (-x)), $MachinePrecision]}, If[LessEqual[x, -1.7e+180], t$95$0, If[LessEqual[x, -1.1e-35], N[(x * z), $MachinePrecision], If[LessEqual[x, 1.0], y, If[LessEqual[x, 2.9e+256], t$95$0, N[(x * z), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.69999999999999992e180 or 1 < x < 2.9000000000000002e256

   1. Initial program 96.5%

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

   3. Taylor expanded in x around inf 99.4%

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

      1. mul-1-neg 99.4%

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

      2. sub-neg 99.4%

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

   5. Simplified 99.4%

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

   6. Taylor expanded in z around 0 69.2%

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

      1. mul-1-neg 69.2%

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

      2. distribute-rgt-neg-out 69.2%

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

   8. Simplified 69.2%

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

   if -1.69999999999999992e180 < x < -1.09999999999999997e-35 or 2.9000000000000002e256 < x

   1. Initial program 93.2%

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

   3. Taylor expanded in y around 0 65.5%

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

   if -1.09999999999999997e-35 < x < 1

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 98.6%

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

   4. Taylor expanded in y around inf 70.6%

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

4. Final simplification 69.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.7 \cdot 10^{+180}:\\ \;\;\;\;y \cdot \left(-x\right)\\ \mathbf{elif}\;x \leq -1.1 \cdot 10^{-35}:\\ \;\;\;\;x \cdot z\\ \mathbf{elif}\;x \leq 1:\\ \;\;\;\;y\\ \mathbf{elif}\;x \leq 2.9 \cdot 10^{+256}:\\ \;\;\;\;y \cdot \left(-x\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -10000000000000 \lor \neg \left(x \leq 1\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 -10000000000000.0) (not (<= x 1.0)))
   (* x (- z y))
   (+ y (* x z))))

C

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

Python

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

Julia

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

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -10000000000000.0], N[Not[LessEqual[x, 1.0]], $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 < -1e13 or 1 < x

   1. Initial program 95.0%

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

   3. Taylor expanded in x around inf 99.5%

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

      1. mul-1-neg 99.5%

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

      2. sub-neg 99.5%

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

   5. Simplified 99.5%

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

   if -1e13 < x < 1

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 98.2%

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

4. Final simplification 98.8%

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

Alternative 4: 84.8% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.08e-35) (not (<= x 16000000.0)))
   (* x (- z y))
   (* y (- 1.0 x))))

C

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

Java

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

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1.08e-35) or not (x <= 16000000.0):
		tmp = x * (z - y)
	else:
		tmp = y * (1.0 - x)
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -1.08e-35) || ~((x <= 16000000.0)))
		tmp = x * (z - y);
	else
		tmp = y * (1.0 - x);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1.08000000000000003e-35 or 1.6e7 < x

   1. Initial program 95.3%

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

   3. Taylor expanded in x around inf 98.5%

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

      1. mul-1-neg 98.5%

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

      2. sub-neg 98.5%

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

   5. Simplified 98.5%

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

   if -1.08000000000000003e-35 < x < 1.6e7

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

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

      1. *-commutative 72.2%

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

   7. Simplified 72.2%

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

   8. Taylor expanded in y around 0 72.2%

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

4. Final simplification 85.3%

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

Alternative 5: 85.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.08 \cdot 10^{-35} \lor \neg \left(x \leq 3.9 \cdot 10^{-10}\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.08e-35) (not (<= x 3.9e-10))) (* x (- z y)) y))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.08e-35) || !(x <= 3.9e-10)) {
		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.08d-35)) .or. (.not. (x <= 3.9d-10))) 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.08e-35) || !(x <= 3.9e-10)) {
		tmp = x * (z - y);
	} else {
		tmp = y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1.08e-35) or not (x <= 3.9e-10):
		tmp = x * (z - y)
	else:
		tmp = y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.08e-35) || !(x <= 3.9e-10))
		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.08e-35) || ~((x <= 3.9e-10)))
		tmp = x * (z - y);
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1.08000000000000003e-35 or 3.9e-10 < x

   1. Initial program 95.4%

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

   3. Taylor expanded in x around inf 96.7%

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

      1. mul-1-neg 96.7%

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

      2. sub-neg 96.7%

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

   5. Simplified 96.7%

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

   if -1.08000000000000003e-35 < x < 3.9e-10

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 99.8%

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

   4. Taylor expanded in y around inf 71.9%

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

4. Final simplification 84.7%

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

Alternative 6: 61.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -6.8 \cdot 10^{-36} \lor \neg \left(x \leq 7.8 \cdot 10^{-11}\right):\\ \;\;\;\;x \cdot z\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -6.8e-36) (not (<= x 7.8e-11))) (* x z) y))

C

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

Python

def code(x, y, z):
	tmp = 0
	if (x <= -6.8e-36) or not (x <= 7.8e-11):
		tmp = x * z
	else:
		tmp = y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -6.8e-36) || !(x <= 7.8e-11))
		tmp = Float64(x * z);
	else
		tmp = y;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -6.8e-36) || ~((x <= 7.8e-11)))
		tmp = x * z;
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -6.8e-36], N[Not[LessEqual[x, 7.8e-11]], $MachinePrecision]], N[(x * z), $MachinePrecision], y]

Derivation

1. Split input into 2 regimes

2. if x < -6.8000000000000005e-36 or 7.80000000000000021e-11 < x

   1. Initial program 95.4%

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

   3. Taylor expanded in y around 0 46.3%

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

   if -6.8000000000000005e-36 < x < 7.80000000000000021e-11

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 99.8%

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

   4. Taylor expanded in y around inf 71.9%

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

4. Final simplification 58.7%

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

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

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

3. Taylor expanded in x around 0 73.0%

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

4. Taylor expanded in y around inf 36.9%

   \[\leadsto \color{blue}{y} \]
5. 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 2024135 
(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)))