Graphics.Rasterific.CubicBezier:cachedBezierAt from Rasterific-0.6.1

Percentage Accurate: 92.4% → 96.4%

Time: 8.6s

Alternatives: 7

Speedup: 0.5×

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

Specification

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (+ (+ (+ x (* y z)) (* t a)) (* (* a z) b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	return ((x + (y * z)) + (t * a)) + ((a * z) * b);
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((x + (y * z)) + (t * a)) + ((a * z) * b)
end function

Java

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

Python

def code(x, y, z, t, a, b):
	return ((x + (y * z)) + (t * a)) + ((a * z) * b)

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(Float64(x + Float64(y * z)) + Float64(t * a)) + Float64(Float64(a * z) * b))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = ((x + (y * z)) + (t * a)) + ((a * z) * b);
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(x + N[(y * z), $MachinePrecision]), $MachinePrecision] + N[(t * a), $MachinePrecision]), $MachinePrecision] + N[(N[(a * z), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]

Initial Program: 92.4% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (+ (+ (+ x (* y z)) (* t a)) (* (* a z) b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	return ((x + (y * z)) + (t * a)) + ((a * z) * b);
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((x + (y * z)) + (t * a)) + ((a * z) * b)
end function

Java

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

Python

def code(x, y, z, t, a, b):
	return ((x + (y * z)) + (t * a)) + ((a * z) * b)

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(Float64(x + Float64(y * z)) + Float64(t * a)) + Float64(Float64(a * z) * b))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = ((x + (y * z)) + (t * a)) + ((a * z) * b);
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(x + N[(y * z), $MachinePrecision]), $MachinePrecision] + N[(t * a), $MachinePrecision]), $MachinePrecision] + N[(N[(a * z), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]

Alternative 1: 96.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(z \cdot a\right) \cdot b\\ \mathbf{if}\;t\_1 \leq \infty:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;a \cdot \mathsf{fma}\left(b, z, t\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (+ (+ (+ x (* y z)) (* t a)) (* (* z a) b))))
   (if (<= t_1 INFINITY) t_1 (* a (fma b z t)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = ((x + (y * z)) + (t * a)) + ((z * a) * b);
	double tmp;
	if (t_1 <= ((double) INFINITY)) {
		tmp = t_1;
	} else {
		tmp = a * fma(b, z, t);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(Float64(x + Float64(y * z)) + Float64(t * a)) + Float64(Float64(z * a) * b))
	tmp = 0.0
	if (t_1 <= Inf)
		tmp = t_1;
	else
		tmp = Float64(a * fma(b, z, t));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(N[(x + N[(y * z), $MachinePrecision]), $MachinePrecision] + N[(t * a), $MachinePrecision]), $MachinePrecision] + N[(N[(z * a), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, Infinity], t$95$1, N[(a * N[(b * z + t), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (+.f64 (+.f64 x (*.f64 y z)) (*.f64 t a)) (*.f64 (*.f64 a z) b)) < +inf.0

   1. Initial program 97.5%

      \[\left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(a \cdot z\right) \cdot b \]
   2. Add Preprocessing

   if +inf.0 < (+.f64 (+.f64 (+.f64 x (*.f64 y z)) (*.f64 t a)) (*.f64 (*.f64 a z) b))

   1. Initial program 0.0%

      \[\left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(a \cdot z\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

      \[\leadsto \color{blue}{a \cdot \left(t + b \cdot z\right)} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \color{blue}{a \cdot \left(t + b \cdot z\right)} \]

      2. +-commutative N/A

         \[\leadsto a \cdot \color{blue}{\left(b \cdot z + t\right)} \]

      3. lower-fma.f64 84.5

         \[\leadsto a \cdot \color{blue}{\mathsf{fma}\left(b, z, t\right)} \]

   5. Simplified 84.5%

      \[\leadsto \color{blue}{a \cdot \mathsf{fma}\left(b, z, t\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 96.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(z \cdot a\right) \cdot b \leq \infty:\\ \;\;\;\;\left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(z \cdot a\right) \cdot b\\ \mathbf{else}:\\ \;\;\;\;a \cdot \mathsf{fma}\left(b, z, t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 82.3% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := a \cdot \mathsf{fma}\left(b, z, t\right)\\ \mathbf{if}\;a \leq -5.4 \cdot 10^{+30}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \leq 2 \cdot 10^{+91}:\\ \;\;\;\;\mathsf{fma}\left(a, t, \mathsf{fma}\left(z, y, x\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* a (fma b z t))))
   (if (<= a -5.4e+30) t_1 (if (<= a 2e+91) (fma a t (fma z y x)) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = a * fma(b, z, t);
	double tmp;
	if (a <= -5.4e+30) {
		tmp = t_1;
	} else if (a <= 2e+91) {
		tmp = fma(a, t, fma(z, y, x));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(a * fma(b, z, t))
	tmp = 0.0
	if (a <= -5.4e+30)
		tmp = t_1;
	elseif (a <= 2e+91)
		tmp = fma(a, t, fma(z, y, x));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(a * N[(b * z + t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -5.4e+30], t$95$1, If[LessEqual[a, 2e+91], N[(a * t + N[(z * y + x), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if a < -5.3999999999999997e30 or 2.00000000000000016e91 < a

   1. Initial program 77.2%

      \[\left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(a \cdot z\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

      \[\leadsto \color{blue}{a \cdot \left(t + b \cdot z\right)} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \color{blue}{a \cdot \left(t + b \cdot z\right)} \]

      2. +-commutative N/A

         \[\leadsto a \cdot \color{blue}{\left(b \cdot z + t\right)} \]

      3. lower-fma.f64 88.7

         \[\leadsto a \cdot \color{blue}{\mathsf{fma}\left(b, z, t\right)} \]

   5. Simplified 88.7%

      \[\leadsto \color{blue}{a \cdot \mathsf{fma}\left(b, z, t\right)} \]

   if -5.3999999999999997e30 < a < 2.00000000000000016e91

   1. Initial program 98.1%

      \[\left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(a \cdot z\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

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

   5. Simplified 89.9%

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

Alternative 3: 73.4% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := a \cdot \mathsf{fma}\left(b, z, t\right)\\ \mathbf{if}\;a \leq -2.2 \cdot 10^{+26}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \leq 10^{+78}:\\ \;\;\;\;\mathsf{fma}\left(z, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* a (fma b z t))))
   (if (<= a -2.2e+26) t_1 (if (<= a 1e+78) (fma z y x) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = a * fma(b, z, t);
	double tmp;
	if (a <= -2.2e+26) {
		tmp = t_1;
	} else if (a <= 1e+78) {
		tmp = fma(z, y, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(a * fma(b, z, t))
	tmp = 0.0
	if (a <= -2.2e+26)
		tmp = t_1;
	elseif (a <= 1e+78)
		tmp = fma(z, y, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(a * N[(b * z + t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -2.2e+26], t$95$1, If[LessEqual[a, 1e+78], N[(z * y + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if a < -2.20000000000000007e26 or 1.00000000000000001e78 < a

   1. Initial program 78.5%

      \[\left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(a \cdot z\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

      \[\leadsto \color{blue}{a \cdot \left(t + b \cdot z\right)} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \color{blue}{a \cdot \left(t + b \cdot z\right)} \]

      2. +-commutative N/A

         \[\leadsto a \cdot \color{blue}{\left(b \cdot z + t\right)} \]

      3. lower-fma.f64 87.5

         \[\leadsto a \cdot \color{blue}{\mathsf{fma}\left(b, z, t\right)} \]

   5. Simplified 87.5%

      \[\leadsto \color{blue}{a \cdot \mathsf{fma}\left(b, z, t\right)} \]

   if -2.20000000000000007e26 < a < 1.00000000000000001e78

   1. Initial program 98.1%

      \[\left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(a \cdot z\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 75.0

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

   5. Simplified 75.0%

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

Alternative 4: 62.8% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -2.8 \cdot 10^{-152}:\\ \;\;\;\;\mathsf{fma}\left(a, t, x\right)\\ \mathbf{elif}\;a \leq 1.1 \cdot 10^{-37}:\\ \;\;\;\;\mathsf{fma}\left(z, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(a, t, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= a -2.8e-152) (fma a t x) (if (<= a 1.1e-37) (fma z y x) (fma a t x))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (a <= -2.8e-152) {
		tmp = fma(a, t, x);
	} else if (a <= 1.1e-37) {
		tmp = fma(z, y, x);
	} else {
		tmp = fma(a, t, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (a <= -2.8e-152)
		tmp = fma(a, t, x);
	elseif (a <= 1.1e-37)
		tmp = fma(z, y, x);
	else
		tmp = fma(a, t, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[a, -2.8e-152], N[(a * t + x), $MachinePrecision], If[LessEqual[a, 1.1e-37], N[(z * y + x), $MachinePrecision], N[(a * t + x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if a < -2.79999999999999984e-152 or 1.10000000000000001e-37 < a

   1. Initial program 84.4%

      \[\left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(a \cdot z\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

         \[\leadsto \color{blue}{a \cdot t + x} \]

      2. lower-fma.f64 55.4

         \[\leadsto \color{blue}{\mathsf{fma}\left(a, t, x\right)} \]

   5. Simplified 55.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(a, t, x\right)} \]

   if -2.79999999999999984e-152 < a < 1.10000000000000001e-37

   1. Initial program 100.0%

      \[\left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(a \cdot z\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 87.1

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

   5. Simplified 87.1%

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

Alternative 5: 58.9% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4 \cdot 10^{+172}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;y \leq 3.6 \cdot 10^{+108}:\\ \;\;\;\;\mathsf{fma}\left(a, t, x\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= y -4e+172) (* y z) (if (<= y 3.6e+108) (fma a t x) (* y z))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= -4e+172) {
		tmp = y * z;
	} else if (y <= 3.6e+108) {
		tmp = fma(a, t, x);
	} else {
		tmp = y * z;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (y <= -4e+172)
		tmp = Float64(y * z);
	elseif (y <= 3.6e+108)
		tmp = fma(a, t, x);
	else
		tmp = Float64(y * z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[y, -4e+172], N[(y * z), $MachinePrecision], If[LessEqual[y, 3.6e+108], N[(a * t + x), $MachinePrecision], N[(y * z), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -4.0000000000000003e172 or 3.6e108 < y

   1. Initial program 87.1%

      \[\left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(a \cdot z\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 63.0

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

   5. Simplified 63.0%

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

   if -4.0000000000000003e172 < y < 3.6e108

   1. Initial program 91.3%

      \[\left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(a \cdot z\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

         \[\leadsto \color{blue}{a \cdot t + x} \]

      2. lower-fma.f64 60.1

         \[\leadsto \color{blue}{\mathsf{fma}\left(a, t, x\right)} \]

   5. Simplified 60.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(a, t, x\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 60.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -4 \cdot 10^{+172}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;y \leq 3.6 \cdot 10^{+108}:\\ \;\;\;\;\mathsf{fma}\left(a, t, x\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 37.9% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -2.8 \cdot 10^{-152}:\\ \;\;\;\;t \cdot a\\ \mathbf{elif}\;a \leq 1.1 \cdot 10^{-37}:\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;t \cdot a\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= a -2.8e-152) (* t a) (if (<= a 1.1e-37) (* y z) (* t a))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (a <= -2.8e-152) {
		tmp = t * a;
	} else if (a <= 1.1e-37) {
		tmp = y * z;
	} else {
		tmp = t * a;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (a <= (-2.8d-152)) then
        tmp = t * a
    else if (a <= 1.1d-37) then
        tmp = y * z
    else
        tmp = t * a
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (a <= -2.8e-152) {
		tmp = t * a;
	} else if (a <= 1.1e-37) {
		tmp = y * z;
	} else {
		tmp = t * a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if a <= -2.8e-152:
		tmp = t * a
	elif a <= 1.1e-37:
		tmp = y * z
	else:
		tmp = t * a
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (a <= -2.8e-152)
		tmp = Float64(t * a);
	elseif (a <= 1.1e-37)
		tmp = Float64(y * z);
	else
		tmp = Float64(t * a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (a <= -2.8e-152)
		tmp = t * a;
	elseif (a <= 1.1e-37)
		tmp = y * z;
	else
		tmp = t * a;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[a, -2.8e-152], N[(t * a), $MachinePrecision], If[LessEqual[a, 1.1e-37], N[(y * z), $MachinePrecision], N[(t * a), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if a < -2.79999999999999984e-152 or 1.10000000000000001e-37 < a

   1. Initial program 84.4%

      \[\left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(a \cdot z\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

      1. lower-*.f64 41.3

         \[\leadsto \color{blue}{a \cdot t} \]

   5. Simplified 41.3%

      \[\leadsto \color{blue}{a \cdot t} \]

   if -2.79999999999999984e-152 < a < 1.10000000000000001e-37

   1. Initial program 100.0%

      \[\left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(a \cdot z\right) \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 46.0

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

   5. Simplified 46.0%

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

4. Final simplification 43.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -2.8 \cdot 10^{-152}:\\ \;\;\;\;t \cdot a\\ \mathbf{elif}\;a \leq 1.1 \cdot 10^{-37}:\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;t \cdot a\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 28.5% accurate, 5.0× speedup

Math

\[\begin{array}{l} \\ t \cdot a \end{array} \]

FPCore

(FPCore (x y z t a b) :precision binary64 (* t a))

C

double code(double x, double y, double z, double t, double a, double b) {
	return t * a;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = t * a
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return t * a;
}

Python

def code(x, y, z, t, a, b):
	return t * a

Julia

function code(x, y, z, t, a, b)
	return Float64(t * a)
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = t * a;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(t * a), $MachinePrecision]

Derivation

1. Initial program 90.3%

   \[\left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(a \cdot z\right) \cdot b \]
2. Add Preprocessing

3. Taylor expanded in t around inf

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

   1. lower-*.f64 28.1

      \[\leadsto \color{blue}{a \cdot t} \]

5. Simplified 28.1%

   \[\leadsto \color{blue}{a \cdot t} \]

6. Final simplification 28.1%

   \[\leadsto t \cdot a \]
7. Add Preprocessing

Developer Target 1: 97.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := z \cdot \left(b \cdot a + y\right) + \left(x + t \cdot a\right)\\ \mathbf{if}\;z < -11820553527347888000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z < 4.7589743188364287 \cdot 10^{-122}:\\ \;\;\;\;\left(b \cdot z + t\right) \cdot a + \left(z \cdot y + x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (+ (* z (+ (* b a) y)) (+ x (* t a)))))
   (if (< z -11820553527347888000.0)
     t_1
     (if (< z 4.7589743188364287e-122)
       (+ (* (+ (* b z) t) a) (+ (* z y) x))
       t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (z * ((b * a) + y)) + (x + (t * a));
	double tmp;
	if (z < -11820553527347888000.0) {
		tmp = t_1;
	} else if (z < 4.7589743188364287e-122) {
		tmp = (((b * z) + t) * a) + ((z * y) + x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (z * ((b * a) + y)) + (x + (t * a))
    if (z < (-11820553527347888000.0d0)) then
        tmp = t_1
    else if (z < 4.7589743188364287d-122) then
        tmp = (((b * z) + t) * a) + ((z * y) + x)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (z * ((b * a) + y)) + (x + (t * a));
	double tmp;
	if (z < -11820553527347888000.0) {
		tmp = t_1;
	} else if (z < 4.7589743188364287e-122) {
		tmp = (((b * z) + t) * a) + ((z * y) + x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = (z * ((b * a) + y)) + (x + (t * a))
	tmp = 0
	if z < -11820553527347888000.0:
		tmp = t_1
	elif z < 4.7589743188364287e-122:
		tmp = (((b * z) + t) * a) + ((z * y) + x)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(z * Float64(Float64(b * a) + y)) + Float64(x + Float64(t * a)))
	tmp = 0.0
	if (z < -11820553527347888000.0)
		tmp = t_1;
	elseif (z < 4.7589743188364287e-122)
		tmp = Float64(Float64(Float64(Float64(b * z) + t) * a) + Float64(Float64(z * y) + x));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = (z * ((b * a) + y)) + (x + (t * a));
	tmp = 0.0;
	if (z < -11820553527347888000.0)
		tmp = t_1;
	elseif (z < 4.7589743188364287e-122)
		tmp = (((b * z) + t) * a) + ((z * y) + x);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(z * N[(N[(b * a), $MachinePrecision] + y), $MachinePrecision]), $MachinePrecision] + N[(x + N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[z, -11820553527347888000.0], t$95$1, If[Less[z, 4.7589743188364287e-122], N[(N[(N[(N[(b * z), $MachinePrecision] + t), $MachinePrecision] * a), $MachinePrecision] + N[(N[(z * y), $MachinePrecision] + x), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Reproduce

herbie shell --seed 2024212 
(FPCore (x y z t a b)
  :name "Graphics.Rasterific.CubicBezier:cachedBezierAt from Rasterific-0.6.1"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< z -11820553527347888000) (+ (* z (+ (* b a) y)) (+ x (* t a))) (if (< z 47589743188364287/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (+ (* (+ (* b z) t) a) (+ (* z y) x)) (+ (* z (+ (* b a) y)) (+ x (* t a))))))

  (+ (+ (+ x (* y z)) (* t a)) (* (* a z) b)))