math.square on complex, imaginary part
Time bar (total: 1.1s)
| 1× | search |
| Probability | Valid | Unknown | Precondition | Infinite | Domain | Can't | Iter |
|---|---|---|---|---|---|---|---|
| 0% | 0% | 99.9% | 0.1% | 0% | 0% | 0% | 0 |
| 100% | 99.9% | 0% | 0.1% | 0% | 0% | 0% | 1 |
Compiled 9 to 7 computations (22.2% saved)
| 699.0ms | 8 256× | 0 | valid |
ival-mult!: 370.0ms (78.2% of total)ival-add!: 102.0ms (21.5% of total)adjust: 2.0ms (0.4% of total)Useful iterations: 2 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 16 | 44 |
| 1 | 38 | 32 |
| 2 | 82 | 30 |
| 3 | 154 | 30 |
| 4 | 220 | 30 |
| 5 | 334 | 30 |
| 6 | 826 | 30 |
| 7 | 3110 | 30 |
| 1× | node-limit |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (+.f64 (*.f64 re im) (*.f64 im re)) |
(negabs re)
(negabs im)
(sort re im)
Compiled 14 to 10 computations (28.6% saved)
| Inputs |
|---|
(+.f64 (*.f64 re im) (*.f64 im re)) |
(*.f64 re im) |
re |
im |
(*.f64 im re) |
| Outputs |
|---|
#s(approx (+ (* re im) (* im re)) #s(hole binary64 (* 2 (* im re)))) |
#s(approx (* re im) #s(hole binary64 (* im re))) |
#s(approx re #s(hole binary64 re)) |
#s(approx im #s(hole binary64 im)) |
6 calls:
| Time | Variable | Point |
|---|---|---|
| 1.0ms | im | -inf |
| 1.0ms | re | -inf |
| 1.0ms | re | inf |
| 1.0ms | im | inf |
| 1.0ms | re | 0 |
Useful iterations: 1 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 14 | 41 |
| 0 | 15 | 37 |
| 1 | 46 | 25 |
| 0 | 193 | 25 |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | unsound |
| 1× | iter-limit |
| Inputs |
|---|
(+.f64 (*.f64 re im) (*.f64 im re)) |
(*.f64 re im) |
re |
im |
(*.f64 im re) |
#s(approx (+ (* re im) (* im re)) #s(hole binary64 (* 2 (* im re)))) |
#s(approx (* re im) #s(hole binary64 (* im re))) |
#s(approx re #s(hole binary64 re)) |
#s(approx im #s(hole binary64 im)) |
| Outputs |
|---|
#s(literal 2 binary64) |
(*.f64 im re) |
(*.f64 re im) |
re |
im |
(*.f64 im re) |
(*.f64 re im) |
#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64)) |
#s(approx (* re im) (*.f64 im re)) |
#s(approx re re) |
#s(approx im im) |
Compiled 50 to 19 computations (62% saved)
2 alts after pruning (1 fresh and 1 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 5 | 1 | 6 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 0 | 0 |
| Total | 5 | 2 | 7 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | (+.f64 (*.f64 re im) (*.f64 im re)) |
| ▶ | 5.3% | #s(approx (+ (* re im) (* im re)) #s(literal 2 binary64)) |
Compiled 16 to 12 computations (25% saved)
| Inputs |
|---|
#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64)) |
#s(literal 2 binary64) |
| Outputs |
|---|
#s(approx (+ (* re im) (* im re)) #s(hole binary64 (* 2 (* im re)))) |
6 calls:
| Time | Variable | Point |
|---|---|---|
| 0.0ms | re | -inf |
| 0.0ms | im | -inf |
| 0.0ms | re | inf |
| 0.0ms | re | 0 |
| 0.0ms | im | inf |
Useful iterations: 1 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 9 | 23 |
| 0 | 9 | 15 |
| 1 | 38 | 7 |
| 0 | 185 | 7 |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | unsound |
| 1× | saturated |
| Inputs |
|---|
#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64)) |
#s(literal 2 binary64) |
#s(approx (+ (* re im) (* im re)) #s(hole binary64 (* 2 (* im re)))) |
| Outputs |
|---|
#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64)) |
#s(literal 2 binary64) |
#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64)) |
Compiled 0 to 2 computations (-∞% saved)
2 alts after pruning (0 fresh and 2 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 0 | 0 | 0 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 1 | 1 |
| Total | 0 | 2 | 2 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | (+.f64 (*.f64 re im) (*.f64 im re)) |
| ✓ | 5.3% | #s(approx (+ (* re im) (* im re)) #s(literal 2 binary64)) |
Compiled 32 to 22 computations (31.3% saved)
| Inputs |
|---|
#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64)) |
(+.f64 (*.f64 re im) (*.f64 im re)) |
| Outputs |
|---|
(+.f64 (*.f64 re im) (*.f64 im re)) |
3 calls:
| 1.0ms | im |
| 1.0ms | re |
| 1.0ms | (+.f64 (*.f64 re im) (*.f64 im re)) |
| Accuracy | Segments | Branch |
|---|---|---|
| 100.0% | 1 | (+.f64 (*.f64 re im) (*.f64 im re)) |
| 100.0% | 1 | re |
| 100.0% | 1 | im |
Compiled 9 to 9 computations (0% saved)
Total -0.0b remaining (-0%)
Threshold costs -0b (-0%)
| Inputs |
|---|
#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64)) |
| Outputs |
|---|
#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64)) |
3 calls:
| 1.0ms | re |
| 1.0ms | im |
| 1.0ms | (+.f64 (*.f64 re im) (*.f64 im re)) |
| Accuracy | Segments | Branch |
|---|---|---|
| 5.3% | 1 | (+.f64 (*.f64 re im) (*.f64 im re)) |
| 5.3% | 1 | re |
| 5.3% | 1 | im |
Compiled 9 to 9 computations (0% saved)
| 1× | done |
Compiled 16 to 10 computations (37.5% saved)
(sort re im)
Compiled 155 to 115 computations (25.8% saved)
Loading profile data...