Graphics.Rasterific.CubicBezier:isSufficientlyFlat from Rasterific-0.6.1

Average Error: 0 → 0

Time: 808.0ms

Precision: binary64

Cost: 320

Math

\[\left(x \cdot 16\right) \cdot x \]

↓

\[x \cdot \left(x \cdot 16\right) \]

FPCore

(FPCore (x) :precision binary64 (* (* x 16.0) x))

↓

(FPCore (x) :precision binary64 (* x (* x 16.0)))

C

double code(double x) {
	return (x * 16.0) * x;
}

↓

double code(double x) {
	return x * (x * 16.0);
}

Fortran

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

↓

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

Java

public static double code(double x) {
	return (x * 16.0) * x;
}

↓

public static double code(double x) {
	return x * (x * 16.0);
}

Python

def code(x):
	return (x * 16.0) * x

↓

def code(x):
	return x * (x * 16.0)

Julia

function code(x)
	return Float64(Float64(x * 16.0) * x)
end

↓

function code(x)
	return Float64(x * Float64(x * 16.0))
end

MATLAB

function tmp = code(x)
	tmp = (x * 16.0) * x;
end

↓

function tmp = code(x)
	tmp = x * (x * 16.0);
end

Wolfram

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

↓

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

Derivation

1. Initial program 0

   \[\left(x \cdot 16\right) \cdot x \]

2. Final simplification 0

   \[\leadsto x \cdot \left(x \cdot 16\right) \]

Reproduce

herbie shell --seed 2022291 
(FPCore (x)
  :name "Graphics.Rasterific.CubicBezier:isSufficientlyFlat from Rasterific-0.6.1"
  :precision binary64
  (* (* x 16.0) x))