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

Percentage Accurate: 84.9% → 96.6%

Time: 6.5s

Alternatives: 6

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.9% 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.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x}{\frac{y}{y - z}} \end{array} \]

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 85.6%

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

   1. remove-double-neg 85.6%

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

   2. distribute-frac-neg2 85.6%

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

   3. distribute-frac-neg 85.6%

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

   4. distribute-rgt-neg-in 85.6%

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

   5. associate-/l* 97.3%

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

   6. distribute-frac-neg 97.3%

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

   7. distribute-frac-neg2 97.3%

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

   8. remove-double-neg 97.3%

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

   9. div-sub 97.3%

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

   10. *-inverses 97.3%

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

3. Simplified 97.3%

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

   1. *-inverses 97.3%

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

   2. div-sub 97.3%

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

   3. clear-num 97.2%

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

   4. un-div-inv 97.3%

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

6. Applied egg-rr 97.3%

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

Alternative 2: 73.1% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -2.5e-24) (not (<= z 520000000000.0))) (* z (/ (- x) y)) x))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -2.5e-24) || !(z <= 520000000000.0)) {
		tmp = z * (-x / y);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -2.5e-24) or not (z <= 520000000000.0):
		tmp = z * (-x / y)
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -2.5e-24) || !(z <= 520000000000.0))
		tmp = Float64(z * Float64(Float64(-x) / y));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -2.5e-24) || ~((z <= 520000000000.0)))
		tmp = z * (-x / y);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -2.5e-24], N[Not[LessEqual[z, 520000000000.0]], $MachinePrecision]], N[(z * N[((-x) / y), $MachinePrecision]), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if z < -2.4999999999999999e-24 or 5.2e11 < z

   1. Initial program 88.3%

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

      1. remove-double-neg 88.3%

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

      2. distribute-frac-neg2 88.3%

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

      3. distribute-frac-neg 88.3%

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

      4. distribute-rgt-neg-in 88.3%

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

      5. associate-/l* 94.8%

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

      6. distribute-frac-neg 94.8%

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

      7. distribute-frac-neg2 94.8%

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

      8. remove-double-neg 94.8%

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

      9. div-sub 94.7%

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

      10. *-inverses 94.7%

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

   3. Simplified 94.7%

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

   5. Taylor expanded in z around inf 72.8%

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

      1. mul-1-neg 72.8%

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

      2. distribute-frac-neg2 72.8%

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

      3. *-commutative 72.8%

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

      4. associate-/l* 75.6%

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

   7. Simplified 75.6%

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

   if -2.4999999999999999e-24 < z < 5.2e11

   1. Initial program 82.8%

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

      1. remove-double-neg 82.8%

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

      2. distribute-frac-neg2 82.8%

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

      3. distribute-frac-neg 82.8%

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

      4. distribute-rgt-neg-in 82.8%

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

      5. associate-/l* 100.0%

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

      6. distribute-frac-neg 100.0%

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

      7. distribute-frac-neg2 100.0%

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

      8. remove-double-neg 100.0%

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

      9. div-sub 100.0%

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

      10. *-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 83.2%

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

4. Final simplification 79.3%

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

Alternative 3: 71.4% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -8.2e-24) (not (<= z 230000000000.0))) (* x (/ (- z) y)) x))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -8.2e-24) || !(z <= 230000000000.0)) {
		tmp = x * (-z / y);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -8.2e-24) or not (z <= 230000000000.0):
		tmp = x * (-z / y)
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -8.2e-24) || !(z <= 230000000000.0))
		tmp = Float64(x * Float64(Float64(-z) / y));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -8.2e-24) || ~((z <= 230000000000.0)))
		tmp = x * (-z / y);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -8.2e-24], N[Not[LessEqual[z, 230000000000.0]], $MachinePrecision]], N[(x * N[((-z) / y), $MachinePrecision]), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if z < -8.20000000000000029e-24 or 2.3e11 < z

   1. Initial program 88.3%

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

      1. associate-/l* 94.8%

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

   3. Simplified 94.8%

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

   5. Taylor expanded in y around 0 72.6%

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

      1. neg-mul-1 72.6%

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

   7. Simplified 72.6%

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

   if -8.20000000000000029e-24 < z < 2.3e11

   1. Initial program 82.8%

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

      1. remove-double-neg 82.8%

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

      2. distribute-frac-neg2 82.8%

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

      3. distribute-frac-neg 82.8%

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

      4. distribute-rgt-neg-in 82.8%

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

      5. associate-/l* 100.0%

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

      6. distribute-frac-neg 100.0%

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

      7. distribute-frac-neg2 100.0%

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

      8. remove-double-neg 100.0%

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

      9. div-sub 100.0%

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

      10. *-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 83.2%

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

4. Final simplification 77.8%

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

Alternative 4: 96.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x \cdot \frac{y - z}{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(x * Float64(Float64(y - z) / y))
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 85.6%

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

   1. associate-/l* 97.3%

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

3. Simplified 97.3%

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

Alternative 5: 96.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 85.6%

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

   1. remove-double-neg 85.6%

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

   2. distribute-frac-neg2 85.6%

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

   3. distribute-frac-neg 85.6%

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

   4. distribute-rgt-neg-in 85.6%

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

   5. associate-/l* 97.3%

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

   6. distribute-frac-neg 97.3%

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

   7. distribute-frac-neg2 97.3%

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

   8. remove-double-neg 97.3%

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

   9. div-sub 97.3%

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

   10. *-inverses 97.3%

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

3. Simplified 97.3%

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

Alternative 6: 50.8% accurate, 7.0× speedup

Math

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

FPCore

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

C

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

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
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := x

Derivation

1. Initial program 85.6%

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

   1. remove-double-neg 85.6%

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

   2. distribute-frac-neg2 85.6%

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

   3. distribute-frac-neg 85.6%

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

   4. distribute-rgt-neg-in 85.6%

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

   5. associate-/l* 97.3%

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

   6. distribute-frac-neg 97.3%

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

   7. distribute-frac-neg2 97.3%

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

   8. remove-double-neg 97.3%

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

   9. div-sub 97.3%

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

   10. *-inverses 97.3%

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

3. Simplified 97.3%

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

5. Taylor expanded in z around 0 51.9%

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

Developer Target 1: 96.3% 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 2024170 
(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))