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

Percentage Accurate: 82.0% → 99.4%

Time: 4.3s

Alternatives: 5

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: 82.0% 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.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} t_1 := \frac{x}{\frac{z}{y}}\\ t_2 := y \cdot \frac{x}{z}\\ \mathbf{if}\;\frac{y}{z} \leq -4 \cdot 10^{+157}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;\frac{y}{z} \leq -5 \cdot 10^{-247}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;\frac{y}{z} \leq 10^{-291}:\\ \;\;\;\;\frac{y \cdot x}{z}\\ \mathbf{elif}\;\frac{y}{z} \leq 2 \cdot 10^{+212}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;t_2\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ x (/ z y))) (t_2 (* y (/ x z))))
   (if (<= (/ y z) -4e+157)
     t_2
     (if (<= (/ y z) -5e-247)
       t_1
       (if (<= (/ y z) 1e-291)
         (/ (* y x) z)
         (if (<= (/ y z) 2e+212) t_1 t_2))))))

C

assert(x < y);
double code(double x, double y, double z, double t) {
	double t_1 = x / (z / y);
	double t_2 = y * (x / z);
	double tmp;
	if ((y / z) <= -4e+157) {
		tmp = t_2;
	} else if ((y / z) <= -5e-247) {
		tmp = t_1;
	} else if ((y / z) <= 1e-291) {
		tmp = (y * x) / z;
	} else if ((y / z) <= 2e+212) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
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) :: tmp
    t_1 = x / (z / y)
    t_2 = y * (x / z)
    if ((y / z) <= (-4d+157)) then
        tmp = t_2
    else if ((y / z) <= (-5d-247)) then
        tmp = t_1
    else if ((y / z) <= 1d-291) then
        tmp = (y * x) / z
    else if ((y / z) <= 2d+212) then
        tmp = t_1
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y, double z, double t) {
	double t_1 = x / (z / y);
	double t_2 = y * (x / z);
	double tmp;
	if ((y / z) <= -4e+157) {
		tmp = t_2;
	} else if ((y / z) <= -5e-247) {
		tmp = t_1;
	} else if ((y / z) <= 1e-291) {
		tmp = (y * x) / z;
	} else if ((y / z) <= 2e+212) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y, z, t):
	t_1 = x / (z / y)
	t_2 = y * (x / z)
	tmp = 0
	if (y / z) <= -4e+157:
		tmp = t_2
	elif (y / z) <= -5e-247:
		tmp = t_1
	elif (y / z) <= 1e-291:
		tmp = (y * x) / z
	elif (y / z) <= 2e+212:
		tmp = t_1
	else:
		tmp = t_2
	return tmp

Julia

x, y = sort([x, y])
function code(x, y, z, t)
	t_1 = Float64(x / Float64(z / y))
	t_2 = Float64(y * Float64(x / z))
	tmp = 0.0
	if (Float64(y / z) <= -4e+157)
		tmp = t_2;
	elseif (Float64(y / z) <= -5e-247)
		tmp = t_1;
	elseif (Float64(y / z) <= 1e-291)
		tmp = Float64(Float64(y * x) / z);
	elseif (Float64(y / z) <= 2e+212)
		tmp = t_1;
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t)
	t_1 = x / (z / y);
	t_2 = y * (x / z);
	tmp = 0.0;
	if ((y / z) <= -4e+157)
		tmp = t_2;
	elseif ((y / z) <= -5e-247)
		tmp = t_1;
	elseif ((y / z) <= 1e-291)
		tmp = (y * x) / z;
	elseif ((y / z) <= 2e+212)
		tmp = t_1;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 y z) < -3.99999999999999993e157 or 1.9999999999999998e212 < (/.f64 y z)

   1. Initial program 70.6%

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

      1. *-commutative 70.6%

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

      2. associate-/l* 79.9%

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

      3. *-inverses 79.9%

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

      4. /-rgt-identity 79.9%

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

      5. associate-*l/ 95.8%

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

      6. associate-*r/ 99.8%

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

   3. Simplified 99.8%

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

   if -3.99999999999999993e157 < (/.f64 y z) < -4.99999999999999978e-247 or 9.99999999999999962e-292 < (/.f64 y z) < 1.9999999999999998e212

   1. Initial program 95.3%

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

      1. associate-/l* 99.7%

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

      2. *-inverses 99.7%

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

      3. /-rgt-identity 99.7%

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

   3. Simplified 99.7%

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

      1. clear-num 99.5%

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

      2. un-div-inv 99.6%

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

   5. Applied egg-rr 99.6%

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

   if -4.99999999999999978e-247 < (/.f64 y z) < 9.99999999999999962e-292

   1. Initial program 71.6%

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

      1. associate-/l* 77.0%

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

      2. *-inverses 77.0%

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

      3. /-rgt-identity 77.0%

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

   3. Simplified 77.0%

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

   4. Taylor expanded in x around 0 99.8%

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

4. Final simplification 99.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{y}{z} \leq -4 \cdot 10^{+157}:\\ \;\;\;\;y \cdot \frac{x}{z}\\ \mathbf{elif}\;\frac{y}{z} \leq -5 \cdot 10^{-247}:\\ \;\;\;\;\frac{x}{\frac{z}{y}}\\ \mathbf{elif}\;\frac{y}{z} \leq 10^{-291}:\\ \;\;\;\;\frac{y \cdot x}{z}\\ \mathbf{elif}\;\frac{y}{z} \leq 2 \cdot 10^{+212}:\\ \;\;\;\;\frac{x}{\frac{z}{y}}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{x}{z}\\ \end{array} \]

Alternative 2: 99.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;\frac{y}{z} \leq -5 \cdot 10^{+185} \lor \neg \left(\frac{y}{z} \leq -5 \cdot 10^{-247}\right) \land \left(\frac{y}{z} \leq 0 \lor \neg \left(\frac{y}{z} \leq 2 \cdot 10^{+212}\right)\right):\\ \;\;\;\;y \cdot \frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{z} \cdot x\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (if (or (<= (/ y z) -5e+185)
         (and (not (<= (/ y z) -5e-247))
              (or (<= (/ y z) 0.0) (not (<= (/ y z) 2e+212)))))
   (* y (/ x z))
   (* (/ y z) x)))

C

assert(x < y);
double code(double x, double y, double z, double t) {
	double tmp;
	if (((y / z) <= -5e+185) || (!((y / z) <= -5e-247) && (((y / z) <= 0.0) || !((y / z) <= 2e+212)))) {
		tmp = y * (x / z);
	} else {
		tmp = (y / z) * x;
	}
	return tmp;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
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) :: tmp
    if (((y / z) <= (-5d+185)) .or. (.not. ((y / z) <= (-5d-247))) .and. ((y / z) <= 0.0d0) .or. (.not. ((y / z) <= 2d+212))) then
        tmp = y * (x / z)
    else
        tmp = (y / z) * x
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y, double z, double t) {
	double tmp;
	if (((y / z) <= -5e+185) || (!((y / z) <= -5e-247) && (((y / z) <= 0.0) || !((y / z) <= 2e+212)))) {
		tmp = y * (x / z);
	} else {
		tmp = (y / z) * x;
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y, z, t):
	tmp = 0
	if ((y / z) <= -5e+185) or (not ((y / z) <= -5e-247) and (((y / z) <= 0.0) or not ((y / z) <= 2e+212))):
		tmp = y * (x / z)
	else:
		tmp = (y / z) * x
	return tmp

Julia

x, y = sort([x, y])
function code(x, y, z, t)
	tmp = 0.0
	if ((Float64(y / z) <= -5e+185) || (!(Float64(y / z) <= -5e-247) && ((Float64(y / z) <= 0.0) || !(Float64(y / z) <= 2e+212))))
		tmp = Float64(y * Float64(x / z));
	else
		tmp = Float64(Float64(y / z) * x);
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (((y / z) <= -5e+185) || (~(((y / z) <= -5e-247)) && (((y / z) <= 0.0) || ~(((y / z) <= 2e+212)))))
		tmp = y * (x / z);
	else
		tmp = (y / z) * x;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := If[Or[LessEqual[N[(y / z), $MachinePrecision], -5e+185], And[N[Not[LessEqual[N[(y / z), $MachinePrecision], -5e-247]], $MachinePrecision], Or[LessEqual[N[(y / z), $MachinePrecision], 0.0], N[Not[LessEqual[N[(y / z), $MachinePrecision], 2e+212]], $MachinePrecision]]]], N[(y * N[(x / z), $MachinePrecision]), $MachinePrecision], N[(N[(y / z), $MachinePrecision] * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 y z) < -4.9999999999999999e185 or -4.99999999999999978e-247 < (/.f64 y z) < -0.0 or 1.9999999999999998e212 < (/.f64 y z)

   1. Initial program 69.1%

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

      1. *-commutative 69.1%

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

      2. associate-/l* 75.4%

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

      3. *-inverses 75.4%

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

      4. /-rgt-identity 75.4%

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

      5. associate-*l/ 99.8%

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

      6. associate-*r/ 99.9%

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

   3. Simplified 99.9%

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

   if -4.9999999999999999e185 < (/.f64 y z) < -4.99999999999999978e-247 or -0.0 < (/.f64 y z) < 1.9999999999999998e212

   1. Initial program 93.5%

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

      1. associate-/l* 99.3%

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

      2. *-inverses 99.3%

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

      3. /-rgt-identity 99.3%

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

   3. Simplified 99.3%

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

4. Final simplification 99.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{y}{z} \leq -5 \cdot 10^{+185} \lor \neg \left(\frac{y}{z} \leq -5 \cdot 10^{-247}\right) \land \left(\frac{y}{z} \leq 0 \lor \neg \left(\frac{y}{z} \leq 2 \cdot 10^{+212}\right)\right):\\ \;\;\;\;y \cdot \frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{z} \cdot x\\ \end{array} \]

Alternative 3: 99.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;\frac{y}{z} \leq -4 \cdot 10^{+157} \lor \neg \left(\frac{y}{z} \leq -5 \cdot 10^{-247} \lor \neg \left(\frac{y}{z} \leq 10^{-291}\right) \land \frac{y}{z} \leq 2 \cdot 10^{+212}\right):\\ \;\;\;\;y \cdot \frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{\frac{z}{y}}\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (if (or (<= (/ y z) -4e+157)
         (not
          (or (<= (/ y z) -5e-247)
              (and (not (<= (/ y z) 1e-291)) (<= (/ y z) 2e+212)))))
   (* y (/ x z))
   (/ x (/ z y))))

C

assert(x < y);
double code(double x, double y, double z, double t) {
	double tmp;
	if (((y / z) <= -4e+157) || !(((y / z) <= -5e-247) || (!((y / z) <= 1e-291) && ((y / z) <= 2e+212)))) {
		tmp = y * (x / z);
	} else {
		tmp = x / (z / y);
	}
	return tmp;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
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) :: tmp
    if (((y / z) <= (-4d+157)) .or. (.not. ((y / z) <= (-5d-247)) .or. (.not. ((y / z) <= 1d-291)) .and. ((y / z) <= 2d+212))) then
        tmp = y * (x / z)
    else
        tmp = x / (z / y)
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y, double z, double t) {
	double tmp;
	if (((y / z) <= -4e+157) || !(((y / z) <= -5e-247) || (!((y / z) <= 1e-291) && ((y / z) <= 2e+212)))) {
		tmp = y * (x / z);
	} else {
		tmp = x / (z / y);
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y, z, t):
	tmp = 0
	if ((y / z) <= -4e+157) or not (((y / z) <= -5e-247) or (not ((y / z) <= 1e-291) and ((y / z) <= 2e+212))):
		tmp = y * (x / z)
	else:
		tmp = x / (z / y)
	return tmp

Julia

x, y = sort([x, y])
function code(x, y, z, t)
	tmp = 0.0
	if ((Float64(y / z) <= -4e+157) || !((Float64(y / z) <= -5e-247) || (!(Float64(y / z) <= 1e-291) && (Float64(y / z) <= 2e+212))))
		tmp = Float64(y * Float64(x / z));
	else
		tmp = Float64(x / Float64(z / y));
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (((y / z) <= -4e+157) || ~((((y / z) <= -5e-247) || (~(((y / z) <= 1e-291)) && ((y / z) <= 2e+212)))))
		tmp = y * (x / z);
	else
		tmp = x / (z / y);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := If[Or[LessEqual[N[(y / z), $MachinePrecision], -4e+157], N[Not[Or[LessEqual[N[(y / z), $MachinePrecision], -5e-247], And[N[Not[LessEqual[N[(y / z), $MachinePrecision], 1e-291]], $MachinePrecision], LessEqual[N[(y / z), $MachinePrecision], 2e+212]]]], $MachinePrecision]], N[(y * N[(x / z), $MachinePrecision]), $MachinePrecision], N[(x / N[(z / y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 y z) < -3.99999999999999993e157 or -4.99999999999999978e-247 < (/.f64 y z) < 9.99999999999999962e-292 or 1.9999999999999998e212 < (/.f64 y z)

   1. Initial program 71.0%

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

      1. *-commutative 71.0%

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

      2. associate-/l* 78.7%

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

      3. *-inverses 78.7%

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

      4. /-rgt-identity 78.7%

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

      5. associate-*l/ 97.5%

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

      6. associate-*r/ 99.9%

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

   3. Simplified 99.9%

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

   if -3.99999999999999993e157 < (/.f64 y z) < -4.99999999999999978e-247 or 9.99999999999999962e-292 < (/.f64 y z) < 1.9999999999999998e212

   1. Initial program 95.3%

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

      1. associate-/l* 99.7%

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

      2. *-inverses 99.7%

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

      3. /-rgt-identity 99.7%

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

   3. Simplified 99.7%

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

      1. clear-num 99.5%

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

      2. un-div-inv 99.6%

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

   5. Applied egg-rr 99.6%

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

4. Final simplification 99.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{y}{z} \leq -4 \cdot 10^{+157} \lor \neg \left(\frac{y}{z} \leq -5 \cdot 10^{-247} \lor \neg \left(\frac{y}{z} \leq 10^{-291}\right) \land \frac{y}{z} \leq 2 \cdot 10^{+212}\right):\\ \;\;\;\;y \cdot \frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{\frac{z}{y}}\\ \end{array} \]

Alternative 4: 99.3% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} t_1 := \frac{x}{\frac{z}{y}}\\ t_2 := y \cdot \frac{x}{z}\\ \mathbf{if}\;\frac{y}{z} \leq -4 \cdot 10^{+157}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;\frac{y}{z} \leq -1 \cdot 10^{-179}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;\frac{y}{z} \leq 4 \cdot 10^{-305}:\\ \;\;\;\;\frac{y}{\frac{z}{x}}\\ \mathbf{elif}\;\frac{y}{z} \leq 2 \cdot 10^{+212}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;t_2\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ x (/ z y))) (t_2 (* y (/ x z))))
   (if (<= (/ y z) -4e+157)
     t_2
     (if (<= (/ y z) -1e-179)
       t_1
       (if (<= (/ y z) 4e-305)
         (/ y (/ z x))
         (if (<= (/ y z) 2e+212) t_1 t_2))))))

C

assert(x < y);
double code(double x, double y, double z, double t) {
	double t_1 = x / (z / y);
	double t_2 = y * (x / z);
	double tmp;
	if ((y / z) <= -4e+157) {
		tmp = t_2;
	} else if ((y / z) <= -1e-179) {
		tmp = t_1;
	} else if ((y / z) <= 4e-305) {
		tmp = y / (z / x);
	} else if ((y / z) <= 2e+212) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
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) :: tmp
    t_1 = x / (z / y)
    t_2 = y * (x / z)
    if ((y / z) <= (-4d+157)) then
        tmp = t_2
    else if ((y / z) <= (-1d-179)) then
        tmp = t_1
    else if ((y / z) <= 4d-305) then
        tmp = y / (z / x)
    else if ((y / z) <= 2d+212) then
        tmp = t_1
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y, double z, double t) {
	double t_1 = x / (z / y);
	double t_2 = y * (x / z);
	double tmp;
	if ((y / z) <= -4e+157) {
		tmp = t_2;
	} else if ((y / z) <= -1e-179) {
		tmp = t_1;
	} else if ((y / z) <= 4e-305) {
		tmp = y / (z / x);
	} else if ((y / z) <= 2e+212) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y, z, t):
	t_1 = x / (z / y)
	t_2 = y * (x / z)
	tmp = 0
	if (y / z) <= -4e+157:
		tmp = t_2
	elif (y / z) <= -1e-179:
		tmp = t_1
	elif (y / z) <= 4e-305:
		tmp = y / (z / x)
	elif (y / z) <= 2e+212:
		tmp = t_1
	else:
		tmp = t_2
	return tmp

Julia

x, y = sort([x, y])
function code(x, y, z, t)
	t_1 = Float64(x / Float64(z / y))
	t_2 = Float64(y * Float64(x / z))
	tmp = 0.0
	if (Float64(y / z) <= -4e+157)
		tmp = t_2;
	elseif (Float64(y / z) <= -1e-179)
		tmp = t_1;
	elseif (Float64(y / z) <= 4e-305)
		tmp = Float64(y / Float64(z / x));
	elseif (Float64(y / z) <= 2e+212)
		tmp = t_1;
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t)
	t_1 = x / (z / y);
	t_2 = y * (x / z);
	tmp = 0.0;
	if ((y / z) <= -4e+157)
		tmp = t_2;
	elseif ((y / z) <= -1e-179)
		tmp = t_1;
	elseif ((y / z) <= 4e-305)
		tmp = y / (z / x);
	elseif ((y / z) <= 2e+212)
		tmp = t_1;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[(x / N[(z / y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(y * N[(x / z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(y / z), $MachinePrecision], -4e+157], t$95$2, If[LessEqual[N[(y / z), $MachinePrecision], -1e-179], t$95$1, If[LessEqual[N[(y / z), $MachinePrecision], 4e-305], N[(y / N[(z / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(y / z), $MachinePrecision], 2e+212], t$95$1, t$95$2]]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 y z) < -3.99999999999999993e157 or 1.9999999999999998e212 < (/.f64 y z)

   1. Initial program 70.6%

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

      1. *-commutative 70.6%

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

      2. associate-/l* 79.9%

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

      3. *-inverses 79.9%

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

      4. /-rgt-identity 79.9%

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

      5. associate-*l/ 95.8%

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

      6. associate-*r/ 99.8%

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

   3. Simplified 99.8%

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

   if -3.99999999999999993e157 < (/.f64 y z) < -1e-179 or 3.99999999999999999e-305 < (/.f64 y z) < 1.9999999999999998e212

   1. Initial program 96.6%

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

      1. associate-/l* 99.7%

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

      2. *-inverses 99.7%

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

      3. /-rgt-identity 99.7%

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

   3. Simplified 99.7%

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

      1. clear-num 99.5%

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

      2. un-div-inv 99.6%

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

   5. Applied egg-rr 99.6%

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

   if -1e-179 < (/.f64 y z) < 3.99999999999999999e-305

   1. Initial program 70.7%

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

      1. associate-/l* 79.0%

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

      2. *-inverses 79.0%

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

      3. /-rgt-identity 79.0%

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

   3. Simplified 79.0%

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

      1. associate-*r/ 99.8%

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

      2. *-commutative 99.8%

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

      3. associate-/l* 99.9%

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

   5. Applied egg-rr 99.9%

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

4. Final simplification 99.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{y}{z} \leq -4 \cdot 10^{+157}:\\ \;\;\;\;y \cdot \frac{x}{z}\\ \mathbf{elif}\;\frac{y}{z} \leq -1 \cdot 10^{-179}:\\ \;\;\;\;\frac{x}{\frac{z}{y}}\\ \mathbf{elif}\;\frac{y}{z} \leq 4 \cdot 10^{-305}:\\ \;\;\;\;\frac{y}{\frac{z}{x}}\\ \mathbf{elif}\;\frac{y}{z} \leq 2 \cdot 10^{+212}:\\ \;\;\;\;\frac{x}{\frac{z}{y}}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{x}{z}\\ \end{array} \]

Alternative 5: 92.3% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 83.7%

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

   1. associate-/l* 89.7%

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

   2. *-inverses 89.7%

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

   3. /-rgt-identity 89.7%

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

3. Simplified 89.7%

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

4. Final simplification 89.7%

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

Developer target: 98.1% 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 2023208 
(FPCore (x y z t)
  :name "Graphics.Rendering.Chart.Backend.Diagrams:calcFontMetrics from Chart-diagrams-1.5.1, B"
  :precision binary64

  :herbie-target
  (if (< (/ (* (/ y z) t) t) -1.20672205123045e+245) (/ y (/ z x)) (if (< (/ (* (/ y z) t) t) -5.907522236933906e-275) (* x (/ y z)) (if (< (/ (* (/ y z) t) t) 5.658954423153415e-65) (/ y (/ z x)) (if (< (/ (* (/ y z) t) t) 2.0087180502407133e+217) (* x (/ y z)) (/ (* y x) z)))))

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