Text.Parsec.Token:makeTokenParser from parsec-3.1.9, A

Percentage Accurate: 100.0% → 100.0%

Time: 5.1s

Alternatives: 5

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\frac{x + y}{10} \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 62.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -8 \cdot 10^{-95}:\\ \;\;\;\;\frac{x}{10}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{10}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= x -8e-95) (/ x 10.0) (/ y 10.0)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -8e-95) {
		tmp = x / 10.0;
	} else {
		tmp = y / 10.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-8d-95)) then
        tmp = x / 10.0d0
    else
        tmp = y / 10.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -8e-95) {
		tmp = x / 10.0;
	} else {
		tmp = y / 10.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -8e-95:
		tmp = x / 10.0
	else:
		tmp = y / 10.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -8e-95)
		tmp = Float64(x / 10.0);
	else
		tmp = Float64(y / 10.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -8e-95)
		tmp = x / 10.0;
	else
		tmp = y / 10.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -8e-95], N[(x / 10.0), $MachinePrecision], N[(y / 10.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -7.99999999999999992e-95

   1. Initial program 100.0%

      \[\frac{x + y}{10} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \mathsf{/.f64}\left(\color{blue}{x}, 10\right) \]
   4. Step-by-step derivation

   5. Simplified 67.6%

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

   if -7.99999999999999992e-95 < x

   1. Initial program 100.0%

      \[\frac{x + y}{10} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \mathsf{/.f64}\left(\color{blue}{y}, 10\right) \]
   4. Step-by-step derivation

   5. Simplified 63.2%

      \[\leadsto \frac{\color{blue}{y}}{10} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 99.4% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (* (+ x y) 0.1))

C

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x + y) * 0.1d0
end function

Java

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

Python

def code(x, y):
	return (x + y) * 0.1

Julia

function code(x, y)
	return Float64(Float64(x + y) * 0.1)
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\frac{x + y}{10} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. div-inv N/A

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

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

      \[\leadsto \mathsf{*.f64}\left(\left(x + y\right), \color{blue}{\left(\frac{1}{10}\right)}\right) \]

   3. +-lowering-+.f64 N/A

      \[\leadsto \mathsf{*.f64}\left(\mathsf{+.f64}\left(x, y\right), \left(\frac{\color{blue}{1}}{10}\right)\right) \]

   4. metadata-eval 99.4%

      \[\leadsto \mathsf{*.f64}\left(\mathsf{+.f64}\left(x, y\right), \frac{1}{10}\right) \]

4. Applied egg-rr 99.4%

   \[\leadsto \color{blue}{\left(x + y\right) \cdot 0.1} \]
5. Add Preprocessing

Alternative 4: 49.9% accurate, 1.7× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (/ x 10.0))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return x / 10.0

Julia

function code(x, y)
	return Float64(x / 10.0)
end

MATLAB

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

Wolfram

code[x_, y_] := N[(x / 10.0), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\frac{x + y}{10} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

   \[\leadsto \mathsf{/.f64}\left(\color{blue}{x}, 10\right) \]
4. Step-by-step derivation

5. Simplified 47.8%

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

Alternative 5: 49.6% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\frac{x + y}{10} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

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

   1. *-lowering-*.f64 47.6%

      \[\leadsto \mathsf{*.f64}\left(\frac{1}{10}, \color{blue}{x}\right) \]

5. Simplified 47.6%

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

6. Final simplification 47.6%

   \[\leadsto x \cdot 0.1 \]
7. Add Preprocessing

Reproduce

herbie shell --seed 2024158 
(FPCore (x y)
  :name "Text.Parsec.Token:makeTokenParser from parsec-3.1.9, A"
  :precision binary64
  (/ (+ x y) 10.0))