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

Percentage Accurate: 78.3% → 100.0%

Time: 7.0s

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: 78.3% 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\right) - y \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 Float64(fma(y, x, 1.0) - y)
end

Wolfram

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

Derivation

1. Initial program 77.4%

   \[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. lower--.f64 N/A

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

   2. +-commutative N/A

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

   3. *-commutative N/A

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

   4. mul-1-neg N/A

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

   5. unsub-neg N/A

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

   6. associate--r- N/A

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

   7. metadata-eval N/A

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

   8. +-lft-identity N/A

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

   9. lower-fma.f64 100.0

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

5. Simplified 100.0%

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

Alternative 2: 89.3% accurate, 0.3× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double t_0 = x + ((1.0 - x) * (1.0 - y));
	double t_1 = (y * x) - y;
	double tmp;
	if (t_0 <= -1000000000000.0) {
		tmp = t_1;
	} else if (t_0 <= 5e+15) {
		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 = x + ((1.0d0 - x) * (1.0d0 - y))
    t_1 = (y * x) - y
    if (t_0 <= (-1000000000000.0d0)) then
        tmp = t_1
    else if (t_0 <= 5d+15) 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 = x + ((1.0 - x) * (1.0 - y));
	double t_1 = (y * x) - y;
	double tmp;
	if (t_0 <= -1000000000000.0) {
		tmp = t_1;
	} else if (t_0 <= 5e+15) {
		tmp = 1.0 - y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(x + N[(N[(1.0 - x), $MachinePrecision] * N[(1.0 - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(y * x), $MachinePrecision] - y), $MachinePrecision]}, If[LessEqual[t$95$0, -1000000000000.0], t$95$1, If[LessEqual[t$95$0, 5e+15], 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))) < -1e12 or 5e15 < (+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y)))

   1. Initial program 97.2%

      \[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. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. distribute-lft-in N/A

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

      6. cancel-sign-sub-inv N/A

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

      7. *-rgt-identity N/A

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

      8. lower--.f64 N/A

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

      9. distribute-rgt-neg-out N/A

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

      10. distribute-lft-neg-in N/A

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

      11. remove-double-neg N/A

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

      12. lower-*.f64 99.8

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

   5. Simplified 99.8%

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

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

   1. Initial program 58.0%

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

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

   5. Simplified 79.7%

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

Alternative 3: 89.3% accurate, 0.3× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double t_0 = x + ((1.0 - x) * (1.0 - y));
	double t_1 = y * (x + -1.0);
	double tmp;
	if (t_0 <= -1000000000000.0) {
		tmp = t_1;
	} else if (t_0 <= 5e+15) {
		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 = x + ((1.0d0 - x) * (1.0d0 - y))
    t_1 = y * (x + (-1.0d0))
    if (t_0 <= (-1000000000000.0d0)) then
        tmp = t_1
    else if (t_0 <= 5d+15) 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 = x + ((1.0 - x) * (1.0 - y));
	double t_1 = y * (x + -1.0);
	double tmp;
	if (t_0 <= -1000000000000.0) {
		tmp = t_1;
	} else if (t_0 <= 5e+15) {
		tmp = 1.0 - y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(x + N[(N[(1.0 - x), $MachinePrecision] * N[(1.0 - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(y * N[(x + -1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -1000000000000.0], t$95$1, If[LessEqual[t$95$0, 5e+15], 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))) < -1e12 or 5e15 < (+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y)))

   1. Initial program 97.2%

      \[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. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. mul-1-neg N/A

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

      5. unsub-neg N/A

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

      6. associate--r- N/A

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

      7. metadata-eval N/A

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

      8. +-lft-identity N/A

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

      9. lower-fma.f64 100.0

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

   5. Simplified 100.0%

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

   6. Taylor expanded in y around inf

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

      1. distribute-rgt-out-- N/A

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

      2. cancel-sign-sub-inv N/A

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

      3. metadata-eval N/A

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

      4. +-commutative N/A

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

      5. cancel-sign-sub N/A

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

      6. mul-1-neg N/A

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

      7. distribute-rgt-out-- N/A

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

      8. unsub-neg N/A

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

      9. metadata-eval N/A

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

      10. distribute-neg-in N/A

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

      11. lower-*.f64 N/A

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

      12. neg-sub0 N/A

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

      13. mul-1-neg N/A

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

      14. unsub-neg N/A

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

      15. associate--r- N/A

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

      16. metadata-eval N/A

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

      17. +-commutative N/A

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

      18. lower-+.f64 99.8

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

   8. Simplified 99.8%

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

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

   1. Initial program 58.0%

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

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

   5. Simplified 79.7%

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

Alternative 4: 62.1% accurate, 0.3× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double t_0 = x + ((1.0 - x) * (1.0 - y));
	double tmp;
	if (t_0 <= -2.0) {
		tmp = -y;
	} else if (t_0 <= 4.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 = x + ((1.0d0 - x) * (1.0d0 - y))
    if (t_0 <= (-2.0d0)) then
        tmp = -y
    else if (t_0 <= 4.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 = x + ((1.0 - x) * (1.0 - y));
	double tmp;
	if (t_0 <= -2.0) {
		tmp = -y;
	} else if (t_0 <= 4.0) {
		tmp = 1.0;
	} else {
		tmp = -y;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(x + N[(N[(1.0 - x), $MachinePrecision] * N[(1.0 - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -2.0], (-y), If[LessEqual[t$95$0, 4.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))) < -2 or 4 < (+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y)))

   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 43.8

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

   5. Simplified 43.8%

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

   6. Taylor expanded in y around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 41.3

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

   8. Simplified 41.3%

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

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

   1. Initial program 55.9%

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

   3. Taylor expanded in y around 0

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

   5. Simplified 77.4%

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

Alternative 5: 86.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.95 \cdot 10^{+23}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;x \leq 410000:\\ \;\;\;\;1 - y\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.95e+23) (* y x) (if (<= x 410000.0) (- 1.0 y) (* y x))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.95e+23) {
		tmp = y * x;
	} else if (x <= 410000.0) {
		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 <= (-1.95d+23)) then
        tmp = y * x
    else if (x <= 410000.0d0) 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 <= -1.95e+23) {
		tmp = y * x;
	} else if (x <= 410000.0) {
		tmp = 1.0 - y;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -1.95e+23:
		tmp = y * x
	elif x <= 410000.0:
		tmp = 1.0 - y
	else:
		tmp = y * x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.95e+23)
		tmp = Float64(y * x);
	elseif (x <= 410000.0)
		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 <= -1.95e+23)
		tmp = y * x;
	elseif (x <= 410000.0)
		tmp = 1.0 - y;
	else
		tmp = y * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.95e+23], N[(y * x), $MachinePrecision], If[LessEqual[x, 410000.0], N[(1.0 - y), $MachinePrecision], N[(y * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -1.95e23 or 4.1e5 < x

   1. Initial program 56.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 76.4

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

   5. Simplified 76.4%

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

   if -1.95e23 < x < 4.1e5

   1. Initial program 98.5%

      \[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.4

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

   5. Simplified 97.4%

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

Alternative 6: 63.1% 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 77.4%

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

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

5. Simplified 60.6%

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

Alternative 7: 38.8% 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 77.4%

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

3. Taylor expanded in y around 0

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

5. Simplified 38.7%

   \[\leadsto \color{blue}{1} \]
6. 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 2024208 
(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))))