Average Error: 0.0 → 0.0
Time: 1.8s
Precision: binary64
\[t0 \cdot \left(Ay - Py\right) - t1 \cdot \left(Ax - Px\right)\]
↓
\[t0 \cdot \left(Ay - Py\right) - t1 \cdot \left(Ax - Px\right)\]
t0 \cdot \left(Ay - Py\right) - t1 \cdot \left(Ax - Px\right)
↓
t0 \cdot \left(Ay - Py\right) - t1 \cdot \left(Ax - Px\right)
double code(double t0, double Ay, double Py, double t1, double Ax, double Px) {
	return ((double) (((double) (t0 * ((double) (Ay - Py)))) - ((double) (t1 * ((double) (Ax - Px))))));
}
↓
double code(double t0, double Ay, double Py, double t1, double Ax, double Px) {
	return ((double) (((double) (t0 * ((double) (Ay - Py)))) - ((double) (t1 * ((double) (Ax - Px))))));
}

Error

Bits error versus t0

Bits error versus Ay

Bits error versus Py

Bits error versus t1

Bits error versus Ax

Bits error versus Px

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[t0 \cdot \left(Ay - Py\right) - t1 \cdot \left(Ax - Px\right)\]

  2. Final simplification0.0

    \[\leadsto t0 \cdot \left(Ay - Py\right) - t1 \cdot \left(Ax - Px\right)\]

Reproduce

herbie shell --seed 2020152 
(FPCore (t0 Ay Py t1 Ax Px)
  :name "(- (* t0 (- Ay Py)) (* t1 (- Ax Px)))"
  :precision binary64
  (- (* t0 (- Ay Py)) (* t1 (- Ax Px))))