Diagrams.Color.HSV:lerp from diagrams-contrib-1.3.0.5

Percentage Accurate: 97.8% → 100.0%

Time: 4.9s

Alternatives: 6

Speedup: 1.3×

• 20.9% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 97.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 96.5%

   \[\left(1 - x\right) \cdot y + x \cdot z \]
2. Step-by-step derivation

   1. *-commutative 96.5%

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

   2. distribute-rgt-out-- 96.5%

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

   3. *-lft-identity 96.5%

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

   4. associate-+l- 96.5%

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

   5. distribute-lft-out-- 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{y - x \cdot \left(y - z\right)} \]
4. Add Preprocessing
5. Add Preprocessing

Alternative 2: 62.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.4 \cdot 10^{+221}:\\ \;\;\;\;x \cdot z\\ \mathbf{elif}\;x \leq -7.6 \cdot 10^{+113}:\\ \;\;\;\;y \cdot \left(-x\right)\\ \mathbf{elif}\;x \leq -8.6 \cdot 10^{-59} \lor \neg \left(x \leq 2.8 \cdot 10^{-34}\right):\\ \;\;\;\;x \cdot z\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -2.4e+221)
   (* x z)
   (if (<= x -7.6e+113)
     (* y (- x))
     (if (or (<= x -8.6e-59) (not (<= x 2.8e-34))) (* x z) y))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -2.4e+221) {
		tmp = x * z;
	} else if (x <= -7.6e+113) {
		tmp = y * -x;
	} else if ((x <= -8.6e-59) || !(x <= 2.8e-34)) {
		tmp = x * z;
	} else {
		tmp = y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= (-2.4d+221)) then
        tmp = x * z
    else if (x <= (-7.6d+113)) then
        tmp = y * -x
    else if ((x <= (-8.6d-59)) .or. (.not. (x <= 2.8d-34))) then
        tmp = x * z
    else
        tmp = y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -2.4e+221) {
		tmp = x * z;
	} else if (x <= -7.6e+113) {
		tmp = y * -x;
	} else if ((x <= -8.6e-59) || !(x <= 2.8e-34)) {
		tmp = x * z;
	} else {
		tmp = y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -2.4e+221:
		tmp = x * z
	elif x <= -7.6e+113:
		tmp = y * -x
	elif (x <= -8.6e-59) or not (x <= 2.8e-34):
		tmp = x * z
	else:
		tmp = y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -2.4e+221)
		tmp = Float64(x * z);
	elseif (x <= -7.6e+113)
		tmp = Float64(y * Float64(-x));
	elseif ((x <= -8.6e-59) || !(x <= 2.8e-34))
		tmp = Float64(x * z);
	else
		tmp = y;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -2.4e+221)
		tmp = x * z;
	elseif (x <= -7.6e+113)
		tmp = y * -x;
	elseif ((x <= -8.6e-59) || ~((x <= 2.8e-34)))
		tmp = x * z;
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -2.4e+221], N[(x * z), $MachinePrecision], If[LessEqual[x, -7.6e+113], N[(y * (-x)), $MachinePrecision], If[Or[LessEqual[x, -8.6e-59], N[Not[LessEqual[x, 2.8e-34]], $MachinePrecision]], N[(x * z), $MachinePrecision], y]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.40000000000000019e221 or -7.6000000000000007e113 < x < -8.6000000000000006e-59 or 2.79999999999999997e-34 < x

   1. Initial program 94.4%

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

   3. Taylor expanded in y around 0 65.6%

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

   if -2.40000000000000019e221 < x < -7.6000000000000007e113

   1. Initial program 91.3%

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

   3. Taylor expanded in x around inf 100.0%

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

      1. mul-1-neg 100.0%

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

      2. sub-neg 100.0%

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

   5. Simplified 100.0%

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

   6. Taylor expanded in z around 0 76.7%

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

      1. associate-*r* 76.7%

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

      2. mul-1-neg 76.7%

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

   8. Simplified 76.7%

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

   if -8.6000000000000006e-59 < x < 2.79999999999999997e-34

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 72.5%

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

4. Final simplification 69.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.4 \cdot 10^{+221}:\\ \;\;\;\;x \cdot z\\ \mathbf{elif}\;x \leq -7.6 \cdot 10^{+113}:\\ \;\;\;\;y \cdot \left(-x\right)\\ \mathbf{elif}\;x \leq -8.6 \cdot 10^{-59} \lor \neg \left(x \leq 2.8 \cdot 10^{-34}\right):\\ \;\;\;\;x \cdot z\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 97.6% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.0) (not (<= x 4.4e-34))) (* x (- z y)) (+ y (* x z))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1 or 4.3999999999999998e-34 < x

   1. Initial program 93.4%

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

   3. Taylor expanded in x around inf 98.8%

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

      1. mul-1-neg 98.8%

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

      2. sub-neg 98.8%

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

   5. Simplified 98.8%

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

   if -1 < x < 4.3999999999999998e-34

   1. Initial program 100.0%

      \[\left(1 - x\right) \cdot y + x \cdot z \]
   2. Step-by-step derivation

      1. *-commutative 100.0%

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

      2. distribute-rgt-out-- 100.0%

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

      3. *-lft-identity 100.0%

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

      4. associate-+l- 100.0%

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

      5. distribute-lft-out-- 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{y - x \cdot \left(y - z\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 99.3%

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

      1. neg-mul-1 99.3%

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

      2. distribute-lft-neg-in 99.3%

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

   7. Simplified 99.3%

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

      1. cancel-sign-sub 99.3%

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

      2. +-commutative 99.3%

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

   9. Applied egg-rr 99.3%

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

4. Final simplification 99.0%

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

Alternative 4: 85.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -5.6 \cdot 10^{-61} \lor \neg \left(x \leq 2.8 \cdot 10^{-34}\right):\\ \;\;\;\;x \cdot \left(z - y\right)\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -5.6e-61) (not (<= x 2.8e-34))) (* x (- z y)) y))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -5.6e-61) || !(x <= 2.8e-34)) {
		tmp = x * (z - y);
	} else {
		tmp = y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((x <= (-5.6d-61)) .or. (.not. (x <= 2.8d-34))) then
        tmp = x * (z - y)
    else
        tmp = y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -5.6e-61) || !(x <= 2.8e-34)) {
		tmp = x * (z - y);
	} else {
		tmp = y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -5.6e-61) or not (x <= 2.8e-34):
		tmp = x * (z - y)
	else:
		tmp = y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -5.6e-61) || !(x <= 2.8e-34))
		tmp = Float64(x * Float64(z - y));
	else
		tmp = y;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -5.6e-61) || ~((x <= 2.8e-34)))
		tmp = x * (z - y);
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -5.6e-61], N[Not[LessEqual[x, 2.8e-34]], $MachinePrecision]], N[(x * N[(z - y), $MachinePrecision]), $MachinePrecision], y]

Derivation

1. Split input into 2 regimes

2. if x < -5.6000000000000002e-61 or 2.79999999999999997e-34 < x

   1. Initial program 93.9%

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

   3. Taylor expanded in x around inf 96.5%

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

      1. mul-1-neg 96.5%

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

      2. sub-neg 96.5%

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

   5. Simplified 96.5%

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

   if -5.6000000000000002e-61 < x < 2.79999999999999997e-34

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 72.5%

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

4. Final simplification 86.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -5.6 \cdot 10^{-61} \lor \neg \left(x \leq 2.8 \cdot 10^{-34}\right):\\ \;\;\;\;x \cdot \left(z - y\right)\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 61.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.25 \cdot 10^{-58} \lor \neg \left(x \leq 3.25 \cdot 10^{-34}\right):\\ \;\;\;\;x \cdot z\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.25e-58) (not (<= x 3.25e-34))) (* x z) y))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.25e-58) || !(x <= 3.25e-34)) {
		tmp = x * z;
	} else {
		tmp = y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((x <= (-1.25d-58)) .or. (.not. (x <= 3.25d-34))) then
        tmp = x * z
    else
        tmp = y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.25e-58) || !(x <= 3.25e-34)) {
		tmp = x * z;
	} else {
		tmp = y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1.25e-58) or not (x <= 3.25e-34):
		tmp = x * z
	else:
		tmp = y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.25e-58) || !(x <= 3.25e-34))
		tmp = Float64(x * z);
	else
		tmp = y;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -1.25e-58) || ~((x <= 3.25e-34)))
		tmp = x * z;
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.25e-58], N[Not[LessEqual[x, 3.25e-34]], $MachinePrecision]], N[(x * z), $MachinePrecision], y]

Derivation

1. Split input into 2 regimes

2. if x < -1.24999999999999994e-58 or 3.24999999999999993e-34 < x

   1. Initial program 93.9%

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

   3. Taylor expanded in y around 0 59.8%

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

   if -1.24999999999999994e-58 < x < 3.24999999999999993e-34

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 72.5%

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

4. Final simplification 65.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.25 \cdot 10^{-58} \lor \neg \left(x \leq 3.25 \cdot 10^{-34}\right):\\ \;\;\;\;x \cdot z\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 37.0% accurate, 9.0× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 y)

C

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

Fortran

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

Java

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

Python

def code(x, y, z):
	return y

Julia

function code(x, y, z)
	return y
end

MATLAB

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

Wolfram

code[x_, y_, z_] := y

Derivation

1. Initial program 96.5%

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

3. Taylor expanded in x around 0 33.4%

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

Developer Target 1: 100.0% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024131 
(FPCore (x y z)
  :name "Diagrams.Color.HSV:lerp  from diagrams-contrib-1.3.0.5"
  :precision binary64

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

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