Data.Colour.RGBSpace.HSV:hsv from colour-2.3.3, J

Percentage Accurate: 96.0% → 99.4%

Time: 4.4s

Alternatives: 10

Speedup: 0.8×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 96.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(1 - y\right) \cdot z\\ \mathbf{if}\;t\_0 \leq -\infty:\\ \;\;\;\;\left(z \cdot x\right) \cdot y\\ \mathbf{elif}\;t\_0 \leq 10^{+294}:\\ \;\;\;\;\mathsf{fma}\left(y - 1, z, 1\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\left(y \cdot x\right) \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (- 1.0 y) z)))
   (if (<= t_0 (- INFINITY))
     (* (* z x) y)
     (if (<= t_0 1e+294) (* (fma (- y 1.0) z 1.0) x) (* (* y x) z)))))

C

double code(double x, double y, double z) {
	double t_0 = (1.0 - y) * z;
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = (z * x) * y;
	} else if (t_0 <= 1e+294) {
		tmp = fma((y - 1.0), z, 1.0) * x;
	} else {
		tmp = (y * x) * z;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(1.0 - y) * z)
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(Float64(z * x) * y);
	elseif (t_0 <= 1e+294)
		tmp = Float64(fma(Float64(y - 1.0), z, 1.0) * x);
	else
		tmp = Float64(Float64(y * x) * z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(1.0 - y), $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(z * x), $MachinePrecision] * y), $MachinePrecision], If[LessEqual[t$95$0, 1e+294], N[(N[(N[(y - 1.0), $MachinePrecision] * z + 1.0), $MachinePrecision] * x), $MachinePrecision], N[(N[(y * x), $MachinePrecision] * z), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (-.f64 #s(literal 1 binary64) y) z) < -inf.0

   1. Initial program 72.8%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 99.9

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

   5. Applied rewrites 99.9%

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

   if -inf.0 < (*.f64 (-.f64 #s(literal 1 binary64) y) z) < 1.00000000000000007e294

   1. Initial program 99.9%

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

   4. Applied rewrites 99.9%

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

   if 1.00000000000000007e294 < (*.f64 (-.f64 #s(literal 1 binary64) y) z)

   1. Initial program 61.3%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 99.9

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

   5. Applied rewrites 99.9%

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

   7. Applied rewrites 99.9%

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

4. Final simplification 99.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(1 - y\right) \cdot z \leq -\infty:\\ \;\;\;\;\left(z \cdot x\right) \cdot y\\ \mathbf{elif}\;\left(1 - y\right) \cdot z \leq 10^{+294}:\\ \;\;\;\;\mathsf{fma}\left(y - 1, z, 1\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\left(y \cdot x\right) \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 96.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(1 - y\right) \cdot z\\ t_1 := z \cdot \left(\left(y - 1\right) \cdot x\right)\\ \mathbf{if}\;t\_0 \leq -1 \cdot 10^{+30}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq 100000000000:\\ \;\;\;\;\left(1 - z\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (- 1.0 y) z)) (t_1 (* z (* (- y 1.0) x))))
   (if (<= t_0 -1e+30) t_1 (if (<= t_0 100000000000.0) (* (- 1.0 z) x) t_1))))

C

double code(double x, double y, double z) {
	double t_0 = (1.0 - y) * z;
	double t_1 = z * ((y - 1.0) * x);
	double tmp;
	if (t_0 <= -1e+30) {
		tmp = t_1;
	} else if (t_0 <= 100000000000.0) {
		tmp = (1.0 - z) * x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = (1.0d0 - y) * z
    t_1 = z * ((y - 1.0d0) * x)
    if (t_0 <= (-1d+30)) then
        tmp = t_1
    else if (t_0 <= 100000000000.0d0) then
        tmp = (1.0d0 - z) * x
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (1.0 - y) * z;
	double t_1 = z * ((y - 1.0) * x);
	double tmp;
	if (t_0 <= -1e+30) {
		tmp = t_1;
	} else if (t_0 <= 100000000000.0) {
		tmp = (1.0 - z) * x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (1.0 - y) * z
	t_1 = z * ((y - 1.0) * x)
	tmp = 0
	if t_0 <= -1e+30:
		tmp = t_1
	elif t_0 <= 100000000000.0:
		tmp = (1.0 - z) * x
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(1.0 - y) * z)
	t_1 = Float64(z * Float64(Float64(y - 1.0) * x))
	tmp = 0.0
	if (t_0 <= -1e+30)
		tmp = t_1;
	elseif (t_0 <= 100000000000.0)
		tmp = Float64(Float64(1.0 - z) * x);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (1.0 - y) * z;
	t_1 = z * ((y - 1.0) * x);
	tmp = 0.0;
	if (t_0 <= -1e+30)
		tmp = t_1;
	elseif (t_0 <= 100000000000.0)
		tmp = (1.0 - z) * x;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(1.0 - y), $MachinePrecision] * z), $MachinePrecision]}, Block[{t$95$1 = N[(z * N[(N[(y - 1.0), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -1e+30], t$95$1, If[LessEqual[t$95$0, 100000000000.0], N[(N[(1.0 - z), $MachinePrecision] * x), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (-.f64 #s(literal 1 binary64) y) z) < -1e30 or 1e11 < (*.f64 (-.f64 #s(literal 1 binary64) y) z)

   1. Initial program 92.5%

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

   3. Taylor expanded in z around inf

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

      1. associate-*r* N/A

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

      2. sub-neg N/A

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

      3. metadata-eval N/A

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

      4. +-commutative N/A

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

      5. distribute-lft-in N/A

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

      6. *-commutative N/A

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

      7. cancel-sign-sub N/A

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

      8. mul-1-neg N/A

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

      9. *-rgt-identity N/A

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

      10. distribute-lft-out-- N/A

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

      11. mul-1-neg N/A

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

      12. distribute-lft-neg-in N/A

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

      13. *-commutative N/A

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

      14. associate-*r* N/A

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

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

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

      16. *-commutative N/A

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

      17. lower-*.f64 N/A

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

   5. Applied rewrites 97.4%

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

   if -1e30 < (*.f64 (-.f64 #s(literal 1 binary64) y) z) < 1e11

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. lower--.f64 93.7

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

   5. Applied rewrites 93.7%

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

4. Final simplification 95.9%

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

Alternative 3: 95.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(y \cdot x, z, x\right)\\ \mathbf{if}\;1 - y \leq -200000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;1 - y \leq 2:\\ \;\;\;\;\left(1 - z\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (fma (* y x) z x)))
   (if (<= (- 1.0 y) -200000.0)
     t_0
     (if (<= (- 1.0 y) 2.0) (* (- 1.0 z) x) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = fma((y * x), z, x);
	double tmp;
	if ((1.0 - y) <= -200000.0) {
		tmp = t_0;
	} else if ((1.0 - y) <= 2.0) {
		tmp = (1.0 - z) * x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = fma(Float64(y * x), z, x)
	tmp = 0.0
	if (Float64(1.0 - y) <= -200000.0)
		tmp = t_0;
	elseif (Float64(1.0 - y) <= 2.0)
		tmp = Float64(Float64(1.0 - z) * x);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(y * x), $MachinePrecision] * z + x), $MachinePrecision]}, If[LessEqual[N[(1.0 - y), $MachinePrecision], -200000.0], t$95$0, If[LessEqual[N[(1.0 - y), $MachinePrecision], 2.0], N[(N[(1.0 - z), $MachinePrecision] * x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 1 binary64) y) < -2e5 or 2 < (-.f64 #s(literal 1 binary64) y)

   1. Initial program 89.7%

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

   4. Applied rewrites 91.2%

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

   5. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 90.8

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

   7. Applied rewrites 90.8%

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

   if -2e5 < (-.f64 #s(literal 1 binary64) y) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. lower--.f64 99.5

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

   5. Applied rewrites 99.5%

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

4. Final simplification 95.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;1 - y \leq -200000:\\ \;\;\;\;\mathsf{fma}\left(y \cdot x, z, x\right)\\ \mathbf{elif}\;1 - y \leq 2:\\ \;\;\;\;\left(1 - z\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y \cdot x, z, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 85.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(z \cdot x\right) \cdot y\\ \mathbf{if}\;y \leq -3400000000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 4 \cdot 10^{+45}:\\ \;\;\;\;\left(1 - z\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (* z x) y)))
   (if (<= y -3400000000.0) t_0 (if (<= y 4e+45) (* (- 1.0 z) x) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (z * x) * y;
	double tmp;
	if (y <= -3400000000.0) {
		tmp = t_0;
	} else if (y <= 4e+45) {
		tmp = (1.0 - z) * x;
	} else {
		tmp = t_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 = (z * x) * y
    if (y <= (-3400000000.0d0)) then
        tmp = t_0
    else if (y <= 4d+45) then
        tmp = (1.0d0 - z) * x
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (z * x) * y;
	double tmp;
	if (y <= -3400000000.0) {
		tmp = t_0;
	} else if (y <= 4e+45) {
		tmp = (1.0 - z) * x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (z * x) * y
	tmp = 0
	if y <= -3400000000.0:
		tmp = t_0
	elif y <= 4e+45:
		tmp = (1.0 - z) * x
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(z * x) * y)
	tmp = 0.0
	if (y <= -3400000000.0)
		tmp = t_0;
	elseif (y <= 4e+45)
		tmp = Float64(Float64(1.0 - z) * x);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (z * x) * y;
	tmp = 0.0;
	if (y <= -3400000000.0)
		tmp = t_0;
	elseif (y <= 4e+45)
		tmp = (1.0 - z) * x;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(z * x), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[y, -3400000000.0], t$95$0, If[LessEqual[y, 4e+45], N[(N[(1.0 - z), $MachinePrecision] * x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -3.4e9 or 3.9999999999999997e45 < y

   1. Initial program 89.2%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 74.8

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

   5. Applied rewrites 74.8%

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

   if -3.4e9 < y < 3.9999999999999997e45

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. lower--.f64 97.6

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

   5. Applied rewrites 97.6%

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

4. Final simplification 88.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3400000000:\\ \;\;\;\;\left(z \cdot x\right) \cdot y\\ \mathbf{elif}\;y \leq 4 \cdot 10^{+45}:\\ \;\;\;\;\left(1 - z\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\left(z \cdot x\right) \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 85.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(y \cdot x\right) \cdot z\\ \mathbf{if}\;y \leq -3400000000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 4 \cdot 10^{+45}:\\ \;\;\;\;\left(1 - z\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (* y x) z)))
   (if (<= y -3400000000.0) t_0 (if (<= y 4e+45) (* (- 1.0 z) x) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (y * x) * z;
	double tmp;
	if (y <= -3400000000.0) {
		tmp = t_0;
	} else if (y <= 4e+45) {
		tmp = (1.0 - z) * x;
	} else {
		tmp = t_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 = (y * x) * z
    if (y <= (-3400000000.0d0)) then
        tmp = t_0
    else if (y <= 4d+45) then
        tmp = (1.0d0 - z) * x
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (y * x) * z;
	double tmp;
	if (y <= -3400000000.0) {
		tmp = t_0;
	} else if (y <= 4e+45) {
		tmp = (1.0 - z) * x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (y * x) * z
	tmp = 0
	if y <= -3400000000.0:
		tmp = t_0
	elif y <= 4e+45:
		tmp = (1.0 - z) * x
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(y * x) * z)
	tmp = 0.0
	if (y <= -3400000000.0)
		tmp = t_0;
	elseif (y <= 4e+45)
		tmp = Float64(Float64(1.0 - z) * x);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (y * x) * z;
	tmp = 0.0;
	if (y <= -3400000000.0)
		tmp = t_0;
	elseif (y <= 4e+45)
		tmp = (1.0 - z) * x;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(y * x), $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[y, -3400000000.0], t$95$0, If[LessEqual[y, 4e+45], N[(N[(1.0 - z), $MachinePrecision] * x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -3.4e9 or 3.9999999999999997e45 < y

   1. Initial program 89.2%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 74.8

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

   5. Applied rewrites 74.8%

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

   7. Applied rewrites 73.4%

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

   if -3.4e9 < y < 3.9999999999999997e45

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. lower--.f64 97.6

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

   5. Applied rewrites 97.6%

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

4. Final simplification 87.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3400000000:\\ \;\;\;\;\left(y \cdot x\right) \cdot z\\ \mathbf{elif}\;y \leq 4 \cdot 10^{+45}:\\ \;\;\;\;\left(1 - z\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\left(y \cdot x\right) \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 97.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 2 \cdot 10^{-58}:\\ \;\;\;\;\mathsf{fma}\left(\left(y - 1\right) \cdot x, z, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z \cdot \left(y - 1\right), x, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x 2e-58) (fma (* (- y 1.0) x) z x) (fma (* z (- y 1.0)) x x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= 2e-58) {
		tmp = fma(((y - 1.0) * x), z, x);
	} else {
		tmp = fma((z * (y - 1.0)), x, x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= 2e-58)
		tmp = fma(Float64(Float64(y - 1.0) * x), z, x);
	else
		tmp = fma(Float64(z * Float64(y - 1.0)), x, x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < 2.0000000000000001e-58

   1. Initial program 93.7%

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

   4. Applied rewrites 98.3%

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

   if 2.0000000000000001e-58 < x

   1. Initial program 99.9%

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

   4. Applied rewrites 100.0%

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

4. Final simplification 98.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 2 \cdot 10^{-58}:\\ \;\;\;\;\mathsf{fma}\left(\left(y - 1\right) \cdot x, z, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z \cdot \left(y - 1\right), x, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 97.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 2 \cdot 10^{-58}:\\ \;\;\;\;\mathsf{fma}\left(\left(y - 1\right) \cdot x, z, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y - 1, z, 1\right) \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x 2e-58) (fma (* (- y 1.0) x) z x) (* (fma (- y 1.0) z 1.0) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= 2e-58) {
		tmp = fma(((y - 1.0) * x), z, x);
	} else {
		tmp = fma((y - 1.0), z, 1.0) * x;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= 2e-58)
		tmp = fma(Float64(Float64(y - 1.0) * x), z, x);
	else
		tmp = Float64(fma(Float64(y - 1.0), z, 1.0) * x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < 2.0000000000000001e-58

   1. Initial program 93.7%

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

   4. Applied rewrites 98.3%

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

   if 2.0000000000000001e-58 < x

   1. Initial program 99.9%

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

   4. Applied rewrites 100.0%

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

4. Final simplification 98.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 2 \cdot 10^{-58}:\\ \;\;\;\;\mathsf{fma}\left(\left(y - 1\right) \cdot x, z, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y - 1, z, 1\right) \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 64.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(-z\right) \cdot x\\ \mathbf{if}\;z \leq -1:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 1:\\ \;\;\;\;1 \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (- z) x))) (if (<= z -1.0) t_0 (if (<= z 1.0) (* 1.0 x) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = -z * x;
	double tmp;
	if (z <= -1.0) {
		tmp = t_0;
	} else if (z <= 1.0) {
		tmp = 1.0 * x;
	} else {
		tmp = t_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 = -z * x
    if (z <= (-1.0d0)) then
        tmp = t_0
    else if (z <= 1.0d0) then
        tmp = 1.0d0 * x
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = -z * x;
	double tmp;
	if (z <= -1.0) {
		tmp = t_0;
	} else if (z <= 1.0) {
		tmp = 1.0 * x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = -z * x
	tmp = 0
	if z <= -1.0:
		tmp = t_0
	elif z <= 1.0:
		tmp = 1.0 * x
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(-z) * x)
	tmp = 0.0
	if (z <= -1.0)
		tmp = t_0;
	elseif (z <= 1.0)
		tmp = Float64(1.0 * x);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = -z * x;
	tmp = 0.0;
	if (z <= -1.0)
		tmp = t_0;
	elseif (z <= 1.0)
		tmp = 1.0 * x;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[((-z) * x), $MachinePrecision]}, If[LessEqual[z, -1.0], t$95$0, If[LessEqual[z, 1.0], N[(1.0 * x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if z < -1 or 1 < z

   1. Initial program 92.0%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 90.6

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

   5. Applied rewrites 90.6%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 57.6%

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

   if -1 < z < 1

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. lower--.f64 80.1

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

   5. Applied rewrites 80.1%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 78.8%

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

4. Final simplification 67.1%

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

Alternative 9: 65.2% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

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 - z) * x
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 95.5%

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

3. Taylor expanded in y around 0

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

   1. lower--.f64 68.5

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

5. Applied rewrites 68.5%

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

6. Final simplification 68.5%

   \[\leadsto \left(1 - z\right) \cdot x \]
7. Add Preprocessing

Alternative 10: 37.7% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ 1 \cdot x \end{array} \]

FPCore

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

C

double code(double x, double y, double z) {
	return 1.0 * x;
}

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
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 95.5%

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

3. Taylor expanded in y around 0

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

   1. lower--.f64 68.5

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

5. Applied rewrites 68.5%

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

6. Taylor expanded in z around 0

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

8. Applied rewrites 37.2%

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

9. Final simplification 37.2%

   \[\leadsto 1 \cdot x \]
10. Add Preprocessing

Developer Target 1: 99.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x \cdot \left(1 - \left(1 - y\right) \cdot z\right)\\ t_1 := x + \left(1 - y\right) \cdot \left(\left(-z\right) \cdot x\right)\\ \mathbf{if}\;t\_0 < -1.618195973607049 \cdot 10^{+50}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 < 3.892237649663903 \cdot 10^{+134}:\\ \;\;\;\;\left(x \cdot y\right) \cdot z - \left(x \cdot z - x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* x (- 1.0 (* (- 1.0 y) z))))
        (t_1 (+ x (* (- 1.0 y) (* (- z) x)))))
   (if (< t_0 -1.618195973607049e+50)
     t_1
     (if (< t_0 3.892237649663903e+134) (- (* (* x y) z) (- (* x z) x)) t_1))))

C

double code(double x, double y, double z) {
	double t_0 = x * (1.0 - ((1.0 - y) * z));
	double t_1 = x + ((1.0 - y) * (-z * x));
	double tmp;
	if (t_0 < -1.618195973607049e+50) {
		tmp = t_1;
	} else if (t_0 < 3.892237649663903e+134) {
		tmp = ((x * y) * z) - ((x * z) - x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = x * (1.0d0 - ((1.0d0 - y) * z))
    t_1 = x + ((1.0d0 - y) * (-z * x))
    if (t_0 < (-1.618195973607049d+50)) then
        tmp = t_1
    else if (t_0 < 3.892237649663903d+134) then
        tmp = ((x * y) * z) - ((x * z) - x)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = x * (1.0 - ((1.0 - y) * z));
	double t_1 = x + ((1.0 - y) * (-z * x));
	double tmp;
	if (t_0 < -1.618195973607049e+50) {
		tmp = t_1;
	} else if (t_0 < 3.892237649663903e+134) {
		tmp = ((x * y) * z) - ((x * z) - x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = x * (1.0 - ((1.0 - y) * z))
	t_1 = x + ((1.0 - y) * (-z * x))
	tmp = 0
	if t_0 < -1.618195973607049e+50:
		tmp = t_1
	elif t_0 < 3.892237649663903e+134:
		tmp = ((x * y) * z) - ((x * z) - x)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x * Float64(1.0 - Float64(Float64(1.0 - y) * z)))
	t_1 = Float64(x + Float64(Float64(1.0 - y) * Float64(Float64(-z) * x)))
	tmp = 0.0
	if (t_0 < -1.618195973607049e+50)
		tmp = t_1;
	elseif (t_0 < 3.892237649663903e+134)
		tmp = Float64(Float64(Float64(x * y) * z) - Float64(Float64(x * z) - x));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x * (1.0 - ((1.0 - y) * z));
	t_1 = x + ((1.0 - y) * (-z * x));
	tmp = 0.0;
	if (t_0 < -1.618195973607049e+50)
		tmp = t_1;
	elseif (t_0 < 3.892237649663903e+134)
		tmp = ((x * y) * z) - ((x * z) - x);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x * N[(1.0 - N[(N[(1.0 - y), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(x + N[(N[(1.0 - y), $MachinePrecision] * N[((-z) * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$0, -1.618195973607049e+50], t$95$1, If[Less[t$95$0, 3.892237649663903e+134], N[(N[(N[(x * y), $MachinePrecision] * z), $MachinePrecision] - N[(N[(x * z), $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Reproduce

herbie shell --seed 2024308 
(FPCore (x y z)
  :name "Data.Colour.RGBSpace.HSV:hsv from colour-2.3.3, J"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< (* x (- 1 (* (- 1 y) z))) -161819597360704900000000000000000000000000000000000) (+ x (* (- 1 y) (* (- z) x))) (if (< (* x (- 1 (* (- 1 y) z))) 389223764966390300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- (* (* x y) z) (- (* x z) x)) (+ x (* (- 1 y) (* (- z) x))))))

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