Graphics.Rasterific.Svg.PathConverter:arcToSegments from rasterific-svg-0.2.3.1

Percentage Accurate: 66.8% → 99.7%

Time: 13.5s

Alternatives: 9

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 66.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.7% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 66.4%

   \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
2. Add Preprocessing

4. Applied egg-rr 0

   \[\leadsto expr\]
5. Add Preprocessing

Alternative 2: 88.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z \cdot z}{t \cdot t}\\ \mathbf{if}\;t\_1 \leq 1.95 \cdot 10^{+303}:\\ \;\;\;\;\frac{x}{y} \cdot \frac{x}{y} + t\_1\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{z}{\frac{t}{z}}}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (* z z) (* t t))))
   (if (<= t_1 1.95e+303) (+ (* (/ x y) (/ x y)) t_1) (/ (/ z (/ t z)) t))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (z * z) / (t * t);
	double tmp;
	if (t_1 <= 1.95e+303) {
		tmp = ((x / y) * (x / y)) + t_1;
	} else {
		tmp = (z / (t / z)) / t;
	}
	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) :: t_1
    real(8) :: tmp
    t_1 = (z * z) / (t * t)
    if (t_1 <= 1.95d+303) then
        tmp = ((x / y) * (x / y)) + t_1
    else
        tmp = (z / (t / z)) / t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (z * z) / (t * t);
	double tmp;
	if (t_1 <= 1.95e+303) {
		tmp = ((x / y) * (x / y)) + t_1;
	} else {
		tmp = (z / (t / z)) / t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (z * z) / (t * t)
	tmp = 0
	if t_1 <= 1.95e+303:
		tmp = ((x / y) * (x / y)) + t_1
	else:
		tmp = (z / (t / z)) / t
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(z * z) / Float64(t * t))
	tmp = 0.0
	if (t_1 <= 1.95e+303)
		tmp = Float64(Float64(Float64(x / y) * Float64(x / y)) + t_1);
	else
		tmp = Float64(Float64(z / Float64(t / z)) / t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (z * z) / (t * t);
	tmp = 0.0;
	if (t_1 <= 1.95e+303)
		tmp = ((x / y) * (x / y)) + t_1;
	else
		tmp = (z / (t / z)) / t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(z * z), $MachinePrecision] / N[(t * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 1.95e+303], N[(N[(N[(x / y), $MachinePrecision] * N[(x / y), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision], N[(N[(z / N[(t / z), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 z z) (*.f64 t t)) < 1.95000000000000002e303

   1. Initial program 72.5%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   4. Applied egg-rr 0

      \[\leadsto expr\]

   if 1.95000000000000002e303 < (/.f64 (*.f64 z z) (*.f64 t t))

   1. Initial program 56.5%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 0

      \[\leadsto expr\]

   5. Simplified 0

      \[\leadsto expr\]

   7. Applied egg-rr 0

      \[\leadsto expr\]

   9. Applied egg-rr 0

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

Alternative 3: 79.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{z \cdot z}{t \cdot t} \leq 5 \cdot 10^{+251}:\\ \;\;\;\;\frac{\frac{x}{y}}{\frac{y}{x}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{z}{\frac{t}{z}}}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ (* z z) (* t t)) 5e+251) (/ (/ x y) (/ y x)) (/ (/ z (/ t z)) t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((z * z) / (t * t)) <= 5e+251) {
		tmp = (x / y) / (y / x);
	} else {
		tmp = (z / (t / z)) / t;
	}
	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) / (t * t)) <= 5d+251) then
        tmp = (x / y) / (y / x)
    else
        tmp = (z / (t / z)) / t
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(N[(z * z), $MachinePrecision] / N[(t * t), $MachinePrecision]), $MachinePrecision], 5e+251], N[(N[(x / y), $MachinePrecision] / N[(y / x), $MachinePrecision]), $MachinePrecision], N[(N[(z / N[(t / z), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 z z) (*.f64 t t)) < 5.0000000000000005e251

   1. Initial program 72.1%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 0

      \[\leadsto expr\]

   5. Simplified 0

      \[\leadsto expr\]

   7. Applied egg-rr 0

      \[\leadsto expr\]

   if 5.0000000000000005e251 < (/.f64 (*.f64 z z) (*.f64 t t))

   1. Initial program 57.4%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 0

      \[\leadsto expr\]

   5. Simplified 0

      \[\leadsto expr\]

   7. Applied egg-rr 0

      \[\leadsto expr\]

   9. Applied egg-rr 0

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

Alternative 4: 80.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{z \cdot z}{t \cdot t} \leq 5 \cdot 10^{+251}:\\ \;\;\;\;\frac{\frac{x}{y}}{\frac{y}{x}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{z}{t}}{\frac{t}{z}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ (* z z) (* t t)) 5e+251) (/ (/ x y) (/ y x)) (/ (/ z t) (/ t z))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((z * z) / (t * t)) <= 5e+251) {
		tmp = (x / y) / (y / x);
	} else {
		tmp = (z / t) / (t / 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) / (t * t)) <= 5d+251) then
        tmp = (x / y) / (y / x)
    else
        tmp = (z / t) / (t / 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) / (t * t)) <= 5e+251) {
		tmp = (x / y) / (y / x);
	} else {
		tmp = (z / t) / (t / z);
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(N[(z * z), $MachinePrecision] / N[(t * t), $MachinePrecision]), $MachinePrecision], 5e+251], N[(N[(x / y), $MachinePrecision] / N[(y / x), $MachinePrecision]), $MachinePrecision], N[(N[(z / t), $MachinePrecision] / N[(t / z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 z z) (*.f64 t t)) < 5.0000000000000005e251

   1. Initial program 72.1%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 0

      \[\leadsto expr\]

   5. Simplified 0

      \[\leadsto expr\]

   7. Applied egg-rr 0

      \[\leadsto expr\]

   if 5.0000000000000005e251 < (/.f64 (*.f64 z z) (*.f64 t t))

   1. Initial program 57.4%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 0

      \[\leadsto expr\]

   5. Simplified 0

      \[\leadsto expr\]

   7. Applied egg-rr 0

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

Alternative 5: 80.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{z \cdot z}{t \cdot t} \leq 5 \cdot 10^{+251}:\\ \;\;\;\;\frac{\frac{x}{y}}{\frac{y}{x}}\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{t} \cdot \frac{z}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ (* z z) (* t t)) 5e+251) (/ (/ x y) (/ y x)) (* (/ z t) (/ z t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((z * z) / (t * t)) <= 5e+251) {
		tmp = (x / y) / (y / x);
	} else {
		tmp = (z / t) * (z / t);
	}
	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) / (t * t)) <= 5d+251) then
        tmp = (x / y) / (y / x)
    else
        tmp = (z / t) * (z / t)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(N[(z * z), $MachinePrecision] / N[(t * t), $MachinePrecision]), $MachinePrecision], 5e+251], N[(N[(x / y), $MachinePrecision] / N[(y / x), $MachinePrecision]), $MachinePrecision], N[(N[(z / t), $MachinePrecision] * N[(z / t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 z z) (*.f64 t t)) < 5.0000000000000005e251

   1. Initial program 72.1%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 0

      \[\leadsto expr\]

   5. Simplified 0

      \[\leadsto expr\]

   7. Applied egg-rr 0

      \[\leadsto expr\]

   if 5.0000000000000005e251 < (/.f64 (*.f64 z z) (*.f64 t t))

   1. Initial program 57.4%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 0

      \[\leadsto expr\]

   5. Simplified 0

      \[\leadsto expr\]

   7. Applied egg-rr 0

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

Alternative 6: 80.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{z \cdot z}{t \cdot t} \leq 5 \cdot 10^{+251}:\\ \;\;\;\;\frac{x}{y} \cdot \frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{t} \cdot \frac{z}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ (* z z) (* t t)) 5e+251) (* (/ x y) (/ x y)) (* (/ z t) (/ z t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((z * z) / (t * t)) <= 5e+251) {
		tmp = (x / y) * (x / y);
	} else {
		tmp = (z / t) * (z / t);
	}
	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) / (t * t)) <= 5d+251) then
        tmp = (x / y) * (x / y)
    else
        tmp = (z / t) * (z / t)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(N[(z * z), $MachinePrecision] / N[(t * t), $MachinePrecision]), $MachinePrecision], 5e+251], N[(N[(x / y), $MachinePrecision] * N[(x / y), $MachinePrecision]), $MachinePrecision], N[(N[(z / t), $MachinePrecision] * N[(z / t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 z z) (*.f64 t t)) < 5.0000000000000005e251

   1. Initial program 72.1%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 0

      \[\leadsto expr\]

   5. Simplified 0

      \[\leadsto expr\]

   7. Applied egg-rr 0

      \[\leadsto expr\]

   if 5.0000000000000005e251 < (/.f64 (*.f64 z z) (*.f64 t t))

   1. Initial program 57.4%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 0

      \[\leadsto expr\]

   5. Simplified 0

      \[\leadsto expr\]

   7. Applied egg-rr 0

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

Alternative 7: 96.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 66.4%

   \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
2. Add Preprocessing

4. Applied egg-rr 0

   \[\leadsto expr\]

6. Applied egg-rr 0

   \[\leadsto expr\]
7. Add Preprocessing

Alternative 8: 96.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 66.4%

   \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
2. Add Preprocessing

4. Applied egg-rr 0

   \[\leadsto expr\]

6. Applied egg-rr 0

   \[\leadsto expr\]
7. Add Preprocessing

Alternative 9: 59.3% accurate, 2.1× speedup

Math

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

FPCore

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

C

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

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 / y) * (x / y)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 66.4%

   \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
2. Add Preprocessing

3. Taylor expanded in x around inf 0

   \[\leadsto expr\]

5. Simplified 0

   \[\leadsto expr\]

7. Applied egg-rr 0

   \[\leadsto expr\]
8. Add Preprocessing

Developer target: 99.7% accurate, 0.1× speedup

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (+ (pow (/ x y) 2.0) (pow (/ z t) 2.0)))

C

double code(double x, double y, double z, double t) {
	return pow((x / y), 2.0) + pow((z / t), 2.0);
}

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 / y) ** 2.0d0) + ((z / t) ** 2.0d0)
end function

Java

public static double code(double x, double y, double z, double t) {
	return Math.pow((x / y), 2.0) + Math.pow((z / t), 2.0);
}

Python

def code(x, y, z, t):
	return math.pow((x / y), 2.0) + math.pow((z / t), 2.0)

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024110 
(FPCore (x y z t)
  :name "Graphics.Rasterific.Svg.PathConverter:arcToSegments from rasterific-svg-0.2.3.1"
  :precision binary64

  :alt
  (+ (pow (/ x y) 2.0) (pow (/ z t) 2.0))

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