Data.Colour.Matrix:inverse from colour-2.3.3, B

Percentage Accurate: 90.9% → 97.0%

Time: 6.9s

Alternatives: 8

Speedup: 0.5×

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

Specification

Math

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

FPCore

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

C

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

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 = ((x * y) - (z * t)) / a
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 90.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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 = ((x * y) - (z * t)) / a
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.0% accurate, 0.3× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} t_1 := x \cdot y - z \cdot t\\ \mathbf{if}\;t_1 \leq -\infty \lor \neg \left(t_1 \leq 10^{+302}\right):\\ \;\;\;\;x \cdot \frac{y}{a} - \frac{z}{\frac{a}{t}}\\ \mathbf{else}:\\ \;\;\;\;\frac{t_1}{a}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (- (* x y) (* z t))))
   (if (or (<= t_1 (- INFINITY)) (not (<= t_1 1e+302)))
     (- (* x (/ y a)) (/ z (/ a t)))
     (/ t_1 a))))

C

assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double t_1 = (x * y) - (z * t);
	double tmp;
	if ((t_1 <= -((double) INFINITY)) || !(t_1 <= 1e+302)) {
		tmp = (x * (y / a)) - (z / (a / t));
	} else {
		tmp = t_1 / a;
	}
	return tmp;
}

Java

assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (x * y) - (z * t);
	double tmp;
	if ((t_1 <= -Double.POSITIVE_INFINITY) || !(t_1 <= 1e+302)) {
		tmp = (x * (y / a)) - (z / (a / t));
	} else {
		tmp = t_1 / a;
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	t_1 = (x * y) - (z * t)
	tmp = 0
	if (t_1 <= -math.inf) or not (t_1 <= 1e+302):
		tmp = (x * (y / a)) - (z / (a / t))
	else:
		tmp = t_1 / a
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	t_1 = Float64(Float64(x * y) - Float64(z * t))
	tmp = 0.0
	if ((t_1 <= Float64(-Inf)) || !(t_1 <= 1e+302))
		tmp = Float64(Float64(x * Float64(y / a)) - Float64(z / Float64(a / t)));
	else
		tmp = Float64(t_1 / a);
	end
	return tmp
end

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	t_1 = (x * y) - (z * t);
	tmp = 0.0;
	if ((t_1 <= -Inf) || ~((t_1 <= 1e+302)))
		tmp = (x * (y / a)) - (z / (a / t));
	else
		tmp = t_1 / a;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] - N[(z * t), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, (-Infinity)], N[Not[LessEqual[t$95$1, 1e+302]], $MachinePrecision]], N[(N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision] - N[(z / N[(a / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 / a), $MachinePrecision]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 2: 71.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} t_1 := \frac{-t}{\frac{a}{z}}\\ t_2 := x \cdot \frac{y}{a}\\ \mathbf{if}\;x \cdot y \leq -1 \cdot 10^{+44}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{-72}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \cdot y \leq 10^{+49}:\\ \;\;\;\;\frac{x \cdot y}{a}\\ \mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{+84}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;t_2\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- t) (/ a z))) (t_2 (* x (/ y a))))
   (if (<= (* x y) -1e+44)
     t_2
     (if (<= (* x y) 5e-72)
       t_1
       (if (<= (* x y) 1e+49)
         (/ (* x y) a)
         (if (<= (* x y) 2e+84) t_1 t_2))))))

C

assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double t_1 = -t / (a / z);
	double t_2 = x * (y / a);
	double tmp;
	if ((x * y) <= -1e+44) {
		tmp = t_2;
	} else if ((x * y) <= 5e-72) {
		tmp = t_1;
	} else if ((x * y) <= 1e+49) {
		tmp = (x * y) / a;
	} else if ((x * y) <= 2e+84) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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) :: t_2
    real(8) :: tmp
    t_1 = -t / (a / z)
    t_2 = x * (y / a)
    if ((x * y) <= (-1d+44)) then
        tmp = t_2
    else if ((x * y) <= 5d-72) then
        tmp = t_1
    else if ((x * y) <= 1d+49) then
        tmp = (x * y) / a
    else if ((x * y) <= 2d+84) then
        tmp = t_1
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double t_1 = -t / (a / z);
	double t_2 = x * (y / a);
	double tmp;
	if ((x * y) <= -1e+44) {
		tmp = t_2;
	} else if ((x * y) <= 5e-72) {
		tmp = t_1;
	} else if ((x * y) <= 1e+49) {
		tmp = (x * y) / a;
	} else if ((x * y) <= 2e+84) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	t_1 = -t / (a / z)
	t_2 = x * (y / a)
	tmp = 0
	if (x * y) <= -1e+44:
		tmp = t_2
	elif (x * y) <= 5e-72:
		tmp = t_1
	elif (x * y) <= 1e+49:
		tmp = (x * y) / a
	elif (x * y) <= 2e+84:
		tmp = t_1
	else:
		tmp = t_2
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	t_1 = Float64(Float64(-t) / Float64(a / z))
	t_2 = Float64(x * Float64(y / a))
	tmp = 0.0
	if (Float64(x * y) <= -1e+44)
		tmp = t_2;
	elseif (Float64(x * y) <= 5e-72)
		tmp = t_1;
	elseif (Float64(x * y) <= 1e+49)
		tmp = Float64(Float64(x * y) / a);
	elseif (Float64(x * y) <= 2e+84)
		tmp = t_1;
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	t_1 = -t / (a / z);
	t_2 = x * (y / a);
	tmp = 0.0;
	if ((x * y) <= -1e+44)
		tmp = t_2;
	elseif ((x * y) <= 5e-72)
		tmp = t_1;
	elseif ((x * y) <= 1e+49)
		tmp = (x * y) / a;
	elseif ((x * y) <= 2e+84)
		tmp = t_1;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[((-t) / N[(a / z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -1e+44], t$95$2, If[LessEqual[N[(x * y), $MachinePrecision], 5e-72], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], 1e+49], N[(N[(x * y), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 2e+84], t$95$1, t$95$2]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 3: 71.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} t_1 := x \cdot \frac{y}{a}\\ \mathbf{if}\;x \cdot y \leq -1 \cdot 10^{+44}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{-72}:\\ \;\;\;\;z \cdot \frac{-t}{a}\\ \mathbf{elif}\;x \cdot y \leq 10^{+49}:\\ \;\;\;\;\frac{x \cdot y}{a}\\ \mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{+84}:\\ \;\;\;\;\frac{-t}{\frac{a}{z}}\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* x (/ y a))))
   (if (<= (* x y) -1e+44)
     t_1
     (if (<= (* x y) 5e-72)
       (* z (/ (- t) a))
       (if (<= (* x y) 1e+49)
         (/ (* x y) a)
         (if (<= (* x y) 2e+84) (/ (- t) (/ a z)) t_1))))))

C

assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double t_1 = x * (y / a);
	double tmp;
	if ((x * y) <= -1e+44) {
		tmp = t_1;
	} else if ((x * y) <= 5e-72) {
		tmp = z * (-t / a);
	} else if ((x * y) <= 1e+49) {
		tmp = (x * y) / a;
	} else if ((x * y) <= 2e+84) {
		tmp = -t / (a / z);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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 / a)
    if ((x * y) <= (-1d+44)) then
        tmp = t_1
    else if ((x * y) <= 5d-72) then
        tmp = z * (-t / a)
    else if ((x * y) <= 1d+49) then
        tmp = (x * y) / a
    else if ((x * y) <= 2d+84) then
        tmp = -t / (a / z)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double t_1 = x * (y / a);
	double tmp;
	if ((x * y) <= -1e+44) {
		tmp = t_1;
	} else if ((x * y) <= 5e-72) {
		tmp = z * (-t / a);
	} else if ((x * y) <= 1e+49) {
		tmp = (x * y) / a;
	} else if ((x * y) <= 2e+84) {
		tmp = -t / (a / z);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	t_1 = x * (y / a)
	tmp = 0
	if (x * y) <= -1e+44:
		tmp = t_1
	elif (x * y) <= 5e-72:
		tmp = z * (-t / a)
	elif (x * y) <= 1e+49:
		tmp = (x * y) / a
	elif (x * y) <= 2e+84:
		tmp = -t / (a / z)
	else:
		tmp = t_1
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	t_1 = Float64(x * Float64(y / a))
	tmp = 0.0
	if (Float64(x * y) <= -1e+44)
		tmp = t_1;
	elseif (Float64(x * y) <= 5e-72)
		tmp = Float64(z * Float64(Float64(-t) / a));
	elseif (Float64(x * y) <= 1e+49)
		tmp = Float64(Float64(x * y) / a);
	elseif (Float64(x * y) <= 2e+84)
		tmp = Float64(Float64(-t) / Float64(a / z));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	t_1 = x * (y / a);
	tmp = 0.0;
	if ((x * y) <= -1e+44)
		tmp = t_1;
	elseif ((x * y) <= 5e-72)
		tmp = z * (-t / a);
	elseif ((x * y) <= 1e+49)
		tmp = (x * y) / a;
	elseif ((x * y) <= 2e+84)
		tmp = -t / (a / z);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -1e+44], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], 5e-72], N[(z * N[((-t) / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 1e+49], N[(N[(x * y), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 2e+84], N[((-t) / N[(a / z), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 4: 71.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} t_1 := x \cdot \frac{y}{a}\\ \mathbf{if}\;x \cdot y \leq -1 \cdot 10^{+44}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{-72}:\\ \;\;\;\;z \cdot \frac{-t}{a}\\ \mathbf{elif}\;x \cdot y \leq 10^{+49}:\\ \;\;\;\;\frac{x \cdot y}{a}\\ \mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{+84}:\\ \;\;\;\;t \cdot \frac{-z}{a}\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* x (/ y a))))
   (if (<= (* x y) -1e+44)
     t_1
     (if (<= (* x y) 5e-72)
       (* z (/ (- t) a))
       (if (<= (* x y) 1e+49)
         (/ (* x y) a)
         (if (<= (* x y) 2e+84) (* t (/ (- z) a)) t_1))))))

C

assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double t_1 = x * (y / a);
	double tmp;
	if ((x * y) <= -1e+44) {
		tmp = t_1;
	} else if ((x * y) <= 5e-72) {
		tmp = z * (-t / a);
	} else if ((x * y) <= 1e+49) {
		tmp = (x * y) / a;
	} else if ((x * y) <= 2e+84) {
		tmp = t * (-z / a);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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 / a)
    if ((x * y) <= (-1d+44)) then
        tmp = t_1
    else if ((x * y) <= 5d-72) then
        tmp = z * (-t / a)
    else if ((x * y) <= 1d+49) then
        tmp = (x * y) / a
    else if ((x * y) <= 2d+84) then
        tmp = t * (-z / a)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double t_1 = x * (y / a);
	double tmp;
	if ((x * y) <= -1e+44) {
		tmp = t_1;
	} else if ((x * y) <= 5e-72) {
		tmp = z * (-t / a);
	} else if ((x * y) <= 1e+49) {
		tmp = (x * y) / a;
	} else if ((x * y) <= 2e+84) {
		tmp = t * (-z / a);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	t_1 = x * (y / a)
	tmp = 0
	if (x * y) <= -1e+44:
		tmp = t_1
	elif (x * y) <= 5e-72:
		tmp = z * (-t / a)
	elif (x * y) <= 1e+49:
		tmp = (x * y) / a
	elif (x * y) <= 2e+84:
		tmp = t * (-z / a)
	else:
		tmp = t_1
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	t_1 = Float64(x * Float64(y / a))
	tmp = 0.0
	if (Float64(x * y) <= -1e+44)
		tmp = t_1;
	elseif (Float64(x * y) <= 5e-72)
		tmp = Float64(z * Float64(Float64(-t) / a));
	elseif (Float64(x * y) <= 1e+49)
		tmp = Float64(Float64(x * y) / a);
	elseif (Float64(x * y) <= 2e+84)
		tmp = Float64(t * Float64(Float64(-z) / a));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	t_1 = x * (y / a);
	tmp = 0.0;
	if ((x * y) <= -1e+44)
		tmp = t_1;
	elseif ((x * y) <= 5e-72)
		tmp = z * (-t / a);
	elseif ((x * y) <= 1e+49)
		tmp = (x * y) / a;
	elseif ((x * y) <= 2e+84)
		tmp = t * (-z / a);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -1e+44], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], 5e-72], N[(z * N[((-t) / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 1e+49], N[(N[(x * y), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 2e+84], N[(t * N[((-z) / a), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 5: 73.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} \mathbf{if}\;x \cdot y \leq -1 \cdot 10^{+44}:\\ \;\;\;\;x \cdot \frac{y}{a}\\ \mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{-113}:\\ \;\;\;\;\frac{t \cdot \left(-z\right)}{a}\\ \mathbf{elif}\;x \cdot y \leq 10^{+250}:\\ \;\;\;\;\frac{x \cdot y}{a}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{x}{a}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
 :precision binary64
 (if (<= (* x y) -1e+44)
   (* x (/ y a))
   (if (<= (* x y) 2e-113)
     (/ (* t (- z)) a)
     (if (<= (* x y) 1e+250) (/ (* x y) a) (* y (/ x a))))))

C

assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((x * y) <= -1e+44) {
		tmp = x * (y / a);
	} else if ((x * y) <= 2e-113) {
		tmp = (t * -z) / a;
	} else if ((x * y) <= 1e+250) {
		tmp = (x * y) / a;
	} else {
		tmp = y * (x / a);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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) :: tmp
    if ((x * y) <= (-1d+44)) then
        tmp = x * (y / a)
    else if ((x * y) <= 2d-113) then
        tmp = (t * -z) / a
    else if ((x * y) <= 1d+250) then
        tmp = (x * y) / a
    else
        tmp = y * (x / a)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((x * y) <= -1e+44) {
		tmp = x * (y / a);
	} else if ((x * y) <= 2e-113) {
		tmp = (t * -z) / a;
	} else if ((x * y) <= 1e+250) {
		tmp = (x * y) / a;
	} else {
		tmp = y * (x / a);
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	tmp = 0
	if (x * y) <= -1e+44:
		tmp = x * (y / a)
	elif (x * y) <= 2e-113:
		tmp = (t * -z) / a
	elif (x * y) <= 1e+250:
		tmp = (x * y) / a
	else:
		tmp = y * (x / a)
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(x * y) <= -1e+44)
		tmp = Float64(x * Float64(y / a));
	elseif (Float64(x * y) <= 2e-113)
		tmp = Float64(Float64(t * Float64(-z)) / a);
	elseif (Float64(x * y) <= 1e+250)
		tmp = Float64(Float64(x * y) / a);
	else
		tmp = Float64(y * Float64(x / a));
	end
	return tmp
end

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((x * y) <= -1e+44)
		tmp = x * (y / a);
	elseif ((x * y) <= 2e-113)
		tmp = (t * -z) / a;
	elseif ((x * y) <= 1e+250)
		tmp = (x * y) / a;
	else
		tmp = y * (x / a);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], -1e+44], N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 2e-113], N[(N[(t * (-z)), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 1e+250], N[(N[(x * y), $MachinePrecision] / a), $MachinePrecision], N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 6: 94.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\ \\ \begin{array}{l} \mathbf{if}\;x \cdot y \leq -5 \cdot 10^{+251}:\\ \;\;\;\;\frac{y}{\frac{a}{x}}\\ \mathbf{elif}\;x \cdot y \leq 10^{+250}:\\ \;\;\;\;\frac{x \cdot y - z \cdot t}{a}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{x}{a}\\ \end{array} \end{array} \]

FPCore

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

C

assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((x * y) <= -5e+251) {
		tmp = y / (a / x);
	} else if ((x * y) <= 1e+250) {
		tmp = ((x * y) - (z * t)) / a;
	} else {
		tmp = y * (x / a);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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) :: tmp
    if ((x * y) <= (-5d+251)) then
        tmp = y / (a / x)
    else if ((x * y) <= 1d+250) then
        tmp = ((x * y) - (z * t)) / a
    else
        tmp = y * (x / a)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((x * y) <= -5e+251) {
		tmp = y / (a / x);
	} else if ((x * y) <= 1e+250) {
		tmp = ((x * y) - (z * t)) / a;
	} else {
		tmp = y * (x / a);
	}
	return tmp;
}

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	tmp = 0
	if (x * y) <= -5e+251:
		tmp = y / (a / x)
	elif (x * y) <= 1e+250:
		tmp = ((x * y) - (z * t)) / a
	else:
		tmp = y * (x / a)
	return tmp

Julia

x, y, z, t, a = sort([x, y, z, t, a])
function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(x * y) <= -5e+251)
		tmp = Float64(y / Float64(a / x));
	elseif (Float64(x * y) <= 1e+250)
		tmp = Float64(Float64(Float64(x * y) - Float64(z * t)) / a);
	else
		tmp = Float64(y * Float64(x / a));
	end
	return tmp
end

MATLAB

x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((x * y) <= -5e+251)
		tmp = y / (a / x);
	elseif ((x * y) <= 1e+250)
		tmp = ((x * y) - (z * t)) / a;
	else
		tmp = y * (x / a);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 7: 51.7% accurate, 1.8× speedup

Math

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

FPCore

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

C

assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	return y * (x / a);
}

Fortran

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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 = y * (x / a)
end function

Java

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

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	return y * (x / a)

Julia

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

MATLAB

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

Wolfram

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

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 8: 51.9% accurate, 1.8× speedup

Math

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

FPCore

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

C

assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
	return x * (y / a);
}

Fortran

NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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 = x * (y / a)
end function

Java

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

Python

[x, y, z, t, a] = sort([x, y, z, t, a])
def code(x, y, z, t, a):
	return x * (y / a)

Julia

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

MATLAB

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

Wolfram

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

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Developer target: 90.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{y}{a} \cdot x - \frac{t}{a} \cdot z\\ \mathbf{if}\;z < -2.468684968699548 \cdot 10^{+170}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;z < 6.309831121978371 \cdot 10^{-71}:\\ \;\;\;\;\frac{x \cdot y - z \cdot t}{a}\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (- (* (/ y a) x) (* (/ t a) z))))
   (if (< z -2.468684968699548e+170)
     t_1
     (if (< z 6.309831121978371e-71) (/ (- (* x y) (* z t)) a) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = ((y / a) * x) - ((t / a) * z);
	double tmp;
	if (z < -2.468684968699548e+170) {
		tmp = t_1;
	} else if (z < 6.309831121978371e-71) {
		tmp = ((x * y) - (z * t)) / a;
	} else {
		tmp = t_1;
	}
	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 = ((y / a) * x) - ((t / a) * z)
    if (z < (-2.468684968699548d+170)) then
        tmp = t_1
    else if (z < 6.309831121978371d-71) then
        tmp = ((x * y) - (z * t)) / a
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = ((y / a) * x) - ((t / a) * z);
	double tmp;
	if (z < -2.468684968699548e+170) {
		tmp = t_1;
	} else if (z < 6.309831121978371e-71) {
		tmp = ((x * y) - (z * t)) / a;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = ((y / a) * x) - ((t / a) * z)
	tmp = 0
	if z < -2.468684968699548e+170:
		tmp = t_1
	elif z < 6.309831121978371e-71:
		tmp = ((x * y) - (z * t)) / a
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(Float64(y / a) * x) - Float64(Float64(t / a) * z))
	tmp = 0.0
	if (z < -2.468684968699548e+170)
		tmp = t_1;
	elseif (z < 6.309831121978371e-71)
		tmp = Float64(Float64(Float64(x * y) - Float64(z * t)) / a);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = ((y / a) * x) - ((t / a) * z);
	tmp = 0.0;
	if (z < -2.468684968699548e+170)
		tmp = t_1;
	elseif (z < 6.309831121978371e-71)
		tmp = ((x * y) - (z * t)) / a;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(N[(y / a), $MachinePrecision] * x), $MachinePrecision] - N[(N[(t / a), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]}, If[Less[z, -2.468684968699548e+170], t$95$1, If[Less[z, 6.309831121978371e-71], N[(N[(N[(x * y), $MachinePrecision] - N[(z * t), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], t$95$1]]]

Reproduce

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

  :herbie-target
  (if (< z -2.468684968699548e+170) (- (* (/ y a) x) (* (/ t a) z)) (if (< z 6.309831121978371e-71) (/ (- (* x y) (* z t)) a) (- (* (/ y a) x) (* (/ t a) z))))

  (/ (- (* x y) (* z t)) a))