Diagrams.Backend.Rasterific:$crender from diagrams-rasterific-1.3.1.3

Percentage Accurate: 97.7% → 100.0%

Time: 5.5s

Alternatives: 6

Speedup: 1.7×

• 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 + \left(1 - x\right) \cdot z \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 97.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 98.0%

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

3. Taylor expanded in x around 0

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

   1. +-commutative N/A

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

   2. mul-1-neg N/A

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

   3. remove-double-neg N/A

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

   4. mul-1-neg N/A

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

   5. distribute-neg-in N/A

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

   6. +-commutative N/A

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

   7. accelerator-lowering-fma.f64 N/A

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

   8. +-commutative N/A

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

   9. distribute-neg-in N/A

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

   10. mul-1-neg N/A

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

   11. remove-double-neg N/A

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

   12. unsub-neg N/A

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

   13. --lowering--.f64 100.0

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

5. Simplified 100.0%

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

Alternative 2: 99.1% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -490 or 1 < x

   1. Initial program 96.3%

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

   3. Taylor expanded in x around inf

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

      1. mul-1-neg N/A

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

      2. remove-double-neg N/A

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

      3. mul-1-neg N/A

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

      4. distribute-neg-in N/A

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

      5. +-commutative N/A

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

      6. *-lowering-*.f64 N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. mul-1-neg N/A

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

      10. remove-double-neg N/A

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

      11. unsub-neg N/A

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

      12. --lowering--.f64 98.6

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

   5. Simplified 98.6%

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

   if -490 < x < 1

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

   5. Simplified 98.8%

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

      1. *-commutative N/A

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

      2. accelerator-lowering-fma.f64 98.8

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

   7. Applied egg-rr 98.8%

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

Alternative 3: 75.9% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* x (- z))))
   (if (<= x -10500000000000.0) t_0 (if (<= x 2.5e+185) (fma y x z) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = x * -z;
	double tmp;
	if (x <= -10500000000000.0) {
		tmp = t_0;
	} else if (x <= 2.5e+185) {
		tmp = fma(y, x, z);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(x * Float64(-z))
	tmp = 0.0
	if (x <= -10500000000000.0)
		tmp = t_0;
	elseif (x <= 2.5e+185)
		tmp = fma(y, x, z);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1.05e13 or 2.49999999999999995e185 < x

   1. Initial program 94.3%

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

   3. Taylor expanded in x around inf

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

      1. mul-1-neg N/A

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

      2. remove-double-neg N/A

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

      3. mul-1-neg N/A

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

      4. distribute-neg-in N/A

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

      5. +-commutative N/A

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

      6. *-lowering-*.f64 N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. mul-1-neg N/A

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

      10. remove-double-neg N/A

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

      11. unsub-neg N/A

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

      12. --lowering--.f64 99.9

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

   5. Simplified 99.9%

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

   6. Taylor expanded in y around 0

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

      3. *-lowering-*.f64 N/A

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

      4. mul-1-neg N/A

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

      5. neg-lowering-neg.f64 61.6

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

   8. Simplified 61.6%

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

   if -1.05e13 < x < 2.49999999999999995e185

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

   5. Simplified 86.9%

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

      1. *-commutative N/A

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

      2. accelerator-lowering-fma.f64 86.9

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

   7. Applied egg-rr 86.9%

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

4. Final simplification 78.2%

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

Alternative 4: 60.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -7 \cdot 10^{-5}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \leq 10^{-89}:\\ \;\;\;\;z\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -7e-5) (* x y) (if (<= x 1e-89) z (* x y))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -7e-5) {
		tmp = x * y;
	} else if (x <= 1e-89) {
		tmp = z;
	} else {
		tmp = x * y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= (-7d-5)) then
        tmp = x * y
    else if (x <= 1d-89) then
        tmp = z
    else
        tmp = x * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -7e-5) {
		tmp = x * y;
	} else if (x <= 1e-89) {
		tmp = z;
	} else {
		tmp = x * y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -7e-5:
		tmp = x * y
	elif x <= 1e-89:
		tmp = z
	else:
		tmp = x * y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -7e-5)
		tmp = Float64(x * y);
	elseif (x <= 1e-89)
		tmp = z;
	else
		tmp = Float64(x * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -7e-5)
		tmp = x * y;
	elseif (x <= 1e-89)
		tmp = z;
	else
		tmp = x * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -7e-5], N[(x * y), $MachinePrecision], If[LessEqual[x, 1e-89], z, N[(x * y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -6.9999999999999994e-5 or 1.00000000000000004e-89 < x

   1. Initial program 96.6%

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

   3. Taylor expanded in y around inf

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

      1. *-lowering-*.f64 50.4

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

   5. Simplified 50.4%

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

   if -6.9999999999999994e-5 < x < 1.00000000000000004e-89

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

   5. Simplified 76.6%

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

Alternative 5: 76.2% accurate, 2.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 98.0%

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

3. Taylor expanded in x around 0

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

5. Simplified 72.3%

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

   1. *-commutative N/A

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

   2. accelerator-lowering-fma.f64 72.3

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

7. Applied egg-rr 72.3%

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

Alternative 6: 36.4% accurate, 17.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 98.0%

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

3. Taylor expanded in x around 0

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

5. Simplified 34.9%

   \[\leadsto \color{blue}{z} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2024198 
(FPCore (x y z)
  :name "Diagrams.Backend.Rasterific:$crender from diagrams-rasterific-1.3.1.3"
  :precision binary64
  (+ (* x y) (* (- 1.0 x) z)))