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

Percentage Accurate: 97.8% → 100.0%

Time: 2.8s

Alternatives: 6

Speedup: 1.7×

• 20.8% 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, 1.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 96.9%

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

3. Taylor expanded in x around 0

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

   1. +-commutative N/A

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

   2. distribute-rgt-out-- N/A

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

   3. unsub-neg N/A

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

   4. *-lft-identity N/A

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

   5. mul-1-neg N/A

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

   6. +-commutative N/A

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

   7. +-commutative N/A

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

   8. mul-1-neg N/A

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

   9. unsub-neg N/A

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

   10. associate-+l- N/A

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

   11. *-commutative N/A

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

   12. distribute-lft-out-- N/A

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

   13. unsub-neg N/A

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

   14. mul-1-neg N/A

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

   15. sub-neg N/A

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

   16. mul-1-neg N/A

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

   17. +-commutative N/A

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

   18. mul-1-neg N/A

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

   19. *-commutative N/A

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

   20. distribute-lft-neg-in N/A

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

   21. lower-fma.f64 N/A

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

5. Applied rewrites 100.0%

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

Alternative 2: 84.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(x - z\right) \cdot y\\ \mathbf{if}\;y \leq -0.35:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 420000000:\\ \;\;\;\;\mathsf{fma}\left(-z, y, z\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (- x z) y)))
   (if (<= y -0.35) t_0 (if (<= y 420000000.0) (fma (- z) y z) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (x - z) * y;
	double tmp;
	if (y <= -0.35) {
		tmp = t_0;
	} else if (y <= 420000000.0) {
		tmp = fma(-z, y, z);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(x - z) * y)
	tmp = 0.0
	if (y <= -0.35)
		tmp = t_0;
	elseif (y <= 420000000.0)
		tmp = fma(Float64(-z), y, z);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(x - z), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[y, -0.35], t$95$0, If[LessEqual[y, 420000000.0], N[((-z) * y + z), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -0.34999999999999998 or 4.2e8 < y

   1. Initial program 92.8%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. remove-double-neg N/A

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

      3. mul-1-neg N/A

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

      4. mul-1-neg N/A

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

      5. distribute-neg-in N/A

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

      6. +-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. +-commutative N/A

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

      9. distribute-neg-in N/A

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

      10. mul-1-neg N/A

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

      11. remove-double-neg N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if -0.34999999999999998 < y < 4.2e8

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 71.3

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

   5. Applied rewrites 71.3%

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

   7. Applied rewrites 71.3%

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

Alternative 3: 84.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(x - z\right) \cdot y\\ \mathbf{if}\;y \leq -0.35:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 420000000:\\ \;\;\;\;\left(1 - y\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (- x z) y)))
   (if (<= y -0.35) t_0 (if (<= y 420000000.0) (* (- 1.0 y) z) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (x - z) * y;
	double tmp;
	if (y <= -0.35) {
		tmp = t_0;
	} else if (y <= 420000000.0) {
		tmp = (1.0 - y) * z;
	} 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 = (x - z) * y
    if (y <= (-0.35d0)) then
        tmp = t_0
    else if (y <= 420000000.0d0) then
        tmp = (1.0d0 - y) * z
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (x - z) * y;
	double tmp;
	if (y <= -0.35) {
		tmp = t_0;
	} else if (y <= 420000000.0) {
		tmp = (1.0 - y) * z;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (x - z) * y
	tmp = 0
	if y <= -0.35:
		tmp = t_0
	elif y <= 420000000.0:
		tmp = (1.0 - y) * z
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(x - z) * y)
	tmp = 0.0
	if (y <= -0.35)
		tmp = t_0;
	elseif (y <= 420000000.0)
		tmp = Float64(Float64(1.0 - y) * z);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (x - z) * y;
	tmp = 0.0;
	if (y <= -0.35)
		tmp = t_0;
	elseif (y <= 420000000.0)
		tmp = (1.0 - y) * z;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(x - z), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[y, -0.35], t$95$0, If[LessEqual[y, 420000000.0], N[(N[(1.0 - y), $MachinePrecision] * z), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -0.34999999999999998 or 4.2e8 < y

   1. Initial program 92.8%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. remove-double-neg N/A

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

      3. mul-1-neg N/A

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

      4. mul-1-neg N/A

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

      5. distribute-neg-in N/A

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

      6. +-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. +-commutative N/A

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

      9. distribute-neg-in N/A

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

      10. mul-1-neg N/A

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

      11. remove-double-neg N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if -0.34999999999999998 < y < 4.2e8

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 71.3

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

   5. Applied rewrites 71.3%

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

Alternative 4: 60.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(-z\right) \cdot y\\ \mathbf{if}\;y \leq -33000000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;1 \cdot z\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (- z) y)))
   (if (<= y -33000000.0) t_0 (if (<= y 1.0) (* 1.0 z) t_0))))

C

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

Java

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

Python

def code(x, y, z):
	t_0 = -z * y
	tmp = 0
	if y <= -33000000.0:
		tmp = t_0
	elif y <= 1.0:
		tmp = 1.0 * z
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(-z) * y)
	tmp = 0.0
	if (y <= -33000000.0)
		tmp = t_0;
	elseif (y <= 1.0)
		tmp = Float64(1.0 * z);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = -z * y;
	tmp = 0.0;
	if (y <= -33000000.0)
		tmp = t_0;
	elseif (y <= 1.0)
		tmp = 1.0 * z;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[((-z) * y), $MachinePrecision]}, If[LessEqual[y, -33000000.0], t$95$0, If[LessEqual[y, 1.0], N[(1.0 * z), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -3.3e7 or 1 < y

   1. Initial program 92.9%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. remove-double-neg N/A

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

      3. mul-1-neg N/A

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

      4. mul-1-neg N/A

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

      5. distribute-neg-in N/A

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

      6. +-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. +-commutative N/A

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

      9. distribute-neg-in N/A

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

      10. mul-1-neg N/A

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

      11. remove-double-neg N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 98.6

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

   5. Applied rewrites 98.6%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 43.6%

      \[\leadsto \left(-z\right) \cdot y \]

   if -3.3e7 < y < 1

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 70.7

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

   5. Applied rewrites 70.7%

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

   6. Taylor expanded in y around 0

      \[\leadsto 1 \cdot z \]
   7. Step-by-step derivation

   8. Applied rewrites 69.1%

      \[\leadsto 1 \cdot z \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 61.3% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 96.9%

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

3. Taylor expanded in x around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower--.f64 59.1

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

5. Applied rewrites 59.1%

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

Alternative 6: 36.1% accurate, 2.8× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 96.9%

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

3. Taylor expanded in x around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower--.f64 59.1

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

5. Applied rewrites 59.1%

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

6. Taylor expanded in y around 0

   \[\leadsto 1 \cdot z \]
7. Step-by-step derivation

8. Applied rewrites 39.9%

   \[\leadsto 1 \cdot z \]
9. Add Preprocessing

Developer Target 1: 100.0% accurate, 1.4× 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 2024304 
(FPCore (x y z)
  :name "Diagrams.TwoD.Segment:bezierClip from diagrams-lib-1.3.0.3"
  :precision binary64

  :alt
  (! :herbie-platform default (- z (* (- z x) y)))

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