Diagrams.Backend.Rasterific:rasterificRadialGradient from diagrams-rasterific-1.3.1.3

Percentage Accurate: 87.9% → 99.9%

Time: 6.3s

Alternatives: 7

Speedup: 1.1×

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

Specification

Math

\[\begin{array}{l} \\ \frac{x + y \cdot \left(z - x\right)}{z} \end{array} \]

FPCore

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

C

double code(double x, double y, double z) {
	return (x + (y * (z - x))) / 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 * (z - x))) / z
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 87.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x + y \cdot \left(z - x\right)}{z} \end{array} \]

FPCore

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

C

double code(double x, double y, double z) {
	return (x + (y * (z - x))) / 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 * (z - x))) / z
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\frac{x}{z}, 1 - y, y\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 87.2%

   \[\frac{x + y \cdot \left(z - x\right)}{z} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

5. Applied rewrites 99.9%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{x}{z}, 1 - y, y\right)} \]
6. Add Preprocessing

Alternative 2: 99.2% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -300000.0) (not (<= y 1.0)))
   (* (/ (- z x) z) y)
   (fma (/ x z) 1.0 y)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -300000.0) || !(y <= 1.0)) {
		tmp = ((z - x) / z) * y;
	} else {
		tmp = fma((x / z), 1.0, y);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -300000.0) || !(y <= 1.0))
		tmp = Float64(Float64(Float64(z - x) / z) * y);
	else
		tmp = fma(Float64(x / z), 1.0, y);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -3e5 or 1 < y

   1. Initial program 73.6%

      \[\frac{x + y \cdot \left(z - x\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 98.7

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

   5. Applied rewrites 98.7%

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

   if -3e5 < y < 1

   1. Initial program 99.9%

      \[\frac{x + y \cdot \left(z - x\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 97.8%

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

4. Final simplification 98.2%

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

Alternative 3: 84.7% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -3.4e-44) (not (<= x 3.1e+149)))
   (* (/ x z) (- 1.0 y))
   (fma (/ x z) 1.0 y)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -3.4e-44) || !(x <= 3.1e+149)) {
		tmp = (x / z) * (1.0 - y);
	} else {
		tmp = fma((x / z), 1.0, y);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -3.4e-44) || !(x <= 3.1e+149))
		tmp = Float64(Float64(x / z) * Float64(1.0 - y));
	else
		tmp = fma(Float64(x / z), 1.0, y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -3.4e-44], N[Not[LessEqual[x, 3.1e+149]], $MachinePrecision]], N[(N[(x / z), $MachinePrecision] * N[(1.0 - y), $MachinePrecision]), $MachinePrecision], N[(N[(x / z), $MachinePrecision] * 1.0 + y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.40000000000000016e-44 or 3.09999999999999987e149 < x

   1. Initial program 86.7%

      \[\frac{x + y \cdot \left(z - x\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. associate-*l/ N/A

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

      3. +-commutative N/A

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

      4. div-add-rev N/A

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

      5. associate-*r/ N/A

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

      6. lower-*.f64 N/A

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

      7. associate-*r/ N/A

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

      8. div-add-rev N/A

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

      9. +-commutative N/A

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

      10. lower-/.f64 N/A

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

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

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

      12. metadata-eval N/A

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

      13. *-lft-identity N/A

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

      14. lower--.f64 88.6

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

   5. Applied rewrites 88.6%

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

   7. Applied rewrites 89.5%

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

   if -3.40000000000000016e-44 < x < 3.09999999999999987e149

   1. Initial program 87.5%

      \[\frac{x + y \cdot \left(z - x\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 90.2%

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

4. Final simplification 89.9%

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

Alternative 4: 77.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 62000000:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{z}, 1, y\right)\\ \mathbf{elif}\;y \leq 7 \cdot 10^{+87}:\\ \;\;\;\;\frac{-x}{z} \cdot y\\ \mathbf{else}:\\ \;\;\;\;1 \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 62000000.0)
   (fma (/ x z) 1.0 y)
   (if (<= y 7e+87) (* (/ (- x) z) y) (* 1.0 y))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= 62000000.0) {
		tmp = fma((x / z), 1.0, y);
	} else if (y <= 7e+87) {
		tmp = (-x / z) * y;
	} else {
		tmp = 1.0 * y;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= 62000000.0)
		tmp = fma(Float64(x / z), 1.0, y);
	elseif (y <= 7e+87)
		tmp = Float64(Float64(Float64(-x) / z) * y);
	else
		tmp = Float64(1.0 * y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, 62000000.0], N[(N[(x / z), $MachinePrecision] * 1.0 + y), $MachinePrecision], If[LessEqual[y, 7e+87], N[(N[((-x) / z), $MachinePrecision] * y), $MachinePrecision], N[(1.0 * y), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < 6.2e7

   1. Initial program 92.8%

      \[\frac{x + y \cdot \left(z - x\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 88.0%

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

   if 6.2e7 < y < 6.99999999999999972e87

   1. Initial program 72.2%

      \[\frac{x + y \cdot \left(z - x\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. associate-*l/ N/A

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

      3. +-commutative N/A

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

      4. div-add-rev N/A

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

      5. associate-*r/ N/A

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

      6. lower-*.f64 N/A

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

      7. associate-*r/ N/A

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

      8. div-add-rev N/A

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

      9. +-commutative N/A

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

      10. lower-/.f64 N/A

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

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

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

      12. metadata-eval N/A

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

      13. *-lft-identity N/A

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

      14. lower--.f64 71.2

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

   5. Applied rewrites 71.2%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 74.4%

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

   if 6.99999999999999972e87 < y

   1. Initial program 66.0%

      \[\frac{x + y \cdot \left(z - x\right)}{z} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 66.0

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

   4. Applied rewrites 66.0%

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

   5. Taylor expanded in y around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. div-sub N/A

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

      4. *-inverses N/A

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

      5. *-lft-identity N/A

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

      6. metadata-eval N/A

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

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

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

      8. +-commutative N/A

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

      9. distribute-rgt1-in N/A

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

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

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

      11. *-lft-identity N/A

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

      12. metadata-eval N/A

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

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

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

      14. metadata-eval N/A

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

      15. distribute-rgt-in N/A

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

      16. *-commutative N/A

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

      17. lower-*.f64 N/A

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

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

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

      19. *-inverses N/A

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

      20. metadata-eval N/A

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

      21. *-lft-identity N/A

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

      22. div-sub N/A

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

      23. lower-/.f64 N/A

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

      24. lower--.f64 99.9

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

   7. Applied rewrites 99.9%

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

   8. Taylor expanded in x around 0

      \[\leadsto 1 \cdot y \]
   9. Step-by-step derivation

   10. Applied rewrites 63.4%

       \[\leadsto 1 \cdot y \]
3. Recombined 3 regimes into one program.

4. Final simplification 83.1%

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

Alternative 5: 57.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.65 \cdot 10^{-57} \lor \neg \left(x \leq 1.45 \cdot 10^{-49}\right):\\ \;\;\;\;\frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.65e-57) (not (<= x 1.45e-49))) (/ x z) (* 1.0 y)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.65e-57) || !(x <= 1.45e-49)) {
		tmp = x / z;
	} else {
		tmp = 1.0 * y;
	}
	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 ((x <= (-1.65d-57)) .or. (.not. (x <= 1.45d-49))) then
        tmp = x / z
    else
        tmp = 1.0d0 * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.65e-57) || !(x <= 1.45e-49)) {
		tmp = x / z;
	} else {
		tmp = 1.0 * y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1.65e-57) or not (x <= 1.45e-49):
		tmp = x / z
	else:
		tmp = 1.0 * y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.65e-57) || !(x <= 1.45e-49))
		tmp = Float64(x / z);
	else
		tmp = Float64(1.0 * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -1.65e-57) || ~((x <= 1.45e-49)))
		tmp = x / z;
	else
		tmp = 1.0 * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.65e-57], N[Not[LessEqual[x, 1.45e-49]], $MachinePrecision]], N[(x / z), $MachinePrecision], N[(1.0 * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.6499999999999999e-57 or 1.45e-49 < x

   1. Initial program 84.6%

      \[\frac{x + y \cdot \left(z - x\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 56.1

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

   5. Applied rewrites 56.1%

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

   if -1.6499999999999999e-57 < x < 1.45e-49

   1. Initial program 90.5%

      \[\frac{x + y \cdot \left(z - x\right)}{z} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 90.5

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

   4. Applied rewrites 90.5%

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

   5. Taylor expanded in y around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. div-sub N/A

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

      4. *-inverses N/A

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

      5. *-lft-identity N/A

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

      6. metadata-eval N/A

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

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

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

      8. +-commutative N/A

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

      9. distribute-rgt1-in N/A

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

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

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

      11. *-lft-identity N/A

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

      12. metadata-eval N/A

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

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

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

      14. metadata-eval N/A

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

      15. distribute-rgt-in N/A

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

      16. *-commutative N/A

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

      17. lower-*.f64 N/A

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

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

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

      19. *-inverses N/A

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

      20. metadata-eval N/A

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

      21. *-lft-identity N/A

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

      22. div-sub N/A

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

      23. lower-/.f64 N/A

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

      24. lower--.f64 80.6

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

   7. Applied rewrites 80.6%

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

   8. Taylor expanded in x around 0

      \[\leadsto 1 \cdot y \]
   9. Step-by-step derivation

   10. Applied rewrites 72.6%

       \[\leadsto 1 \cdot y \]
3. Recombined 2 regimes into one program.

4. Final simplification 63.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.65 \cdot 10^{-57} \lor \neg \left(x \leq 1.45 \cdot 10^{-49}\right):\\ \;\;\;\;\frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 77.8% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\frac{x}{z}, 1, y\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (fma (/ x z) 1.0 y))

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 87.2%

   \[\frac{x + y \cdot \left(z - x\right)}{z} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

5. Applied rewrites 99.9%

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

6. Taylor expanded in y around 0

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

8. Applied rewrites 79.7%

   \[\leadsto \mathsf{fma}\left(\frac{x}{z}, 1, y\right) \]
9. Add Preprocessing

Alternative 7: 41.0% accurate, 3.8× speedup

Math

\[\begin{array}{l} \\ 1 \cdot y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (* 1.0 y))

C

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

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 = 1.0d0 * y
end function

Java

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

Python

def code(x, y, z):
	return 1.0 * y

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := N[(1.0 * y), $MachinePrecision]

Derivation

1. Initial program 87.2%

   \[\frac{x + y \cdot \left(z - x\right)}{z} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-fma.f64 87.2

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

4. Applied rewrites 87.2%

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

5. Taylor expanded in y around inf

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

   1. associate-/l* N/A

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

   2. *-commutative N/A

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

   3. div-sub N/A

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

   4. *-inverses N/A

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

   5. *-lft-identity N/A

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

   6. metadata-eval N/A

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

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

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

   8. +-commutative N/A

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

   9. distribute-rgt1-in N/A

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

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

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

   11. *-lft-identity N/A

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

   12. metadata-eval N/A

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

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

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

   14. metadata-eval N/A

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

   15. distribute-rgt-in N/A

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

   16. *-commutative N/A

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

   17. lower-*.f64 N/A

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

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

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

   19. *-inverses N/A

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

   20. metadata-eval N/A

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

   21. *-lft-identity N/A

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

   22. div-sub N/A

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

   23. lower-/.f64 N/A

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

   24. lower--.f64 67.5

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

7. Applied rewrites 67.5%

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

8. Taylor expanded in x around 0

   \[\leadsto 1 \cdot y \]
9. Step-by-step derivation

10. Applied rewrites 40.5%

    \[\leadsto 1 \cdot y \]

11. Final simplification 40.5%

    \[\leadsto 1 \cdot y \]
12. Add Preprocessing

Developer Target 1: 93.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \left(y + \frac{x}{z}\right) - \frac{y}{\frac{z}{x}} \end{array} \]

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024359 
(FPCore (x y z)
  :name "Diagrams.Backend.Rasterific:rasterificRadialGradient from diagrams-rasterific-1.3.1.3"
  :precision binary64

  :alt
  (! :herbie-platform default (- (+ y (/ x z)) (/ y (/ z x))))

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