Graphics.Rendering.Chart.Backend.Diagrams:calcFontMetrics from Chart-diagrams-1.5.1, B

Percentage Accurate: 80.9% → 99.3%

Time: 5.2s

Alternatives: 3

Speedup: 1.8×

Specification

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = x * (((y / z) * t) / t)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 80.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = x * (((y / z) * t) / t)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ [x_m, y_m, z_m, t] = \mathsf{sort}([x_m, y_m, z_m, t])\\ \\ z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;\frac{y\_m}{z\_m} \leq 4 \cdot 10^{+163}:\\ \;\;\;\;\frac{y\_m}{z\_m} \cdot x\_m\\ \mathbf{else}:\\ \;\;\;\;\frac{y\_m}{\frac{z\_m}{x\_m}}\\ \end{array}\right)\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
NOTE: x_m, y_m, z_m, and t should be sorted in increasing order before calling this function.
(FPCore (z_s y_s x_s x_m y_m z_m t)
 :precision binary64
 (*
  z_s
  (*
   y_s
   (*
    x_s
    (if (<= (/ y_m z_m) 4e+163) (* (/ y_m z_m) x_m) (/ y_m (/ z_m x_m)))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t) {
	double tmp;
	if ((y_m / z_m) <= 4e+163) {
		tmp = (y_m / z_m) * x_m;
	} else {
		tmp = y_m / (z_m / x_m);
	}
	return z_s * (y_s * (x_s * tmp));
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, and t should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t)
    real(8), intent (in) :: z_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((y_m / z_m) <= 4d+163) then
        tmp = (y_m / z_m) * x_m
    else
        tmp = y_m / (z_m / x_m)
    end if
    code = z_s * (y_s * (x_s * tmp))
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t) {
	double tmp;
	if ((y_m / z_m) <= 4e+163) {
		tmp = (y_m / z_m) * x_m;
	} else {
		tmp = y_m / (z_m / x_m);
	}
	return z_s * (y_s * (x_s * tmp));
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
[x_m, y_m, z_m, t] = sort([x_m, y_m, z_m, t])
def code(z_s, y_s, x_s, x_m, y_m, z_m, t):
	tmp = 0
	if (y_m / z_m) <= 4e+163:
		tmp = (y_m / z_m) * x_m
	else:
		tmp = y_m / (z_m / x_m)
	return z_s * (y_s * (x_s * tmp))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
z\_m = abs(z)
z\_s = copysign(1.0, z)
x_m, y_m, z_m, t = sort([x_m, y_m, z_m, t])
function code(z_s, y_s, x_s, x_m, y_m, z_m, t)
	tmp = 0.0
	if (Float64(y_m / z_m) <= 4e+163)
		tmp = Float64(Float64(y_m / z_m) * x_m);
	else
		tmp = Float64(y_m / Float64(z_m / x_m));
	end
	return Float64(z_s * Float64(y_s * Float64(x_s * tmp)))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t = num2cell(sort([x_m, y_m, z_m, t])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t)
	tmp = 0.0;
	if ((y_m / z_m) <= 4e+163)
		tmp = (y_m / z_m) * x_m;
	else
		tmp = y_m / (z_m / x_m);
	end
	tmp_2 = z_s * (y_s * (x_s * tmp));
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, and t should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[N[(y$95$m / z$95$m), $MachinePrecision], 4e+163], N[(N[(y$95$m / z$95$m), $MachinePrecision] * x$95$m), $MachinePrecision], N[(y$95$m / N[(z$95$m / x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 y z) < 3.9999999999999998e163

   1. Initial program 88.6%

      \[x \cdot \frac{\frac{y}{z} \cdot t}{t} \]
   2. Step-by-step derivation

      1. associate-/l* 94.2%

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

      2. *-commutative 94.2%

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

      3. *-inverses 94.2%

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

      4. *-lft-identity 94.2%

         \[\leadsto x \cdot \color{blue}{\frac{y}{z}} \]

   3. Simplified 94.2%

      \[\leadsto \color{blue}{x \cdot \frac{y}{z}} \]
   4. Add Preprocessing

   if 3.9999999999999998e163 < (/.f64 y z)

   1. Initial program 68.4%

      \[x \cdot \frac{\frac{y}{z} \cdot t}{t} \]
   2. Step-by-step derivation

      1. associate-/l* 79.0%

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

      2. *-commutative 79.0%

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

      3. *-inverses 79.0%

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

      4. *-lft-identity 79.0%

         \[\leadsto x \cdot \color{blue}{\frac{y}{z}} \]

   3. Simplified 79.0%

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

      1. *-commutative 79.0%

         \[\leadsto \color{blue}{\frac{y}{z} \cdot x} \]

      2. associate-*l/ 99.8%

         \[\leadsto \color{blue}{\frac{y \cdot x}{z}} \]

      3. associate-*r/ 97.3%

         \[\leadsto \color{blue}{y \cdot \frac{x}{z}} \]

      4. clear-num 97.1%

         \[\leadsto y \cdot \color{blue}{\frac{1}{\frac{z}{x}}} \]

      5. un-div-inv 97.3%

         \[\leadsto \color{blue}{\frac{y}{\frac{z}{x}}} \]

   6. Applied egg-rr 97.3%

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

4. Final simplification 94.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{y}{z} \leq 4 \cdot 10^{+163}:\\ \;\;\;\;\frac{y}{z} \cdot x\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{\frac{z}{x}}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ [x_m, y_m, z_m, t] = \mathsf{sort}([x_m, y_m, z_m, t])\\ \\ z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;\frac{y\_m}{z\_m} \leq 4 \cdot 10^{+222}:\\ \;\;\;\;\frac{y\_m}{z\_m} \cdot x\_m\\ \mathbf{else}:\\ \;\;\;\;y\_m \cdot \frac{x\_m}{z\_m}\\ \end{array}\right)\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
NOTE: x_m, y_m, z_m, and t should be sorted in increasing order before calling this function.
(FPCore (z_s y_s x_s x_m y_m z_m t)
 :precision binary64
 (*
  z_s
  (*
   y_s
   (*
    x_s
    (if (<= (/ y_m z_m) 4e+222) (* (/ y_m z_m) x_m) (* y_m (/ x_m z_m)))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t) {
	double tmp;
	if ((y_m / z_m) <= 4e+222) {
		tmp = (y_m / z_m) * x_m;
	} else {
		tmp = y_m * (x_m / z_m);
	}
	return z_s * (y_s * (x_s * tmp));
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, and t should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t)
    real(8), intent (in) :: z_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((y_m / z_m) <= 4d+222) then
        tmp = (y_m / z_m) * x_m
    else
        tmp = y_m * (x_m / z_m)
    end if
    code = z_s * (y_s * (x_s * tmp))
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t) {
	double tmp;
	if ((y_m / z_m) <= 4e+222) {
		tmp = (y_m / z_m) * x_m;
	} else {
		tmp = y_m * (x_m / z_m);
	}
	return z_s * (y_s * (x_s * tmp));
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
[x_m, y_m, z_m, t] = sort([x_m, y_m, z_m, t])
def code(z_s, y_s, x_s, x_m, y_m, z_m, t):
	tmp = 0
	if (y_m / z_m) <= 4e+222:
		tmp = (y_m / z_m) * x_m
	else:
		tmp = y_m * (x_m / z_m)
	return z_s * (y_s * (x_s * tmp))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
z\_m = abs(z)
z\_s = copysign(1.0, z)
x_m, y_m, z_m, t = sort([x_m, y_m, z_m, t])
function code(z_s, y_s, x_s, x_m, y_m, z_m, t)
	tmp = 0.0
	if (Float64(y_m / z_m) <= 4e+222)
		tmp = Float64(Float64(y_m / z_m) * x_m);
	else
		tmp = Float64(y_m * Float64(x_m / z_m));
	end
	return Float64(z_s * Float64(y_s * Float64(x_s * tmp)))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t = num2cell(sort([x_m, y_m, z_m, t])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t)
	tmp = 0.0;
	if ((y_m / z_m) <= 4e+222)
		tmp = (y_m / z_m) * x_m;
	else
		tmp = y_m * (x_m / z_m);
	end
	tmp_2 = z_s * (y_s * (x_s * tmp));
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, and t should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[N[(y$95$m / z$95$m), $MachinePrecision], 4e+222], N[(N[(y$95$m / z$95$m), $MachinePrecision] * x$95$m), $MachinePrecision], N[(y$95$m * N[(x$95$m / z$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 y z) < 4.0000000000000002e222

   1. Initial program 87.6%

      \[x \cdot \frac{\frac{y}{z} \cdot t}{t} \]
   2. Step-by-step derivation

      1. associate-/l* 94.4%

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

      2. *-commutative 94.4%

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

      3. *-inverses 94.4%

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

      4. *-lft-identity 94.4%

         \[\leadsto x \cdot \color{blue}{\frac{y}{z}} \]

   3. Simplified 94.4%

      \[\leadsto \color{blue}{x \cdot \frac{y}{z}} \]
   4. Add Preprocessing

   if 4.0000000000000002e222 < (/.f64 y z)

   1. Initial program 71.6%

      \[x \cdot \frac{\frac{y}{z} \cdot t}{t} \]
   2. Step-by-step derivation

      1. associate-/l* 74.8%

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

      2. *-commutative 74.8%

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

      3. *-inverses 74.8%

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

      4. *-lft-identity 74.8%

         \[\leadsto x \cdot \color{blue}{\frac{y}{z}} \]

      5. associate-*r/ 99.7%

         \[\leadsto \color{blue}{\frac{x \cdot y}{z}} \]

      6. associate-*l/ 99.8%

         \[\leadsto \color{blue}{\frac{x}{z} \cdot y} \]

      7. *-commutative 99.8%

         \[\leadsto \color{blue}{y \cdot \frac{x}{z}} \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{y \cdot \frac{x}{z}} \]
   4. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 95.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{y}{z} \leq 4 \cdot 10^{+222}:\\ \;\;\;\;\frac{y}{z} \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{x}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 91.8% accurate, 1.8× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ [x_m, y_m, z_m, t] = \mathsf{sort}([x_m, y_m, z_m, t])\\ \\ z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \left(\frac{y\_m}{z\_m} \cdot x\_m\right)\right)\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
NOTE: x_m, y_m, z_m, and t should be sorted in increasing order before calling this function.
(FPCore (z_s y_s x_s x_m y_m z_m t)
 :precision binary64
 (* z_s (* y_s (* x_s (* (/ y_m z_m) x_m)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t) {
	return z_s * (y_s * (x_s * ((y_m / z_m) * x_m)));
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, and t should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t)
    real(8), intent (in) :: z_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    code = z_s * (y_s * (x_s * ((y_m / z_m) * x_m)))
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t) {
	return z_s * (y_s * (x_s * ((y_m / z_m) * x_m)));
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
[x_m, y_m, z_m, t] = sort([x_m, y_m, z_m, t])
def code(z_s, y_s, x_s, x_m, y_m, z_m, t):
	return z_s * (y_s * (x_s * ((y_m / z_m) * x_m)))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
z\_m = abs(z)
z\_s = copysign(1.0, z)
x_m, y_m, z_m, t = sort([x_m, y_m, z_m, t])
function code(z_s, y_s, x_s, x_m, y_m, z_m, t)
	return Float64(z_s * Float64(y_s * Float64(x_s * Float64(Float64(y_m / z_m) * x_m))))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t = num2cell(sort([x_m, y_m, z_m, t])){:}
function tmp = code(z_s, y_s, x_s, x_m, y_m, z_m, t)
	tmp = z_s * (y_s * (x_s * ((y_m / z_m) * x_m)));
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, and t should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * N[(N[(y$95$m / z$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 85.7%

   \[x \cdot \frac{\frac{y}{z} \cdot t}{t} \]
2. Step-by-step derivation

   1. associate-/l* 92.1%

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

   2. *-commutative 92.1%

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

   3. *-inverses 92.1%

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

   4. *-lft-identity 92.1%

      \[\leadsto x \cdot \color{blue}{\frac{y}{z}} \]

3. Simplified 92.1%

   \[\leadsto \color{blue}{x \cdot \frac{y}{z}} \]
4. Add Preprocessing

5. Final simplification 92.1%

   \[\leadsto \frac{y}{z} \cdot x \]
6. Add Preprocessing

Developer Target 1: 97.0% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x \cdot \frac{y}{z}\\ t_2 := \frac{\frac{y}{z} \cdot t}{t}\\ t_3 := \frac{y}{\frac{z}{x}}\\ \mathbf{if}\;t\_2 < -1.20672205123045 \cdot 10^{+245}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_2 < -5.907522236933906 \cdot 10^{-275}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 < 5.658954423153415 \cdot 10^{-65}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_2 < 2.0087180502407133 \cdot 10^{+217}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\frac{y \cdot x}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* x (/ y z))) (t_2 (/ (* (/ y z) t) t)) (t_3 (/ y (/ z x))))
   (if (< t_2 -1.20672205123045e+245)
     t_3
     (if (< t_2 -5.907522236933906e-275)
       t_1
       (if (< t_2 5.658954423153415e-65)
         t_3
         (if (< t_2 2.0087180502407133e+217) t_1 (/ (* y x) z)))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = x * (y / z);
	double t_2 = ((y / z) * t) / t;
	double t_3 = y / (z / x);
	double tmp;
	if (t_2 < -1.20672205123045e+245) {
		tmp = t_3;
	} else if (t_2 < -5.907522236933906e-275) {
		tmp = t_1;
	} else if (t_2 < 5.658954423153415e-65) {
		tmp = t_3;
	} else if (t_2 < 2.0087180502407133e+217) {
		tmp = t_1;
	} else {
		tmp = (y * x) / z;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_1 = x * (y / z)
    t_2 = ((y / z) * t) / t
    t_3 = y / (z / x)
    if (t_2 < (-1.20672205123045d+245)) then
        tmp = t_3
    else if (t_2 < (-5.907522236933906d-275)) then
        tmp = t_1
    else if (t_2 < 5.658954423153415d-65) then
        tmp = t_3
    else if (t_2 < 2.0087180502407133d+217) then
        tmp = t_1
    else
        tmp = (y * x) / z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = x * (y / z);
	double t_2 = ((y / z) * t) / t;
	double t_3 = y / (z / x);
	double tmp;
	if (t_2 < -1.20672205123045e+245) {
		tmp = t_3;
	} else if (t_2 < -5.907522236933906e-275) {
		tmp = t_1;
	} else if (t_2 < 5.658954423153415e-65) {
		tmp = t_3;
	} else if (t_2 < 2.0087180502407133e+217) {
		tmp = t_1;
	} else {
		tmp = (y * x) / z;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = x * (y / z)
	t_2 = ((y / z) * t) / t
	t_3 = y / (z / x)
	tmp = 0
	if t_2 < -1.20672205123045e+245:
		tmp = t_3
	elif t_2 < -5.907522236933906e-275:
		tmp = t_1
	elif t_2 < 5.658954423153415e-65:
		tmp = t_3
	elif t_2 < 2.0087180502407133e+217:
		tmp = t_1
	else:
		tmp = (y * x) / z
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(x * Float64(y / z))
	t_2 = Float64(Float64(Float64(y / z) * t) / t)
	t_3 = Float64(y / Float64(z / x))
	tmp = 0.0
	if (t_2 < -1.20672205123045e+245)
		tmp = t_3;
	elseif (t_2 < -5.907522236933906e-275)
		tmp = t_1;
	elseif (t_2 < 5.658954423153415e-65)
		tmp = t_3;
	elseif (t_2 < 2.0087180502407133e+217)
		tmp = t_1;
	else
		tmp = Float64(Float64(y * x) / z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = x * (y / z);
	t_2 = ((y / z) * t) / t;
	t_3 = y / (z / x);
	tmp = 0.0;
	if (t_2 < -1.20672205123045e+245)
		tmp = t_3;
	elseif (t_2 < -5.907522236933906e-275)
		tmp = t_1;
	elseif (t_2 < 5.658954423153415e-65)
		tmp = t_3;
	elseif (t_2 < 2.0087180502407133e+217)
		tmp = t_1;
	else
		tmp = (y * x) / z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(x * N[(y / z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(y / z), $MachinePrecision] * t), $MachinePrecision] / t), $MachinePrecision]}, Block[{t$95$3 = N[(y / N[(z / x), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$2, -1.20672205123045e+245], t$95$3, If[Less[t$95$2, -5.907522236933906e-275], t$95$1, If[Less[t$95$2, 5.658954423153415e-65], t$95$3, If[Less[t$95$2, 2.0087180502407133e+217], t$95$1, N[(N[(y * x), $MachinePrecision] / z), $MachinePrecision]]]]]]]]

Reproduce

herbie shell --seed 2024157 
(FPCore (x y z t)
  :name "Graphics.Rendering.Chart.Backend.Diagrams:calcFontMetrics from Chart-diagrams-1.5.1, B"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< (/ (* (/ y z) t) t) -120672205123045000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ y (/ z x)) (if (< (/ (* (/ y z) t) t) -2953761118466953/50000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (* x (/ y z)) (if (< (/ (* (/ y z) t) t) 1131790884630683/20000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ y (/ z x)) (if (< (/ (* (/ y z) t) t) 20087180502407133000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (* x (/ y z)) (/ (* y x) z))))))

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