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

Percentage Accurate: 88.1% → 99.5%

Time: 4.9s

Alternatives: 9

Speedup: 0.7×

• 21.5% 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: 88.1% 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.5% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -5e-18) (not (<= z 4.5e-122)))
   (fma (/ (- z x) z) y (/ x z))
   (/ (+ x (* y (- z x))) z)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -5.00000000000000036e-18 or 4.4999999999999998e-122 < z

   1. Initial program 80.0%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. div-add N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/l* N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 100.0

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

   4. Applied rewrites 100.0%

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

   if -5.00000000000000036e-18 < z < 4.4999999999999998e-122

   1. Initial program 99.9%

      \[\frac{x + y \cdot \left(z - x\right)}{z} \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 100.0%

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

Alternative 2: 99.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -8 \cdot 10^{+78} \lor \neg \left(y \leq 0.0275\right):\\ \;\;\;\;\frac{z - x}{z} \cdot y\\ \mathbf{else}:\\ \;\;\;\;\frac{x + y \cdot \left(z - x\right)}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -8e+78) (not (<= y 0.0275)))
   (* (/ (- z x) z) y)
   (/ (+ x (* y (- z x))) z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -8e+78) || !(y <= 0.0275)) {
		tmp = ((z - x) / z) * y;
	} else {
		tmp = (x + (y * (z - x))) / z;
	}
	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 <= (-8d+78)) .or. (.not. (y <= 0.0275d0))) then
        tmp = ((z - x) / z) * y
    else
        tmp = (x + (y * (z - x))) / z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -8e+78) || !(y <= 0.0275)) {
		tmp = ((z - x) / z) * y;
	} else {
		tmp = (x + (y * (z - x))) / z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -8e+78) or not (y <= 0.0275):
		tmp = ((z - x) / z) * y
	else:
		tmp = (x + (y * (z - x))) / z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -8e+78) || !(y <= 0.0275))
		tmp = Float64(Float64(Float64(z - x) / z) * y);
	else
		tmp = Float64(Float64(x + Float64(y * Float64(z - x))) / z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -8e+78) || ~((y <= 0.0275)))
		tmp = ((z - x) / z) * y;
	else
		tmp = (x + (y * (z - x))) / z;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -8.00000000000000007e78 or 0.0275000000000000001 < y

   1. Initial program 71.2%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. div-add N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/l* N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 93.0

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

   4. Applied rewrites 93.0%

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

   5. Taylor expanded in y around inf

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

   7. Applied rewrites 100.0%

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

   if -8.00000000000000007e78 < y < 0.0275000000000000001

   1. Initial program 99.9%

      \[\frac{x + y \cdot \left(z - x\right)}{z} \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 99.9%

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

Alternative 3: 99.1% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1 or 0.0275000000000000001 < y

   1. Initial program 75.9%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. div-add N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/l* N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 94.2

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

   4. Applied rewrites 94.2%

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

   5. Taylor expanded in y around inf

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

   7. Applied rewrites 98.3%

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

   if -1 < y < 0.0275000000000000001

   1. Initial program 99.9%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. div-add N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/l* N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 91.8

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

   4. Applied rewrites 91.8%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 98.5%

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

4. Final simplification 98.4%

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

Alternative 4: 75.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -4.6e+105) y (if (<= y 0.0275) (/ (fma z y x) z) y)))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -4.6e+105) {
		tmp = y;
	} else if (y <= 0.0275) {
		tmp = fma(z, y, x) / z;
	} else {
		tmp = y;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -4.6e+105)
		tmp = y;
	elseif (y <= 0.0275)
		tmp = Float64(fma(z, y, x) / z);
	else
		tmp = y;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -4.6e+105], y, If[LessEqual[y, 0.0275], N[(N[(z * y + x), $MachinePrecision] / z), $MachinePrecision], y]]

Derivation

1. Split input into 2 regimes

2. if y < -4.5999999999999996e105 or 0.0275000000000000001 < y

   1. Initial program 71.0%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 53.1%

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

   if -4.5999999999999996e105 < y < 0.0275000000000000001

   1. Initial program 99.3%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 93.5%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 93.5

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

   7. Applied rewrites 93.5%

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

4. Final simplification 78.2%

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

Alternative 5: 77.6% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 4.8e+108) (fma 1.0 y (/ x z)) (* (/ (- x) z) y)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 4.80000000000000037e108

   1. Initial program 89.6%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. div-add N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/l* N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 94.3

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

   4. Applied rewrites 94.3%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 88.3%

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

   if 4.80000000000000037e108 < y

   1. Initial program 83.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

   5. Applied rewrites 50.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 58.1%

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

4. Final simplification 82.9%

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

Alternative 6: 75.9% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -3.4e+166) (* (- x) (/ y z)) (fma 1.0 y (/ x z))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -3.4e166

   1. Initial program 96.5%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. div-add N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/l* N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 81.5

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

   4. Applied rewrites 81.5%

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

   5. Taylor expanded in y around inf

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

   7. Applied rewrites 74.8%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 74.6%

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

   if -3.4e166 < x

   1. Initial program 87.6%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. div-add N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/l* N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 94.3

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

   4. Applied rewrites 94.3%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 82.9%

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

Alternative 7: 57.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -0.00058:\\ \;\;\;\;y\\ \mathbf{elif}\;z \leq 2 \cdot 10^{-70}:\\ \;\;\;\;\frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -0.00058) y (if (<= z 2e-70) (/ x z) y)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -0.00058) {
		tmp = y;
	} else if (z <= 2e-70) {
		tmp = x / z;
	} else {
		tmp = 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 (z <= (-0.00058d0)) then
        tmp = y
    else if (z <= 2d-70) then
        tmp = x / z
    else
        tmp = y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -0.00058) {
		tmp = y;
	} else if (z <= 2e-70) {
		tmp = x / z;
	} else {
		tmp = y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -0.00058:
		tmp = y
	elif z <= 2e-70:
		tmp = x / z
	else:
		tmp = y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -0.00058)
		tmp = y;
	elseif (z <= 2e-70)
		tmp = Float64(x / z);
	else
		tmp = y;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -0.00058)
		tmp = y;
	elseif (z <= 2e-70)
		tmp = x / z;
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -0.00058], y, If[LessEqual[z, 2e-70], N[(x / z), $MachinePrecision], y]]

Derivation

1. Split input into 2 regimes

2. if z < -5.8e-4 or 1.99999999999999999e-70 < z

   1. Initial program 78.6%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 71.7%

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

   if -5.8e-4 < z < 1.99999999999999999e-70

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 59.1%

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

4. Final simplification 65.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -0.00058:\\ \;\;\;\;y\\ \mathbf{elif}\;z \leq 2 \cdot 10^{-70}:\\ \;\;\;\;\frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 77.7% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 88.6%

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

   1. lift-/.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. +-commutative N/A

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

   4. div-add N/A

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

   5. lift-*.f64 N/A

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

   6. associate-/l* N/A

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

   7. *-commutative N/A

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

   8. lower-fma.f64 N/A

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

   9. lower-/.f64 N/A

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

   10. lower-/.f64 92.9

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

4. Applied rewrites 92.9%

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

5. Taylor expanded in x around 0

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

7. Applied rewrites 80.1%

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

Alternative 9: 40.3% accurate, 23.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := y

Derivation

1. Initial program 88.6%

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

3. Taylor expanded in x around 0

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

5. Applied rewrites 44.6%

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

6. Final simplification 44.6%

   \[\leadsto y \]
7. Add Preprocessing

Developer Target 1: 93.7% 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 2025019 
(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))