Diagrams.TwoD.Segment:bezierClip from diagrams-lib-1.3.0.3

Percentage Accurate: 97.8% → 100.0%

Time: 5.7s

Alternatives: 7

Speedup: 1.3×

• 21.5% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 97.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(y, x - z, z\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 97.6%

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

   1. distribute-lft-out-- 97.6%

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

   2. *-rgt-identity 97.6%

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

   3. cancel-sign-sub-inv 97.6%

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

   4. +-commutative 97.6%

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

   5. associate-+r+ 97.6%

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

   6. distribute-rgt-out 100.0%

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

   7. +-commutative 100.0%

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

   8. fma-define 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, \left(-z\right) + x, z\right)} \]

   9. +-commutative 100.0%

      \[\leadsto \mathsf{fma}\left(y, \color{blue}{x + \left(-z\right)}, z\right) \]

   10. unsub-neg 100.0%

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

3. Simplified 100.0%

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

5. Final simplification 100.0%

   \[\leadsto \mathsf{fma}\left(y, x - z, z\right) \]
6. Add Preprocessing

Alternative 2: 62.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \left(-z\right)\\ \mathbf{if}\;y \leq -2.6 \cdot 10^{+215}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq -2.3 \cdot 10^{-33}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 4.5 \cdot 10^{-29}:\\ \;\;\;\;z\\ \mathbf{elif}\;y \leq 2.1 \cdot 10^{+236}:\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* y (- z))))
   (if (<= y -2.6e+215)
     t_0
     (if (<= y -2.3e-33)
       (* y x)
       (if (<= y 4.5e-29) z (if (<= y 2.1e+236) (* y x) t_0))))))

C

double code(double x, double y, double z) {
	double t_0 = y * -z;
	double tmp;
	if (y <= -2.6e+215) {
		tmp = t_0;
	} else if (y <= -2.3e-33) {
		tmp = y * x;
	} else if (y <= 4.5e-29) {
		tmp = z;
	} else if (y <= 2.1e+236) {
		tmp = y * x;
	} else {
		tmp = t_0;
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = y * -z
    if (y <= (-2.6d+215)) then
        tmp = t_0
    else if (y <= (-2.3d-33)) then
        tmp = y * x
    else if (y <= 4.5d-29) then
        tmp = z
    else if (y <= 2.1d+236) then
        tmp = y * x
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = y * -z;
	double tmp;
	if (y <= -2.6e+215) {
		tmp = t_0;
	} else if (y <= -2.3e-33) {
		tmp = y * x;
	} else if (y <= 4.5e-29) {
		tmp = z;
	} else if (y <= 2.1e+236) {
		tmp = y * x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = y * -z
	tmp = 0
	if y <= -2.6e+215:
		tmp = t_0
	elif y <= -2.3e-33:
		tmp = y * x
	elif y <= 4.5e-29:
		tmp = z
	elif y <= 2.1e+236:
		tmp = y * x
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(y * Float64(-z))
	tmp = 0.0
	if (y <= -2.6e+215)
		tmp = t_0;
	elseif (y <= -2.3e-33)
		tmp = Float64(y * x);
	elseif (y <= 4.5e-29)
		tmp = z;
	elseif (y <= 2.1e+236)
		tmp = Float64(y * x);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = y * -z;
	tmp = 0.0;
	if (y <= -2.6e+215)
		tmp = t_0;
	elseif (y <= -2.3e-33)
		tmp = y * x;
	elseif (y <= 4.5e-29)
		tmp = z;
	elseif (y <= 2.1e+236)
		tmp = y * x;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(y * (-z)), $MachinePrecision]}, If[LessEqual[y, -2.6e+215], t$95$0, If[LessEqual[y, -2.3e-33], N[(y * x), $MachinePrecision], If[LessEqual[y, 4.5e-29], z, If[LessEqual[y, 2.1e+236], N[(y * x), $MachinePrecision], t$95$0]]]]]

Derivation

1. Split input into 3 regimes

2. if y < -2.6e215 or 2.10000000000000006e236 < y

   1. Initial program 80.0%

      \[x \cdot y + z \cdot \left(1 - y\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 99.9%

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

      1. mul-1-neg 99.9%

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

      2. sub-neg 99.9%

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

   5. Simplified 99.9%

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

   6. Taylor expanded in x around 0 68.6%

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

      1. associate-*r* 68.6%

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

      2. mul-1-neg 68.6%

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

   8. Simplified 68.6%

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

   if -2.6e215 < y < -2.29999999999999986e-33 or 4.4999999999999998e-29 < y < 2.10000000000000006e236

   1. Initial program 99.1%

      \[x \cdot y + z \cdot \left(1 - y\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 61.5%

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

      1. *-commutative 61.5%

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

   5. Simplified 61.5%

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

   if -2.29999999999999986e-33 < y < 4.4999999999999998e-29

   1. Initial program 100.0%

      \[x \cdot y + z \cdot \left(1 - y\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 75.8%

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

4. Final simplification 68.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.6 \cdot 10^{+215}:\\ \;\;\;\;y \cdot \left(-z\right)\\ \mathbf{elif}\;y \leq -2.3 \cdot 10^{-33}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 4.5 \cdot 10^{-29}:\\ \;\;\;\;z\\ \mathbf{elif}\;y \leq 2.1 \cdot 10^{+236}:\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(-z\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 85.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5.8 \cdot 10^{-34} \lor \neg \left(y \leq 5 \cdot 10^{-29}\right):\\ \;\;\;\;y \cdot \left(x - z\right)\\ \mathbf{else}:\\ \;\;\;\;z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -5.8e-34) (not (<= y 5e-29))) (* y (- x z)) z))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -5.8e-34) || !(y <= 5e-29)) {
		tmp = y * (x - z);
	} else {
		tmp = z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -5.8e-34) or not (y <= 5e-29):
		tmp = y * (x - z)
	else:
		tmp = z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -5.8e-34) || !(y <= 5e-29))
		tmp = Float64(y * Float64(x - z));
	else
		tmp = z;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -5.8e-34) || ~((y <= 5e-29)))
		tmp = y * (x - z);
	else
		tmp = z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -5.8e-34], N[Not[LessEqual[y, 5e-29]], $MachinePrecision]], N[(y * N[(x - z), $MachinePrecision]), $MachinePrecision], z]

Derivation

1. Split input into 2 regimes

2. if y < -5.8000000000000004e-34 or 4.99999999999999986e-29 < y

   1. Initial program 95.6%

      \[x \cdot y + z \cdot \left(1 - y\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 94.9%

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

      1. mul-1-neg 94.9%

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

      2. sub-neg 94.9%

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

   5. Simplified 94.9%

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

   if -5.8000000000000004e-34 < y < 4.99999999999999986e-29

   1. Initial program 100.0%

      \[x \cdot y + z \cdot \left(1 - y\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 75.8%

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

4. Final simplification 86.1%

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

Alternative 4: 99.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;y \cdot \left(x - z\right)\\ \mathbf{else}:\\ \;\;\;\;z + y \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -1.0) (not (<= y 1.0))) (* y (- x z)) (+ z (* y x))))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -1.0) || !(y <= 1.0)) {
		tmp = y * (x - z);
	} else {
		tmp = z + (y * x);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -1.0) or not (y <= 1.0):
		tmp = y * (x - z)
	else:
		tmp = z + (y * x)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -1.0) || !(y <= 1.0))
		tmp = Float64(y * Float64(x - z));
	else
		tmp = Float64(z + Float64(y * x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -1.0) || ~((y <= 1.0)))
		tmp = y * (x - z);
	else
		tmp = z + (y * x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -1.0], N[Not[LessEqual[y, 1.0]], $MachinePrecision]], N[(y * N[(x - z), $MachinePrecision]), $MachinePrecision], N[(z + N[(y * x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1 < y

   1. Initial program 95.1%

      \[x \cdot y + z \cdot \left(1 - y\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 98.7%

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

      1. mul-1-neg 98.7%

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

      2. sub-neg 98.7%

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

   5. Simplified 98.7%

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

   if -1 < y < 1

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

      2. +-lft-identity 100.0%

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

      3. cancel-sign-sub 100.0%

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

      4. cancel-sign-sub 100.0%

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

      5. +-lft-identity 100.0%

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

      6. distribute-lft-out-- 100.0%

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

      7. *-rgt-identity 100.0%

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

      8. associate-+l- 100.0%

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

      9. distribute-rgt-out-- 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in z around 0 98.2%

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

      1. mul-1-neg 98.2%

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

      2. distribute-lft-neg-out 98.2%

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

      3. *-commutative 98.2%

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

   7. Simplified 98.2%

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

      1. sub-neg 98.2%

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

      2. distribute-rgt-neg-out 98.2%

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

      3. remove-double-neg 98.2%

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

      4. +-commutative 98.2%

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

   9. Applied egg-rr 98.2%

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

4. Final simplification 98.4%

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

Alternative 5: 61.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6 \cdot 10^{-34} \lor \neg \left(y \leq 4.3 \cdot 10^{-29}\right):\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -6e-34) (not (<= y 4.3e-29))) (* y x) z))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -6e-34) || !(y <= 4.3e-29)) {
		tmp = y * x;
	} else {
		tmp = 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 <= (-6d-34)) .or. (.not. (y <= 4.3d-29))) then
        tmp = y * x
    else
        tmp = z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -6e-34) || !(y <= 4.3e-29)) {
		tmp = y * x;
	} else {
		tmp = z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -6e-34) or not (y <= 4.3e-29):
		tmp = y * x
	else:
		tmp = z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -6e-34) || !(y <= 4.3e-29))
		tmp = Float64(y * x);
	else
		tmp = z;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -6e-34) || ~((y <= 4.3e-29)))
		tmp = y * x;
	else
		tmp = z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -6e-34], N[Not[LessEqual[y, 4.3e-29]], $MachinePrecision]], N[(y * x), $MachinePrecision], z]

Derivation

1. Split input into 2 regimes

2. if y < -6e-34 or 4.2999999999999998e-29 < y

   1. Initial program 95.6%

      \[x \cdot y + z \cdot \left(1 - y\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 55.6%

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

      1. *-commutative 55.6%

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

   5. Simplified 55.6%

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

   if -6e-34 < y < 4.2999999999999998e-29

   1. Initial program 100.0%

      \[x \cdot y + z \cdot \left(1 - y\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 75.8%

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

4. Final simplification 64.9%

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

Alternative 6: 100.0% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.6%

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

   1. +-commutative 97.6%

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

   2. +-lft-identity 97.6%

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

   3. cancel-sign-sub 97.6%

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

   4. cancel-sign-sub 97.6%

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

   5. +-lft-identity 97.6%

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

   6. distribute-lft-out-- 97.6%

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

   7. *-rgt-identity 97.6%

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

   8. associate-+l- 97.6%

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

   9. distribute-rgt-out-- 100.0%

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

3. Simplified 100.0%

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

5. Final simplification 100.0%

   \[\leadsto z + y \cdot \left(x - z\right) \]
6. Add Preprocessing

Alternative 7: 35.8% accurate, 9.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := z

Derivation

1. Initial program 97.6%

   \[x \cdot y + z \cdot \left(1 - y\right) \]
2. Add Preprocessing

3. Taylor expanded in y around 0 38.0%

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

4. Final simplification 38.0%

   \[\leadsto z \]
5. Add Preprocessing

Developer target: 100.0% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024055 
(FPCore (x y z)
  :name "Diagrams.TwoD.Segment:bezierClip from diagrams-lib-1.3.0.3"
  :precision binary64

  :alt
  (- z (* (- z x) y))

  (+ (* x y) (* z (- 1.0 y))))