Diagrams.TwoD.Arc:bezierFromSweepQ1 from diagrams-lib-1.3.0.3

Percentage Accurate: 94.0% → 99.7%

Time: 10.2s

Alternatives: 12

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

double code(double x, double y) {
	return ((1.0 - x) * (3.0 - x)) / (y * 3.0);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = ((1.0d0 - x) * (3.0d0 - x)) / (y * 3.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 94.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	return ((1.0 - x) * (3.0 - x)) / (y * 3.0);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = ((1.0d0 - x) * (3.0d0 - x)) / (y * 3.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left(1 - x\right) \cdot \left(3 - x\right) \leq 10^{+21}:\\ \;\;\;\;\frac{\mathsf{fma}\left(x, \mathsf{fma}\left(0.3333333333333333, x, -1.3333333333333333\right), 1\right)}{y}\\ \mathbf{else}:\\ \;\;\;\;\left(3 - x\right) \cdot \frac{-x}{3 \cdot y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (* (- 1.0 x) (- 3.0 x)) 1e+21)
   (/ (fma x (fma 0.3333333333333333 x -1.3333333333333333) 1.0) y)
   (* (- 3.0 x) (/ (- x) (* 3.0 y)))))

C

double code(double x, double y) {
	double tmp;
	if (((1.0 - x) * (3.0 - x)) <= 1e+21) {
		tmp = fma(x, fma(0.3333333333333333, x, -1.3333333333333333), 1.0) / y;
	} else {
		tmp = (3.0 - x) * (-x / (3.0 * y));
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(Float64(1.0 - x) * Float64(3.0 - x)) <= 1e+21)
		tmp = Float64(fma(x, fma(0.3333333333333333, x, -1.3333333333333333), 1.0) / y);
	else
		tmp = Float64(Float64(3.0 - x) * Float64(Float64(-x) / Float64(3.0 * y)));
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[N[(N[(1.0 - x), $MachinePrecision] * N[(3.0 - x), $MachinePrecision]), $MachinePrecision], 1e+21], N[(N[(x * N[(0.3333333333333333 * x + -1.3333333333333333), $MachinePrecision] + 1.0), $MachinePrecision] / y), $MachinePrecision], N[(N[(3.0 - x), $MachinePrecision] * N[((-x) / N[(3.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 3 binary64) x)) < 1e21

   1. Initial program 99.6%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto \frac{\color{blue}{-4 \cdot x + 3}}{y \cdot 3} \]

      2. lower-fma.f64 94.8

         \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(-4, x, 3\right)}}{y \cdot 3} \]

   5. Applied rewrites 94.8%

      \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(-4, x, 3\right)}}{y \cdot 3} \]
   6. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(-4, x, 3\right)}{y \cdot 3}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(-4, x, 3\right)}{\color{blue}{y \cdot 3}} \]

      3. *-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(-4, x, 3\right)}{\color{blue}{3 \cdot y}} \]

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

      6. div-inv N/A

         \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(-4, x, 3\right) \cdot \frac{1}{3}}}{y} \]

      7. lower-*.f64 N/A

         \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(-4, x, 3\right) \cdot \frac{1}{3}}}{y} \]

      8. metadata-eval N/A

         \[\leadsto \frac{\mathsf{Rewrite=>}\left(lower-fma.f64, \left(\mathsf{fma}\left(x, -4, 3\right)\right)\right) \cdot \color{blue}{\frac{1}{3}}}{y} \]

   7. Applied rewrites 95.2%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, -4, 3\right) \cdot 0.3333333333333333}{y}} \]

   8. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

         \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(x, \frac{1}{3} \cdot x - \frac{4}{3}, 1\right)}}{y} \]

      3. sub-neg N/A

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

      4. metadata-eval N/A

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

      5. lower-fma.f64 100.0

         \[\leadsto \frac{\mathsf{fma}\left(x, \color{blue}{\mathsf{fma}\left(0.3333333333333333, x, -1.3333333333333333\right)}, 1\right)}{y} \]

   10. Applied rewrites 100.0%

       \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(x, \mathsf{fma}\left(0.3333333333333333, x, -1.3333333333333333\right), 1\right)}}{y} \]

   if 1e21 < (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 3 binary64) x))

   1. Initial program 86.3%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. div-inv N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. associate-/l* N/A

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

      8. associate-*l* N/A

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

      9. lower-*.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. metadata-eval 99.7

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

   4. Applied rewrites 99.7%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 99.7

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

      4. lift-*.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. associate-*l/ N/A

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

      7. associate-/l* N/A

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

      8. metadata-eval N/A

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

      9. associate-/r* N/A

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

      10. *-commutative N/A

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

      11. lift-*.f64 N/A

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

      12. un-div-inv N/A

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

      13. lower-/.f64 99.8

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

   6. Applied rewrites 99.8%

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

   7. Taylor expanded in x around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 99.8

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

   9. Applied rewrites 99.8%

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

4. Final simplification 99.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(1 - x\right) \cdot \left(3 - x\right) \leq 10^{+21}:\\ \;\;\;\;\frac{\mathsf{fma}\left(x, \mathsf{fma}\left(0.3333333333333333, x, -1.3333333333333333\right), 1\right)}{y}\\ \mathbf{else}:\\ \;\;\;\;\left(3 - x\right) \cdot \frac{-x}{3 \cdot y}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left(1 - x\right) \cdot \left(3 - x\right) \leq 500000000000:\\ \;\;\;\;\frac{\mathsf{fma}\left(x, \mathsf{fma}\left(0.3333333333333333, x, -1.3333333333333333\right), 1\right)}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y} \cdot \mathsf{fma}\left(x, 0.3333333333333333, -1.3333333333333333\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (* (- 1.0 x) (- 3.0 x)) 500000000000.0)
   (/ (fma x (fma 0.3333333333333333 x -1.3333333333333333) 1.0) y)
   (* (/ x y) (fma x 0.3333333333333333 -1.3333333333333333))))

C

double code(double x, double y) {
	double tmp;
	if (((1.0 - x) * (3.0 - x)) <= 500000000000.0) {
		tmp = fma(x, fma(0.3333333333333333, x, -1.3333333333333333), 1.0) / y;
	} else {
		tmp = (x / y) * fma(x, 0.3333333333333333, -1.3333333333333333);
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(Float64(1.0 - x) * Float64(3.0 - x)) <= 500000000000.0)
		tmp = Float64(fma(x, fma(0.3333333333333333, x, -1.3333333333333333), 1.0) / y);
	else
		tmp = Float64(Float64(x / y) * fma(x, 0.3333333333333333, -1.3333333333333333));
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[N[(N[(1.0 - x), $MachinePrecision] * N[(3.0 - x), $MachinePrecision]), $MachinePrecision], 500000000000.0], N[(N[(x * N[(0.3333333333333333 * x + -1.3333333333333333), $MachinePrecision] + 1.0), $MachinePrecision] / y), $MachinePrecision], N[(N[(x / y), $MachinePrecision] * N[(x * 0.3333333333333333 + -1.3333333333333333), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 3 binary64) x)) < 5e11

   1. Initial program 99.5%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto \frac{\color{blue}{-4 \cdot x + 3}}{y \cdot 3} \]

      2. lower-fma.f64 97.2

         \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(-4, x, 3\right)}}{y \cdot 3} \]

   5. Applied rewrites 97.2%

      \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(-4, x, 3\right)}}{y \cdot 3} \]
   6. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(-4, x, 3\right)}{y \cdot 3}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\mathsf{fma}\left(-4, x, 3\right)}{\color{blue}{y \cdot 3}} \]

      3. *-commutative N/A

         \[\leadsto \frac{\mathsf{fma}\left(-4, x, 3\right)}{\color{blue}{3 \cdot y}} \]

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

      6. div-inv N/A

         \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(-4, x, 3\right) \cdot \frac{1}{3}}}{y} \]

      7. lower-*.f64 N/A

         \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(-4, x, 3\right) \cdot \frac{1}{3}}}{y} \]

      8. metadata-eval N/A

         \[\leadsto \frac{\mathsf{Rewrite=>}\left(lower-fma.f64, \left(\mathsf{fma}\left(x, -4, 3\right)\right)\right) \cdot \color{blue}{\frac{1}{3}}}{y} \]

   7. Applied rewrites 97.6%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, -4, 3\right) \cdot 0.3333333333333333}{y}} \]

   8. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

         \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(x, \frac{1}{3} \cdot x - \frac{4}{3}, 1\right)}}{y} \]

      3. sub-neg N/A

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

      4. metadata-eval N/A

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

      5. lower-fma.f64 100.0

         \[\leadsto \frac{\mathsf{fma}\left(x, \color{blue}{\mathsf{fma}\left(0.3333333333333333, x, -1.3333333333333333\right)}, 1\right)}{y} \]

   10. Applied rewrites 100.0%

       \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(x, \mathsf{fma}\left(0.3333333333333333, x, -1.3333333333333333\right), 1\right)}}{y} \]

   if 5e11 < (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 3 binary64) x))

   1. Initial program 88.1%

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

   3. Taylor expanded in x around inf

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

      1. sub-neg N/A

         \[\leadsto {x}^{2} \cdot \color{blue}{\left(\frac{1}{3} \cdot \frac{1}{y} + \left(\mathsf{neg}\left(\frac{4}{3} \cdot \frac{1}{x \cdot y}\right)\right)\right)} \]

      2. associate-*r/ N/A

         \[\leadsto {x}^{2} \cdot \left(\frac{1}{3} \cdot \frac{1}{y} + \left(\mathsf{neg}\left(\color{blue}{\frac{\frac{4}{3} \cdot 1}{x \cdot y}}\right)\right)\right) \]

      3. metadata-eval N/A

         \[\leadsto {x}^{2} \cdot \left(\frac{1}{3} \cdot \frac{1}{y} + \left(\mathsf{neg}\left(\frac{\color{blue}{\frac{4}{3}}}{x \cdot y}\right)\right)\right) \]

      4. distribute-lft-in N/A

         \[\leadsto \color{blue}{{x}^{2} \cdot \left(\frac{1}{3} \cdot \frac{1}{y}\right) + {x}^{2} \cdot \left(\mathsf{neg}\left(\frac{\frac{4}{3}}{x \cdot y}\right)\right)} \]

      5. associate-*r* N/A

         \[\leadsto \color{blue}{\left({x}^{2} \cdot \frac{1}{3}\right) \cdot \frac{1}{y}} + {x}^{2} \cdot \left(\mathsf{neg}\left(\frac{\frac{4}{3}}{x \cdot y}\right)\right) \]

      6. *-commutative N/A

         \[\leadsto \color{blue}{\left(\frac{1}{3} \cdot {x}^{2}\right)} \cdot \frac{1}{y} + {x}^{2} \cdot \left(\mathsf{neg}\left(\frac{\frac{4}{3}}{x \cdot y}\right)\right) \]

      7. unpow2 N/A

         \[\leadsto \left(\frac{1}{3} \cdot \color{blue}{\left(x \cdot x\right)}\right) \cdot \frac{1}{y} + {x}^{2} \cdot \left(\mathsf{neg}\left(\frac{\frac{4}{3}}{x \cdot y}\right)\right) \]

      8. associate-*r* N/A

         \[\leadsto \color{blue}{\left(\left(\frac{1}{3} \cdot x\right) \cdot x\right)} \cdot \frac{1}{y} + {x}^{2} \cdot \left(\mathsf{neg}\left(\frac{\frac{4}{3}}{x \cdot y}\right)\right) \]

      9. associate-*l* N/A

         \[\leadsto \color{blue}{\left(\frac{1}{3} \cdot x\right) \cdot \left(x \cdot \frac{1}{y}\right)} + {x}^{2} \cdot \left(\mathsf{neg}\left(\frac{\frac{4}{3}}{x \cdot y}\right)\right) \]

      10. associate-*r/ N/A

          \[\leadsto \left(\frac{1}{3} \cdot x\right) \cdot \color{blue}{\frac{x \cdot 1}{y}} + {x}^{2} \cdot \left(\mathsf{neg}\left(\frac{\frac{4}{3}}{x \cdot y}\right)\right) \]

      11. *-rgt-identity N/A

          \[\leadsto \left(\frac{1}{3} \cdot x\right) \cdot \frac{\color{blue}{x}}{y} + {x}^{2} \cdot \left(\mathsf{neg}\left(\frac{\frac{4}{3}}{x \cdot y}\right)\right) \]

      12. distribute-neg-frac N/A

          \[\leadsto \left(\frac{1}{3} \cdot x\right) \cdot \frac{x}{y} + {x}^{2} \cdot \color{blue}{\frac{\mathsf{neg}\left(\frac{4}{3}\right)}{x \cdot y}} \]

      13. metadata-eval N/A

          \[\leadsto \left(\frac{1}{3} \cdot x\right) \cdot \frac{x}{y} + {x}^{2} \cdot \frac{\color{blue}{\frac{-4}{3}}}{x \cdot y} \]

      14. associate-*r/ N/A

          \[\leadsto \left(\frac{1}{3} \cdot x\right) \cdot \frac{x}{y} + \color{blue}{\frac{{x}^{2} \cdot \frac{-4}{3}}{x \cdot y}} \]

      15. times-frac N/A

          \[\leadsto \left(\frac{1}{3} \cdot x\right) \cdot \frac{x}{y} + \color{blue}{\frac{{x}^{2}}{x} \cdot \frac{\frac{-4}{3}}{y}} \]

   5. Applied rewrites 99.5%

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

Developer Target 1: 99.9% accurate, 0.8× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	return ((1.0 - x) / y) * ((3.0 - x) / 3.0);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = ((1.0d0 - x) / y) * ((3.0d0 - x) / 3.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024223 
(FPCore (x y)
  :name "Diagrams.TwoD.Arc:bezierFromSweepQ1 from diagrams-lib-1.3.0.3"
  :precision binary64

  :alt
  (! :herbie-platform default (* (/ (- 1 x) y) (/ (- 3 x) 3)))

  (/ (* (- 1.0 x) (- 3.0 x)) (* y 3.0)))