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

Percentage Accurate: 96.0% → 97.9%

Time: 7.5s

Alternatives: 6

Speedup: 0.5×

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 96.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \cdot z \leq -5 \cdot 10^{+191}:\\ \;\;\;\;z \cdot \left(x \cdot \left(-y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x - \left(y \cdot z\right) \cdot x\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= (* y z) -5e+191) (* z (* x (- y))) (- x (* (* y z) x))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if ((y * z) <= -5e+191) {
		tmp = z * (x * -y);
	} else {
		tmp = x - ((y * z) * x);
	}
	return tmp;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y * z) <= (-5d+191)) then
        tmp = z * (x * -y)
    else
        tmp = x - ((y * z) * x)
    end if
    code = tmp
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double tmp;
	if ((y * z) <= -5e+191) {
		tmp = z * (x * -y);
	} else {
		tmp = x - ((y * z) * x);
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if (y * z) <= -5e+191:
		tmp = z * (x * -y)
	else:
		tmp = x - ((y * z) * x)
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (Float64(y * z) <= -5e+191)
		tmp = Float64(z * Float64(x * Float64(-y)));
	else
		tmp = Float64(x - Float64(Float64(y * z) * x));
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y * z) <= -5e+191)
		tmp = z * (x * -y);
	else
		tmp = x - ((y * z) * x);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[N[(y * z), $MachinePrecision], -5e+191], N[(z * N[(x * (-y)), $MachinePrecision]), $MachinePrecision], N[(x - N[(N[(y * z), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y z) < -5.0000000000000002e191

   1. Initial program 79.0%

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

   3. Taylor expanded in y around inf 79.0%

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

      1. associate-*r* 79.0%

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

      2. associate-*r* 97.2%

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

      3. mul-1-neg 97.2%

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

   5. Simplified 97.2%

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

   if -5.0000000000000002e191 < (*.f64 y z)

   1. Initial program 98.6%

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

      1. sub-neg 98.6%

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

      2. distribute-rgt-in 98.6%

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

      3. *-un-lft-identity 98.6%

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

      4. distribute-rgt-neg-in 98.6%

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

   4. Applied egg-rr 98.6%

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

4. Final simplification 98.4%

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

Alternative 2: 95.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \cdot z \leq -2 \cdot 10^{+248}:\\ \;\;\;\;y \cdot \left(x \cdot \left(-z\right)\right)\\ \mathbf{elif}\;y \cdot z \leq -1000000 \lor \neg \left(y \cdot z \leq 0.002\right):\\ \;\;\;\;x \cdot \left(z \cdot \left(-y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= (* y z) -2e+248)
   (* y (* x (- z)))
   (if (or (<= (* y z) -1000000.0) (not (<= (* y z) 0.002)))
     (* x (* z (- y)))
     x)))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if ((y * z) <= -2e+248) {
		tmp = y * (x * -z);
	} else if (((y * z) <= -1000000.0) || !((y * z) <= 0.002)) {
		tmp = x * (z * -y);
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y * z) <= (-2d+248)) then
        tmp = y * (x * -z)
    else if (((y * z) <= (-1000000.0d0)) .or. (.not. ((y * z) <= 0.002d0))) then
        tmp = x * (z * -y)
    else
        tmp = x
    end if
    code = tmp
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double tmp;
	if ((y * z) <= -2e+248) {
		tmp = y * (x * -z);
	} else if (((y * z) <= -1000000.0) || !((y * z) <= 0.002)) {
		tmp = x * (z * -y);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if (y * z) <= -2e+248:
		tmp = y * (x * -z)
	elif ((y * z) <= -1000000.0) or not ((y * z) <= 0.002):
		tmp = x * (z * -y)
	else:
		tmp = x
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (Float64(y * z) <= -2e+248)
		tmp = Float64(y * Float64(x * Float64(-z)));
	elseif ((Float64(y * z) <= -1000000.0) || !(Float64(y * z) <= 0.002))
		tmp = Float64(x * Float64(z * Float64(-y)));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y * z) <= -2e+248)
		tmp = y * (x * -z);
	elseif (((y * z) <= -1000000.0) || ~(((y * z) <= 0.002)))
		tmp = x * (z * -y);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[N[(y * z), $MachinePrecision], -2e+248], N[(y * N[(x * (-z)), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[N[(y * z), $MachinePrecision], -1000000.0], N[Not[LessEqual[N[(y * z), $MachinePrecision], 0.002]], $MachinePrecision]], N[(x * N[(z * (-y)), $MachinePrecision]), $MachinePrecision], x]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 y z) < -2.00000000000000009e248

   1. Initial program 73.2%

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

   3. Taylor expanded in y around inf 73.2%

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

      1. mul-1-neg 73.2%

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

      2. *-commutative 73.2%

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

      3. distribute-lft-neg-in 73.2%

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

      4. distribute-rgt-neg-out 73.2%

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

      5. associate-*l* 99.8%

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

      6. *-commutative 99.8%

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

   5. Simplified 99.8%

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

   if -2.00000000000000009e248 < (*.f64 y z) < -1e6 or 2e-3 < (*.f64 y z)

   1. Initial program 96.8%

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

   3. Taylor expanded in y around inf 94.2%

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

      1. mul-1-neg 94.2%

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

   5. Simplified 94.2%

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

   if -1e6 < (*.f64 y z) < 2e-3

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 98.4%

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

4. Final simplification 97.0%

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

Alternative 3: 93.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \cdot z \leq -1000000 \lor \neg \left(y \cdot z \leq 0.002\right):\\ \;\;\;\;x \cdot \left(z \cdot \left(-y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (or (<= (* y z) -1000000.0) (not (<= (* y z) 0.002)))
   (* x (* z (- y)))
   x))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (((y * z) <= -1000000.0) || !((y * z) <= 0.002)) {
		tmp = x * (z * -y);
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (((y * z) <= (-1000000.0d0)) .or. (.not. ((y * z) <= 0.002d0))) then
        tmp = x * (z * -y)
    else
        tmp = x
    end if
    code = tmp
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double tmp;
	if (((y * z) <= -1000000.0) || !((y * z) <= 0.002)) {
		tmp = x * (z * -y);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if ((y * z) <= -1000000.0) or not ((y * z) <= 0.002):
		tmp = x * (z * -y)
	else:
		tmp = x
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if ((Float64(y * z) <= -1000000.0) || !(Float64(y * z) <= 0.002))
		tmp = Float64(x * Float64(z * Float64(-y)));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (((y * z) <= -1000000.0) || ~(((y * z) <= 0.002)))
		tmp = x * (z * -y);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[Or[LessEqual[N[(y * z), $MachinePrecision], -1000000.0], N[Not[LessEqual[N[(y * z), $MachinePrecision], 0.002]], $MachinePrecision]], N[(x * N[(z * (-y)), $MachinePrecision]), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y z) < -1e6 or 2e-3 < (*.f64 y z)

   1. Initial program 91.3%

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

   3. Taylor expanded in y around inf 89.4%

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

      1. mul-1-neg 89.4%

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

   5. Simplified 89.4%

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

   if -1e6 < (*.f64 y z) < 2e-3

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 98.4%

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

4. Final simplification 94.1%

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

Alternative 4: 93.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \cdot z \leq -1000000:\\ \;\;\;\;z \cdot \left(x \cdot \left(-y\right)\right)\\ \mathbf{elif}\;y \cdot z \leq 0.002:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(z \cdot \left(-y\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= (* y z) -1000000.0)
   (* z (* x (- y)))
   (if (<= (* y z) 0.002) x (* x (* z (- y))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if ((y * z) <= -1000000.0) {
		tmp = z * (x * -y);
	} else if ((y * z) <= 0.002) {
		tmp = x;
	} else {
		tmp = x * (z * -y);
	}
	return tmp;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y * z) <= (-1000000.0d0)) then
        tmp = z * (x * -y)
    else if ((y * z) <= 0.002d0) then
        tmp = x
    else
        tmp = x * (z * -y)
    end if
    code = tmp
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double tmp;
	if ((y * z) <= -1000000.0) {
		tmp = z * (x * -y);
	} else if ((y * z) <= 0.002) {
		tmp = x;
	} else {
		tmp = x * (z * -y);
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if (y * z) <= -1000000.0:
		tmp = z * (x * -y)
	elif (y * z) <= 0.002:
		tmp = x
	else:
		tmp = x * (z * -y)
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (Float64(y * z) <= -1000000.0)
		tmp = Float64(z * Float64(x * Float64(-y)));
	elseif (Float64(y * z) <= 0.002)
		tmp = x;
	else
		tmp = Float64(x * Float64(z * Float64(-y)));
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y * z) <= -1000000.0)
		tmp = z * (x * -y);
	elseif ((y * z) <= 0.002)
		tmp = x;
	else
		tmp = x * (z * -y);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[N[(y * z), $MachinePrecision], -1000000.0], N[(z * N[(x * (-y)), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(y * z), $MachinePrecision], 0.002], x, N[(x * N[(z * (-y)), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 y z) < -1e6

   1. Initial program 88.7%

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

   3. Taylor expanded in y around inf 87.0%

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

      1. associate-*r* 87.0%

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

      2. associate-*r* 95.2%

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

      3. mul-1-neg 95.2%

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

   5. Simplified 95.2%

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

   if -1e6 < (*.f64 y z) < 2e-3

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 98.4%

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

   if 2e-3 < (*.f64 y z)

   1. Initial program 94.6%

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

   3. Taylor expanded in y around inf 92.5%

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

      1. mul-1-neg 92.5%

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

   5. Simplified 92.5%

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

4. Final simplification 96.3%

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

Alternative 5: 97.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \cdot z \leq -5 \cdot 10^{+191}:\\ \;\;\;\;z \cdot \left(x \cdot \left(-y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(1 - y \cdot z\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= (* y z) -5e+191) (* z (* x (- y))) (* x (- 1.0 (* y z)))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if ((y * z) <= -5e+191) {
		tmp = z * (x * -y);
	} else {
		tmp = x * (1.0 - (y * z));
	}
	return tmp;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y * z) <= (-5d+191)) then
        tmp = z * (x * -y)
    else
        tmp = x * (1.0d0 - (y * z))
    end if
    code = tmp
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double tmp;
	if ((y * z) <= -5e+191) {
		tmp = z * (x * -y);
	} else {
		tmp = x * (1.0 - (y * z));
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if (y * z) <= -5e+191:
		tmp = z * (x * -y)
	else:
		tmp = x * (1.0 - (y * z))
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (Float64(y * z) <= -5e+191)
		tmp = Float64(z * Float64(x * Float64(-y)));
	else
		tmp = Float64(x * Float64(1.0 - Float64(y * z)));
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y * z) <= -5e+191)
		tmp = z * (x * -y);
	else
		tmp = x * (1.0 - (y * z));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[N[(y * z), $MachinePrecision], -5e+191], N[(z * N[(x * (-y)), $MachinePrecision]), $MachinePrecision], N[(x * N[(1.0 - N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y z) < -5.0000000000000002e191

   1. Initial program 79.0%

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

   3. Taylor expanded in y around inf 79.0%

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

      1. associate-*r* 79.0%

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

      2. associate-*r* 97.2%

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

      3. mul-1-neg 97.2%

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

   5. Simplified 97.2%

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

   if -5.0000000000000002e191 < (*.f64 y z)

   1. Initial program 98.6%

      \[x \cdot \left(1 - y \cdot z\right) \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 98.4%

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

Alternative 6: 51.6% accurate, 7.0× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ x \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z) :precision binary64 x)

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	return x;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x
end function

Java

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

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	return x

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	return x
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
	tmp = x;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := x

Derivation

1. Initial program 95.9%

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

3. Taylor expanded in y around 0 53.8%

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

4. Final simplification 53.8%

   \[\leadsto x \]
5. Add Preprocessing

Reproduce

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