Diagrams.Trail:splitAtParam from diagrams-lib-1.3.0.3, C

Percentage Accurate: 100.0% → 100.0%

Time: 6.1s

Alternatives: 7

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\frac{x - y}{1 - y} \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 86.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2800 \lor \neg \left(y \leq 580\right):\\ \;\;\;\;1 + \frac{1 - x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{1 - y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -2800.0) (not (<= y 580.0)))
   (+ 1.0 (/ (- 1.0 x) y))
   (/ x (- 1.0 y))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -2800.0) || !(y <= 580.0)) {
		tmp = 1.0 + ((1.0 - x) / 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 ((y <= (-2800.0d0)) .or. (.not. (y <= 580.0d0))) then
        tmp = 1.0d0 + ((1.0d0 - x) / 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 ((y <= -2800.0) || !(y <= 580.0)) {
		tmp = 1.0 + ((1.0 - x) / y);
	} else {
		tmp = x / (1.0 - y);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -2800.0) or not (y <= 580.0):
		tmp = 1.0 + ((1.0 - x) / y)
	else:
		tmp = x / (1.0 - y)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -2800.0) || !(y <= 580.0))
		tmp = Float64(1.0 + Float64(Float64(1.0 - x) / y));
	else
		tmp = Float64(x / Float64(1.0 - y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -2800.0) || ~((y <= 580.0)))
		tmp = 1.0 + ((1.0 - x) / y);
	else
		tmp = x / (1.0 - y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -2800.0], N[Not[LessEqual[y, 580.0]], $MachinePrecision]], N[(1.0 + N[(N[(1.0 - x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(x / N[(1.0 - y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2800 or 580 < y

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 99.7%

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

      1. +-commutative 99.7%

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

      2. mul-1-neg 99.7%

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

      3. sub-neg 99.7%

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

      4. div-sub 99.7%

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

   5. Simplified 99.7%

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

   if -2800 < y < 580

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 72.5%

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

4. Final simplification 86.3%

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

Alternative 3: 86.3% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -5500.0) (not (<= y 66000000.0)))
   (- 1.0 (/ x y))
   (/ x (- 1.0 y))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -5500.0) || !(y <= 66000000.0)) {
		tmp = 1.0 - (x / 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 ((y <= (-5500.0d0)) .or. (.not. (y <= 66000000.0d0))) then
        tmp = 1.0d0 - (x / 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 ((y <= -5500.0) || !(y <= 66000000.0)) {
		tmp = 1.0 - (x / y);
	} else {
		tmp = x / (1.0 - y);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -5500.0) or not (y <= 66000000.0):
		tmp = 1.0 - (x / y)
	else:
		tmp = x / (1.0 - y)
	return tmp

Julia

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

MATLAB

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

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -5500.0], N[Not[LessEqual[y, 66000000.0]], $MachinePrecision]], N[(1.0 - N[(x / y), $MachinePrecision]), $MachinePrecision], N[(x / N[(1.0 - y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -5500 or 6.6e7 < y

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 99.7%

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

      1. +-commutative 99.7%

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

      2. mul-1-neg 99.7%

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

      3. sub-neg 99.7%

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

      4. div-sub 99.7%

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

   5. Simplified 99.7%

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

   6. Taylor expanded in x around inf 99.3%

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

      1. neg-mul-1 99.3%

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

      2. distribute-neg-frac2 99.3%

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

   8. Simplified 99.3%

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

   9. Taylor expanded in x around 0 99.3%

      \[\leadsto \color{blue}{1 + -1 \cdot \frac{x}{y}} \]
   10. Step-by-step derivation

       1. mul-1-neg 99.3%

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

       2. sub-neg 99.3%

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

   11. Simplified 99.3%

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

   if -5500 < y < 6.6e7

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 72.5%

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

4. Final simplification 86.1%

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

Alternative 4: 85.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6.8 \cdot 10^{-21} \lor \neg \left(y \leq 1\right):\\ \;\;\;\;1 - \frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -6.8e-21) (not (<= y 1.0))) (- 1.0 (/ x y)) x))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -6.8e-21) || !(y <= 1.0)) {
		tmp = 1.0 - (x / y);
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

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

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -6.8e-21) || !(y <= 1.0)) {
		tmp = 1.0 - (x / y);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -6.8e-21) or not (y <= 1.0):
		tmp = 1.0 - (x / y)
	else:
		tmp = x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -6.8e-21) || !(y <= 1.0))
		tmp = Float64(1.0 - Float64(x / y));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -6.8e-21) || ~((y <= 1.0)))
		tmp = 1.0 - (x / y);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -6.8e-21], N[Not[LessEqual[y, 1.0]], $MachinePrecision]], N[(1.0 - N[(x / y), $MachinePrecision]), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if y < -6.8e-21 or 1 < y

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 96.2%

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

      1. +-commutative 96.2%

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

      2. mul-1-neg 96.2%

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

      3. sub-neg 96.2%

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

      4. div-sub 96.2%

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

   5. Simplified 96.2%

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

   6. Taylor expanded in x around inf 96.2%

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

      1. neg-mul-1 96.2%

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

      2. distribute-neg-frac2 96.2%

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

   8. Simplified 96.2%

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

   9. Taylor expanded in x around 0 96.2%

      \[\leadsto \color{blue}{1 + -1 \cdot \frac{x}{y}} \]
   10. Step-by-step derivation

       1. mul-1-neg 96.2%

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

       2. sub-neg 96.2%

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

   11. Simplified 96.2%

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

   if -6.8e-21 < y < 1

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 73.5%

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

4. Final simplification 85.5%

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

Alternative 5: 86.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -11000:\\ \;\;\;\;\frac{y - x}{y}\\ \mathbf{elif}\;y \leq 5500000:\\ \;\;\;\;\frac{x}{1 - y}\\ \mathbf{else}:\\ \;\;\;\;1 - \frac{x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -11000.0)
   (/ (- y x) y)
   (if (<= y 5500000.0) (/ x (- 1.0 y)) (- 1.0 (/ x y)))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -11000.0) {
		tmp = (y - x) / y;
	} else if (y <= 5500000.0) {
		tmp = x / (1.0 - y);
	} else {
		tmp = 1.0 - (x / y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= (-11000.0d0)) then
        tmp = (y - x) / y
    else if (y <= 5500000.0d0) then
        tmp = x / (1.0d0 - y)
    else
        tmp = 1.0d0 - (x / y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -11000.0) {
		tmp = (y - x) / y;
	} else if (y <= 5500000.0) {
		tmp = x / (1.0 - y);
	} else {
		tmp = 1.0 - (x / y);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -11000.0:
		tmp = (y - x) / y
	elif y <= 5500000.0:
		tmp = x / (1.0 - y)
	else:
		tmp = 1.0 - (x / y)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -11000.0)
		tmp = Float64(Float64(y - x) / y);
	elseif (y <= 5500000.0)
		tmp = Float64(x / Float64(1.0 - y));
	else
		tmp = Float64(1.0 - Float64(x / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -11000.0)
		tmp = (y - x) / y;
	elseif (y <= 5500000.0)
		tmp = x / (1.0 - y);
	else
		tmp = 1.0 - (x / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -11000.0], N[(N[(y - x), $MachinePrecision] / y), $MachinePrecision], If[LessEqual[y, 5500000.0], N[(x / N[(1.0 - y), $MachinePrecision]), $MachinePrecision], N[(1.0 - N[(x / y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -11000

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 99.4%

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

      1. +-commutative 99.4%

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

      2. mul-1-neg 99.4%

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

      3. sub-neg 99.4%

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

      4. div-sub 99.4%

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

   5. Simplified 99.4%

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

   6. Taylor expanded in x around inf 99.1%

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

      1. neg-mul-1 99.1%

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

      2. distribute-neg-frac2 99.1%

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

   8. Simplified 99.1%

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

   9. Taylor expanded in y around 0 99.1%

      \[\leadsto \color{blue}{\frac{y + -1 \cdot x}{y}} \]
   10. Step-by-step derivation

       1. neg-mul-1 99.1%

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

       2. unsub-neg 99.1%

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

   11. Simplified 99.1%

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

   if -11000 < y < 5.5e6

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 72.5%

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

   if 5.5e6 < y

   1. Initial program 99.9%

      \[\frac{x - y}{1 - y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 100.0%

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

      1. +-commutative 100.0%

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

      2. mul-1-neg 100.0%

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

      3. sub-neg 100.0%

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

      4. div-sub 100.0%

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

   5. Simplified 100.0%

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

   6. Taylor expanded in x around inf 99.7%

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

      1. neg-mul-1 99.7%

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

      2. distribute-neg-frac2 99.7%

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

   8. Simplified 99.7%

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

   9. Taylor expanded in x around 0 99.7%

      \[\leadsto \color{blue}{1 + -1 \cdot \frac{x}{y}} \]
   10. Step-by-step derivation

       1. mul-1-neg 99.7%

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

       2. sub-neg 99.7%

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

   11. Simplified 99.7%

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

Alternative 6: 72.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6.8 \cdot 10^{-21}:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -6.8e-21) 1.0 (if (<= y 1.0) x 1.0)))

C

double code(double x, double y) {
	double tmp;
	if (y <= -6.8e-21) {
		tmp = 1.0;
	} else if (y <= 1.0) {
		tmp = x;
	} 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 (y <= (-6.8d-21)) then
        tmp = 1.0d0
    else if (y <= 1.0d0) then
        tmp = x
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -6.8e-21) {
		tmp = 1.0;
	} else if (y <= 1.0) {
		tmp = x;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -6.8e-21:
		tmp = 1.0
	elif y <= 1.0:
		tmp = x
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -6.8e-21)
		tmp = 1.0;
	elseif (y <= 1.0)
		tmp = x;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -6.8e-21)
		tmp = 1.0;
	elseif (y <= 1.0)
		tmp = x;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -6.8e-21], 1.0, If[LessEqual[y, 1.0], x, 1.0]]

Derivation

1. Split input into 2 regimes

2. if y < -6.8e-21 or 1 < y

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 79.0%

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

   if -6.8e-21 < y < 1

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 73.5%

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

Alternative 7: 38.7% accurate, 7.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 100.0%

   \[\frac{x - y}{1 - y} \]
2. Add Preprocessing

3. Taylor expanded in y around inf 43.3%

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

Reproduce

herbie shell --seed 2024088 
(FPCore (x y)
  :name "Diagrams.Trail:splitAtParam  from diagrams-lib-1.3.0.3, C"
  :precision binary64
  (/ (- x y) (- 1.0 y)))