Diagrams.Backend.Rasterific:rasterificRadialGradient from diagrams-rasterific-1.3.1.3

Percentage Accurate: 88.2% → 100.0%

Time: 10.1s

Alternatives: 6

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 88.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 86.7%

   \[\frac{x + y \cdot \left(z - x\right)}{z} \]

3. Simplified 0

   \[\leadsto expr\]
4. Add Preprocessing
5. Add Preprocessing

Alternative 2: 99.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2020:\\ \;\;\;\;y - \frac{y}{\frac{z}{x}}\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;y + \frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(1 - \frac{x}{z}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -2020.0)
   (- y (/ y (/ z x)))
   (if (<= y 1.0) (+ y (/ x z)) (* y (- 1.0 (/ x z))))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -2020.0) {
		tmp = y - (y / (z / x));
	} else if (y <= 1.0) {
		tmp = y + (x / z);
	} else {
		tmp = y * (1.0 - (x / z));
	}
	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 (y <= (-2020.0d0)) then
        tmp = y - (y / (z / x))
    else if (y <= 1.0d0) then
        tmp = y + (x / z)
    else
        tmp = y * (1.0d0 - (x / z))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -2020.0) {
		tmp = y - (y / (z / x));
	} else if (y <= 1.0) {
		tmp = y + (x / z);
	} else {
		tmp = y * (1.0 - (x / z));
	}
	return tmp;
}

Python

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

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -2020.0)
		tmp = Float64(y - Float64(y / Float64(z / x)));
	elseif (y <= 1.0)
		tmp = Float64(y + Float64(x / z));
	else
		tmp = Float64(y * Float64(1.0 - Float64(x / z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -2020.0)
		tmp = y - (y / (z / x));
	elseif (y <= 1.0)
		tmp = y + (x / z);
	else
		tmp = y * (1.0 - (x / z));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -2020

   1. Initial program 78.5%

      \[\frac{x + y \cdot \left(z - x\right)}{z} \]

   3. Simplified 0

      \[\leadsto expr\]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 0

      \[\leadsto expr\]

   7. Simplified 0

      \[\leadsto expr\]

   9. Applied egg-rr 0

      \[\leadsto expr\]

   11. Applied egg-rr 0

       \[\leadsto expr\]

   if -2020 < y < 1

   1. Initial program 99.2%

      \[\frac{x + y \cdot \left(z - x\right)}{z} \]

   3. Simplified 0

      \[\leadsto expr\]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 0

      \[\leadsto expr\]

   7. Simplified 0

      \[\leadsto expr\]

   if 1 < y

   1. Initial program 72.4%

      \[\frac{x + y \cdot \left(z - x\right)}{z} \]

   3. Simplified 0

      \[\leadsto expr\]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 0

      \[\leadsto expr\]

   7. Simplified 0

      \[\leadsto expr\]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 99.2% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = y * (1.0 - (x / z));
	tmp = 0.0;
	if (y <= -2020.0)
		tmp = t_0;
	elseif (y <= 1.0)
		tmp = y + (x / z);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -2020 or 1 < y

   1. Initial program 75.4%

      \[\frac{x + y \cdot \left(z - x\right)}{z} \]

   3. Simplified 0

      \[\leadsto expr\]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 0

      \[\leadsto expr\]

   7. Simplified 0

      \[\leadsto expr\]

   if -2020 < y < 1

   1. Initial program 99.2%

      \[\frac{x + y \cdot \left(z - x\right)}{z} \]

   3. Simplified 0

      \[\leadsto expr\]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 0

      \[\leadsto expr\]

   7. Simplified 0

      \[\leadsto expr\]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 60.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.45 \cdot 10^{-39}:\\ \;\;\;\;y\\ \mathbf{elif}\;y \leq 1.5 \cdot 10^{-11}:\\ \;\;\;\;\frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -1.45e-39) y (if (<= y 1.5e-11) (/ x z) y)))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.45e-39) {
		tmp = y;
	} else if (y <= 1.5e-11) {
		tmp = x / z;
	} else {
		tmp = 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 (y <= (-1.45d-39)) then
        tmp = y
    else if (y <= 1.5d-11) then
        tmp = x / z
    else
        tmp = y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.45e-39) {
		tmp = y;
	} else if (y <= 1.5e-11) {
		tmp = x / z;
	} else {
		tmp = y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -1.45e-39:
		tmp = y
	elif y <= 1.5e-11:
		tmp = x / z
	else:
		tmp = y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -1.45e-39)
		tmp = y;
	elseif (y <= 1.5e-11)
		tmp = Float64(x / z);
	else
		tmp = y;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -1.45e-39)
		tmp = y;
	elseif (y <= 1.5e-11)
		tmp = x / z;
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -1.45e-39], y, If[LessEqual[y, 1.5e-11], N[(x / z), $MachinePrecision], y]]

Derivation

1. Split input into 2 regimes

2. if y < -1.44999999999999994e-39 or 1.5e-11 < y

   1. Initial program 76.1%

      \[\frac{x + y \cdot \left(z - x\right)}{z} \]

   3. Simplified 0

      \[\leadsto expr\]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 0

      \[\leadsto expr\]

   7. Simplified 0

      \[\leadsto expr\]

   if -1.44999999999999994e-39 < y < 1.5e-11

   1. Initial program 100.0%

      \[\frac{x + y \cdot \left(z - x\right)}{z} \]

   3. Simplified 0

      \[\leadsto expr\]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 0

      \[\leadsto expr\]

   7. Simplified 0

      \[\leadsto expr\]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 78.0% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ y + \frac{x}{z} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (+ y (/ x z)))

C

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

Java

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

Python

def code(x, y, z):
	return y + (x / z)

Julia

function code(x, y, z)
	return Float64(y + Float64(x / z))
end

MATLAB

function tmp = code(x, y, z)
	tmp = y + (x / z);
end

Wolfram

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

Derivation

1. Initial program 86.7%

   \[\frac{x + y \cdot \left(z - x\right)}{z} \]

3. Simplified 0

   \[\leadsto expr\]
4. Add Preprocessing

5. Taylor expanded in y around 0 0

   \[\leadsto expr\]

7. Simplified 0

   \[\leadsto expr\]
8. Add Preprocessing

Alternative 6: 40.4% accurate, 9.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := y

Derivation

1. Initial program 86.7%

   \[\frac{x + y \cdot \left(z - x\right)}{z} \]

3. Simplified 0

   \[\leadsto expr\]
4. Add Preprocessing

5. Taylor expanded in x around 0 0

   \[\leadsto expr\]

7. Simplified 0

   \[\leadsto expr\]
8. Add Preprocessing

Developer target: 93.7% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (- (+ y (/ x z)) (/ y (/ z x))))

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (y + (x / z)) - (y / (z / x))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024110 
(FPCore (x y z)
  :name "Diagrams.Backend.Rasterific:rasterificRadialGradient from diagrams-rasterific-1.3.1.3"
  :precision binary64

  :alt
  (- (+ y (/ x z)) (/ y (/ z x)))

  (/ (+ x (* y (- z x))) z))