Statistics.Distribution.CauchyLorentz:$cdensity from math-functions-0.1.5.2

Percentage Accurate: 89.9% → 98.8%

Time: 2.7s

Alternatives: 4

Speedup: 0.6×

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 89.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ [x, y_m, z] = \mathsf{sort}([x, y_m, z])\\ \\ y\_s \cdot \begin{array}{l} \mathbf{if}\;y\_m \cdot \left(1 + z \cdot z\right) \leq 2 \cdot 10^{+307}:\\ \;\;\;\;\frac{1}{\left(\mathsf{fma}\left(z, z, 1\right) \cdot y\_m\right) \cdot x}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{z \cdot \left(\left(x \cdot z\right) \cdot y\_m\right)}\\ \end{array} \end{array} \]

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x y_m z)
 :precision binary64
 (*
  y_s
  (if (<= (* y_m (+ 1.0 (* z z))) 2e+307)
    (/ 1.0 (* (* (fma z z 1.0) y_m) x))
    (/ 1.0 (* z (* (* x z) y_m))))))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x < y_m && y_m < z);
double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if ((y_m * (1.0 + (z * z))) <= 2e+307) {
		tmp = 1.0 / ((fma(z, z, 1.0) * y_m) * x);
	} else {
		tmp = 1.0 / (z * ((x * z) * y_m));
	}
	return y_s * tmp;
}

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
x, y_m, z = sort([x, y_m, z])
function code(y_s, x, y_m, z)
	tmp = 0.0
	if (Float64(y_m * Float64(1.0 + Float64(z * z))) <= 2e+307)
		tmp = Float64(1.0 / Float64(Float64(fma(z, z, 1.0) * y_m) * x));
	else
		tmp = Float64(1.0 / Float64(z * Float64(Float64(x * z) * y_m)));
	end
	return Float64(y_s * tmp)
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x_, y$95$m_, z_] := N[(y$95$s * If[LessEqual[N[(y$95$m * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2e+307], N[(1.0 / N[(N[(N[(z * z + 1.0), $MachinePrecision] * y$95$m), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(z * N[(N[(x * z), $MachinePrecision] * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) < 1.99999999999999997e307

   1. Initial program 89.9%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. pow2 N/A

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

      7. associate-/r* N/A

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

      8. lower-/.f64 N/A

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

      9. *-commutative N/A

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

      10. pow2 N/A

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

      11. lower-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

      14. pow2 N/A

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

      15. +-commutative N/A

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

      16. pow2 N/A

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

      17. lower-fma.f64 89.6

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

   3. Applied rewrites 89.6%

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

   if 1.99999999999999997e307 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z)))

   1. Initial program 89.9%

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

   2. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 49.3

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

   4. Applied rewrites 49.3%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. associate-*l* N/A

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

      6. lower-*.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 57.4

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

   6. Applied rewrites 57.4%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 58.4

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

   8. Applied rewrites 58.4%

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

Alternative 2: 77.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ [x, y_m, z] = \mathsf{sort}([x, y_m, z])\\ \\ y\_s \cdot \begin{array}{l} \mathbf{if}\;z \leq 0.0055:\\ \;\;\;\;\frac{1}{y\_m \cdot x}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{z \cdot \left(\left(x \cdot z\right) \cdot y\_m\right)}\\ \end{array} \end{array} \]

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x y_m z)
 :precision binary64
 (* y_s (if (<= z 0.0055) (/ 1.0 (* y_m x)) (/ 1.0 (* z (* (* x z) y_m))))))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x < y_m && y_m < z);
double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if (z <= 0.0055) {
		tmp = 1.0 / (y_m * x);
	} else {
		tmp = 1.0 / (z * ((x * z) * y_m));
	}
	return y_s * tmp;
}

Fortran

y\_m =     private
y\_s =     private
NOTE: x, y_m, and z should be sorted in increasing order before calling this function.
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(y_s, x, y_m, z)
use fmin_fmax_functions
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= 0.0055d0) then
        tmp = 1.0d0 / (y_m * x)
    else
        tmp = 1.0d0 / (z * ((x * z) * y_m))
    end if
    code = y_s * tmp
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x < y_m && y_m < z;
public static double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if (z <= 0.0055) {
		tmp = 1.0 / (y_m * x);
	} else {
		tmp = 1.0 / (z * ((x * z) * y_m));
	}
	return y_s * tmp;
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
[x, y_m, z] = sort([x, y_m, z])
def code(y_s, x, y_m, z):
	tmp = 0
	if z <= 0.0055:
		tmp = 1.0 / (y_m * x)
	else:
		tmp = 1.0 / (z * ((x * z) * y_m))
	return y_s * tmp

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
x, y_m, z = sort([x, y_m, z])
function code(y_s, x, y_m, z)
	tmp = 0.0
	if (z <= 0.0055)
		tmp = Float64(1.0 / Float64(y_m * x));
	else
		tmp = Float64(1.0 / Float64(z * Float64(Float64(x * z) * y_m)));
	end
	return Float64(y_s * tmp)
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x, y_m, z = num2cell(sort([x, y_m, z])){:}
function tmp_2 = code(y_s, x, y_m, z)
	tmp = 0.0;
	if (z <= 0.0055)
		tmp = 1.0 / (y_m * x);
	else
		tmp = 1.0 / (z * ((x * z) * y_m));
	end
	tmp_2 = y_s * tmp;
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x_, y$95$m_, z_] := N[(y$95$s * If[LessEqual[z, 0.0055], N[(1.0 / N[(y$95$m * x), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(z * N[(N[(x * z), $MachinePrecision] * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 0.0054999999999999997

   1. Initial program 89.9%

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

   2. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 58.7

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

   4. Applied rewrites 58.7%

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

   if 0.0054999999999999997 < z

   1. Initial program 89.9%

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

   2. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 49.3

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

   4. Applied rewrites 49.3%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. associate-*l* N/A

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

      6. lower-*.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 57.4

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

   6. Applied rewrites 57.4%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 58.4

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

   8. Applied rewrites 58.4%

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

Alternative 3: 76.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ [x, y_m, z] = \mathsf{sort}([x, y_m, z])\\ \\ y\_s \cdot \begin{array}{l} \mathbf{if}\;z \leq 0.0055:\\ \;\;\;\;\frac{1}{y\_m \cdot x}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{y\_m \cdot \left(\left(x \cdot z\right) \cdot z\right)}\\ \end{array} \end{array} \]

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x y_m z)
 :precision binary64
 (* y_s (if (<= z 0.0055) (/ 1.0 (* y_m x)) (/ 1.0 (* y_m (* (* x z) z))))))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x < y_m && y_m < z);
double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if (z <= 0.0055) {
		tmp = 1.0 / (y_m * x);
	} else {
		tmp = 1.0 / (y_m * ((x * z) * z));
	}
	return y_s * tmp;
}

Fortran

y\_m =     private
y\_s =     private
NOTE: x, y_m, and z should be sorted in increasing order before calling this function.
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(y_s, x, y_m, z)
use fmin_fmax_functions
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= 0.0055d0) then
        tmp = 1.0d0 / (y_m * x)
    else
        tmp = 1.0d0 / (y_m * ((x * z) * z))
    end if
    code = y_s * tmp
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x < y_m && y_m < z;
public static double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if (z <= 0.0055) {
		tmp = 1.0 / (y_m * x);
	} else {
		tmp = 1.0 / (y_m * ((x * z) * z));
	}
	return y_s * tmp;
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
[x, y_m, z] = sort([x, y_m, z])
def code(y_s, x, y_m, z):
	tmp = 0
	if z <= 0.0055:
		tmp = 1.0 / (y_m * x)
	else:
		tmp = 1.0 / (y_m * ((x * z) * z))
	return y_s * tmp

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
x, y_m, z = sort([x, y_m, z])
function code(y_s, x, y_m, z)
	tmp = 0.0
	if (z <= 0.0055)
		tmp = Float64(1.0 / Float64(y_m * x));
	else
		tmp = Float64(1.0 / Float64(y_m * Float64(Float64(x * z) * z)));
	end
	return Float64(y_s * tmp)
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x, y_m, z = num2cell(sort([x, y_m, z])){:}
function tmp_2 = code(y_s, x, y_m, z)
	tmp = 0.0;
	if (z <= 0.0055)
		tmp = 1.0 / (y_m * x);
	else
		tmp = 1.0 / (y_m * ((x * z) * z));
	end
	tmp_2 = y_s * tmp;
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x_, y$95$m_, z_] := N[(y$95$s * If[LessEqual[z, 0.0055], N[(1.0 / N[(y$95$m * x), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(y$95$m * N[(N[(x * z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 0.0054999999999999997

   1. Initial program 89.9%

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

   2. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 58.7

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

   4. Applied rewrites 58.7%

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

   if 0.0054999999999999997 < z

   1. Initial program 89.9%

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

   2. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 49.3

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

   4. Applied rewrites 49.3%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. associate-*l* N/A

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

      6. lower-*.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 57.4

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

   6. Applied rewrites 57.4%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. associate-*l* N/A

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

      7. lower-*.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 56.0

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

   8. Applied rewrites 56.0%

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

Alternative 4: 58.7% accurate, 2.2× speedup

Math

\[\begin{array}{l} y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ [x, y_m, z] = \mathsf{sort}([x, y_m, z])\\ \\ y\_s \cdot \frac{1}{y\_m \cdot x} \end{array} \]

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
NOTE: x, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x y_m z) :precision binary64 (* y_s (/ 1.0 (* y_m x))))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x < y_m && y_m < z);
double code(double y_s, double x, double y_m, double z) {
	return y_s * (1.0 / (y_m * x));
}

Fortran

y\_m =     private
y\_s =     private
NOTE: x, y_m, and z should be sorted in increasing order before calling this function.
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(y_s, x, y_m, z)
use fmin_fmax_functions
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    code = y_s * (1.0d0 / (y_m * x))
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
assert x < y_m && y_m < z;
public static double code(double y_s, double x, double y_m, double z) {
	return y_s * (1.0 / (y_m * x));
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
[x, y_m, z] = sort([x, y_m, z])
def code(y_s, x, y_m, z):
	return y_s * (1.0 / (y_m * x))

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
x, y_m, z = sort([x, y_m, z])
function code(y_s, x, y_m, z)
	return Float64(y_s * Float64(1.0 / Float64(y_m * x)))
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x, y_m, z = num2cell(sort([x, y_m, z])){:}
function tmp = code(y_s, x, y_m, z)
	tmp = y_s * (1.0 / (y_m * x));
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x_, y$95$m_, z_] := N[(y$95$s * N[(1.0 / N[(y$95$m * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 89.9%

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

2. Taylor expanded in z around 0

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

   1. lower-/.f64 N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 58.7

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

4. Applied rewrites 58.7%

   \[\leadsto \color{blue}{\frac{1}{y \cdot x}} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2025131 
(FPCore (x y z)
  :name "Statistics.Distribution.CauchyLorentz:$cdensity from math-functions-0.1.5.2"
  :precision binary64
  (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))