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

Percentage Accurate: 96.0% → 97.8%

Time: 8.3s

Alternatives: 5

Speedup: 1.0×

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.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;z \cdot y \leq 10^{+302}:\\ \;\;\;\;\left(1 - z \cdot y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\left(-z\right) \cdot x, y, x\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 (<= (* z y) 1e+302) (* (- 1.0 (* z y)) x) (fma (* (- z) x) y x)))

C

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

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (Float64(z * y) <= 1e+302)
		tmp = Float64(Float64(1.0 - Float64(z * y)) * x);
	else
		tmp = fma(Float64(Float64(-z) * x), y, 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[(z * y), $MachinePrecision], 1e+302], N[(N[(1.0 - N[(z * y), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision], N[(N[((-z) * x), $MachinePrecision] * y + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y z) < 1.0000000000000001e302

   1. Initial program 98.6%

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

   if 1.0000000000000001e302 < (*.f64 y z)

   1. Initial program 64.1%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. distribute-lft-in N/A

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

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

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

      9. associate-*r* N/A

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

      10. *-rgt-identity N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. lower-neg.f64 99.9

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

   4. Applied rewrites 99.9%

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

4. Final simplification 98.7%

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

Alternative 2: 93.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} t_0 := \left(\left(-y\right) \cdot z\right) \cdot x\\ \mathbf{if}\;z \cdot y \leq -20000000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \cdot y \leq 0.001:\\ \;\;\;\;1 \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \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
 (let* ((t_0 (* (* (- y) z) x)))
   (if (<= (* z y) -20000000.0) t_0 (if (<= (* z y) 0.001) (* 1.0 x) t_0))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double t_0 = (-y * z) * x;
	double tmp;
	if ((z * y) <= -20000000.0) {
		tmp = t_0;
	} else if ((z * y) <= 0.001) {
		tmp = 1.0 * x;
	} else {
		tmp = t_0;
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = (-y * z) * x
    if ((z * y) <= (-20000000.0d0)) then
        tmp = t_0
    else if ((z * y) <= 0.001d0) then
        tmp = 1.0d0 * x
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	t_0 = (-y * z) * x;
	tmp = 0.0;
	if ((z * y) <= -20000000.0)
		tmp = t_0;
	elseif ((z * y) <= 0.001)
		tmp = 1.0 * x;
	else
		tmp = t_0;
	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_] := Block[{t$95$0 = N[(N[((-y) * z), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[N[(z * y), $MachinePrecision], -20000000.0], t$95$0, If[LessEqual[N[(z * y), $MachinePrecision], 0.001], N[(1.0 * x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 91.5%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 88.6

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

   5. Applied rewrites 88.6%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 96.2%

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

4. Final simplification 92.4%

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

Alternative 3: 97.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;z \cdot y \leq 2 \cdot 10^{+290}:\\ \;\;\;\;\left(1 - z \cdot y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\left(-y\right) \cdot x, z, x\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 (<= (* z y) 2e+290) (* (- 1.0 (* z y)) x) (fma (* (- y) x) z x)))

C

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 y z) < 2.00000000000000012e290

   1. Initial program 98.6%

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

   if 2.00000000000000012e290 < (*.f64 y z)

   1. Initial program 65.7%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. distribute-lft-in N/A

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

      6. lift-*.f64 N/A

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

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

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

      8. associate-*r* N/A

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

      9. *-rgt-identity N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. lower-neg.f64 99.9

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

   4. Applied rewrites 99.9%

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

4. Final simplification 98.7%

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

Alternative 4: 96.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \left(1 - z \cdot y\right) \cdot 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 (* (- 1.0 (* z y)) x))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	return (1.0 - (z * y)) * 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 = (1.0d0 - (z * y)) * x
end function

Java

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

Python

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

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	return Float64(Float64(1.0 - Float64(z * y)) * x)
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 95.8%

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

3. Final simplification 95.8%

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

Alternative 5: 50.7% accurate, 2.3× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ 1 \cdot 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 (* 1.0 x))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	return 1.0 * 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 = 1.0d0 * x
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 95.8%

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

3. Taylor expanded in z around 0

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

5. Applied rewrites 50.6%

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

6. Final simplification 50.6%

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

Reproduce

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