Graphics.Rasterific.CubicBezier:isSufficientlyFlat from Rasterific-0.6.1
Time bar (total: 2.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 7 to 6 computations (14.3% saved)
| 928.0ms | 8 256× | 0 | valid |
ival-mult: 405.0ms (96.2% of total)ival-true: 6.0ms (1.4% of total)exact: 5.0ms (1.2% of total)ival-assert: 3.0ms (0.7% of total)adjust: 2.0ms (0.5% of total)| Ground Truth | Overpredictions | Example | Underpredictions | Example | Subexpression |
|---|---|---|---|---|---|
| 0 | 0 | - | 0 | - | (*.f64 (*.f64 x #s(literal 16 binary64)) x) |
| 0 | 0 | - | 0 | - | #s(literal 16 binary64) |
| 0 | 0 | - | 0 | - | (*.f64 x #s(literal 16 binary64)) |
| 0 | 0 | - | 0 | - | x |
| Predicted + | Predicted - | |
|---|---|---|
| + | 0 | 0 |
| - | 0 | 256 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 0 | 0 | 0 |
| - | 0 | 0 | 256 |
| number | freq |
|---|---|
| 0 | 256 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 0 | 0 | 0 |
| - | 0 | 0 | 1 |
| 22.0ms | 512× | 0 | valid |
Compiled 29 to 16 computations (44.8% saved)
ival-mult: 7.0ms (87.4% of total)ival-true: 0.0ms (0% of total)adjust: 0.0ms (0% of total)exact: 0.0ms (0% of total)ival-assert: 0.0ms (0% of total)Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 8 | 15 |
| 1 | 23 | 10 |
| 2 | 51 | 10 |
| 3 | 71 | 10 |
| 4 | 87 | 10 |
| 5 | 125 | 10 |
| 6 | 147 | 10 |
| 0 | 7 | 7 |
| 0 | 11 | 7 |
| 0 | 11 | 7 |
| 1× | saturated |
| 1× | saturated |
| 1× | iter limit |
| 1× | saturated |
| Inputs |
|---|
(*.f64 (*.f64 x #s(literal 16 binary64)) x) |
| Outputs |
|---|
(*.f64 (*.f64 x #s(literal 16 binary64)) x) |
(abs x)
Compiled 5 to 4 computations (20% saved)
Compiled 0 to 1 computations (-∞% saved)
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (*.f64 (*.f64 x #s(literal 16 binary64)) x) |
Compiled 5 to 4 computations (20% saved)
Found 2 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| cost-diff | 0 | (*.f64 x #s(literal 16 binary64)) | |
| cost-diff | 0 | (*.f64 (*.f64 x #s(literal 16 binary64)) x) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 7 | 16 |
| 0 | 11 | 16 |
| 0 | 11 | 16 |
| 1× | saturated |
| 1× | saturated |
| 1× | iter limit |
| Inputs |
|---|
(*.f64 (*.f64 x #s(literal 16 binary64)) x) |
(*.f64 x #s(literal 16 binary64)) |
x |
#s(literal 16 binary64) |
| Outputs |
|---|
(*.f64 (*.f64 x #s(literal 16 binary64)) x) |
(*.f64 x #s(literal 16 binary64)) |
x |
#s(literal 16 binary64) |
Found 2 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| accuracy | 0.0 | (*.f64 (*.f64 x #s(literal 16 binary64)) x) | |
| accuracy | 0.0 | (*.f64 x #s(literal 16 binary64)) |
| 27.0ms | 256× | 0 | valid |
Compiled 12 to 6 computations (50% saved)
ival-mult: 21.0ms (99.4% of total)ival-true: 0.0ms (0% of total)adjust: 0.0ms (0% of total)exact: 0.0ms (0% of total)ival-assert: 0.0ms (0% of total)| Inputs |
|---|
(*.f64 (*.f64 x #s(literal 16 binary64)) x) |
(*.f64 x #s(literal 16 binary64)) |
| Outputs |
|---|
#s(approx (* (* x 16) x) #s(hole binary64 (* 16 (pow x 2)))) |
#s(approx (* x 16) #s(hole binary64 (* 16 x))) |
3 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 1.0ms | x | @ | 0 | ((* (* x 16) x) (* x 16)) |
| 1.0ms | x | @ | inf | ((* (* x 16) x) (* x 16)) |
| 1.0ms | x | @ | -inf | ((* (* x 16) x) (* x 16)) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 14 | 22 |
| 1 | 24 | 22 |
| 2 | 34 | 22 |
| 3 | 60 | 22 |
| 4 | 116 | 22 |
| 5 | 228 | 22 |
| 6 | 730 | 22 |
| 7 | 5233 | 22 |
| 0 | 8515 | 22 |
| 1 | 8651 | 22 |
| 2 | 8935 | 22 |
| 3 | 9065 | 22 |
| 4 | 9756 | 22 |
| 5 | 11543 | 22 |
| 6 | 12233 | 22 |
| 7 | 12382 | 22 |
| 8 | 12385 | 22 |
| 1× | saturated |
| 1× | node limit |
| Inputs |
|---|
#s(approx (* (* x 16) x) #s(hole binary64 (* 16 (pow x 2)))) |
#s(approx (* x 16) #s(hole binary64 (* 16 x))) |
| Outputs |
|---|
#s(approx (* (* x 16) x) #s(hole binary64 (* 16 (pow x 2)))) |
#s(approx (* x 16) #s(hole binary64 (* 16 x))) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 7 | 12 |
| 1 | 11 | 12 |
| 2 | 13 | 12 |
| 3 | 15 | 12 |
| 0 | 15 | 12 |
| 1 | 18 | 12 |
| 2 | 21 | 12 |
| 3 | 27 | 12 |
| 4 | 58 | 12 |
| 0 | 181 | 12 |
| 1 | 195 | 12 |
| 2 | 224 | 12 |
| 3 | 239 | 12 |
| 4 | 243 | 12 |
| 1× | saturated |
| 1× | iter limit |
| 1× | iter limit |
| 1× | unsound |
| 1× | saturated |
| Inputs |
|---|
(*.f64 (*.f64 x #s(literal 16 binary64)) x) |
(*.f64 x #s(literal 16 binary64)) |
| Outputs |
|---|
(*.f64 (*.f64 (neg.f64 x) #s(literal 16 binary64)) (neg.f64 x)) |
(*.f64 (neg.f64 x) (*.f64 (neg.f64 x) #s(literal 16 binary64))) |
(*.f64 (*.f64 x x) #s(literal 16 binary64)) |
(*.f64 (*.f64 #s(literal 16 binary64) x) x) |
(*.f64 #s(literal 16 binary64) (*.f64 x x)) |
(*.f64 x (*.f64 #s(literal 16 binary64) x)) |
(neg.f64 (*.f64 (*.f64 (neg.f64 x) #s(literal 16 binary64)) x)) |
(neg.f64 (*.f64 x (*.f64 (neg.f64 x) #s(literal 16 binary64)))) |
(neg.f64 (*.f64 (*.f64 #s(literal 16 binary64) x) x)) |
(*.f64 #s(literal 16 binary64) x) |
(*.f64 x #s(literal 16 binary64)) |
Compiled 64 to 19 computations (70.3% saved)
1 alts after pruning (0 fresh and 1 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 11 | 0 | 11 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 0 | 0 |
| Total | 11 | 1 | 12 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | (*.f64 (*.f64 x #s(literal 16 binary64)) x) |
Compiled 10 to 8 computations (20% saved)
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 7 | 7 |
| 1 | 11 | 7 |
| 1× | saturated |
| Inputs |
|---|
(*.f64 (*.f64 x #s(literal 16 binary64)) x) |
| Outputs |
|---|
(*.f64 (*.f64 x #s(literal 16 binary64)) x) |
| 1× | done |
Compiled 5 to 4 computations (20% saved)
(abs x)
Compiled 40 to 32 computations (20% saved)
Loading profile data...