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

Percentage Accurate: 97.8% → 100.0%

Time: 4.7s

Alternatives: 5

Speedup: 1.7×

• 21.1% 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.8% 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(y - z, x, z\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.2%

   \[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 z + x \cdot \color{blue}{\left(-1 \cdot z + y\right)} \]

   2. distribute-lft-in N/A

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

   3. mul-1-neg N/A

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

   4. distribute-rgt-neg-in N/A

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

   5. mul-1-neg N/A

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

   6. associate-+r+ N/A

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

   7. mul-1-neg N/A

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

   8. unsub-neg N/A

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

   9. associate-+l- N/A

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

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

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

   11. unsub-neg N/A

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

   12. mul-1-neg N/A

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

   13. sub-neg N/A

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

   14. mul-1-neg N/A

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

   15. +-commutative N/A

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

   16. mul-1-neg N/A

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

   17. *-commutative N/A

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

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

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

   19. lower-fma.f64 N/A

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

5. Applied rewrites 100.0%

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

Alternative 2: 84.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(y - z\right) \cdot x\\ \mathbf{if}\;x \leq -4.6 \cdot 10^{-18}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 6.8 \cdot 10^{-91}:\\ \;\;\;\;1 \cdot z\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (- y z) x)))
   (if (<= x -4.6e-18) t_0 (if (<= x 6.8e-91) (* 1.0 z) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (y - z) * x;
	double tmp;
	if (x <= -4.6e-18) {
		tmp = t_0;
	} else if (x <= 6.8e-91) {
		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 = (y - z) * x
    if (x <= (-4.6d-18)) then
        tmp = t_0
    else if (x <= 6.8d-91) 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 = (y - z) * x;
	double tmp;
	if (x <= -4.6e-18) {
		tmp = t_0;
	} else if (x <= 6.8e-91) {
		tmp = 1.0 * z;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (y - z) * x
	tmp = 0
	if x <= -4.6e-18:
		tmp = t_0
	elif x <= 6.8e-91:
		tmp = 1.0 * z
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(y - z) * x)
	tmp = 0.0
	if (x <= -4.6e-18)
		tmp = t_0;
	elseif (x <= 6.8e-91)
		tmp = Float64(1.0 * z);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (y - z) * x;
	tmp = 0.0;
	if (x <= -4.6e-18)
		tmp = t_0;
	elseif (x <= 6.8e-91)
		tmp = 1.0 * z;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -4.6000000000000002e-18 or 6.80000000000000053e-91 < x

   1. Initial program 98.6%

      \[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. *-commutative N/A

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

      2. remove-double-neg N/A

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

      3. mul-1-neg N/A

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

      4. mul-1-neg N/A

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

      5. distribute-neg-in N/A

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

      6. +-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. +-commutative N/A

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

      9. distribute-neg-in N/A

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

      10. mul-1-neg N/A

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

      11. remove-double-neg N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 94.1

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

   5. Applied rewrites 94.1%

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

   if -4.6000000000000002e-18 < x < 6.80000000000000053e-91

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 76.2

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

   5. Applied rewrites 76.2%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 76.2%

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

Alternative 3: 60.8% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

function code(x, y, z)
	t_0 = Float64(Float64(-z) * x)
	tmp = 0.0
	if (x <= -0.37)
		tmp = t_0;
	elseif (x <= 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 * x;
	tmp = 0.0;
	if (x <= -0.37)
		tmp = t_0;
	elseif (x <= 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) * x), $MachinePrecision]}, If[LessEqual[x, -0.37], t$95$0, If[LessEqual[x, 1.0], N[(1.0 * z), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < -0.37 or 1 < x

   1. Initial program 98.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. *-commutative N/A

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

      2. remove-double-neg N/A

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

      3. mul-1-neg N/A

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

      4. mul-1-neg N/A

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

      5. distribute-neg-in N/A

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

      6. +-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. +-commutative N/A

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

      9. distribute-neg-in N/A

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

      10. mul-1-neg N/A

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

      11. remove-double-neg N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 98.9

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

   5. Applied rewrites 98.9%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 43.5%

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

   if -0.37 < x < 1

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 67.7

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

   5. Applied rewrites 67.7%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 66.9%

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

Alternative 4: 61.8% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.2%

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

3. Taylor expanded in y around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower--.f64 56.8

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

5. Applied rewrites 56.8%

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

Alternative 5: 36.6% 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 99.2%

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

3. Taylor expanded in y around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower--.f64 56.8

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

5. Applied rewrites 56.8%

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

6. Taylor expanded in x around 0

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

8. Applied rewrites 36.6%

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

Reproduce

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