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

Percentage Accurate: 95.8% → 97.9%

Time: 4.8s

Alternatives: 5

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: 95.8% 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.1× 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^{+206}:\\ \;\;\;\;x \cdot \mathsf{fma}\left(z, -y, 1\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(z \cdot \left(-x\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) 2e+206) (* x (fma z (- y) 1.0)) (* y (* z (- x)))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if ((y * z) <= 2e+206) {
		tmp = x * fma(z, -y, 1.0);
	} else {
		tmp = 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) <= 2e+206)
		tmp = Float64(x * fma(z, Float64(-y), 1.0));
	else
		tmp = Float64(y * Float64(z * Float64(-x)));
	end
	return 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+206], N[(x * N[(z * (-y) + 1.0), $MachinePrecision]), $MachinePrecision], N[(y * N[(z * (-x)), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y z) < 2.0000000000000001e206

   1. Initial program 98.6%

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

      1. cancel-sign-sub-inv 98.6%

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

      2. +-commutative 98.6%

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

      3. *-commutative 98.6%

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

      4. fma-define 98.6%

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

   3. Simplified 98.6%

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

   if 2.0000000000000001e206 < (*.f64 y z)

   1. Initial program 73.9%

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

   3. Taylor expanded in y around inf 73.9%

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

      1. *-commutative 73.9%

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

      2. associate-*r* 73.9%

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

      3. neg-mul-1 73.9%

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

      4. distribute-rgt-neg-in 73.9%

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

      5. associate-*l* 99.7%

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

      6. distribute-lft-neg-in 99.7%

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

      7. distribute-rgt-neg-in 99.7%

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

   5. Simplified 99.7%

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

Alternative 2: 74.8% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -3.5 \cdot 10^{-104} \lor \neg \left(z \leq 2100000\right):\\ \;\;\;\;y \cdot \left(z \cdot \left(-x\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 (<= z -3.5e-104) (not (<= z 2100000.0))) (* y (* z (- x))) x))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if ((z <= -3.5e-104) || !(z <= 2100000.0)) {
		tmp = y * (z * -x);
	} 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 ((z <= (-3.5d-104)) .or. (.not. (z <= 2100000.0d0))) then
        tmp = y * (z * -x)
    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 ((z <= -3.5e-104) || !(z <= 2100000.0)) {
		tmp = y * (z * -x);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if (z <= -3.5e-104) or not (z <= 2100000.0):
		tmp = y * (z * -x)
	else:
		tmp = x
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if ((z <= -3.5e-104) || !(z <= 2100000.0))
		tmp = Float64(y * Float64(z * Float64(-x)));
	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 ((z <= -3.5e-104) || ~((z <= 2100000.0)))
		tmp = y * (z * -x);
	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[z, -3.5e-104], N[Not[LessEqual[z, 2100000.0]], $MachinePrecision]], N[(y * N[(z * (-x)), $MachinePrecision]), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if z < -3.50000000000000029e-104 or 2.1e6 < z

   1. Initial program 93.1%

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

   3. Taylor expanded in y around inf 67.6%

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

      1. *-commutative 67.6%

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

      2. associate-*r* 67.6%

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

      3. neg-mul-1 67.6%

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

      4. distribute-rgt-neg-in 67.6%

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

      5. associate-*l* 72.7%

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

      6. distribute-lft-neg-in 72.7%

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

      7. distribute-rgt-neg-in 72.7%

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

   5. Simplified 72.7%

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

   if -3.50000000000000029e-104 < z < 2.1e6

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 75.8%

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

4. Final simplification 73.9%

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

Alternative 3: 72.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -3.5 \cdot 10^{-104} \lor \neg \left(z \leq 30000\right):\\ \;\;\;\;\left(y \cdot z\right) \cdot \left(-x\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 (<= z -3.5e-104) (not (<= z 30000.0))) (* (* y z) (- x)) x))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if ((z <= -3.5e-104) || !(z <= 30000.0)) {
		tmp = (y * z) * -x;
	} 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 ((z <= (-3.5d-104)) .or. (.not. (z <= 30000.0d0))) then
        tmp = (y * z) * -x
    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 ((z <= -3.5e-104) || !(z <= 30000.0)) {
		tmp = (y * z) * -x;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if (z <= -3.5e-104) or not (z <= 30000.0):
		tmp = (y * z) * -x
	else:
		tmp = x
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if ((z <= -3.5e-104) || !(z <= 30000.0))
		tmp = Float64(Float64(y * z) * Float64(-x));
	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 ((z <= -3.5e-104) || ~((z <= 30000.0)))
		tmp = (y * z) * -x;
	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[z, -3.5e-104], N[Not[LessEqual[z, 30000.0]], $MachinePrecision]], N[(N[(y * z), $MachinePrecision] * (-x)), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if z < -3.50000000000000029e-104 or 3e4 < z

   1. Initial program 93.1%

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

   3. Taylor expanded in y around inf 67.6%

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

      1. neg-mul-1 67.6%

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

      2. distribute-rgt-neg-in 67.6%

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

   5. Simplified 67.6%

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

   if -3.50000000000000029e-104 < z < 3e4

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 75.8%

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

4. Final simplification 70.9%

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

Alternative 4: 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 2 \cdot 10^{+206}:\\ \;\;\;\;x \cdot \left(1 - y \cdot z\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(z \cdot \left(-x\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) 2e+206) (* x (- 1.0 (* y z))) (* y (* z (- x)))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if ((y * z) <= 2e+206) {
		tmp = x * (1.0 - (y * z));
	} else {
		tmp = 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) <= 2d+206) then
        tmp = x * (1.0d0 - (y * z))
    else
        tmp = 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) <= 2e+206) {
		tmp = x * (1.0 - (y * z));
	} else {
		tmp = y * (z * -x);
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if (y * z) <= 2e+206:
		tmp = x * (1.0 - (y * z))
	else:
		tmp = 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) <= 2e+206)
		tmp = Float64(x * Float64(1.0 - Float64(y * z)));
	else
		tmp = Float64(y * Float64(z * Float64(-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+206)
		tmp = x * (1.0 - (y * z));
	else
		tmp = 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], 2e+206], N[(x * N[(1.0 - N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y * N[(z * (-x)), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y z) < 2.0000000000000001e206

   1. Initial program 98.6%

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

   if 2.0000000000000001e206 < (*.f64 y z)

   1. Initial program 73.9%

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

   3. Taylor expanded in y around inf 73.9%

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

      1. *-commutative 73.9%

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

      2. associate-*r* 73.9%

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

      3. neg-mul-1 73.9%

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

      4. distribute-rgt-neg-in 73.9%

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

      5. associate-*l* 99.7%

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

      6. distribute-lft-neg-in 99.7%

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

      7. distribute-rgt-neg-in 99.7%

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

   5. Simplified 99.7%

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

Alternative 5: 49.9% 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.8%

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

3. Taylor expanded in y around 0 46.7%

   \[\leadsto \color{blue}{x} \]
4. Add Preprocessing

Reproduce

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