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

Percentage Accurate: 80.7% → 92.2%

Time: 3.8s

Alternatives: 2

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.7% 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: 92.2% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: x, y, z, and t 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 = (x / z) * y
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 85.5%

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

   1. associate-/l* 94.0%

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

   2. associate-*r/ 94.0%

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

   3. *-commutative 94.0%

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

   4. *-inverses 94.0%

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

   5. /-rgt-identity 94.0%

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

   6. *-commutative 94.0%

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

3. Simplified 94.0%

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

5. Taylor expanded in x around 0 93.8%

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

   1. associate-*l/ 90.9%

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

7. Applied egg-rr 90.9%

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

8. Final simplification 90.9%

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

Alternative 2: 92.0% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: x, y, z, and t 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 = x * (y / z)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 85.5%

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

   1. associate-/l* 94.0%

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

   2. associate-*r/ 94.0%

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

   3. *-commutative 94.0%

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

   4. *-inverses 94.0%

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

   5. /-rgt-identity 94.0%

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

   6. *-commutative 94.0%

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

3. Simplified 94.0%

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

5. Final simplification 94.0%

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

Developer target: 98.2% 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 2024033 
(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)))