Graphics.Rasterific.Shading:$sradialGradientWithFocusShader from Rasterific-0.6.1

Percentage Accurate: 100.0% → 100.0%

Time: 2.5s

Alternatives: 3

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[x - y \cdot y \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 87.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \cdot y \leq 1.8 \cdot 10^{+23}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(-y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= (* y y) 1.8e+23) x (* y (- y))))

C

double code(double x, double y) {
	double tmp;
	if ((y * y) <= 1.8e+23) {
		tmp = x;
	} else {
		tmp = y * -y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y * y) <= 1.8d+23) then
        tmp = x
    else
        tmp = y * -y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y * y) <= 1.8e+23) {
		tmp = x;
	} else {
		tmp = y * -y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y * y) <= 1.8e+23:
		tmp = x
	else:
		tmp = y * -y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(y * y) <= 1.8e+23)
		tmp = x;
	else
		tmp = Float64(y * Float64(-y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y * y) <= 1.8e+23)
		tmp = x;
	else
		tmp = y * -y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 1.8e+23], x, N[(y * (-y)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y y) < 1.7999999999999999e23

   1. Initial program 100.0%

      \[x - y \cdot y \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Simplified 89.7%

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

   if 1.7999999999999999e23 < (*.f64 y y)

   1. Initial program 100.0%

      \[x - y \cdot y \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left({y}^{2}\right)} \]

      2. neg-lowering-neg.f64 N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left({y}^{2}\right)} \]

      3. unpow2 N/A

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

      4. *-lowering-*.f64 88.8

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

   5. Simplified 88.8%

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

4. Final simplification 89.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot y \leq 1.8 \cdot 10^{+23}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(-y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 52.0% accurate, 9.0× speedup

Math

\[\begin{array}{l} \\ x \end{array} \]

FPCore

(FPCore (x y) :precision binary64 x)

C

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x
end function

Java

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

Python

def code(x, y):
	return x

Julia

function code(x, y)
	return x
end

MATLAB

function tmp = code(x, y)
	tmp = x;
end

Wolfram

code[x_, y_] := x

Derivation

1. Initial program 100.0%

   \[x - y \cdot y \]
2. Add Preprocessing

3. Taylor expanded in x around inf

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

5. Simplified 52.4%

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

Reproduce

herbie shell --seed 2024199 
(FPCore (x y)
  :name "Graphics.Rasterific.Shading:$sradialGradientWithFocusShader from Rasterific-0.6.1"
  :precision binary64
  (- x (* y y)))