Graphics.Rendering.Chart.Plot.Vectors:renderPlotVectors from Chart-1.5.3

Percentage Accurate: 77.5% → 100.0%

Time: 6.6s

Alternatives: 6

Speedup: 1.5×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 77.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(y, x, 1 - y\right) \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (fma y x (- 1.0 y)))

C

double code(double x, double y) {
	return fma(y, x, (1.0 - y));
}

Julia

function code(x, y)
	return fma(y, x, Float64(1.0 - y))
end

Wolfram

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

Derivation

1. Initial program 78.8%

   \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

   1. +-commutative N/A

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

   2. associate--l+ N/A

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

   3. *-commutative N/A

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

   4. mul-1-neg N/A

      \[\leadsto \left(1 + \color{blue}{\left(\mathsf{neg}\left(\left(1 - y\right)\right)\right)}\right) \cdot x + \left(1 - y\right) \]

   5. unsub-neg N/A

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

   6. associate--r- N/A

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

   7. metadata-eval N/A

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

   8. +-lft-identity N/A

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

   9. lower-fma.f64 N/A

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, x, 1 - y\right)} \]

   10. lower--.f64 100.0

       \[\leadsto \mathsf{fma}\left(y, x, \color{blue}{1 - y}\right) \]

5. Applied rewrites 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, x, 1 - y\right)} \]
6. Add Preprocessing

Alternative 2: 61.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;1 - y \leq -2000000 \lor \neg \left(1 - y \leq 1.00000002\right):\\ \;\;\;\;-y\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= (- 1.0 y) -2000000.0) (not (<= (- 1.0 y) 1.00000002))) (- y) 1.0))

C

double code(double x, double y) {
	double tmp;
	if (((1.0 - y) <= -2000000.0) || !((1.0 - y) <= 1.00000002)) {
		tmp = -y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (((1.0d0 - y) <= (-2000000.0d0)) .or. (.not. ((1.0d0 - y) <= 1.00000002d0))) then
        tmp = -y
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (((1.0 - y) <= -2000000.0) || !((1.0 - y) <= 1.00000002)) {
		tmp = -y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if ((1.0 - y) <= -2000000.0) or not ((1.0 - y) <= 1.00000002):
		tmp = -y
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((Float64(1.0 - y) <= -2000000.0) || !(Float64(1.0 - y) <= 1.00000002))
		tmp = Float64(-y);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (((1.0 - y) <= -2000000.0) || ~(((1.0 - y) <= 1.00000002)))
		tmp = -y;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[N[(1.0 - y), $MachinePrecision], -2000000.0], N[Not[LessEqual[N[(1.0 - y), $MachinePrecision], 1.00000002]], $MachinePrecision]], (-y), 1.0]

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 1 binary64) y) < -2e6 or 1.0000000200000001 < (-.f64 #s(literal 1 binary64) y)

   1. Initial program 99.7%

      \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{-1 \cdot \left(y \cdot \left(1 - x\right)\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. mul-1-neg N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\left(1 - x\right)\right)\right)} \cdot y \]

      5. sub-neg N/A

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

      6. +-commutative N/A

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

      7. distribute-neg-in N/A

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

      8. remove-double-neg N/A

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

      9. sub-neg N/A

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

      10. lower--.f64 98.5

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

   5. Applied rewrites 98.5%

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

   6. Taylor expanded in x around 0

      \[\leadsto -1 \cdot \color{blue}{y} \]
   7. Step-by-step derivation

   8. Applied rewrites 49.3%

      \[\leadsto -y \]

   if -2e6 < (-.f64 #s(literal 1 binary64) y) < 1.0000000200000001

   1. Initial program 61.3%

      \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. mul-1-neg N/A

         \[\leadsto \left(1 + \color{blue}{\left(\mathsf{neg}\left(\left(1 - y\right)\right)\right)}\right) \cdot x \]

      3. unsub-neg N/A

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

      4. associate--r- N/A

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

      5. metadata-eval N/A

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

      6. +-lft-identity N/A

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

      7. lower-*.f64 26.2

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

   5. Applied rewrites 26.2%

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

   6. Taylor expanded in y around 0

      \[\leadsto \color{blue}{1} \]
   7. Step-by-step derivation

   8. Applied rewrites 76.7%

      \[\leadsto \color{blue}{1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 64.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;1 - y \leq -2000000 \lor \neg \left(1 - y \leq 1.00000002\right):\\ \;\;\;\;-y\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 86.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.4 \cdot 10^{+28}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;x \leq 1.4 \cdot 10^{+38}:\\ \;\;\;\;1 - y\\ \mathbf{else}:\\ \;\;\;\;\left(x - 1\right) \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -4.4e+28) (* y x) (if (<= x 1.4e+38) (- 1.0 y) (* (- x 1.0) y))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -4.4e+28) {
		tmp = y * x;
	} else if (x <= 1.4e+38) {
		tmp = 1.0 - y;
	} else {
		tmp = (x - 1.0) * y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-4.4d+28)) then
        tmp = y * x
    else if (x <= 1.4d+38) then
        tmp = 1.0d0 - y
    else
        tmp = (x - 1.0d0) * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -4.4e+28) {
		tmp = y * x;
	} else if (x <= 1.4e+38) {
		tmp = 1.0 - y;
	} else {
		tmp = (x - 1.0) * y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -4.4e+28:
		tmp = y * x
	elif x <= 1.4e+38:
		tmp = 1.0 - y
	else:
		tmp = (x - 1.0) * y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -4.4e+28)
		tmp = Float64(y * x);
	elseif (x <= 1.4e+38)
		tmp = Float64(1.0 - y);
	else
		tmp = Float64(Float64(x - 1.0) * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -4.4e+28)
		tmp = y * x;
	elseif (x <= 1.4e+38)
		tmp = 1.0 - y;
	else
		tmp = (x - 1.0) * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -4.4e+28], N[(y * x), $MachinePrecision], If[LessEqual[x, 1.4e+38], N[(1.0 - y), $MachinePrecision], N[(N[(x - 1.0), $MachinePrecision] * y), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -4.39999999999999973e28

   1. Initial program 50.6%

      \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. mul-1-neg N/A

         \[\leadsto \left(1 + \color{blue}{\left(\mathsf{neg}\left(\left(1 - y\right)\right)\right)}\right) \cdot x \]

      3. unsub-neg N/A

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

      4. associate--r- N/A

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

      5. metadata-eval N/A

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

      6. +-lft-identity N/A

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

      7. lower-*.f64 77.9

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

   5. Applied rewrites 77.9%

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

   if -4.39999999999999973e28 < x < 1.4e38

   1. Initial program 97.3%

      \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{1 - y} \]
   4. Step-by-step derivation

      1. lower--.f64 97.8

         \[\leadsto \color{blue}{1 - y} \]

   5. Applied rewrites 97.8%

      \[\leadsto \color{blue}{1 - y} \]

   if 1.4e38 < x

   1. Initial program 58.3%

      \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{-1 \cdot \left(y \cdot \left(1 - x\right)\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. mul-1-neg N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\left(1 - x\right)\right)\right)} \cdot y \]

      5. sub-neg N/A

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

      6. +-commutative N/A

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

      7. distribute-neg-in N/A

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

      8. remove-double-neg N/A

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

      9. sub-neg N/A

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

      10. lower--.f64 83.5

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

   5. Applied rewrites 83.5%

      \[\leadsto \color{blue}{\left(x - 1\right) \cdot y} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 86.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.4 \cdot 10^{+28} \lor \neg \left(x \leq 1.4 \cdot 10^{+38}\right):\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;1 - y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -4.4e+28) (not (<= x 1.4e+38))) (* y x) (- 1.0 y)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -4.4e+28) || !(x <= 1.4e+38)) {
		tmp = y * x;
	} else {
		tmp = 1.0 - y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x <= (-4.4d+28)) .or. (.not. (x <= 1.4d+38))) then
        tmp = y * x
    else
        tmp = 1.0d0 - y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -4.4e+28) || !(x <= 1.4e+38)) {
		tmp = y * x;
	} else {
		tmp = 1.0 - y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -4.4e+28) or not (x <= 1.4e+38):
		tmp = y * x
	else:
		tmp = 1.0 - y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -4.4e+28) || !(x <= 1.4e+38))
		tmp = Float64(y * x);
	else
		tmp = Float64(1.0 - y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -4.4e+28) || ~((x <= 1.4e+38)))
		tmp = y * x;
	else
		tmp = 1.0 - y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -4.4e+28], N[Not[LessEqual[x, 1.4e+38]], $MachinePrecision]], N[(y * x), $MachinePrecision], N[(1.0 - y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -4.39999999999999973e28 or 1.4e38 < x

   1. Initial program 54.6%

      \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. mul-1-neg N/A

         \[\leadsto \left(1 + \color{blue}{\left(\mathsf{neg}\left(\left(1 - y\right)\right)\right)}\right) \cdot x \]

      3. unsub-neg N/A

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

      4. associate--r- N/A

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

      5. metadata-eval N/A

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

      6. +-lft-identity N/A

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

      7. lower-*.f64 80.8

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

   5. Applied rewrites 80.8%

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

   if -4.39999999999999973e28 < x < 1.4e38

   1. Initial program 97.3%

      \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{1 - y} \]
   4. Step-by-step derivation

      1. lower--.f64 97.8

         \[\leadsto \color{blue}{1 - y} \]

   5. Applied rewrites 97.8%

      \[\leadsto \color{blue}{1 - y} \]
3. Recombined 2 regimes into one program.

4. Final simplification 90.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.4 \cdot 10^{+28} \lor \neg \left(x \leq 1.4 \cdot 10^{+38}\right):\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;1 - y\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 62.9% accurate, 3.8× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (- 1.0 y))

C

double code(double x, double y) {
	return 1.0 - y;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = 1.0d0 - y
end function

Java

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

Python

def code(x, y):
	return 1.0 - y

Julia

function code(x, y)
	return Float64(1.0 - y)
end

MATLAB

function tmp = code(x, y)
	tmp = 1.0 - y;
end

Wolfram

code[x_, y_] := N[(1.0 - y), $MachinePrecision]

Derivation

1. Initial program 78.8%

   \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{1 - y} \]
4. Step-by-step derivation

   1. lower--.f64 65.1

      \[\leadsto \color{blue}{1 - y} \]

5. Applied rewrites 65.1%

   \[\leadsto \color{blue}{1 - y} \]
6. Add Preprocessing

Alternative 6: 39.0% accurate, 15.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 1.0)

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return 1.0

Julia

function code(x, y)
	return 1.0
end

MATLAB

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

Wolfram

code[x_, y_] := 1.0

Derivation

1. Initial program 78.8%

   \[x + \left(1 - x\right) \cdot \left(1 - y\right) \]
2. Add Preprocessing

3. Taylor expanded in x around inf

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

   1. *-commutative N/A

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

   2. mul-1-neg N/A

      \[\leadsto \left(1 + \color{blue}{\left(\mathsf{neg}\left(\left(1 - y\right)\right)\right)}\right) \cdot x \]

   3. unsub-neg N/A

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

   4. associate--r- N/A

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

   5. metadata-eval N/A

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

   6. +-lft-identity N/A

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

   7. lower-*.f64 37.5

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

5. Applied rewrites 37.5%

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

6. Taylor expanded in y around 0

   \[\leadsto \color{blue}{1} \]
7. Step-by-step derivation

8. Applied rewrites 43.0%

   \[\leadsto \color{blue}{1} \]
9. Add Preprocessing

Developer Target 1: 100.0% accurate, 1.3× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (- (* y x) (- y 1.0)))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024318 
(FPCore (x y)
  :name "Graphics.Rendering.Chart.Plot.Vectors:renderPlotVectors from Chart-1.5.3"
  :precision binary64

  :alt
  (! :herbie-platform default (- (* y x) (- y 1)))

  (+ x (* (- 1.0 x) (- 1.0 y))))