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

Percentage Accurate: 84.1% → 96.1%

Time: 6.7s

Alternatives: 7

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.1% 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.1% 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}\;x\_m \leq 2.8 \cdot 10^{-58}:\\ \;\;\;\;\frac{x\_m \cdot \left(y - z\right)}{y}\\ \mathbf{else}:\\ \;\;\;\;x\_m \cdot \left(1 - \frac{z}{y}\right)\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
(FPCore (x_s x_m y z)
 :precision binary64
 (* x_s (if (<= x_m 2.8e-58) (/ (* x_m (- y z)) y) (* x_m (- 1.0 (/ z y))))))

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 <= 2.8e-58) {
		tmp = (x_m * (y - z)) / y;
	} else {
		tmp = x_m * (1.0 - (z / y));
	}
	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 <= 2.8d-58) then
        tmp = (x_m * (y - z)) / y
    else
        tmp = x_m * (1.0d0 - (z / y))
    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 <= 2.8e-58) {
		tmp = (x_m * (y - z)) / y;
	} else {
		tmp = x_m * (1.0 - (z / y));
	}
	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 <= 2.8e-58:
		tmp = (x_m * (y - z)) / y
	else:
		tmp = x_m * (1.0 - (z / y))
	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 <= 2.8e-58)
		tmp = Float64(Float64(x_m * Float64(y - z)) / y);
	else
		tmp = Float64(x_m * Float64(1.0 - Float64(z / y)));
	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 <= 2.8e-58)
		tmp = (x_m * (y - z)) / y;
	else
		tmp = x_m * (1.0 - (z / y));
	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, 2.8e-58], N[(N[(x$95$m * N[(y - z), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], N[(x$95$m * N[(1.0 - N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 2.8000000000000001e-58

   1. Initial program 88.0%

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

   if 2.8000000000000001e-58 < x

   1. Initial program 85.9%

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

      1. *-commutative 85.9%

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

      2. associate-*l/ 100.0%

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

      3. *-commutative 100.0%

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

      4. div-sub 100.0%

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

      5. *-inverses 100.0%

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

   3. Simplified 100.0%

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

4. Final simplification 91.2%

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

Alternative 2: 70.9% accurate, 0.3× 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}\;z \leq -4.8 \cdot 10^{+50} \lor \neg \left(z \leq 5 \cdot 10^{-40} \lor \neg \left(z \leq 4.8 \cdot 10^{+114}\right) \land z \leq 3 \cdot 10^{+168}\right):\\ \;\;\;\;z \cdot \frac{-x\_m}{y}\\ \mathbf{else}:\\ \;\;\;\;x\_m\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
(FPCore (x_s x_m y z)
 :precision binary64
 (*
  x_s
  (if (or (<= z -4.8e+50)
          (not (or (<= z 5e-40) (and (not (<= z 4.8e+114)) (<= z 3e+168)))))
    (* z (/ (- x_m) 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 ((z <= -4.8e+50) || !((z <= 5e-40) || (!(z <= 4.8e+114) && (z <= 3e+168)))) {
		tmp = z * (-x_m / y);
	} else {
		tmp = 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 ((z <= (-4.8d+50)) .or. (.not. (z <= 5d-40) .or. (.not. (z <= 4.8d+114)) .and. (z <= 3d+168))) then
        tmp = z * (-x_m / y)
    else
        tmp = 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 ((z <= -4.8e+50) || !((z <= 5e-40) || (!(z <= 4.8e+114) && (z <= 3e+168)))) {
		tmp = z * (-x_m / y);
	} else {
		tmp = 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 (z <= -4.8e+50) or not ((z <= 5e-40) or (not (z <= 4.8e+114) and (z <= 3e+168))):
		tmp = z * (-x_m / y)
	else:
		tmp = 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 ((z <= -4.8e+50) || !((z <= 5e-40) || (!(z <= 4.8e+114) && (z <= 3e+168))))
		tmp = Float64(z * Float64(Float64(-x_m) / y));
	else
		tmp = 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 ((z <= -4.8e+50) || ~(((z <= 5e-40) || (~((z <= 4.8e+114)) && (z <= 3e+168)))))
		tmp = z * (-x_m / y);
	else
		tmp = 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[Or[LessEqual[z, -4.8e+50], N[Not[Or[LessEqual[z, 5e-40], And[N[Not[LessEqual[z, 4.8e+114]], $MachinePrecision], LessEqual[z, 3e+168]]]], $MachinePrecision]], N[(z * N[((-x$95$m) / y), $MachinePrecision]), $MachinePrecision], x$95$m]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < -4.8000000000000004e50 or 4.99999999999999965e-40 < z < 4.8e114 or 2.9999999999999998e168 < z

   1. Initial program 92.1%

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

      1. *-commutative 92.1%

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

      2. associate-*l/ 90.0%

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

      3. *-commutative 90.0%

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

      4. div-sub 90.0%

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

      5. *-inverses 90.0%

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

   3. Simplified 90.0%

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

   5. Taylor expanded in z around inf 76.6%

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

      1. mul-1-neg 76.6%

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

      2. associate-*l/ 78.4%

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

      3. distribute-rgt-neg-out 78.4%

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

      4. *-commutative 78.4%

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

   7. Simplified 78.4%

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

   if -4.8000000000000004e50 < z < 4.99999999999999965e-40 or 4.8e114 < z < 2.9999999999999998e168

   1. Initial program 83.2%

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

      1. *-commutative 83.2%

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

      2. associate-*l/ 100.0%

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

      3. *-commutative 100.0%

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

      4. div-sub 100.0%

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

      5. *-inverses 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in z around 0 80.1%

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

4. Final simplification 79.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -4.8 \cdot 10^{+50} \lor \neg \left(z \leq 5 \cdot 10^{-40} \lor \neg \left(z \leq 4.8 \cdot 10^{+114}\right) \land z \leq 3 \cdot 10^{+168}\right):\\ \;\;\;\;z \cdot \frac{-x}{y}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 72.9% accurate, 0.4× 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 -1.6 \cdot 10^{-37}:\\ \;\;\;\;x\_m\\ \mathbf{elif}\;y \leq 6 \cdot 10^{-7}:\\ \;\;\;\;\frac{x\_m \cdot \left(-z\right)}{y}\\ \mathbf{else}:\\ \;\;\;\;x\_m\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
(FPCore (x_s x_m y z)
 :precision binary64
 (* x_s (if (<= y -1.6e-37) x_m (if (<= y 6e-7) (/ (* x_m (- 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 (y <= -1.6e-37) {
		tmp = x_m;
	} else if (y <= 6e-7) {
		tmp = (x_m * -z) / y;
	} else {
		tmp = 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 <= (-1.6d-37)) then
        tmp = x_m
    else if (y <= 6d-7) then
        tmp = (x_m * -z) / y
    else
        tmp = 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 <= -1.6e-37) {
		tmp = x_m;
	} else if (y <= 6e-7) {
		tmp = (x_m * -z) / y;
	} else {
		tmp = 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 <= -1.6e-37:
		tmp = x_m
	elif y <= 6e-7:
		tmp = (x_m * -z) / y
	else:
		tmp = 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 <= -1.6e-37)
		tmp = x_m;
	elseif (y <= 6e-7)
		tmp = Float64(Float64(x_m * Float64(-z)) / y);
	else
		tmp = 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 <= -1.6e-37)
		tmp = x_m;
	elseif (y <= 6e-7)
		tmp = (x_m * -z) / y;
	else
		tmp = 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, -1.6e-37], x$95$m, If[LessEqual[y, 6e-7], N[(N[(x$95$m * (-z)), $MachinePrecision] / y), $MachinePrecision], x$95$m]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < -1.5999999999999999e-37 or 5.9999999999999997e-7 < y

   1. Initial program 80.5%

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

      1. *-commutative 80.5%

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

      2. associate-*l/ 99.9%

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

      3. *-commutative 99.9%

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

      4. div-sub 99.9%

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

      5. *-inverses 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in z around 0 78.9%

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

   if -1.5999999999999999e-37 < y < 5.9999999999999997e-7

   1. Initial program 95.4%

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

   3. Taylor expanded in y around 0 79.0%

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

      1. associate-*r* 79.0%

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

      2. neg-mul-1 79.0%

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

      3. *-commutative 79.0%

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

   5. Simplified 79.0%

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

4. Final simplification 79.0%

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

Alternative 4: 95.9% 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}\;z \leq -7.4 \cdot 10^{+118}:\\ \;\;\;\;\left(y - z\right) \cdot \frac{x\_m}{y}\\ \mathbf{else}:\\ \;\;\;\;x\_m \cdot \left(1 - \frac{z}{y}\right)\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
(FPCore (x_s x_m y z)
 :precision binary64
 (* x_s (if (<= z -7.4e+118) (* (- y z) (/ x_m y)) (* x_m (- 1.0 (/ z y))))))

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 (z <= -7.4e+118) {
		tmp = (y - z) * (x_m / y);
	} else {
		tmp = x_m * (1.0 - (z / y));
	}
	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 (z <= (-7.4d+118)) then
        tmp = (y - z) * (x_m / y)
    else
        tmp = x_m * (1.0d0 - (z / y))
    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 (z <= -7.4e+118) {
		tmp = (y - z) * (x_m / y);
	} else {
		tmp = x_m * (1.0 - (z / y));
	}
	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 z <= -7.4e+118:
		tmp = (y - z) * (x_m / y)
	else:
		tmp = x_m * (1.0 - (z / y))
	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 (z <= -7.4e+118)
		tmp = Float64(Float64(y - z) * Float64(x_m / y));
	else
		tmp = Float64(x_m * Float64(1.0 - Float64(z / y)));
	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 (z <= -7.4e+118)
		tmp = (y - z) * (x_m / y);
	else
		tmp = x_m * (1.0 - (z / y));
	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[z, -7.4e+118], N[(N[(y - z), $MachinePrecision] * N[(x$95$m / y), $MachinePrecision]), $MachinePrecision], N[(x$95$m * N[(1.0 - N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < -7.39999999999999973e118

   1. Initial program 92.1%

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

      1. associate-*l/ 94.9%

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

   3. Simplified 94.9%

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

   if -7.39999999999999973e118 < z

   1. Initial program 86.4%

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

      1. *-commutative 86.4%

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

      2. associate-*l/ 97.7%

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

      3. *-commutative 97.7%

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

      4. div-sub 97.7%

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

      5. *-inverses 97.7%

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

   3. Simplified 97.7%

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

4. Final simplification 97.2%

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

Alternative 5: 52.6% accurate, 0.7× 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 4 \cdot 10^{-6}:\\ \;\;\;\;x\_m\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{x\_m}{y}\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
(FPCore (x_s x_m y z)
 :precision binary64
 (* x_s (if (<= x_m 4e-6) x_m (* y (/ x_m y)))))

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 <= 4e-6) {
		tmp = x_m;
	} else {
		tmp = y * (x_m / y);
	}
	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 <= 4d-6) then
        tmp = x_m
    else
        tmp = y * (x_m / y)
    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 <= 4e-6) {
		tmp = x_m;
	} else {
		tmp = y * (x_m / y);
	}
	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 <= 4e-6:
		tmp = x_m
	else:
		tmp = y * (x_m / y)
	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 <= 4e-6)
		tmp = x_m;
	else
		tmp = Float64(y * Float64(x_m / y));
	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 <= 4e-6)
		tmp = x_m;
	else
		tmp = y * (x_m / y);
	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, 4e-6], x$95$m, N[(y * N[(x$95$m / y), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 3.99999999999999982e-6

   1. Initial program 88.6%

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

      1. *-commutative 88.6%

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

      2. associate-*l/ 93.8%

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

      3. *-commutative 93.8%

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

      4. div-sub 93.8%

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

      5. *-inverses 93.8%

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

   3. Simplified 93.8%

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

   5. Taylor expanded in z around 0 53.5%

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

   if 3.99999999999999982e-6 < x

   1. Initial program 83.4%

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

   3. Taylor expanded in y around inf 35.4%

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

      1. associate-/l* 48.6%

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

      2. associate-/r/ 62.0%

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

   5. Applied egg-rr 62.0%

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

4. Final simplification 55.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 4 \cdot 10^{-6}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{x}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 96.2% 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(x\_m \cdot \left(1 - \frac{z}{y}\right)\right) \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
(FPCore (x_s x_m y z) :precision binary64 (* x_s (* x_m (- 1.0 (/ z y)))))

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 * (1.0 - (z / y)));
}

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 * (1.0d0 - (z / y)))
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 * (1.0 - (z / y)));
}

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 * (1.0 - (z / y)))

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 * Float64(1.0 - Float64(z / y))))
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 * (1.0 - (z / y)));
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[(x$95$m * N[(1.0 - N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 87.5%

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

   1. *-commutative 87.5%

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

   2. associate-*l/ 95.2%

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

   3. *-commutative 95.2%

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

   4. div-sub 95.2%

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

   5. *-inverses 95.2%

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

3. Simplified 95.2%

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

5. Final simplification 95.2%

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

Alternative 7: 50.2% accurate, 7.0× speedup

Math

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

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 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 * 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 87.5%

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

   1. *-commutative 87.5%

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

   2. associate-*l/ 95.2%

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

   3. *-commutative 95.2%

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

   4. div-sub 95.2%

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

   5. *-inverses 95.2%

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

3. Simplified 95.2%

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

5. Taylor expanded in z around 0 52.4%

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

6. Final simplification 52.4%

   \[\leadsto x \]
7. Add Preprocessing

Developer target: 96.2% accurate, 0.4× 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 2024029 
(FPCore (x y z)
  :name "Diagrams.Backend.Cairo.Internal:setTexture from diagrams-cairo-1.3.0.3"
  :precision binary64

  :herbie-target
  (if (< z -2.060202331921739e+104) (- x (/ (* z x) y)) (if (< z 1.6939766013828526e+213) (/ x (/ y (- y z))) (* (- y z) (/ x y))))

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