2sin (example 3.3)

Percentage Accurate: 42.5% → 99.4%

Time: 11.9s

Alternatives: 10

Speedup: 2.0×

Specification

Math

\[\begin{array}{l} \\ \sin \left(x + \varepsilon\right) - \sin x \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 (- (sin (+ x eps)) (sin x)))

C

double code(double x, double eps) {
	return sin((x + eps)) - sin(x);
}

Fortran

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = sin((x + eps)) - sin(x)
end function

Java

public static double code(double x, double eps) {
	return Math.sin((x + eps)) - Math.sin(x);
}

Python

def code(x, eps):
	return math.sin((x + eps)) - math.sin(x)

Julia

function code(x, eps)
	return Float64(sin(Float64(x + eps)) - sin(x))
end

MATLAB

function tmp = code(x, eps)
	tmp = sin((x + eps)) - sin(x);
end

Wolfram

code[x_, eps_] := N[(N[Sin[N[(x + eps), $MachinePrecision]], $MachinePrecision] - N[Sin[x], $MachinePrecision]), $MachinePrecision]

Initial Program: 42.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \sin \left(x + \varepsilon\right) - \sin x \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 (- (sin (+ x eps)) (sin x)))

C

double code(double x, double eps) {
	return sin((x + eps)) - sin(x);
}

Fortran

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = sin((x + eps)) - sin(x)
end function

Java

public static double code(double x, double eps) {
	return Math.sin((x + eps)) - Math.sin(x);
}

Python

def code(x, eps):
	return math.sin((x + eps)) - math.sin(x)

Julia

function code(x, eps)
	return Float64(sin(Float64(x + eps)) - sin(x))
end

MATLAB

function tmp = code(x, eps)
	tmp = sin((x + eps)) - sin(x);
end

Wolfram

code[x_, eps_] := N[(N[Sin[N[(x + eps), $MachinePrecision]], $MachinePrecision] - N[Sin[x], $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\cos \varepsilon + -1, \sin x, \sin \varepsilon \cdot \cos x\right) \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (fma (+ (cos eps) -1.0) (sin x) (* (sin eps) (cos x))))

C

double code(double x, double eps) {
	return fma((cos(eps) + -1.0), sin(x), (sin(eps) * cos(x)));
}

Julia

function code(x, eps)
	return fma(Float64(cos(eps) + -1.0), sin(x), Float64(sin(eps) * cos(x)))
end

Wolfram

code[x_, eps_] := N[(N[(N[Cos[eps], $MachinePrecision] + -1.0), $MachinePrecision] * N[Sin[x], $MachinePrecision] + N[(N[Sin[eps], $MachinePrecision] * N[Cos[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 41.6%

   \[\sin \left(x + \varepsilon\right) - \sin x \]
2. Step-by-step derivation

   1. sin-sum 67.0%

      \[\leadsto \color{blue}{\left(\sin x \cdot \cos \varepsilon + \cos x \cdot \sin \varepsilon\right)} - \sin x \]

   2. associate--l+ 67.0%

      \[\leadsto \color{blue}{\sin x \cdot \cos \varepsilon + \left(\cos x \cdot \sin \varepsilon - \sin x\right)} \]

3. Applied egg-rr 67.0%

   \[\leadsto \color{blue}{\sin x \cdot \cos \varepsilon + \left(\cos x \cdot \sin \varepsilon - \sin x\right)} \]
4. Step-by-step derivation

   1. +-commutative 67.0%

      \[\leadsto \color{blue}{\left(\cos x \cdot \sin \varepsilon - \sin x\right) + \sin x \cdot \cos \varepsilon} \]

   2. sub-neg 67.0%

      \[\leadsto \color{blue}{\left(\cos x \cdot \sin \varepsilon + \left(-\sin x\right)\right)} + \sin x \cdot \cos \varepsilon \]

   3. associate-+l+ 99.4%

      \[\leadsto \color{blue}{\cos x \cdot \sin \varepsilon + \left(\left(-\sin x\right) + \sin x \cdot \cos \varepsilon\right)} \]

   4. *-commutative 99.4%

      \[\leadsto \color{blue}{\sin \varepsilon \cdot \cos x} + \left(\left(-\sin x\right) + \sin x \cdot \cos \varepsilon\right) \]

   5. neg-mul-1 99.4%

      \[\leadsto \sin \varepsilon \cdot \cos x + \left(\color{blue}{-1 \cdot \sin x} + \sin x \cdot \cos \varepsilon\right) \]

   6. *-commutative 99.4%

      \[\leadsto \sin \varepsilon \cdot \cos x + \left(-1 \cdot \sin x + \color{blue}{\cos \varepsilon \cdot \sin x}\right) \]

   7. distribute-rgt-out 99.4%

      \[\leadsto \sin \varepsilon \cdot \cos x + \color{blue}{\sin x \cdot \left(-1 + \cos \varepsilon\right)} \]

   8. +-commutative 99.4%

      \[\leadsto \sin \varepsilon \cdot \cos x + \sin x \cdot \color{blue}{\left(\cos \varepsilon + -1\right)} \]

5. Simplified 99.4%

   \[\leadsto \color{blue}{\sin \varepsilon \cdot \cos x + \sin x \cdot \left(\cos \varepsilon + -1\right)} \]
6. Step-by-step derivation

   1. +-commutative 99.4%

      \[\leadsto \color{blue}{\sin x \cdot \left(\cos \varepsilon + -1\right) + \sin \varepsilon \cdot \cos x} \]

   2. *-commutative 99.4%

      \[\leadsto \color{blue}{\left(\cos \varepsilon + -1\right) \cdot \sin x} + \sin \varepsilon \cdot \cos x \]

   3. *-commutative 99.4%

      \[\leadsto \left(\cos \varepsilon + -1\right) \cdot \sin x + \color{blue}{\cos x \cdot \sin \varepsilon} \]

   4. fma-def 99.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\cos \varepsilon + -1, \sin x, \cos x \cdot \sin \varepsilon\right)} \]

   5. *-commutative 99.4%

      \[\leadsto \mathsf{fma}\left(\cos \varepsilon + -1, \sin x, \color{blue}{\sin \varepsilon \cdot \cos x}\right) \]

7. Applied egg-rr 99.4%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\cos \varepsilon + -1, \sin x, \sin \varepsilon \cdot \cos x\right)} \]

8. Final simplification 99.4%

   \[\leadsto \mathsf{fma}\left(\cos \varepsilon + -1, \sin x, \sin \varepsilon \cdot \cos x\right) \]

Alternative 2: 99.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\sin \varepsilon, \cos x, \left(\cos \varepsilon + -1\right) \cdot \sin x\right) \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (fma (sin eps) (cos x) (* (+ (cos eps) -1.0) (sin x))))

C

double code(double x, double eps) {
	return fma(sin(eps), cos(x), ((cos(eps) + -1.0) * sin(x)));
}

Julia

function code(x, eps)
	return fma(sin(eps), cos(x), Float64(Float64(cos(eps) + -1.0) * sin(x)))
end

Wolfram

code[x_, eps_] := N[(N[Sin[eps], $MachinePrecision] * N[Cos[x], $MachinePrecision] + N[(N[(N[Cos[eps], $MachinePrecision] + -1.0), $MachinePrecision] * N[Sin[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 41.6%

   \[\sin \left(x + \varepsilon\right) - \sin x \]
2. Step-by-step derivation

   1. sin-sum 67.0%

      \[\leadsto \color{blue}{\left(\sin x \cdot \cos \varepsilon + \cos x \cdot \sin \varepsilon\right)} - \sin x \]

   2. associate--l+ 67.0%

      \[\leadsto \color{blue}{\sin x \cdot \cos \varepsilon + \left(\cos x \cdot \sin \varepsilon - \sin x\right)} \]

3. Applied egg-rr 67.0%

   \[\leadsto \color{blue}{\sin x \cdot \cos \varepsilon + \left(\cos x \cdot \sin \varepsilon - \sin x\right)} \]
4. Step-by-step derivation

   1. +-commutative 67.0%

      \[\leadsto \color{blue}{\left(\cos x \cdot \sin \varepsilon - \sin x\right) + \sin x \cdot \cos \varepsilon} \]

   2. sub-neg 67.0%

      \[\leadsto \color{blue}{\left(\cos x \cdot \sin \varepsilon + \left(-\sin x\right)\right)} + \sin x \cdot \cos \varepsilon \]

   3. associate-+l+ 99.4%

      \[\leadsto \color{blue}{\cos x \cdot \sin \varepsilon + \left(\left(-\sin x\right) + \sin x \cdot \cos \varepsilon\right)} \]

   4. *-commutative 99.4%

      \[\leadsto \color{blue}{\sin \varepsilon \cdot \cos x} + \left(\left(-\sin x\right) + \sin x \cdot \cos \varepsilon\right) \]

   5. neg-mul-1 99.4%

      \[\leadsto \sin \varepsilon \cdot \cos x + \left(\color{blue}{-1 \cdot \sin x} + \sin x \cdot \cos \varepsilon\right) \]

   6. *-commutative 99.4%

      \[\leadsto \sin \varepsilon \cdot \cos x + \left(-1 \cdot \sin x + \color{blue}{\cos \varepsilon \cdot \sin x}\right) \]

   7. distribute-rgt-out 99.4%

      \[\leadsto \sin \varepsilon \cdot \cos x + \color{blue}{\sin x \cdot \left(-1 + \cos \varepsilon\right)} \]

   8. +-commutative 99.4%

      \[\leadsto \sin \varepsilon \cdot \cos x + \sin x \cdot \color{blue}{\left(\cos \varepsilon + -1\right)} \]

5. Simplified 99.4%

   \[\leadsto \color{blue}{\sin \varepsilon \cdot \cos x + \sin x \cdot \left(\cos \varepsilon + -1\right)} \]
6. Step-by-step derivation

   1. fma-def 99.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\sin \varepsilon, \cos x, \sin x \cdot \left(\cos \varepsilon + -1\right)\right)} \]

   2. *-commutative 99.4%

      \[\leadsto \mathsf{fma}\left(\sin \varepsilon, \cos x, \color{blue}{\left(\cos \varepsilon + -1\right) \cdot \sin x}\right) \]

7. Applied egg-rr 99.4%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\sin \varepsilon, \cos x, \left(\cos \varepsilon + -1\right) \cdot \sin x\right)} \]

8. Final simplification 99.4%

   \[\leadsto \mathsf{fma}\left(\sin \varepsilon, \cos x, \left(\cos \varepsilon + -1\right) \cdot \sin x\right) \]

Alternative 3: 99.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \sin \varepsilon \cdot \cos x + \left(\cos \varepsilon + -1\right) \cdot \sin x \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (+ (* (sin eps) (cos x)) (* (+ (cos eps) -1.0) (sin x))))

C

double code(double x, double eps) {
	return (sin(eps) * cos(x)) + ((cos(eps) + -1.0) * sin(x));
}

Fortran

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = (sin(eps) * cos(x)) + ((cos(eps) + (-1.0d0)) * sin(x))
end function

Java

public static double code(double x, double eps) {
	return (Math.sin(eps) * Math.cos(x)) + ((Math.cos(eps) + -1.0) * Math.sin(x));
}

Python

def code(x, eps):
	return (math.sin(eps) * math.cos(x)) + ((math.cos(eps) + -1.0) * math.sin(x))

Julia

function code(x, eps)
	return Float64(Float64(sin(eps) * cos(x)) + Float64(Float64(cos(eps) + -1.0) * sin(x)))
end

MATLAB

function tmp = code(x, eps)
	tmp = (sin(eps) * cos(x)) + ((cos(eps) + -1.0) * sin(x));
end

Wolfram

code[x_, eps_] := N[(N[(N[Sin[eps], $MachinePrecision] * N[Cos[x], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Cos[eps], $MachinePrecision] + -1.0), $MachinePrecision] * N[Sin[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 41.6%

   \[\sin \left(x + \varepsilon\right) - \sin x \]
2. Step-by-step derivation

   1. sin-sum 67.0%

      \[\leadsto \color{blue}{\left(\sin x \cdot \cos \varepsilon + \cos x \cdot \sin \varepsilon\right)} - \sin x \]

   2. associate--l+ 67.0%

      \[\leadsto \color{blue}{\sin x \cdot \cos \varepsilon + \left(\cos x \cdot \sin \varepsilon - \sin x\right)} \]

3. Applied egg-rr 67.0%

   \[\leadsto \color{blue}{\sin x \cdot \cos \varepsilon + \left(\cos x \cdot \sin \varepsilon - \sin x\right)} \]
4. Step-by-step derivation

   1. +-commutative 67.0%

      \[\leadsto \color{blue}{\left(\cos x \cdot \sin \varepsilon - \sin x\right) + \sin x \cdot \cos \varepsilon} \]

   2. sub-neg 67.0%

      \[\leadsto \color{blue}{\left(\cos x \cdot \sin \varepsilon + \left(-\sin x\right)\right)} + \sin x \cdot \cos \varepsilon \]

   3. associate-+l+ 99.4%

      \[\leadsto \color{blue}{\cos x \cdot \sin \varepsilon + \left(\left(-\sin x\right) + \sin x \cdot \cos \varepsilon\right)} \]

   4. *-commutative 99.4%

      \[\leadsto \color{blue}{\sin \varepsilon \cdot \cos x} + \left(\left(-\sin x\right) + \sin x \cdot \cos \varepsilon\right) \]

   5. neg-mul-1 99.4%

      \[\leadsto \sin \varepsilon \cdot \cos x + \left(\color{blue}{-1 \cdot \sin x} + \sin x \cdot \cos \varepsilon\right) \]

   6. *-commutative 99.4%

      \[\leadsto \sin \varepsilon \cdot \cos x + \left(-1 \cdot \sin x + \color{blue}{\cos \varepsilon \cdot \sin x}\right) \]

   7. distribute-rgt-out 99.4%

      \[\leadsto \sin \varepsilon \cdot \cos x + \color{blue}{\sin x \cdot \left(-1 + \cos \varepsilon\right)} \]

   8. +-commutative 99.4%

      \[\leadsto \sin \varepsilon \cdot \cos x + \sin x \cdot \color{blue}{\left(\cos \varepsilon + -1\right)} \]

5. Simplified 99.4%

   \[\leadsto \color{blue}{\sin \varepsilon \cdot \cos x + \sin x \cdot \left(\cos \varepsilon + -1\right)} \]

6. Final simplification 99.4%

   \[\leadsto \sin \varepsilon \cdot \cos x + \left(\cos \varepsilon + -1\right) \cdot \sin x \]

Alternative 4: 77.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\varepsilon \leq -0.0012 \lor \neg \left(\varepsilon \leq 235000000000\right):\\ \;\;\;\;\sin \varepsilon - \sin x\\ \mathbf{else}:\\ \;\;\;\;\varepsilon \cdot \left(\cos x + \varepsilon \cdot \left(\sin x \cdot -0.5\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (or (<= eps -0.0012) (not (<= eps 235000000000.0)))
   (- (sin eps) (sin x))
   (* eps (+ (cos x) (* eps (* (sin x) -0.5))))))

C

double code(double x, double eps) {
	double tmp;
	if ((eps <= -0.0012) || !(eps <= 235000000000.0)) {
		tmp = sin(eps) - sin(x);
	} else {
		tmp = eps * (cos(x) + (eps * (sin(x) * -0.5)));
	}
	return tmp;
}

Fortran

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    real(8) :: tmp
    if ((eps <= (-0.0012d0)) .or. (.not. (eps <= 235000000000.0d0))) then
        tmp = sin(eps) - sin(x)
    else
        tmp = eps * (cos(x) + (eps * (sin(x) * (-0.5d0))))
    end if
    code = tmp
end function

Java

public static double code(double x, double eps) {
	double tmp;
	if ((eps <= -0.0012) || !(eps <= 235000000000.0)) {
		tmp = Math.sin(eps) - Math.sin(x);
	} else {
		tmp = eps * (Math.cos(x) + (eps * (Math.sin(x) * -0.5)));
	}
	return tmp;
}

Python

def code(x, eps):
	tmp = 0
	if (eps <= -0.0012) or not (eps <= 235000000000.0):
		tmp = math.sin(eps) - math.sin(x)
	else:
		tmp = eps * (math.cos(x) + (eps * (math.sin(x) * -0.5)))
	return tmp

Julia

function code(x, eps)
	tmp = 0.0
	if ((eps <= -0.0012) || !(eps <= 235000000000.0))
		tmp = Float64(sin(eps) - sin(x));
	else
		tmp = Float64(eps * Float64(cos(x) + Float64(eps * Float64(sin(x) * -0.5))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, eps)
	tmp = 0.0;
	if ((eps <= -0.0012) || ~((eps <= 235000000000.0)))
		tmp = sin(eps) - sin(x);
	else
		tmp = eps * (cos(x) + (eps * (sin(x) * -0.5)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, eps_] := If[Or[LessEqual[eps, -0.0012], N[Not[LessEqual[eps, 235000000000.0]], $MachinePrecision]], N[(N[Sin[eps], $MachinePrecision] - N[Sin[x], $MachinePrecision]), $MachinePrecision], N[(eps * N[(N[Cos[x], $MachinePrecision] + N[(eps * N[(N[Sin[x], $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if eps < -0.00119999999999999989 or 2.35e11 < eps

   1. Initial program 52.2%

      \[\sin \left(x + \varepsilon\right) - \sin x \]
   2. Step-by-step derivation

      1. add-cube-cbrt 51.5%

         \[\leadsto \color{blue}{\left(\sqrt[3]{\sin \left(x + \varepsilon\right)} \cdot \sqrt[3]{\sin \left(x + \varepsilon\right)}\right) \cdot \sqrt[3]{\sin \left(x + \varepsilon\right)}} - \sin x \]

      2. pow3 51.5%

         \[\leadsto \color{blue}{{\left(\sqrt[3]{\sin \left(x + \varepsilon\right)}\right)}^{3}} - \sin x \]

   3. Applied egg-rr 51.5%

      \[\leadsto \color{blue}{{\left(\sqrt[3]{\sin \left(x + \varepsilon\right)}\right)}^{3}} - \sin x \]

   4. Taylor expanded in x around 0 26.7%

      \[\leadsto {\color{blue}{\left({\sin \varepsilon}^{0.3333333333333333}\right)}}^{3} - \sin x \]

   5. Taylor expanded in eps around inf 54.8%

      \[\leadsto \color{blue}{{1}^{0.3333333333333333} \cdot \sin \varepsilon - \sin x} \]
   6. Step-by-step derivation

      1. pow-base-1 54.8%

         \[\leadsto \color{blue}{1} \cdot \sin \varepsilon - \sin x \]

      2. *-lft-identity 54.8%

         \[\leadsto \color{blue}{\sin \varepsilon} - \sin x \]

   7. Simplified 54.8%

      \[\leadsto \color{blue}{\sin \varepsilon - \sin x} \]

   if -0.00119999999999999989 < eps < 2.35e11

   1. Initial program 30.8%

      \[\sin \left(x + \varepsilon\right) - \sin x \]
   2. Step-by-step derivation

      1. sin-sum 34.0%

         \[\leadsto \color{blue}{\left(\sin x \cdot \cos \varepsilon + \cos x \cdot \sin \varepsilon\right)} - \sin x \]

      2. associate--l+ 34.0%

         \[\leadsto \color{blue}{\sin x \cdot \cos \varepsilon + \left(\cos x \cdot \sin \varepsilon - \sin x\right)} \]

   3. Applied egg-rr 34.0%

      \[\leadsto \color{blue}{\sin x \cdot \cos \varepsilon + \left(\cos x \cdot \sin \varepsilon - \sin x\right)} \]
   4. Step-by-step derivation

      1. +-commutative 34.0%

         \[\leadsto \color{blue}{\left(\cos x \cdot \sin \varepsilon - \sin x\right) + \sin x \cdot \cos \varepsilon} \]

      2. sub-neg 34.0%

         \[\leadsto \color{blue}{\left(\cos x \cdot \sin \varepsilon + \left(-\sin x\right)\right)} + \sin x \cdot \cos \varepsilon \]

      3. associate-+l+ 99.3%

         \[\leadsto \color{blue}{\cos x \cdot \sin \varepsilon + \left(\left(-\sin x\right) + \sin x \cdot \cos \varepsilon\right)} \]

      4. *-commutative 99.3%

         \[\leadsto \color{blue}{\sin \varepsilon \cdot \cos x} + \left(\left(-\sin x\right) + \sin x \cdot \cos \varepsilon\right) \]

      5. neg-mul-1 99.3%

         \[\leadsto \sin \varepsilon \cdot \cos x + \left(\color{blue}{-1 \cdot \sin x} + \sin x \cdot \cos \varepsilon\right) \]

      6. *-commutative 99.3%

         \[\leadsto \sin \varepsilon \cdot \cos x + \left(-1 \cdot \sin x + \color{blue}{\cos \varepsilon \cdot \sin x}\right) \]

      7. distribute-rgt-out 99.3%

         \[\leadsto \sin \varepsilon \cdot \cos x + \color{blue}{\sin x \cdot \left(-1 + \cos \varepsilon\right)} \]

      8. +-commutative 99.3%

         \[\leadsto \sin \varepsilon \cdot \cos x + \sin x \cdot \color{blue}{\left(\cos \varepsilon + -1\right)} \]

   5. Simplified 99.3%

      \[\leadsto \color{blue}{\sin \varepsilon \cdot \cos x + \sin x \cdot \left(\cos \varepsilon + -1\right)} \]

   6. Taylor expanded in eps around 0 98.5%

      \[\leadsto \color{blue}{-0.5 \cdot \left({\varepsilon}^{2} \cdot \sin x\right) + \varepsilon \cdot \cos x} \]
   7. Step-by-step derivation

      1. *-commutative 98.5%

         \[\leadsto -0.5 \cdot \color{blue}{\left(\sin x \cdot {\varepsilon}^{2}\right)} + \varepsilon \cdot \cos x \]

      2. associate-*l* 98.5%

         \[\leadsto \color{blue}{\left(-0.5 \cdot \sin x\right) \cdot {\varepsilon}^{2}} + \varepsilon \cdot \cos x \]

      3. unpow2 98.5%

         \[\leadsto \left(-0.5 \cdot \sin x\right) \cdot \color{blue}{\left(\varepsilon \cdot \varepsilon\right)} + \varepsilon \cdot \cos x \]

      4. associate-*r* 98.5%

         \[\leadsto \color{blue}{\left(\left(-0.5 \cdot \sin x\right) \cdot \varepsilon\right) \cdot \varepsilon} + \varepsilon \cdot \cos x \]

      5. *-commutative 98.5%

         \[\leadsto \left(\left(-0.5 \cdot \sin x\right) \cdot \varepsilon\right) \cdot \varepsilon + \color{blue}{\cos x \cdot \varepsilon} \]

      6. distribute-rgt-out 98.5%

         \[\leadsto \color{blue}{\varepsilon \cdot \left(\left(-0.5 \cdot \sin x\right) \cdot \varepsilon + \cos x\right)} \]

      7. *-commutative 98.5%

         \[\leadsto \varepsilon \cdot \left(\color{blue}{\varepsilon \cdot \left(-0.5 \cdot \sin x\right)} + \cos x\right) \]

   8. Simplified 98.5%

      \[\leadsto \color{blue}{\varepsilon \cdot \left(\varepsilon \cdot \left(-0.5 \cdot \sin x\right) + \cos x\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 76.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\varepsilon \leq -0.0012 \lor \neg \left(\varepsilon \leq 235000000000\right):\\ \;\;\;\;\sin \varepsilon - \sin x\\ \mathbf{else}:\\ \;\;\;\;\varepsilon \cdot \left(\cos x + \varepsilon \cdot \left(\sin x \cdot -0.5\right)\right)\\ \end{array} \]

Alternative 5: 76.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \cos \left(0.5 \cdot \left(\varepsilon + \left(x + x\right)\right)\right) \cdot \left(2 \cdot \sin \left(\varepsilon \cdot 0.5\right)\right) \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (* (cos (* 0.5 (+ eps (+ x x)))) (* 2.0 (sin (* eps 0.5)))))

C

double code(double x, double eps) {
	return cos((0.5 * (eps + (x + x)))) * (2.0 * sin((eps * 0.5)));
}

Fortran

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = cos((0.5d0 * (eps + (x + x)))) * (2.0d0 * sin((eps * 0.5d0)))
end function

Java

public static double code(double x, double eps) {
	return Math.cos((0.5 * (eps + (x + x)))) * (2.0 * Math.sin((eps * 0.5)));
}

Python

def code(x, eps):
	return math.cos((0.5 * (eps + (x + x)))) * (2.0 * math.sin((eps * 0.5)))

Julia

function code(x, eps)
	return Float64(cos(Float64(0.5 * Float64(eps + Float64(x + x)))) * Float64(2.0 * sin(Float64(eps * 0.5))))
end

MATLAB

function tmp = code(x, eps)
	tmp = cos((0.5 * (eps + (x + x)))) * (2.0 * sin((eps * 0.5)));
end

Wolfram

code[x_, eps_] := N[(N[Cos[N[(0.5 * N[(eps + N[(x + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(2.0 * N[Sin[N[(eps * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 41.6%

   \[\sin \left(x + \varepsilon\right) - \sin x \]
2. Step-by-step derivation

   1. diff-sin 41.0%

      \[\leadsto \color{blue}{2 \cdot \left(\sin \left(\frac{\left(x + \varepsilon\right) - x}{2}\right) \cdot \cos \left(\frac{\left(x + \varepsilon\right) + x}{2}\right)\right)} \]

   2. div-inv 41.0%

      \[\leadsto 2 \cdot \left(\sin \color{blue}{\left(\left(\left(x + \varepsilon\right) - x\right) \cdot \frac{1}{2}\right)} \cdot \cos \left(\frac{\left(x + \varepsilon\right) + x}{2}\right)\right) \]

   3. metadata-eval 41.0%

      \[\leadsto 2 \cdot \left(\sin \left(\left(\left(x + \varepsilon\right) - x\right) \cdot \color{blue}{0.5}\right) \cdot \cos \left(\frac{\left(x + \varepsilon\right) + x}{2}\right)\right) \]

   4. div-inv 41.0%

      \[\leadsto 2 \cdot \left(\sin \left(\left(\left(x + \varepsilon\right) - x\right) \cdot 0.5\right) \cdot \cos \color{blue}{\left(\left(\left(x + \varepsilon\right) + x\right) \cdot \frac{1}{2}\right)}\right) \]

   5. +-commutative 41.0%

      \[\leadsto 2 \cdot \left(\sin \left(\left(\left(x + \varepsilon\right) - x\right) \cdot 0.5\right) \cdot \cos \left(\color{blue}{\left(x + \left(x + \varepsilon\right)\right)} \cdot \frac{1}{2}\right)\right) \]

   6. metadata-eval 41.0%

      \[\leadsto 2 \cdot \left(\sin \left(\left(\left(x + \varepsilon\right) - x\right) \cdot 0.5\right) \cdot \cos \left(\left(x + \left(x + \varepsilon\right)\right) \cdot \color{blue}{0.5}\right)\right) \]

3. Applied egg-rr 41.0%

   \[\leadsto \color{blue}{2 \cdot \left(\sin \left(\left(\left(x + \varepsilon\right) - x\right) \cdot 0.5\right) \cdot \cos \left(\left(x + \left(x + \varepsilon\right)\right) \cdot 0.5\right)\right)} \]
4. Step-by-step derivation

   1. associate-*r* 41.0%

      \[\leadsto \color{blue}{\left(2 \cdot \sin \left(\left(\left(x + \varepsilon\right) - x\right) \cdot 0.5\right)\right) \cdot \cos \left(\left(x + \left(x + \varepsilon\right)\right) \cdot 0.5\right)} \]

   2. *-commutative 41.0%

      \[\leadsto \color{blue}{\cos \left(\left(x + \left(x + \varepsilon\right)\right) \cdot 0.5\right) \cdot \left(2 \cdot \sin \left(\left(\left(x + \varepsilon\right) - x\right) \cdot 0.5\right)\right)} \]

   3. *-commutative 41.0%

      \[\leadsto \cos \color{blue}{\left(0.5 \cdot \left(x + \left(x + \varepsilon\right)\right)\right)} \cdot \left(2 \cdot \sin \left(\left(\left(x + \varepsilon\right) - x\right) \cdot 0.5\right)\right) \]

   4. associate-+r+ 41.0%

      \[\leadsto \cos \left(0.5 \cdot \color{blue}{\left(\left(x + x\right) + \varepsilon\right)}\right) \cdot \left(2 \cdot \sin \left(\left(\left(x + \varepsilon\right) - x\right) \cdot 0.5\right)\right) \]

   5. +-commutative 41.0%

      \[\leadsto \cos \left(0.5 \cdot \color{blue}{\left(\varepsilon + \left(x + x\right)\right)}\right) \cdot \left(2 \cdot \sin \left(\left(\left(x + \varepsilon\right) - x\right) \cdot 0.5\right)\right) \]

   6. *-commutative 41.0%

      \[\leadsto \cos \left(0.5 \cdot \left(\varepsilon + \left(x + x\right)\right)\right) \cdot \left(2 \cdot \sin \color{blue}{\left(0.5 \cdot \left(\left(x + \varepsilon\right) - x\right)\right)}\right) \]

   7. +-commutative 41.0%

      \[\leadsto \cos \left(0.5 \cdot \left(\varepsilon + \left(x + x\right)\right)\right) \cdot \left(2 \cdot \sin \left(0.5 \cdot \left(\color{blue}{\left(\varepsilon + x\right)} - x\right)\right)\right) \]

   8. associate--l+ 75.6%

      \[\leadsto \cos \left(0.5 \cdot \left(\varepsilon + \left(x + x\right)\right)\right) \cdot \left(2 \cdot \sin \left(0.5 \cdot \color{blue}{\left(\varepsilon + \left(x - x\right)\right)}\right)\right) \]

   9. +-inverses 75.6%

      \[\leadsto \cos \left(0.5 \cdot \left(\varepsilon + \left(x + x\right)\right)\right) \cdot \left(2 \cdot \sin \left(0.5 \cdot \left(\varepsilon + \color{blue}{0}\right)\right)\right) \]

   10. distribute-lft-in 75.6%

       \[\leadsto \cos \left(0.5 \cdot \left(\varepsilon + \left(x + x\right)\right)\right) \cdot \left(2 \cdot \sin \color{blue}{\left(0.5 \cdot \varepsilon + 0.5 \cdot 0\right)}\right) \]

   11. metadata-eval 75.6%

       \[\leadsto \cos \left(0.5 \cdot \left(\varepsilon + \left(x + x\right)\right)\right) \cdot \left(2 \cdot \sin \left(0.5 \cdot \varepsilon + \color{blue}{0}\right)\right) \]

5. Simplified 75.6%

   \[\leadsto \color{blue}{\cos \left(0.5 \cdot \left(\varepsilon + \left(x + x\right)\right)\right) \cdot \left(2 \cdot \sin \left(0.5 \cdot \varepsilon + 0\right)\right)} \]

6. Final simplification 75.6%

   \[\leadsto \cos \left(0.5 \cdot \left(\varepsilon + \left(x + x\right)\right)\right) \cdot \left(2 \cdot \sin \left(\varepsilon \cdot 0.5\right)\right) \]

Alternative 6: 77.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\varepsilon \leq -1.2 \cdot 10^{-5} \lor \neg \left(\varepsilon \leq 0.18\right):\\ \;\;\;\;\sin \varepsilon - \sin x\\ \mathbf{else}:\\ \;\;\;\;\varepsilon \cdot \cos x\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (or (<= eps -1.2e-5) (not (<= eps 0.18)))
   (- (sin eps) (sin x))
   (* eps (cos x))))

C

double code(double x, double eps) {
	double tmp;
	if ((eps <= -1.2e-5) || !(eps <= 0.18)) {
		tmp = sin(eps) - sin(x);
	} else {
		tmp = eps * cos(x);
	}
	return tmp;
}

Fortran

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    real(8) :: tmp
    if ((eps <= (-1.2d-5)) .or. (.not. (eps <= 0.18d0))) then
        tmp = sin(eps) - sin(x)
    else
        tmp = eps * cos(x)
    end if
    code = tmp
end function

Java

public static double code(double x, double eps) {
	double tmp;
	if ((eps <= -1.2e-5) || !(eps <= 0.18)) {
		tmp = Math.sin(eps) - Math.sin(x);
	} else {
		tmp = eps * Math.cos(x);
	}
	return tmp;
}

Python

def code(x, eps):
	tmp = 0
	if (eps <= -1.2e-5) or not (eps <= 0.18):
		tmp = math.sin(eps) - math.sin(x)
	else:
		tmp = eps * math.cos(x)
	return tmp

Julia

function code(x, eps)
	tmp = 0.0
	if ((eps <= -1.2e-5) || !(eps <= 0.18))
		tmp = Float64(sin(eps) - sin(x));
	else
		tmp = Float64(eps * cos(x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, eps)
	tmp = 0.0;
	if ((eps <= -1.2e-5) || ~((eps <= 0.18)))
		tmp = sin(eps) - sin(x);
	else
		tmp = eps * cos(x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, eps_] := If[Or[LessEqual[eps, -1.2e-5], N[Not[LessEqual[eps, 0.18]], $MachinePrecision]], N[(N[Sin[eps], $MachinePrecision] - N[Sin[x], $MachinePrecision]), $MachinePrecision], N[(eps * N[Cos[x], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if eps < -1.2e-5 or 0.17999999999999999 < eps

   1. Initial program 51.8%

      \[\sin \left(x + \varepsilon\right) - \sin x \]
   2. Step-by-step derivation

      1. add-cube-cbrt 51.1%

         \[\leadsto \color{blue}{\left(\sqrt[3]{\sin \left(x + \varepsilon\right)} \cdot \sqrt[3]{\sin \left(x + \varepsilon\right)}\right) \cdot \sqrt[3]{\sin \left(x + \varepsilon\right)}} - \sin x \]

      2. pow3 51.1%

         \[\leadsto \color{blue}{{\left(\sqrt[3]{\sin \left(x + \varepsilon\right)}\right)}^{3}} - \sin x \]

   3. Applied egg-rr 51.1%

      \[\leadsto \color{blue}{{\left(\sqrt[3]{\sin \left(x + \varepsilon\right)}\right)}^{3}} - \sin x \]

   4. Taylor expanded in x around 0 26.5%

      \[\leadsto {\color{blue}{\left({\sin \varepsilon}^{0.3333333333333333}\right)}}^{3} - \sin x \]

   5. Taylor expanded in eps around inf 54.4%

      \[\leadsto \color{blue}{{1}^{0.3333333333333333} \cdot \sin \varepsilon - \sin x} \]
   6. Step-by-step derivation

      1. pow-base-1 54.4%

         \[\leadsto \color{blue}{1} \cdot \sin \varepsilon - \sin x \]

      2. *-lft-identity 54.4%

         \[\leadsto \color{blue}{\sin \varepsilon} - \sin x \]

   7. Simplified 54.4%

      \[\leadsto \color{blue}{\sin \varepsilon - \sin x} \]

   if -1.2e-5 < eps < 0.17999999999999999

   1. Initial program 31.0%

      \[\sin \left(x + \varepsilon\right) - \sin x \]

   2. Taylor expanded in eps around 0 98.5%

      \[\leadsto \color{blue}{\varepsilon \cdot \cos x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 76.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\varepsilon \leq -1.2 \cdot 10^{-5} \lor \neg \left(\varepsilon \leq 0.18\right):\\ \;\;\;\;\sin \varepsilon - \sin x\\ \mathbf{else}:\\ \;\;\;\;\varepsilon \cdot \cos x\\ \end{array} \]

Alternative 7: 76.8% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\varepsilon \leq -9.5 \cdot 10^{-5}:\\ \;\;\;\;\sin \varepsilon\\ \mathbf{elif}\;\varepsilon \leq 0.18:\\ \;\;\;\;\varepsilon \cdot \cos x\\ \mathbf{else}:\\ \;\;\;\;\sin \varepsilon\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (<= eps -9.5e-5) (sin eps) (if (<= eps 0.18) (* eps (cos x)) (sin eps))))

C

double code(double x, double eps) {
	double tmp;
	if (eps <= -9.5e-5) {
		tmp = sin(eps);
	} else if (eps <= 0.18) {
		tmp = eps * cos(x);
	} else {
		tmp = sin(eps);
	}
	return tmp;
}

Fortran

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    real(8) :: tmp
    if (eps <= (-9.5d-5)) then
        tmp = sin(eps)
    else if (eps <= 0.18d0) then
        tmp = eps * cos(x)
    else
        tmp = sin(eps)
    end if
    code = tmp
end function

Java

public static double code(double x, double eps) {
	double tmp;
	if (eps <= -9.5e-5) {
		tmp = Math.sin(eps);
	} else if (eps <= 0.18) {
		tmp = eps * Math.cos(x);
	} else {
		tmp = Math.sin(eps);
	}
	return tmp;
}

Python

def code(x, eps):
	tmp = 0
	if eps <= -9.5e-5:
		tmp = math.sin(eps)
	elif eps <= 0.18:
		tmp = eps * math.cos(x)
	else:
		tmp = math.sin(eps)
	return tmp

Julia

function code(x, eps)
	tmp = 0.0
	if (eps <= -9.5e-5)
		tmp = sin(eps);
	elseif (eps <= 0.18)
		tmp = Float64(eps * cos(x));
	else
		tmp = sin(eps);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, eps)
	tmp = 0.0;
	if (eps <= -9.5e-5)
		tmp = sin(eps);
	elseif (eps <= 0.18)
		tmp = eps * cos(x);
	else
		tmp = sin(eps);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, eps_] := If[LessEqual[eps, -9.5e-5], N[Sin[eps], $MachinePrecision], If[LessEqual[eps, 0.18], N[(eps * N[Cos[x], $MachinePrecision]), $MachinePrecision], N[Sin[eps], $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if eps < -9.5000000000000005e-5 or 0.17999999999999999 < eps

   1. Initial program 51.8%

      \[\sin \left(x + \varepsilon\right) - \sin x \]

   2. Taylor expanded in x around 0 53.2%

      \[\leadsto \color{blue}{\sin \varepsilon} \]

   if -9.5000000000000005e-5 < eps < 0.17999999999999999

   1. Initial program 31.0%

      \[\sin \left(x + \varepsilon\right) - \sin x \]

   2. Taylor expanded in eps around 0 98.5%

      \[\leadsto \color{blue}{\varepsilon \cdot \cos x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 75.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\varepsilon \leq -9.5 \cdot 10^{-5}:\\ \;\;\;\;\sin \varepsilon\\ \mathbf{elif}\;\varepsilon \leq 0.18:\\ \;\;\;\;\varepsilon \cdot \cos x\\ \mathbf{else}:\\ \;\;\;\;\sin \varepsilon\\ \end{array} \]

Alternative 8: 55.3% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \sin \varepsilon \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 (sin eps))

C

double code(double x, double eps) {
	return sin(eps);
}

Fortran

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

Java

public static double code(double x, double eps) {
	return Math.sin(eps);
}

Python

def code(x, eps):
	return math.sin(eps)

Julia

function code(x, eps)
	return sin(eps)
end

MATLAB

function tmp = code(x, eps)
	tmp = sin(eps);
end

Wolfram

code[x_, eps_] := N[Sin[eps], $MachinePrecision]

Derivation

1. Initial program 41.6%

   \[\sin \left(x + \varepsilon\right) - \sin x \]

2. Taylor expanded in x around 0 55.9%

   \[\leadsto \color{blue}{\sin \varepsilon} \]

3. Final simplification 55.9%

   \[\leadsto \sin \varepsilon \]

Alternative 9: 4.2% accurate, 205.0× speedup

Math

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

FPCore

(FPCore (x eps) :precision binary64 0.0)

C

double code(double x, double eps) {
	return 0.0;
}

Fortran

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = 0.0d0
end function

Java

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

Python

def code(x, eps):
	return 0.0

Julia

function code(x, eps)
	return 0.0
end

MATLAB

function tmp = code(x, eps)
	tmp = 0.0;
end

Wolfram

code[x_, eps_] := 0.0

Derivation

1. Initial program 41.6%

   \[\sin \left(x + \varepsilon\right) - \sin x \]
2. Step-by-step derivation

   1. add-cube-cbrt 40.5%

      \[\leadsto \color{blue}{\left(\sqrt[3]{\sin \left(x + \varepsilon\right)} \cdot \sqrt[3]{\sin \left(x + \varepsilon\right)}\right) \cdot \sqrt[3]{\sin \left(x + \varepsilon\right)}} - \sin x \]

   2. pow3 40.5%

      \[\leadsto \color{blue}{{\left(\sqrt[3]{\sin \left(x + \varepsilon\right)}\right)}^{3}} - \sin x \]

3. Applied egg-rr 40.5%

   \[\leadsto \color{blue}{{\left(\sqrt[3]{\sin \left(x + \varepsilon\right)}\right)}^{3}} - \sin x \]

4. Taylor expanded in eps around 0 4.2%

   \[\leadsto \color{blue}{{1}^{0.3333333333333333} \cdot \sin x - \sin x} \]
5. Step-by-step derivation

   1. pow-base-1 4.2%

      \[\leadsto \color{blue}{1} \cdot \sin x - \sin x \]

   2. *-lft-identity 4.2%

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

   3. +-inverses 4.2%

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

6. Simplified 4.2%

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

7. Final simplification 4.2%

   \[\leadsto 0 \]

Alternative 10: 29.3% accurate, 205.0× speedup

Math

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

FPCore

(FPCore (x eps) :precision binary64 eps)

C

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

Fortran

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

Java

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

Python

def code(x, eps):
	return eps

Julia

function code(x, eps)
	return eps
end

MATLAB

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

Wolfram

code[x_, eps_] := eps

Derivation

1. Initial program 41.6%

   \[\sin \left(x + \varepsilon\right) - \sin x \]

2. Taylor expanded in eps around 0 50.6%

   \[\leadsto \color{blue}{-0.5 \cdot \left({\varepsilon}^{2} \cdot \sin x\right) + \varepsilon \cdot \cos x} \]
3. Step-by-step derivation

   1. +-commutative 50.6%

      \[\leadsto \color{blue}{\varepsilon \cdot \cos x + -0.5 \cdot \left({\varepsilon}^{2} \cdot \sin x\right)} \]

   2. fma-def 50.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\varepsilon, \cos x, -0.5 \cdot \left({\varepsilon}^{2} \cdot \sin x\right)\right)} \]

   3. *-commutative 50.6%

      \[\leadsto \mathsf{fma}\left(\varepsilon, \cos x, -0.5 \cdot \color{blue}{\left(\sin x \cdot {\varepsilon}^{2}\right)}\right) \]

   4. unpow2 50.6%

      \[\leadsto \mathsf{fma}\left(\varepsilon, \cos x, -0.5 \cdot \left(\sin x \cdot \color{blue}{\left(\varepsilon \cdot \varepsilon\right)}\right)\right) \]

   5. associate-*r* 50.7%

      \[\leadsto \mathsf{fma}\left(\varepsilon, \cos x, -0.5 \cdot \color{blue}{\left(\left(\sin x \cdot \varepsilon\right) \cdot \varepsilon\right)}\right) \]

4. Simplified 50.7%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\varepsilon, \cos x, -0.5 \cdot \left(\left(\sin x \cdot \varepsilon\right) \cdot \varepsilon\right)\right)} \]

5. Taylor expanded in x around 0 30.6%

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

6. Final simplification 30.6%

   \[\leadsto \varepsilon \]

Developer target: 76.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 2 \cdot \left(\cos \left(x + \frac{\varepsilon}{2}\right) \cdot \sin \left(\frac{\varepsilon}{2}\right)\right) \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (* 2.0 (* (cos (+ x (/ eps 2.0))) (sin (/ eps 2.0)))))

C

double code(double x, double eps) {
	return 2.0 * (cos((x + (eps / 2.0))) * sin((eps / 2.0)));
}

Fortran

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = 2.0d0 * (cos((x + (eps / 2.0d0))) * sin((eps / 2.0d0)))
end function

Java

public static double code(double x, double eps) {
	return 2.0 * (Math.cos((x + (eps / 2.0))) * Math.sin((eps / 2.0)));
}

Python

def code(x, eps):
	return 2.0 * (math.cos((x + (eps / 2.0))) * math.sin((eps / 2.0)))

Julia

function code(x, eps)
	return Float64(2.0 * Float64(cos(Float64(x + Float64(eps / 2.0))) * sin(Float64(eps / 2.0))))
end

MATLAB

function tmp = code(x, eps)
	tmp = 2.0 * (cos((x + (eps / 2.0))) * sin((eps / 2.0)));
end

Wolfram

code[x_, eps_] := N[(2.0 * N[(N[Cos[N[(x + N[(eps / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(eps / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2023271 
(FPCore (x eps)
  :name "2sin (example 3.3)"
  :precision binary64

  :herbie-target
  (* 2.0 (* (cos (+ x (/ eps 2.0))) (sin (/ eps 2.0))))

  (- (sin (+ x eps)) (sin x)))