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

Percentage Accurate: 88.2% → 98.7%

Time: 8.0s

Alternatives: 5

Speedup: 0.3×

Specification

Math

\[\begin{array}{l} \\ \frac{x + y}{1 - \frac{y}{z}} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (/ (+ x y) (- 1.0 (/ y z))))

C

double code(double x, double y, double z) {
	return (x + y) / (1.0 - (y / z));
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x + y) / (1.0d0 - (y / z))
end function

Java

public static double code(double x, double y, double z) {
	return (x + y) / (1.0 - (y / z));
}

Python

def code(x, y, z):
	return (x + y) / (1.0 - (y / z))

Julia

function code(x, y, z)
	return Float64(Float64(x + y) / Float64(1.0 - Float64(y / z)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (x + y) / (1.0 - (y / z));
end

Wolfram

code[x_, y_, z_] := N[(N[(x + y), $MachinePrecision] / N[(1.0 - N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 88.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x + y}{1 - \frac{y}{z}} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (/ (+ x y) (- 1.0 (/ y z))))

C

double code(double x, double y, double z) {
	return (x + y) / (1.0 - (y / z));
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x + y) / (1.0d0 - (y / z))
end function

Java

public static double code(double x, double y, double z) {
	return (x + y) / (1.0 - (y / z));
}

Python

def code(x, y, z):
	return (x + y) / (1.0 - (y / z))

Julia

function code(x, y, z)
	return Float64(Float64(x + y) / Float64(1.0 - Float64(y / z)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (x + y) / (1.0 - (y / z));
end

Wolfram

code[x_, y_, z_] := N[(N[(x + y), $MachinePrecision] / N[(1.0 - N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 98.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x + y}{1 - \frac{y}{z}}\\ \mathbf{if}\;t\_0 \leq -2 \cdot 10^{-211} \lor \neg \left(t\_0 \leq 0\right):\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;-\mathsf{fma}\left(\frac{x}{y}, z, z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (/ (+ x y) (- 1.0 (/ y z)))))
   (if (or (<= t_0 -2e-211) (not (<= t_0 0.0))) t_0 (- (fma (/ x y) z z)))))

C

double code(double x, double y, double z) {
	double t_0 = (x + y) / (1.0 - (y / z));
	double tmp;
	if ((t_0 <= -2e-211) || !(t_0 <= 0.0)) {
		tmp = t_0;
	} else {
		tmp = -fma((x / y), z, z);
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(x + y) / Float64(1.0 - Float64(y / z)))
	tmp = 0.0
	if ((t_0 <= -2e-211) || !(t_0 <= 0.0))
		tmp = t_0;
	else
		tmp = Float64(-fma(Float64(x / y), z, z));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(x + y), $MachinePrecision] / N[(1.0 - N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, -2e-211], N[Not[LessEqual[t$95$0, 0.0]], $MachinePrecision]], t$95$0, (-N[(N[(x / y), $MachinePrecision] * z + z), $MachinePrecision])]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 x y) (-.f64 #s(literal 1 binary64) (/.f64 y z))) < -2.00000000000000017e-211 or 0.0 < (/.f64 (+.f64 x y) (-.f64 #s(literal 1 binary64) (/.f64 y z)))

   1. Initial program 99.8%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Add Preprocessing

   if -2.00000000000000017e-211 < (/.f64 (+.f64 x y) (-.f64 #s(literal 1 binary64) (/.f64 y z))) < 0.0

   1. Initial program 21.0%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(-1 \cdot z + -1 \cdot \frac{x \cdot z}{y}\right) - \frac{{z}^{2}}{y}} \]
   4. Step-by-step derivation

      1. associate-+r- N/A

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

      2. associate--l+ N/A

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

      3. fp-cancel-sign-sub-inv N/A

         \[\leadsto \color{blue}{\left(-1 \cdot z - \left(\mathsf{neg}\left(-1\right)\right) \cdot \frac{x \cdot z}{y}\right)} - \frac{{z}^{2}}{y} \]

      4. metadata-eval N/A

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

      5. *-lft-identity N/A

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

      6. associate--l- N/A

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

      7. *-lft-identity N/A

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

      8. metadata-eval N/A

         \[\leadsto -1 \cdot z - \left(\frac{x \cdot z}{y} + \frac{\color{blue}{\left(\mathsf{neg}\left(-1\right)\right)} \cdot {z}^{2}}{y}\right) \]

      9. div-add N/A

         \[\leadsto -1 \cdot z - \color{blue}{\frac{x \cdot z + \left(\mathsf{neg}\left(-1\right)\right) \cdot {z}^{2}}{y}} \]

      10. fp-cancel-sub-sign-inv N/A

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

      11. *-lft-identity N/A

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

      12. metadata-eval N/A

          \[\leadsto -1 \cdot z - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right)} \cdot \frac{x \cdot z - -1 \cdot {z}^{2}}{y} \]

      13. fp-cancel-sign-sub-inv N/A

          \[\leadsto \color{blue}{-1 \cdot z + -1 \cdot \frac{x \cdot z - -1 \cdot {z}^{2}}{y}} \]

      14. distribute-lft-out N/A

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

      15. mul-1-neg N/A

          \[\leadsto \color{blue}{\mathsf{neg}\left(\left(z + \frac{x \cdot z - -1 \cdot {z}^{2}}{y}\right)\right)} \]

      16. lower-neg.f64 N/A

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

   5. Applied rewrites 90.8%

      \[\leadsto \color{blue}{-\mathsf{fma}\left(\frac{z}{y}, x + z, z\right)} \]

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 14.6%

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

   9. Taylor expanded in z around 0

      \[\leadsto -z \cdot \left(1 + \frac{x}{y}\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 100.0%

       \[\leadsto -\mathsf{fma}\left(\frac{x}{y}, z, z\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x + y}{1 - \frac{y}{z}} \leq -2 \cdot 10^{-211} \lor \neg \left(\frac{x + y}{1 - \frac{y}{z}} \leq 0\right):\\ \;\;\;\;\frac{x + y}{1 - \frac{y}{z}}\\ \mathbf{else}:\\ \;\;\;\;-\mathsf{fma}\left(\frac{x}{y}, z, z\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 74.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.05 \cdot 10^{-24} \lor \neg \left(y \leq 10^{-12}\right):\\ \;\;\;\;-\mathsf{fma}\left(\frac{x}{y}, z, z\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{1 - \frac{y}{z}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -1.05e-24) (not (<= y 1e-12)))
   (- (fma (/ x y) z z))
   (/ x (- 1.0 (/ y z)))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -1.05e-24) || !(y <= 1e-12)) {
		tmp = -fma((x / y), z, z);
	} else {
		tmp = x / (1.0 - (y / z));
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -1.05e-24) || !(y <= 1e-12))
		tmp = Float64(-fma(Float64(x / y), z, z));
	else
		tmp = Float64(x / Float64(1.0 - Float64(y / z)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -1.05e-24], N[Not[LessEqual[y, 1e-12]], $MachinePrecision]], (-N[(N[(x / y), $MachinePrecision] * z + z), $MachinePrecision]), N[(x / N[(1.0 - N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.05e-24 or 9.9999999999999998e-13 < y

   1. Initial program 78.0%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(-1 \cdot z + -1 \cdot \frac{x \cdot z}{y}\right) - \frac{{z}^{2}}{y}} \]
   4. Step-by-step derivation

      1. associate-+r- N/A

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

      2. associate--l+ N/A

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

      3. fp-cancel-sign-sub-inv N/A

         \[\leadsto \color{blue}{\left(-1 \cdot z - \left(\mathsf{neg}\left(-1\right)\right) \cdot \frac{x \cdot z}{y}\right)} - \frac{{z}^{2}}{y} \]

      4. metadata-eval N/A

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

      5. *-lft-identity N/A

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

      6. associate--l- N/A

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

      7. *-lft-identity N/A

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

      8. metadata-eval N/A

         \[\leadsto -1 \cdot z - \left(\frac{x \cdot z}{y} + \frac{\color{blue}{\left(\mathsf{neg}\left(-1\right)\right)} \cdot {z}^{2}}{y}\right) \]

      9. div-add N/A

         \[\leadsto -1 \cdot z - \color{blue}{\frac{x \cdot z + \left(\mathsf{neg}\left(-1\right)\right) \cdot {z}^{2}}{y}} \]

      10. fp-cancel-sub-sign-inv N/A

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

      11. *-lft-identity N/A

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

      12. metadata-eval N/A

          \[\leadsto -1 \cdot z - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right)} \cdot \frac{x \cdot z - -1 \cdot {z}^{2}}{y} \]

      13. fp-cancel-sign-sub-inv N/A

          \[\leadsto \color{blue}{-1 \cdot z + -1 \cdot \frac{x \cdot z - -1 \cdot {z}^{2}}{y}} \]

      14. distribute-lft-out N/A

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

      15. mul-1-neg N/A

          \[\leadsto \color{blue}{\mathsf{neg}\left(\left(z + \frac{x \cdot z - -1 \cdot {z}^{2}}{y}\right)\right)} \]

      16. lower-neg.f64 N/A

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

   5. Applied rewrites 76.8%

      \[\leadsto \color{blue}{-\mathsf{fma}\left(\frac{z}{y}, x + z, z\right)} \]

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 16.9%

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

   9. Taylor expanded in z around 0

      \[\leadsto -z \cdot \left(1 + \frac{x}{y}\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 79.8%

       \[\leadsto -\mathsf{fma}\left(\frac{x}{y}, z, z\right) \]

   if -1.05e-24 < y < 9.9999999999999998e-13

   1. Initial program 99.9%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 N/A

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

      3. lower-/.f64 77.4

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

   5. Applied rewrites 77.4%

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

4. Final simplification 78.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.05 \cdot 10^{-24} \lor \neg \left(y \leq 10^{-12}\right):\\ \;\;\;\;-\mathsf{fma}\left(\frac{x}{y}, z, z\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{1 - \frac{y}{z}}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 75.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4.5 \cdot 10^{-22} \lor \neg \left(y \leq 42000000000000\right):\\ \;\;\;\;-\mathsf{fma}\left(\frac{x}{y}, z, z\right)\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -4.5e-22) (not (<= y 42000000000000.0)))
   (- (fma (/ x y) z z))
   (+ y x)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -4.5e-22) || !(y <= 42000000000000.0)) {
		tmp = -fma((x / y), z, z);
	} else {
		tmp = y + x;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -4.5e-22) || !(y <= 42000000000000.0))
		tmp = Float64(-fma(Float64(x / y), z, z));
	else
		tmp = Float64(y + x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -4.5e-22], N[Not[LessEqual[y, 42000000000000.0]], $MachinePrecision]], (-N[(N[(x / y), $MachinePrecision] * z + z), $MachinePrecision]), N[(y + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -4.49999999999999987e-22 or 4.2e13 < y

   1. Initial program 77.5%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(-1 \cdot z + -1 \cdot \frac{x \cdot z}{y}\right) - \frac{{z}^{2}}{y}} \]
   4. Step-by-step derivation

      1. associate-+r- N/A

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

      2. associate--l+ N/A

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

      3. fp-cancel-sign-sub-inv N/A

         \[\leadsto \color{blue}{\left(-1 \cdot z - \left(\mathsf{neg}\left(-1\right)\right) \cdot \frac{x \cdot z}{y}\right)} - \frac{{z}^{2}}{y} \]

      4. metadata-eval N/A

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

      5. *-lft-identity N/A

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

      6. associate--l- N/A

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

      7. *-lft-identity N/A

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

      8. metadata-eval N/A

         \[\leadsto -1 \cdot z - \left(\frac{x \cdot z}{y} + \frac{\color{blue}{\left(\mathsf{neg}\left(-1\right)\right)} \cdot {z}^{2}}{y}\right) \]

      9. div-add N/A

         \[\leadsto -1 \cdot z - \color{blue}{\frac{x \cdot z + \left(\mathsf{neg}\left(-1\right)\right) \cdot {z}^{2}}{y}} \]

      10. fp-cancel-sub-sign-inv N/A

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

      11. *-lft-identity N/A

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

      12. metadata-eval N/A

          \[\leadsto -1 \cdot z - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right)} \cdot \frac{x \cdot z - -1 \cdot {z}^{2}}{y} \]

      13. fp-cancel-sign-sub-inv N/A

          \[\leadsto \color{blue}{-1 \cdot z + -1 \cdot \frac{x \cdot z - -1 \cdot {z}^{2}}{y}} \]

      14. distribute-lft-out N/A

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

      15. mul-1-neg N/A

          \[\leadsto \color{blue}{\mathsf{neg}\left(\left(z + \frac{x \cdot z - -1 \cdot {z}^{2}}{y}\right)\right)} \]

      16. lower-neg.f64 N/A

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

   5. Applied rewrites 77.8%

      \[\leadsto \color{blue}{-\mathsf{fma}\left(\frac{z}{y}, x + z, z\right)} \]

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 17.2%

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

   9. Taylor expanded in z around 0

      \[\leadsto -z \cdot \left(1 + \frac{x}{y}\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 80.7%

       \[\leadsto -\mathsf{fma}\left(\frac{x}{y}, z, z\right) \]

   if -4.49999999999999987e-22 < y < 4.2e13

   1. Initial program 99.9%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(-1 \cdot z + -1 \cdot \frac{x \cdot z}{y}\right) - \frac{{z}^{2}}{y}} \]
   4. Step-by-step derivation

      1. associate-+r- N/A

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

      2. associate--l+ N/A

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

      3. fp-cancel-sign-sub-inv N/A

         \[\leadsto \color{blue}{\left(-1 \cdot z - \left(\mathsf{neg}\left(-1\right)\right) \cdot \frac{x \cdot z}{y}\right)} - \frac{{z}^{2}}{y} \]

      4. metadata-eval N/A

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

      5. *-lft-identity N/A

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

      6. associate--l- N/A

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

      7. *-lft-identity N/A

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

      8. metadata-eval N/A

         \[\leadsto -1 \cdot z - \left(\frac{x \cdot z}{y} + \frac{\color{blue}{\left(\mathsf{neg}\left(-1\right)\right)} \cdot {z}^{2}}{y}\right) \]

      9. div-add N/A

         \[\leadsto -1 \cdot z - \color{blue}{\frac{x \cdot z + \left(\mathsf{neg}\left(-1\right)\right) \cdot {z}^{2}}{y}} \]

      10. fp-cancel-sub-sign-inv N/A

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

      11. *-lft-identity N/A

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

      12. metadata-eval N/A

          \[\leadsto -1 \cdot z - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right)} \cdot \frac{x \cdot z - -1 \cdot {z}^{2}}{y} \]

      13. fp-cancel-sign-sub-inv N/A

          \[\leadsto \color{blue}{-1 \cdot z + -1 \cdot \frac{x \cdot z - -1 \cdot {z}^{2}}{y}} \]

      14. distribute-lft-out N/A

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

      15. mul-1-neg N/A

          \[\leadsto \color{blue}{\mathsf{neg}\left(\left(z + \frac{x \cdot z - -1 \cdot {z}^{2}}{y}\right)\right)} \]

      16. lower-neg.f64 N/A

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

   5. Applied rewrites 25.5%

      \[\leadsto \color{blue}{-\mathsf{fma}\left(\frac{z}{y}, x + z, z\right)} \]

   6. Taylor expanded in z around 0

      \[\leadsto -z \cdot \left(1 + \frac{x}{y}\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 25.9%

      \[\leadsto -\mathsf{fma}\left(\frac{z}{y}, x, z\right) \]

   9. Taylor expanded in z around inf

      \[\leadsto \color{blue}{x + y} \]
   10. Step-by-step derivation

       1. +-commutative N/A

          \[\leadsto \color{blue}{y + x} \]

       2. lower-+.f64 76.2

          \[\leadsto \color{blue}{y + x} \]

   11. Applied rewrites 76.2%

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

4. Final simplification 78.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -4.5 \cdot 10^{-22} \lor \neg \left(y \leq 42000000000000\right):\\ \;\;\;\;-\mathsf{fma}\left(\frac{x}{y}, z, z\right)\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 66.8% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -3.6 \cdot 10^{-19} \lor \neg \left(y \leq 7.2 \cdot 10^{+34}\right):\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -3.6e-19) (not (<= y 7.2e+34))) (- z) (+ y x)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -3.6e-19) || !(y <= 7.2e+34)) {
		tmp = -z;
	} else {
		tmp = y + x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y <= (-3.6d-19)) .or. (.not. (y <= 7.2d+34))) then
        tmp = -z
    else
        tmp = y + x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -3.6e-19) || !(y <= 7.2e+34)) {
		tmp = -z;
	} else {
		tmp = y + x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -3.6e-19) or not (y <= 7.2e+34):
		tmp = -z
	else:
		tmp = y + x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -3.6e-19) || !(y <= 7.2e+34))
		tmp = Float64(-z);
	else
		tmp = Float64(y + x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -3.6e-19) || ~((y <= 7.2e+34)))
		tmp = -z;
	else
		tmp = y + x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -3.6e-19], N[Not[LessEqual[y, 7.2e+34]], $MachinePrecision]], (-z), N[(y + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -3.6000000000000001e-19 or 7.2000000000000001e34 < y

   1. Initial program 76.7%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(z\right)} \]

      2. lower-neg.f64 65.4

         \[\leadsto \color{blue}{-z} \]

   5. Applied rewrites 65.4%

      \[\leadsto \color{blue}{-z} \]

   if -3.6000000000000001e-19 < y < 7.2000000000000001e34

   1. Initial program 99.9%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\left(-1 \cdot z + -1 \cdot \frac{x \cdot z}{y}\right) - \frac{{z}^{2}}{y}} \]
   4. Step-by-step derivation

      1. associate-+r- N/A

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

      2. associate--l+ N/A

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

      3. fp-cancel-sign-sub-inv N/A

         \[\leadsto \color{blue}{\left(-1 \cdot z - \left(\mathsf{neg}\left(-1\right)\right) \cdot \frac{x \cdot z}{y}\right)} - \frac{{z}^{2}}{y} \]

      4. metadata-eval N/A

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

      5. *-lft-identity N/A

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

      6. associate--l- N/A

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

      7. *-lft-identity N/A

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

      8. metadata-eval N/A

         \[\leadsto -1 \cdot z - \left(\frac{x \cdot z}{y} + \frac{\color{blue}{\left(\mathsf{neg}\left(-1\right)\right)} \cdot {z}^{2}}{y}\right) \]

      9. div-add N/A

         \[\leadsto -1 \cdot z - \color{blue}{\frac{x \cdot z + \left(\mathsf{neg}\left(-1\right)\right) \cdot {z}^{2}}{y}} \]

      10. fp-cancel-sub-sign-inv N/A

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

      11. *-lft-identity N/A

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

      12. metadata-eval N/A

          \[\leadsto -1 \cdot z - \color{blue}{\left(\mathsf{neg}\left(-1\right)\right)} \cdot \frac{x \cdot z - -1 \cdot {z}^{2}}{y} \]

      13. fp-cancel-sign-sub-inv N/A

          \[\leadsto \color{blue}{-1 \cdot z + -1 \cdot \frac{x \cdot z - -1 \cdot {z}^{2}}{y}} \]

      14. distribute-lft-out N/A

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

      15. mul-1-neg N/A

          \[\leadsto \color{blue}{\mathsf{neg}\left(\left(z + \frac{x \cdot z - -1 \cdot {z}^{2}}{y}\right)\right)} \]

      16. lower-neg.f64 N/A

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

   5. Applied rewrites 27.0%

      \[\leadsto \color{blue}{-\mathsf{fma}\left(\frac{z}{y}, x + z, z\right)} \]

   6. Taylor expanded in z around 0

      \[\leadsto -z \cdot \left(1 + \frac{x}{y}\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 27.3%

      \[\leadsto -\mathsf{fma}\left(\frac{z}{y}, x, z\right) \]

   9. Taylor expanded in z around inf

      \[\leadsto \color{blue}{x + y} \]
   10. Step-by-step derivation

       1. +-commutative N/A

          \[\leadsto \color{blue}{y + x} \]

       2. lower-+.f64 74.8

          \[\leadsto \color{blue}{y + x} \]

   11. Applied rewrites 74.8%

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

4. Final simplification 69.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3.6 \cdot 10^{-19} \lor \neg \left(y \leq 7.2 \cdot 10^{+34}\right):\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 34.9% accurate, 9.7× speedup

Math

\[\begin{array}{l} \\ -z \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- z))

C

double code(double x, double y, double z) {
	return -z;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = -z
end function

Java

public static double code(double x, double y, double z) {
	return -z;
}

Python

def code(x, y, z):
	return -z

Julia

function code(x, y, z)
	return Float64(-z)
end

MATLAB

function tmp = code(x, y, z)
	tmp = -z;
end

Wolfram

code[x_, y_, z_] := (-z)

Derivation

1. Initial program 87.8%

   \[\frac{x + y}{1 - \frac{y}{z}} \]
2. Add Preprocessing

3. Taylor expanded in y around inf

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

   1. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(z\right)} \]

   2. lower-neg.f64 40.2

      \[\leadsto \color{blue}{-z} \]

5. Applied rewrites 40.2%

   \[\leadsto \color{blue}{-z} \]
6. Add Preprocessing

Developer Target 1: 93.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{y + x}{-y} \cdot z\\ \mathbf{if}\;y < -3.7429310762689856 \cdot 10^{+171}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y < 3.5534662456086734 \cdot 10^{+168}:\\ \;\;\;\;\frac{x + y}{1 - \frac{y}{z}}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (/ (+ y x) (- y)) z)))
   (if (< y -3.7429310762689856e+171)
     t_0
     (if (< y 3.5534662456086734e+168) (/ (+ x y) (- 1.0 (/ y z))) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = ((y + x) / -y) * z;
	double tmp;
	if (y < -3.7429310762689856e+171) {
		tmp = t_0;
	} else if (y < 3.5534662456086734e+168) {
		tmp = (x + y) / (1.0 - (y / z));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = ((y + x) / -y) * z
    if (y < (-3.7429310762689856d+171)) then
        tmp = t_0
    else if (y < 3.5534662456086734d+168) then
        tmp = (x + y) / (1.0d0 - (y / z))
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = ((y + x) / -y) * z;
	double tmp;
	if (y < -3.7429310762689856e+171) {
		tmp = t_0;
	} else if (y < 3.5534662456086734e+168) {
		tmp = (x + y) / (1.0 - (y / z));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = ((y + x) / -y) * z
	tmp = 0
	if y < -3.7429310762689856e+171:
		tmp = t_0
	elif y < 3.5534662456086734e+168:
		tmp = (x + y) / (1.0 - (y / z))
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(Float64(y + x) / Float64(-y)) * z)
	tmp = 0.0
	if (y < -3.7429310762689856e+171)
		tmp = t_0;
	elseif (y < 3.5534662456086734e+168)
		tmp = Float64(Float64(x + y) / Float64(1.0 - Float64(y / z)));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = ((y + x) / -y) * z;
	tmp = 0.0;
	if (y < -3.7429310762689856e+171)
		tmp = t_0;
	elseif (y < 3.5534662456086734e+168)
		tmp = (x + y) / (1.0 - (y / z));
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[(y + x), $MachinePrecision] / (-y)), $MachinePrecision] * z), $MachinePrecision]}, If[Less[y, -3.7429310762689856e+171], t$95$0, If[Less[y, 3.5534662456086734e+168], N[(N[(x + y), $MachinePrecision] / N[(1.0 - N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Reproduce

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

  :alt
  (! :herbie-platform default (if (< y -3742931076268985600000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (* (/ (+ y x) (- y)) z) (if (< y 3553466245608673400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (+ x y) (- 1 (/ y z))) (* (/ (+ y x) (- y)) z))))

  (/ (+ x y) (- 1.0 (/ y z))))