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

Percentage Accurate: 77.7% → 100.0%

Time: 7.2s

Alternatives: 7

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.7% 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 75.6%

   \[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: 88.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(1 - x\right) \cdot \left(1 - y\right) + x\\ t_1 := \mathsf{fma}\left(y, x, -y\right)\\ \mathbf{if}\;t\_0 \leq -5 \cdot 10^{+14}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq 1000000:\\ \;\;\;\;1 - y\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (+ (* (- 1.0 x) (- 1.0 y)) x)) (t_1 (fma y x (- y))))
   (if (<= t_0 -5e+14) t_1 (if (<= t_0 1000000.0) (- 1.0 y) t_1))))

C

double code(double x, double y) {
	double t_0 = ((1.0 - x) * (1.0 - y)) + x;
	double t_1 = fma(y, x, -y);
	double tmp;
	if (t_0 <= -5e+14) {
		tmp = t_1;
	} else if (t_0 <= 1000000.0) {
		tmp = 1.0 - y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(Float64(Float64(1.0 - x) * Float64(1.0 - y)) + x)
	t_1 = fma(y, x, Float64(-y))
	tmp = 0.0
	if (t_0 <= -5e+14)
		tmp = t_1;
	elseif (t_0 <= 1000000.0)
		tmp = Float64(1.0 - y);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(N[(1.0 - x), $MachinePrecision] * N[(1.0 - y), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]}, Block[{t$95$1 = N[(y * x + (-y)), $MachinePrecision]}, If[LessEqual[t$95$0, -5e+14], t$95$1, If[LessEqual[t$95$0, 1000000.0], N[(1.0 - y), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y))) < -5e14 or 1e6 < (+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y)))

   1. Initial program 99.1%

      \[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 46.6

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

   5. Applied rewrites 46.6%

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

   6. Taylor expanded in y around inf

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

      1. associate-*r* N/A

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

      2. distribute-lft-out-- N/A

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

      3. *-rgt-identity N/A

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

      4. mul-1-neg N/A

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

      5. cancel-sign-sub N/A

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

      6. *-commutative N/A

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

      7. +-commutative N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. mul-1-neg N/A

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

      11. lower-neg.f64 100.0

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

   8. Applied rewrites 100.0%

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

   if -5e14 < (+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y))) < 1e6

   1. Initial program 51.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 80.2

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

   5. Applied rewrites 80.2%

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

4. Final simplification 90.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(1 - x\right) \cdot \left(1 - y\right) + x \leq -5 \cdot 10^{+14}:\\ \;\;\;\;\mathsf{fma}\left(y, x, -y\right)\\ \mathbf{elif}\;\left(1 - x\right) \cdot \left(1 - y\right) + x \leq 1000000:\\ \;\;\;\;1 - y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, x, -y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 88.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(1 - x\right) \cdot \left(1 - y\right) + x\\ t_1 := \left(x - 1\right) \cdot y\\ \mathbf{if}\;t\_0 \leq -5 \cdot 10^{+14}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq 1000000:\\ \;\;\;\;1 - y\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (+ (* (- 1.0 x) (- 1.0 y)) x)) (t_1 (* (- x 1.0) y)))
   (if (<= t_0 -5e+14) t_1 (if (<= t_0 1000000.0) (- 1.0 y) t_1))))

C

double code(double x, double y) {
	double t_0 = ((1.0 - x) * (1.0 - y)) + x;
	double t_1 = (x - 1.0) * y;
	double tmp;
	if (t_0 <= -5e+14) {
		tmp = t_1;
	} else if (t_0 <= 1000000.0) {
		tmp = 1.0 - y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = ((1.0d0 - x) * (1.0d0 - y)) + x
    t_1 = (x - 1.0d0) * y
    if (t_0 <= (-5d+14)) then
        tmp = t_1
    else if (t_0 <= 1000000.0d0) then
        tmp = 1.0d0 - y
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = ((1.0 - x) * (1.0 - y)) + x;
	double t_1 = (x - 1.0) * y;
	double tmp;
	if (t_0 <= -5e+14) {
		tmp = t_1;
	} else if (t_0 <= 1000000.0) {
		tmp = 1.0 - y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = ((1.0 - x) * (1.0 - y)) + x
	t_1 = (x - 1.0) * y
	tmp = 0
	if t_0 <= -5e+14:
		tmp = t_1
	elif t_0 <= 1000000.0:
		tmp = 1.0 - y
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(Float64(1.0 - x) * Float64(1.0 - y)) + x)
	t_1 = Float64(Float64(x - 1.0) * y)
	tmp = 0.0
	if (t_0 <= -5e+14)
		tmp = t_1;
	elseif (t_0 <= 1000000.0)
		tmp = Float64(1.0 - y);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = ((1.0 - x) * (1.0 - y)) + x;
	t_1 = (x - 1.0) * y;
	tmp = 0.0;
	if (t_0 <= -5e+14)
		tmp = t_1;
	elseif (t_0 <= 1000000.0)
		tmp = 1.0 - y;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(N[(1.0 - x), $MachinePrecision] * N[(1.0 - y), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x - 1.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$0, -5e+14], t$95$1, If[LessEqual[t$95$0, 1000000.0], N[(1.0 - y), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y))) < -5e14 or 1e6 < (+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y)))

   1. Initial program 99.1%

      \[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 99.9

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

   5. Applied rewrites 99.9%

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

   if -5e14 < (+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y))) < 1e6

   1. Initial program 51.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 80.2

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

   5. Applied rewrites 80.2%

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

4. Final simplification 90.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(1 - x\right) \cdot \left(1 - y\right) + x \leq -5 \cdot 10^{+14}:\\ \;\;\;\;\left(x - 1\right) \cdot y\\ \mathbf{elif}\;\left(1 - x\right) \cdot \left(1 - y\right) + x \leq 1000000:\\ \;\;\;\;1 - y\\ \mathbf{else}:\\ \;\;\;\;\left(x - 1\right) \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 61.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(1 - x\right) \cdot \left(1 - y\right) + x\\ \mathbf{if}\;t\_0 \leq -10000:\\ \;\;\;\;-y\\ \mathbf{elif}\;t\_0 \leq 2:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (+ (* (- 1.0 x) (- 1.0 y)) x)))
   (if (<= t_0 -10000.0) (- y) (if (<= t_0 2.0) 1.0 (- y)))))

C

double code(double x, double y) {
	double t_0 = ((1.0 - x) * (1.0 - y)) + x;
	double tmp;
	if (t_0 <= -10000.0) {
		tmp = -y;
	} else if (t_0 <= 2.0) {
		tmp = 1.0;
	} else {
		tmp = -y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = ((1.0d0 - x) * (1.0d0 - y)) + x
    if (t_0 <= (-10000.0d0)) then
        tmp = -y
    else if (t_0 <= 2.0d0) then
        tmp = 1.0d0
    else
        tmp = -y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = ((1.0 - x) * (1.0 - y)) + x;
	double tmp;
	if (t_0 <= -10000.0) {
		tmp = -y;
	} else if (t_0 <= 2.0) {
		tmp = 1.0;
	} else {
		tmp = -y;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = ((1.0 - x) * (1.0 - y)) + x
	tmp = 0
	if t_0 <= -10000.0:
		tmp = -y
	elif t_0 <= 2.0:
		tmp = 1.0
	else:
		tmp = -y
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(Float64(1.0 - x) * Float64(1.0 - y)) + x)
	tmp = 0.0
	if (t_0 <= -10000.0)
		tmp = Float64(-y);
	elseif (t_0 <= 2.0)
		tmp = 1.0;
	else
		tmp = Float64(-y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = ((1.0 - x) * (1.0 - y)) + x;
	tmp = 0.0;
	if (t_0 <= -10000.0)
		tmp = -y;
	elseif (t_0 <= 2.0)
		tmp = 1.0;
	else
		tmp = -y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(N[(1.0 - x), $MachinePrecision] * N[(1.0 - y), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[t$95$0, -10000.0], (-y), If[LessEqual[t$95$0, 2.0], 1.0, (-y)]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y))) < -1e4 or 2 < (+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y)))

   1. Initial program 99.1%

      \[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 97.9

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

   5. Applied rewrites 97.9%

      \[\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 54.8%

      \[\leadsto -y \]

   if -1e4 < (+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y))) < 2

   1. Initial program 49.9%

      \[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 21.9

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

   5. Applied rewrites 21.9%

      \[\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 79.7%

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

4. Final simplification 66.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(1 - x\right) \cdot \left(1 - y\right) + x \leq -10000:\\ \;\;\;\;-y\\ \mathbf{elif}\;\left(1 - x\right) \cdot \left(1 - y\right) + x \leq 2:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-y\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 85.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -6.4 \cdot 10^{+112}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;x \leq 2.4 \cdot 10^{+25}:\\ \;\;\;\;1 - y\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -6.4e+112) (* y x) (if (<= x 2.4e+25) (- 1.0 y) (* y x))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -6.4e+112) {
		tmp = y * x;
	} else if (x <= 2.4e+25) {
		tmp = 1.0 - y;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-6.4d+112)) then
        tmp = y * x
    else if (x <= 2.4d+25) then
        tmp = 1.0d0 - y
    else
        tmp = y * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -6.4e+112) {
		tmp = y * x;
	} else if (x <= 2.4e+25) {
		tmp = 1.0 - y;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -6.4e+112:
		tmp = y * x
	elif x <= 2.4e+25:
		tmp = 1.0 - y
	else:
		tmp = y * x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -6.4e+112)
		tmp = Float64(y * x);
	elseif (x <= 2.4e+25)
		tmp = Float64(1.0 - y);
	else
		tmp = Float64(y * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -6.4e+112)
		tmp = y * x;
	elseif (x <= 2.4e+25)
		tmp = 1.0 - y;
	else
		tmp = y * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -6.4e+112], N[(y * x), $MachinePrecision], If[LessEqual[x, 2.4e+25], N[(1.0 - y), $MachinePrecision], N[(y * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -6.39999999999999972e112 or 2.39999999999999996e25 < x

   1. Initial program 51.2%

      \[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 73.9

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

   5. Applied rewrites 73.9%

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

   if -6.39999999999999972e112 < x < 2.39999999999999996e25

   1. Initial program 91.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 93.2

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

   5. Applied rewrites 93.2%

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

Alternative 6: 62.8% 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 75.6%

   \[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 67.6

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

5. Applied rewrites 67.6%

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

Alternative 7: 38.5% 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 75.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 34.0

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

5. Applied rewrites 34.0%

   \[\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 39.6%

   \[\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 2024296 
(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))))