FastMath test1
Time bar (total: 18.3s)
| 1× | search |
| Probability | Valid | Unknown | Precondition | Infinite | Domain | Can't | Iter |
|---|---|---|---|---|---|---|---|
| 0% | 0% | 100% | 0% | 0% | 0% | 0% | 0 |
| 100% | 100% | 0% | 0% | 0% | 0% | 0% | 1 |
Compiled 9 to 8 computations (11.1% saved)
| 285.0ms | 8 256× | 0 | valid |
ival-mult!: 100.0ms (82.9% of total)ival-add!: 19.0ms (15.8% of total)adjust: 2.0ms (1.7% of total)Useful iterations: 2 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 11 | 10 |
| 1 | 31 | 10 |
| 2 | 71 | 9 |
| 3 | 84 | 9 |
| 1× | saturated |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 99.6% | (+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64))) |
(negabs d)
Compiled 12 to 12 computations (0% saved)
| Inputs |
|---|
(+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64))) |
(*.f64 d #s(literal 10 binary64)) |
d |
#s(literal 10 binary64) |
(*.f64 d #s(literal 20 binary64)) |
#s(literal 20 binary64) |
| Outputs |
|---|
#s(approx (+ (* d 10) (* d 20)) #s(hole binary64 (* 30 d))) |
#s(approx (* d 10) #s(hole binary64 (* 10 d))) |
#s(approx d #s(hole binary64 d)) |
#s(approx (* d 20) #s(hole binary64 (* 20 d))) |
3 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 1.0ms | d | @ | -inf | ((+ (* d 10) (* d 20)) (* d 10) d 10 (* d 20) 20) |
| 1.0ms | d | @ | inf | ((+ (* d 10) (* d 20)) (* d 10) d 10 (* d 20) 20) |
| 1.0ms | d | @ | 0 | ((+ (* d 10) (* d 20)) (* d 10) d 10 (* d 20) 20) |
| Inputs |
|---|
(+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64))) |
(*.f64 d #s(literal 10 binary64)) |
d |
#s(literal 10 binary64) |
(*.f64 d #s(literal 20 binary64)) |
#s(literal 20 binary64) |
#s(approx (+ (* d 10) (* d 20)) #s(hole binary64 (* 30 d))) |
#s(approx (* d 10) #s(hole binary64 (* 10 d))) |
#s(approx d #s(hole binary64 d)) |
#s(approx (* d 20) #s(hole binary64 (* 20 d))) |
| Outputs |
|---|
(*.f64 #s(literal 30 binary64) d) |
(*.f64 #s(literal 10 binary64) d) |
d |
#s(literal 10 binary64) |
(*.f64 #s(literal 20 binary64) d) |
#s(literal 20 binary64) |
#s(approx (* d 30) (*.f64 #s(literal 30 binary64) d)) |
#s(approx (* 10 d) (*.f64 #s(literal 10 binary64) d)) |
#s(approx d d) |
#s(approx (* 20 d) (*.f64 #s(literal 20 binary64) d)) |
Compiled 20 to 17 computations (15% saved)
3 alts after pruning (3 fresh and 0 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 7 | 3 | 10 |
| Fresh | 0 | 0 | 0 |
| Picked | 1 | 0 | 1 |
| Done | 0 | 0 | 0 |
| Total | 8 | 3 | 11 |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (*.f64 #s(literal 30 binary64) d) |
| ▶ | 15.2% | #s(approx d d) |
| ▶ | 5.3% | #s(literal 10 binary64) |
Compiled 6 to 7 computations (-16.7% saved)
| Inputs |
|---|
#s(literal 10 binary64) |
#s(approx d d) |
d |
(*.f64 #s(literal 30 binary64) d) |
#s(literal 30 binary64) |
| Outputs |
|---|
#s(approx d #s(hole binary64 d)) |
#s(approx (* 30 d) #s(hole binary64 (* 30 d))) |
3 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 1.0ms | d | @ | -inf | (10 d d (* 30 d) 30) |
| 1.0ms | d | @ | inf | (10 d d (* 30 d) 30) |
| 0.0ms | d | @ | 0 | (10 d d (* 30 d) 30) |
| Inputs |
|---|
#s(literal 10 binary64) |
#s(approx d d) |
d |
(*.f64 #s(literal 30 binary64) d) |
#s(literal 30 binary64) |
#s(approx d #s(hole binary64 d)) |
#s(approx (* 30 d) #s(hole binary64 (* 30 d))) |
| Outputs |
|---|
#s(literal 10 binary64) |
#s(approx d d) |
d |
(*.f64 #s(literal 30 binary64) d) |
#s(literal 30 binary64) |
#s(approx (* 30 d) (*.f64 #s(literal 30 binary64) d)) |
Compiled 6 to 6 computations (0% saved)
3 alts after pruning (0 fresh and 3 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 3 | 0 | 3 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 3 | 3 |
| Done | 0 | 0 | 0 |
| Total | 3 | 3 | 6 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | (*.f64 #s(literal 30 binary64) d) |
| ✓ | 15.2% | #s(approx d d) |
| ✓ | 5.3% | #s(literal 10 binary64) |
Compiled 15 to 16 computations (-6.7% saved)
| Inputs |
|---|
#s(literal 10 binary64) |
#s(approx d d) |
(*.f64 #s(literal 30 binary64) d) |
(+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64))) |
| Outputs |
|---|
(*.f64 #s(literal 30 binary64) d) |
2 calls:
| 2.0ms | (+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64))) |
| 2.0ms | d |
| Accuracy | Segments | Branch |
|---|---|---|
| 100.0% | 1 | (+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64))) |
| 100.0% | 1 | d |
Compiled 7 to 7 computations (0% saved)
| Inputs |
|---|
#s(literal 10 binary64) |
#s(approx d d) |
| Outputs |
|---|
#s(approx d d) |
2 calls:
| 2.0ms | (+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64))) |
| 2.0ms | d |
| Accuracy | Segments | Branch |
|---|---|---|
| 15.2% | 1 | (+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64))) |
| 15.2% | 1 | d |
Compiled 7 to 7 computations (0% saved)
Total -0.0b remaining (-0%)
Threshold costs -0b (-0%)
| Inputs |
|---|
#s(literal 10 binary64) |
| Outputs |
|---|
#s(literal 10 binary64) |
2 calls:
| 4.0ms | (+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64))) |
| 1.0ms | d |
| Accuracy | Segments | Branch |
|---|---|---|
| 5.3% | 1 | (+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64))) |
| 5.3% | 1 | d |
Compiled 7 to 7 computations (0% saved)
| 1× | done |
Compiled 5 to 5 computations (0% saved)
Compiled 26 to 28 computations (-7.7% saved)
Loading profile data...