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

Percentage Accurate: 90.6% → 92.7%

Time: 1.2s

Alternatives: 3

Speedup: 0.7×

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

Specification

\[\mathsf{TRUE}\left(\right)\]

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (- (* x x) (* (* y 4.0) (- (* z z) t))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 90.6% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (- (* x x) (* (* y 4.0) (- (* z z) t))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 92.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \cdot x \leq 1.35 \cdot 10^{+289}:\\ \;\;\;\;x \cdot x - \left(y \cdot 4\right) \cdot \left(z \cdot z - t\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (* x x) 1.35e+289) (- (* x x) (* (* y 4.0) (- (* z z) t))) (* x x)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x * x) <= 1.35e+289) {
		tmp = (x * x) - ((y * 4.0) * ((z * z) - t));
	} else {
		tmp = x * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x * x) <= 1.35d+289) then
        tmp = (x * x) - ((y * 4.0d0) * ((z * z) - t))
    else
        tmp = x * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x * x) <= 1.35e+289) {
		tmp = (x * x) - ((y * 4.0) * ((z * z) - t));
	} else {
		tmp = x * x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x * x) <= 1.35e+289:
		tmp = (x * x) - ((y * 4.0) * ((z * z) - t))
	else:
		tmp = x * x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x * x) <= 1.35e+289)
		tmp = Float64(Float64(x * x) - Float64(Float64(y * 4.0) * Float64(Float64(z * z) - t)));
	else
		tmp = Float64(x * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x * x) <= 1.35e+289)
		tmp = (x * x) - ((y * 4.0) * ((z * z) - t));
	else
		tmp = x * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x * x), $MachinePrecision], 1.35e+289], N[(N[(x * x), $MachinePrecision] - N[(N[(y * 4.0), $MachinePrecision] * N[(N[(z * z), $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x x) < 1.35e289

   1. Initial program 94.8%

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

   if 1.35e289 < (*.f64 x x)

   1. Initial program 76.0%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 85.5%

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

Alternative 2: 46.9% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \cdot z \leq 6.5 \cdot 10^{+295}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;z \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (* z z) 6.5e+295) (* x x) (* z z)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z * z) <= 6.5e+295) {
		tmp = x * x;
	} else {
		tmp = z * z;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((z * z) <= 6.5d+295) then
        tmp = x * x
    else
        tmp = z * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((z * z) <= 6.5e+295) {
		tmp = x * x;
	} else {
		tmp = z * z;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (z * z) <= 6.5e+295:
		tmp = x * x
	else:
		tmp = z * z
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(z * z) <= 6.5e+295)
		tmp = Float64(x * x);
	else
		tmp = Float64(z * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z * z) <= 6.5e+295)
		tmp = x * x;
	else
		tmp = z * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(z * z), $MachinePrecision], 6.5e+295], N[(x * x), $MachinePrecision], N[(z * z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 6.5000000000000003e295

   1. Initial program 96.3%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 49.7%

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

   if 6.5000000000000003e295 < (*.f64 z z)

   1. Initial program 68.1%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 25.8%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 49.3%

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

Alternative 3: 41.0% accurate, 4.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 89.3%

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

3. Taylor expanded in x around 0

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

5. Applied rewrites 43.7%

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

Developer Target 1: 90.6% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (- (* x x) (* 4.0 (* y (- (* z z) t)))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024321 
(FPCore (x y z t)
  :name "Graphics.Rasterific.Shading:$sradialGradientWithFocusShader from Rasterific-0.6.1, B"
  :precision binary64
  :pre (TRUE)

  :alt
  (! :herbie-platform default (- (* x x) (* 4 (* y (- (* z z) t)))))

  (- (* x x) (* (* y 4.0) (- (* z z) t))))