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

Percentage Accurate: 85.1% → 95.8%

Time: 8.0s

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: 85.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: 95.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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 97.6

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

4. Applied rewrites 97.6%

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

6. Applied rewrites 97.6%

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

Alternative 2: 96.1% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (/ (* (- y z) x) y) 5e+301) (- x (/ (* z x) y)) (* (/ x y) (- y z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((((y - z) * x) / y) <= 5e+301) {
		tmp = x - ((z * x) / y);
	} else {
		tmp = (x / y) * (y - z);
	}
	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 ((((y - z) * x) / y) <= 5d+301) then
        tmp = x - ((z * x) / y)
    else
        tmp = (x / y) * (y - z)
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z):
	tmp = 0
	if (((y - z) * x) / y) <= 5e+301:
		tmp = x - ((z * x) / y)
	else:
		tmp = (x / y) * (y - z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(Float64(Float64(y - z) * x) / y) <= 5e+301)
		tmp = Float64(x - Float64(Float64(z * x) / y));
	else
		tmp = Float64(Float64(x / y) * Float64(y - z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((((y - z) * x) / y) <= 5e+301)
		tmp = x - ((z * x) / y);
	else
		tmp = (x / y) * (y - z);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x (-.f64 y z)) y) < 5.0000000000000004e301

   1. Initial program 87.2%

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

   3. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

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

      2. unsub-neg N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 95.0

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

   5. Applied rewrites 95.0%

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

   if 5.0000000000000004e301 < (/.f64 (*.f64 x (-.f64 y z)) y)

   1. Initial program 59.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. *-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 99.8

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

   4. Applied rewrites 99.8%

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

4. Final simplification 95.8%

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

Alternative 3: 50.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\left(y - z\right) \cdot x}{y} \leq -4 \cdot 10^{-243}:\\ \;\;\;\;\frac{-z}{y} \cdot x\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (/ (* (- y z) x) y) -4e-243) (* (/ (- z) y) x) (* 1.0 x)))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((((y - z) * x) / y) <= -4e-243) {
		tmp = (-z / y) * x;
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (((y - z) * x) / y) <= -4e-243:
		tmp = (-z / y) * x
	else:
		tmp = 1.0 * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(Float64(Float64(y - z) * x) / y) <= -4e-243)
		tmp = Float64(Float64(Float64(-z) / y) * x);
	else
		tmp = Float64(1.0 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((((y - z) * x) / y) <= -4e-243)
		tmp = (-z / y) * x;
	else
		tmp = 1.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x (-.f64 y z)) y) < -3.99999999999999998e-243

   1. Initial program 84.8%

      \[\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 50.7

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

   5. Applied rewrites 50.7%

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

   if -3.99999999999999998e-243 < (/.f64 (*.f64 x (-.f64 y z)) y)

   1. Initial program 81.7%

      \[\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 97.9

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

   4. Applied rewrites 97.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 58.8%

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

4. Final simplification 55.5%

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

Alternative 4: 95.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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 97.6

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

4. Applied rewrites 97.6%

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

Alternative 5: 94.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 83.0%

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

3. Taylor expanded in z around 0

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

   1. mul-1-neg N/A

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

   2. unsub-neg N/A

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

   3. lower--.f64 N/A

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

   4. lower-/.f64 N/A

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

   5. *-commutative N/A

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

   6. lower-*.f64 94.3

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

5. Applied rewrites 94.3%

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

Alternative 6: 49.8% accurate, 3.3× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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 97.6

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

4. Applied rewrites 97.6%

   \[\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 54.4%

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

Developer Target 1: 95.9% 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 2024240 
(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))