Data.Colour.RGB:hslsv from colour-2.3.3, B

Percentage Accurate: 99.4% → 99.8%

Time: 11.5s

Alternatives: 17

Speedup: 1.1×

Specification

Math

\[\begin{array}{l} \\ \frac{60 \cdot \left(x - y\right)}{z - t} + a \cdot 120 \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (+ (/ (* 60.0 (- x y)) (- z t)) (* a 120.0)))

C

double code(double x, double y, double z, double t, double a) {
	return ((60.0 * (x - y)) / (z - t)) + (a * 120.0);
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = ((60.0d0 * (x - y)) / (z - t)) + (a * 120.0d0)
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	return ((60.0 * (x - y)) / (z - t)) + (a * 120.0);
}

Python

def code(x, y, z, t, a):
	return ((60.0 * (x - y)) / (z - t)) + (a * 120.0)

Julia

function code(x, y, z, t, a)
	return Float64(Float64(Float64(60.0 * Float64(x - y)) / Float64(z - t)) + Float64(a * 120.0))
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = ((60.0 * (x - y)) / (z - t)) + (a * 120.0);
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision] + N[(a * 120.0), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{60 \cdot \left(x - y\right)}{z - t} + a \cdot 120 \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (+ (/ (* 60.0 (- x y)) (- z t)) (* a 120.0)))

C

double code(double x, double y, double z, double t, double a) {
	return ((60.0 * (x - y)) / (z - t)) + (a * 120.0);
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = ((60.0d0 * (x - y)) / (z - t)) + (a * 120.0d0)
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	return ((60.0 * (x - y)) / (z - t)) + (a * 120.0);
}

Python

def code(x, y, z, t, a):
	return ((60.0 * (x - y)) / (z - t)) + (a * 120.0)

Julia

function code(x, y, z, t, a)
	return Float64(Float64(Float64(60.0 * Float64(x - y)) / Float64(z - t)) + Float64(a * 120.0))
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = ((60.0 * (x - y)) / (z - t)) + (a * 120.0);
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision] + N[(a * 120.0), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ 120 \cdot a + \frac{60}{\frac{z - t}{x - y}} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (+ (* 120.0 a) (/ 60.0 (/ (- z t) (- x y)))))

C

double code(double x, double y, double z, double t, double a) {
	return (120.0 * a) + (60.0 / ((z - t) / (x - y)));
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = (120.0d0 * a) + (60.0d0 / ((z - t) / (x - y)))
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	return (120.0 * a) + (60.0 / ((z - t) / (x - y)));
}

Python

def code(x, y, z, t, a):
	return (120.0 * a) + (60.0 / ((z - t) / (x - y)))

Julia

function code(x, y, z, t, a)
	return Float64(Float64(120.0 * a) + Float64(60.0 / Float64(Float64(z - t) / Float64(x - y))))
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = (120.0 * a) + (60.0 / ((z - t) / (x - y)));
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(120.0 * a), $MachinePrecision] + N[(60.0 / N[(N[(z - t), $MachinePrecision] / N[(x - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.4%

   \[\frac{60 \cdot \left(x - y\right)}{z - t} + a \cdot 120 \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-/.f64 N/A

      \[\leadsto \color{blue}{\frac{60 \cdot \left(x - y\right)}{z - t}} + a \cdot 120 \]

   2. lift-*.f64 N/A

      \[\leadsto \frac{\color{blue}{60 \cdot \left(x - y\right)}}{z - t} + a \cdot 120 \]

   3. associate-/l* N/A

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   4. clear-num N/A

      \[\leadsto 60 \cdot \color{blue}{\frac{1}{\frac{z - t}{x - y}}} + a \cdot 120 \]

   5. un-div-inv N/A

      \[\leadsto \color{blue}{\frac{60}{\frac{z - t}{x - y}}} + a \cdot 120 \]

   6. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{60}{\frac{z - t}{x - y}}} + a \cdot 120 \]

   7. lower-/.f64 99.8

      \[\leadsto \frac{60}{\color{blue}{\frac{z - t}{x - y}}} + a \cdot 120 \]

4. Applied rewrites 99.8%

   \[\leadsto \color{blue}{\frac{60}{\frac{z - t}{x - y}}} + a \cdot 120 \]

5. Final simplification 99.8%

   \[\leadsto 120 \cdot a + \frac{60}{\frac{z - t}{x - y}} \]
6. Add Preprocessing

Alternative 2: 60.2% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{\left(x - y\right) \cdot 60}{z - t}\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+177}:\\ \;\;\;\;\frac{60}{z - t} \cdot x\\ \mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+157}:\\ \;\;\;\;120 \cdot a\\ \mathbf{else}:\\ \;\;\;\;\frac{x - y}{t} \cdot -60\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* (- x y) 60.0) (- z t))))
   (if (<= t_1 -1e+177)
     (* (/ 60.0 (- z t)) x)
     (if (<= t_1 4e+157) (* 120.0 a) (* (/ (- x y) t) -60.0)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = ((x - y) * 60.0) / (z - t);
	double tmp;
	if (t_1 <= -1e+177) {
		tmp = (60.0 / (z - t)) * x;
	} else if (t_1 <= 4e+157) {
		tmp = 120.0 * a;
	} else {
		tmp = ((x - y) / t) * -60.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: tmp
    t_1 = ((x - y) * 60.0d0) / (z - t)
    if (t_1 <= (-1d+177)) then
        tmp = (60.0d0 / (z - t)) * x
    else if (t_1 <= 4d+157) then
        tmp = 120.0d0 * a
    else
        tmp = ((x - y) / t) * (-60.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = ((x - y) * 60.0) / (z - t);
	double tmp;
	if (t_1 <= -1e+177) {
		tmp = (60.0 / (z - t)) * x;
	} else if (t_1 <= 4e+157) {
		tmp = 120.0 * a;
	} else {
		tmp = ((x - y) / t) * -60.0;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = ((x - y) * 60.0) / (z - t)
	tmp = 0
	if t_1 <= -1e+177:
		tmp = (60.0 / (z - t)) * x
	elif t_1 <= 4e+157:
		tmp = 120.0 * a
	else:
		tmp = ((x - y) / t) * -60.0
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(Float64(x - y) * 60.0) / Float64(z - t))
	tmp = 0.0
	if (t_1 <= -1e+177)
		tmp = Float64(Float64(60.0 / Float64(z - t)) * x);
	elseif (t_1 <= 4e+157)
		tmp = Float64(120.0 * a);
	else
		tmp = Float64(Float64(Float64(x - y) / t) * -60.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = ((x - y) * 60.0) / (z - t);
	tmp = 0.0;
	if (t_1 <= -1e+177)
		tmp = (60.0 / (z - t)) * x;
	elseif (t_1 <= 4e+157)
		tmp = 120.0 * a;
	else
		tmp = ((x - y) / t) * -60.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(N[(x - y), $MachinePrecision] * 60.0), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+177], N[(N[(60.0 / N[(z - t), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision], If[LessEqual[t$95$1, 4e+157], N[(120.0 * a), $MachinePrecision], N[(N[(N[(x - y), $MachinePrecision] / t), $MachinePrecision] * -60.0), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -1e177

   1. Initial program 98.2%

      \[\frac{60 \cdot \left(x - y\right)}{z - t} + a \cdot 120 \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{60 \cdot \frac{x}{z - t}} \]
   4. Step-by-step derivation

      1. *-lft-identity N/A

         \[\leadsto 60 \cdot \frac{\color{blue}{1 \cdot x}}{z - t} \]

      2. associate-*l/ N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{60 \cdot 1}{z - t}} \cdot x \]

      6. metadata-eval N/A

         \[\leadsto \frac{\color{blue}{60}}{z - t} \cdot x \]

      7. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{60}{z - t}} \cdot x \]

      8. lower--.f64 50.6

         \[\leadsto \frac{60}{\color{blue}{z - t}} \cdot x \]

   5. Applied rewrites 50.6%

      \[\leadsto \color{blue}{\frac{60}{z - t} \cdot x} \]

   if -1e177 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 3.99999999999999993e157

   1. Initial program 99.8%

      \[\frac{60 \cdot \left(x - y\right)}{z - t} + a \cdot 120 \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{a \cdot 120} \]

      2. lower-*.f64 62.5

         \[\leadsto \color{blue}{a \cdot 120} \]

   5. Applied rewrites 62.5%

      \[\leadsto \color{blue}{a \cdot 120} \]

   if 3.99999999999999993e157 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 97.7%

      \[\frac{60 \cdot \left(x - y\right)}{z - t} + a \cdot 120 \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} \]
   4. Step-by-step derivation

      1. associate-*r/ N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. metadata-eval N/A

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

      5. associate-*r/ N/A

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

      6. lower-*.f64 N/A

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

      7. lower--.f64 N/A

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

      8. associate-*r/ N/A

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

      9. metadata-eval N/A

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

      10. lower-/.f64 N/A

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

      11. lower--.f64 89.3

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

   5. Applied rewrites 89.3%

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

   6. Taylor expanded in z around 0

      \[\leadsto -60 \cdot \color{blue}{\frac{x - y}{t}} \]
   7. Step-by-step derivation

   8. Applied rewrites 53.0%

      \[\leadsto \frac{x - y}{t} \cdot \color{blue}{-60} \]
3. Recombined 3 regimes into one program.

4. Final simplification 60.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\left(x - y\right) \cdot 60}{z - t} \leq -1 \cdot 10^{+177}:\\ \;\;\;\;\frac{60}{z - t} \cdot x\\ \mathbf{elif}\;\frac{\left(x - y\right) \cdot 60}{z - t} \leq 4 \cdot 10^{+157}:\\ \;\;\;\;120 \cdot a\\ \mathbf{else}:\\ \;\;\;\;\frac{x - y}{t} \cdot -60\\ \end{array} \]
5. Add Preprocessing

Developer Target 1: 99.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \frac{60}{\frac{z - t}{x - y}} + a \cdot 120 \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (+ (/ 60.0 (/ (- z t) (- x y))) (* a 120.0)))

C

double code(double x, double y, double z, double t, double a) {
	return (60.0 / ((z - t) / (x - y))) + (a * 120.0);
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = (60.0d0 / ((z - t) / (x - y))) + (a * 120.0d0)
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	return (60.0 / ((z - t) / (x - y))) + (a * 120.0);
}

Python

def code(x, y, z, t, a):
	return (60.0 / ((z - t) / (x - y))) + (a * 120.0)

Julia

function code(x, y, z, t, a)
	return Float64(Float64(60.0 / Float64(Float64(z - t) / Float64(x - y))) + Float64(a * 120.0))
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = (60.0 / ((z - t) / (x - y))) + (a * 120.0);
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(60.0 / N[(N[(z - t), $MachinePrecision] / N[(x - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(a * 120.0), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2024234 
(FPCore (x y z t a)
  :name "Data.Colour.RGB:hslsv from colour-2.3.3, B"
  :precision binary64

  :alt
  (! :herbie-platform default (+ (/ 60 (/ (- z t) (- x y))) (* a 120)))

  (+ (/ (* 60.0 (- x y)) (- z t)) (* a 120.0)))