Diagrams.Backend.Cairo.Internal:setTexture from diagrams-cairo-1.3.0.3

Percentage Accurate: 84.7% → 96.0%

Time: 8.1s

Alternatives: 8

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 84.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 96.0% accurate, 0.8× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (* x_s (if (<= x_m 5e-44) (/ (* (- y z) x_m) y) (* (/ (- y z) y) x_m))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (x_m <= 5e-44) {
		tmp = ((y - z) * x_m) / y;
	} else {
		tmp = ((y - z) / y) * x_m;
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x_m <= 5d-44) then
        tmp = ((y - z) * x_m) / y
    else
        tmp = ((y - z) / y) * x_m
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (x_m <= 5e-44) {
		tmp = ((y - z) * x_m) / y;
	} else {
		tmp = ((y - z) / y) * x_m;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	tmp = 0
	if x_m <= 5e-44:
		tmp = ((y - z) * x_m) / y
	else:
		tmp = ((y - z) / y) * x_m
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if (x_m <= 5e-44)
		tmp = Float64(Float64(Float64(y - z) * x_m) / y);
	else
		tmp = Float64(Float64(Float64(y - z) / y) * x_m);
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if (x_m <= 5e-44)
		tmp = ((y - z) * x_m) / y;
	else
		tmp = ((y - z) / y) * x_m;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[LessEqual[x$95$m, 5e-44], N[(N[(N[(y - z), $MachinePrecision] * x$95$m), $MachinePrecision] / y), $MachinePrecision], N[(N[(N[(y - z), $MachinePrecision] / y), $MachinePrecision] * x$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 5.00000000000000039e-44

   1. Initial program 88.7%

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

   if 5.00000000000000039e-44 < x

   1. Initial program 83.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 100.0

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

   4. Applied rewrites 100.0%

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

4. Final simplification 92.3%

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

Alternative 2: 90.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq -3.5 \cdot 10^{+125}:\\ \;\;\;\;1 \cdot x\_m\\ \mathbf{elif}\;y \leq 2.05 \cdot 10^{+144}:\\ \;\;\;\;\frac{x\_m}{y} \cdot \left(y - z\right)\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\_m\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (*
  x_s
  (if (<= y -3.5e+125)
    (* 1.0 x_m)
    (if (<= y 2.05e+144) (* (/ x_m y) (- y z)) (* 1.0 x_m)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (y <= -3.5e+125) {
		tmp = 1.0 * x_m;
	} else if (y <= 2.05e+144) {
		tmp = (x_m / y) * (y - z);
	} else {
		tmp = 1.0 * x_m;
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y <= (-3.5d+125)) then
        tmp = 1.0d0 * x_m
    else if (y <= 2.05d+144) then
        tmp = (x_m / y) * (y - z)
    else
        tmp = 1.0d0 * x_m
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (y <= -3.5e+125) {
		tmp = 1.0 * x_m;
	} else if (y <= 2.05e+144) {
		tmp = (x_m / y) * (y - z);
	} else {
		tmp = 1.0 * x_m;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	tmp = 0
	if y <= -3.5e+125:
		tmp = 1.0 * x_m
	elif y <= 2.05e+144:
		tmp = (x_m / y) * (y - z)
	else:
		tmp = 1.0 * x_m
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if (y <= -3.5e+125)
		tmp = Float64(1.0 * x_m);
	elseif (y <= 2.05e+144)
		tmp = Float64(Float64(x_m / y) * Float64(y - z));
	else
		tmp = Float64(1.0 * x_m);
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if (y <= -3.5e+125)
		tmp = 1.0 * x_m;
	elseif (y <= 2.05e+144)
		tmp = (x_m / y) * (y - z);
	else
		tmp = 1.0 * x_m;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[LessEqual[y, -3.5e+125], N[(1.0 * x$95$m), $MachinePrecision], If[LessEqual[y, 2.05e+144], N[(N[(x$95$m / y), $MachinePrecision] * N[(y - z), $MachinePrecision]), $MachinePrecision], N[(1.0 * x$95$m), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < -3.50000000000000011e125 or 2.05000000000000001e144 < y

   1. Initial program 69.8%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in z around 0

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

   7. Applied rewrites 94.4%

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

   if -3.50000000000000011e125 < y < 2.05000000000000001e144

   1. Initial program 93.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 91.8

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

   4. Applied rewrites 91.8%

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

Alternative 3: 72.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq -5 \cdot 10^{-41}:\\ \;\;\;\;1 \cdot x\_m\\ \mathbf{elif}\;y \leq 3.4 \cdot 10^{-8}:\\ \;\;\;\;\frac{\left(-z\right) \cdot x\_m}{y}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\_m\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (*
  x_s
  (if (<= y -5e-41)
    (* 1.0 x_m)
    (if (<= y 3.4e-8) (/ (* (- z) x_m) y) (* 1.0 x_m)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (y <= -5e-41) {
		tmp = 1.0 * x_m;
	} else if (y <= 3.4e-8) {
		tmp = (-z * x_m) / y;
	} else {
		tmp = 1.0 * x_m;
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y <= (-5d-41)) then
        tmp = 1.0d0 * x_m
    else if (y <= 3.4d-8) then
        tmp = (-z * x_m) / y
    else
        tmp = 1.0d0 * x_m
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (y <= -5e-41) {
		tmp = 1.0 * x_m;
	} else if (y <= 3.4e-8) {
		tmp = (-z * x_m) / y;
	} else {
		tmp = 1.0 * x_m;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	tmp = 0
	if y <= -5e-41:
		tmp = 1.0 * x_m
	elif y <= 3.4e-8:
		tmp = (-z * x_m) / y
	else:
		tmp = 1.0 * x_m
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if (y <= -5e-41)
		tmp = Float64(1.0 * x_m);
	elseif (y <= 3.4e-8)
		tmp = Float64(Float64(Float64(-z) * x_m) / y);
	else
		tmp = Float64(1.0 * x_m);
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if (y <= -5e-41)
		tmp = 1.0 * x_m;
	elseif (y <= 3.4e-8)
		tmp = (-z * x_m) / y;
	else
		tmp = 1.0 * x_m;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[LessEqual[y, -5e-41], N[(1.0 * x$95$m), $MachinePrecision], If[LessEqual[y, 3.4e-8], N[(N[((-z) * x$95$m), $MachinePrecision] / y), $MachinePrecision], N[(1.0 * x$95$m), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < -4.9999999999999996e-41 or 3.4e-8 < y

   1. Initial program 79.4%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in z around 0

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

   7. Applied rewrites 77.4%

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

   if -4.9999999999999996e-41 < y < 3.4e-8

   1. Initial program 95.9%

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

   3. Taylor expanded in z around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 82.1

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

   5. Applied rewrites 82.1%

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

4. Final simplification 79.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5 \cdot 10^{-41}:\\ \;\;\;\;1 \cdot x\\ \mathbf{elif}\;y \leq 3.4 \cdot 10^{-8}:\\ \;\;\;\;\frac{\left(-z\right) \cdot x}{y}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 72.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq -5 \cdot 10^{-41}:\\ \;\;\;\;1 \cdot x\_m\\ \mathbf{elif}\;y \leq 3.4 \cdot 10^{-8}:\\ \;\;\;\;\left(-z\right) \cdot \frac{x\_m}{y}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\_m\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (*
  x_s
  (if (<= y -5e-41)
    (* 1.0 x_m)
    (if (<= y 3.4e-8) (* (- z) (/ x_m y)) (* 1.0 x_m)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (y <= -5e-41) {
		tmp = 1.0 * x_m;
	} else if (y <= 3.4e-8) {
		tmp = -z * (x_m / y);
	} else {
		tmp = 1.0 * x_m;
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y <= (-5d-41)) then
        tmp = 1.0d0 * x_m
    else if (y <= 3.4d-8) then
        tmp = -z * (x_m / y)
    else
        tmp = 1.0d0 * x_m
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (y <= -5e-41) {
		tmp = 1.0 * x_m;
	} else if (y <= 3.4e-8) {
		tmp = -z * (x_m / y);
	} else {
		tmp = 1.0 * x_m;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	tmp = 0
	if y <= -5e-41:
		tmp = 1.0 * x_m
	elif y <= 3.4e-8:
		tmp = -z * (x_m / y)
	else:
		tmp = 1.0 * x_m
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if (y <= -5e-41)
		tmp = Float64(1.0 * x_m);
	elseif (y <= 3.4e-8)
		tmp = Float64(Float64(-z) * Float64(x_m / y));
	else
		tmp = Float64(1.0 * x_m);
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if (y <= -5e-41)
		tmp = 1.0 * x_m;
	elseif (y <= 3.4e-8)
		tmp = -z * (x_m / y);
	else
		tmp = 1.0 * x_m;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[LessEqual[y, -5e-41], N[(1.0 * x$95$m), $MachinePrecision], If[LessEqual[y, 3.4e-8], N[((-z) * N[(x$95$m / y), $MachinePrecision]), $MachinePrecision], N[(1.0 * x$95$m), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < -4.9999999999999996e-41 or 3.4e-8 < y

   1. Initial program 79.4%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in z around 0

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

   7. Applied rewrites 77.4%

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

   if -4.9999999999999996e-41 < y < 3.4e-8

   1. Initial program 95.9%

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

   3. Taylor expanded in z around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 82.1

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

   5. Applied rewrites 82.1%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. associate-/r/ N/A

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

      4. lift-/.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. associate-*r* N/A

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

      7. lift-/.f64 N/A

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

      8. associate-*l/ N/A

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

      9. *-lft-identity N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 80.5

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

   7. Applied rewrites 80.5%

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

4. Final simplification 78.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5 \cdot 10^{-41}:\\ \;\;\;\;1 \cdot x\\ \mathbf{elif}\;y \leq 3.4 \cdot 10^{-8}:\\ \;\;\;\;\left(-z\right) \cdot \frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 70.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq -5 \cdot 10^{-41}:\\ \;\;\;\;1 \cdot x\_m\\ \mathbf{elif}\;y \leq 3.4 \cdot 10^{-8}:\\ \;\;\;\;\frac{-z}{y} \cdot x\_m\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\_m\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (*
  x_s
  (if (<= y -5e-41)
    (* 1.0 x_m)
    (if (<= y 3.4e-8) (* (/ (- z) y) x_m) (* 1.0 x_m)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (y <= -5e-41) {
		tmp = 1.0 * x_m;
	} else if (y <= 3.4e-8) {
		tmp = (-z / y) * x_m;
	} else {
		tmp = 1.0 * x_m;
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y <= (-5d-41)) then
        tmp = 1.0d0 * x_m
    else if (y <= 3.4d-8) then
        tmp = (-z / y) * x_m
    else
        tmp = 1.0d0 * x_m
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (y <= -5e-41) {
		tmp = 1.0 * x_m;
	} else if (y <= 3.4e-8) {
		tmp = (-z / y) * x_m;
	} else {
		tmp = 1.0 * x_m;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	tmp = 0
	if y <= -5e-41:
		tmp = 1.0 * x_m
	elif y <= 3.4e-8:
		tmp = (-z / y) * x_m
	else:
		tmp = 1.0 * x_m
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if (y <= -5e-41)
		tmp = Float64(1.0 * x_m);
	elseif (y <= 3.4e-8)
		tmp = Float64(Float64(Float64(-z) / y) * x_m);
	else
		tmp = Float64(1.0 * x_m);
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if (y <= -5e-41)
		tmp = 1.0 * x_m;
	elseif (y <= 3.4e-8)
		tmp = (-z / y) * x_m;
	else
		tmp = 1.0 * x_m;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[LessEqual[y, -5e-41], N[(1.0 * x$95$m), $MachinePrecision], If[LessEqual[y, 3.4e-8], N[(N[((-z) / y), $MachinePrecision] * x$95$m), $MachinePrecision], N[(1.0 * x$95$m), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < -4.9999999999999996e-41 or 3.4e-8 < y

   1. Initial program 79.4%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in z around 0

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

   7. Applied rewrites 77.4%

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

   if -4.9999999999999996e-41 < y < 3.4e-8

   1. Initial program 95.9%

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

   3. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. lower-*.f64 N/A

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

      5. associate-*r/ N/A

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

      6. lower-/.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 75.5

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

   5. Applied rewrites 75.5%

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

Alternative 6: 96.4% accurate, 1.0× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z) :precision binary64 (* x_s (* (/ (- y z) y) x_m)))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	return x_s * (((y - z) / y) * x_m);
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x_s * (((y - z) / y) * x_m)
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	return x_s * (((y - z) / y) * x_m);
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	return x_s * (((y - z) / y) * x_m)

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	return Float64(x_s * Float64(Float64(Float64(y - z) / y) * x_m))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp = code(x_s, x_m, y, z)
	tmp = x_s * (((y - z) / y) * x_m);
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * N[(N[(N[(y - z), $MachinePrecision] / y), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 86.8%

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

   1. lift-/.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. associate-/l* N/A

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

   4. *-commutative N/A

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

   5. lower-*.f64 N/A

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

   6. lower-/.f64 96.2

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

4. Applied rewrites 96.2%

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

Alternative 7: 50.4% accurate, 3.3× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z) :precision binary64 (* x_s (* 1.0 x_m)))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	return x_s * (1.0 * x_m);
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x_s * (1.0d0 * x_m)
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	return x_s * (1.0 * x_m);
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	return x_s * (1.0 * x_m)

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	return Float64(x_s * Float64(1.0 * x_m))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp = code(x_s, x_m, y, z)
	tmp = x_s * (1.0 * x_m);
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * N[(1.0 * x$95$m), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 86.8%

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

   1. lift-/.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. associate-/l* N/A

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

   4. *-commutative N/A

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

   5. lower-*.f64 N/A

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

   6. lower-/.f64 96.2

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

4. Applied rewrites 96.2%

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

5. Taylor expanded in z around 0

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

7. Applied rewrites 50.6%

   \[\leadsto \color{blue}{1} \cdot x \]
8. Add Preprocessing

Alternative 8: 2.9% accurate, 6.7× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \left(-x\_m\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z) :precision binary64 (* x_s (- x_m)))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	return x_s * -x_m;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x_s * -x_m
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	return x_s * -x_m;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	return x_s * -x_m

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	return Float64(x_s * Float64(-x_m))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp = code(x_s, x_m, y, z)
	tmp = x_s * -x_m;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * (-x$95$m)), $MachinePrecision]

Derivation

1. Initial program 86.8%

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

3. Taylor expanded in z around inf

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

   1. mul-1-neg N/A

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

   2. lower-neg.f64 49.0

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

5. Applied rewrites 49.0%

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

   1. lift-/.f64 N/A

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

   2. clear-num N/A

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

   3. associate-/r/ N/A

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

   4. lift-/.f64 N/A

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

   5. lift-*.f64 N/A

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

   6. associate-*r* N/A

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

   7. lift-/.f64 N/A

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

   8. associate-*l/ N/A

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

   9. *-lft-identity N/A

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

   10. lower-*.f64 N/A

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

   11. lower-/.f64 48.9

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

7. Applied rewrites 48.9%

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

9. Applied rewrites 48.9%

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

10. Taylor expanded in z around 0

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

    1. mul-1-neg N/A

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

    2. lower-neg.f64 2.8

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

12. Applied rewrites 2.8%

    \[\leadsto \color{blue}{-x} \]
13. Add Preprocessing

Developer Target 1: 96.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z < -2.060202331921739 \cdot 10^{+104}:\\ \;\;\;\;x - \frac{z \cdot x}{y}\\ \mathbf{elif}\;z < 1.6939766013828526 \cdot 10^{+213}:\\ \;\;\;\;\frac{x}{\frac{y}{y - z}}\\ \mathbf{else}:\\ \;\;\;\;\left(y - z\right) \cdot \frac{x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (< z -2.060202331921739e+104)
   (- x (/ (* z x) y))
   (if (< z 1.6939766013828526e+213) (/ x (/ y (- y z))) (* (- y z) (/ x y)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z < -2.060202331921739e+104) {
		tmp = x - ((z * x) / y);
	} else if (z < 1.6939766013828526e+213) {
		tmp = x / (y / (y - z));
	} else {
		tmp = (y - z) * (x / y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z < (-2.060202331921739d+104)) then
        tmp = x - ((z * x) / y)
    else if (z < 1.6939766013828526d+213) then
        tmp = x / (y / (y - z))
    else
        tmp = (y - z) * (x / y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z < -2.060202331921739e+104) {
		tmp = x - ((z * x) / y);
	} else if (z < 1.6939766013828526e+213) {
		tmp = x / (y / (y - z));
	} else {
		tmp = (y - z) * (x / y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z < -2.060202331921739e+104:
		tmp = x - ((z * x) / y)
	elif z < 1.6939766013828526e+213:
		tmp = x / (y / (y - z))
	else:
		tmp = (y - z) * (x / y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z < -2.060202331921739e+104)
		tmp = Float64(x - Float64(Float64(z * x) / y));
	elseif (z < 1.6939766013828526e+213)
		tmp = Float64(x / Float64(y / Float64(y - z)));
	else
		tmp = Float64(Float64(y - z) * Float64(x / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z < -2.060202331921739e+104)
		tmp = x - ((z * x) / y);
	elseif (z < 1.6939766013828526e+213)
		tmp = x / (y / (y - z));
	else
		tmp = (y - z) * (x / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Less[z, -2.060202331921739e+104], N[(x - N[(N[(z * x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], If[Less[z, 1.6939766013828526e+213], N[(x / N[(y / N[(y - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y - z), $MachinePrecision] * N[(x / y), $MachinePrecision]), $MachinePrecision]]]

Reproduce

herbie shell --seed 2024235 
(FPCore (x y z)
  :name "Diagrams.Backend.Cairo.Internal:setTexture from diagrams-cairo-1.3.0.3"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< z -206020233192173900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- x (/ (* z x) y)) (if (< z 1693976601382852600000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ x (/ y (- y z))) (* (- y z) (/ x y)))))

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