math.square on complex, imaginary part

Time bar (total: 854.0ms)

start0.0ms (0%)

Memory
0.1MiB live, 0.1MiB allocated; 0ms collecting garbage

analyze0.0ms (0%)

Memory
0.6MiB live, 0.6MiB allocated; 0ms collecting garbage
Algorithm
search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%99.9%0.1%0%0%0%0
100%99.9%0%0.1%0%0%0%1
Compiler

Compiled 9 to 7 computations (22.2% saved)

sample513.0ms (60%)

Memory
6.4MiB live, 713.3MiB allocated; 132ms collecting garbage
Samples
272.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 112.0ms
ival-mult!: 85.0ms (75.9% of total)
ival-add!: 25.0ms (22.3% of total)
adjust: 1.0ms (0.9% of total)
Bogosity

preprocess57.0ms (6.7%)

Memory
2.2MiB live, 48.4MiB allocated; 7ms collecting garbage
Iterations

Useful iterations: 2 (0.0ms)

IterNodesCost
01644
13532
28030
315330
421730
531530
674730
7160230
8357830
Stop Event
node-limit
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(+.f64 (*.f64 re im) (*.f64 im re))
Symmetry

(negabs re)

(negabs im)

(sort re im)

Compiler

Compiled 10 to 10 computations (0% saved)

series6.0ms (0.7%)

Memory
8.2MiB live, 8.2MiB allocated; 0ms collecting garbage
Counts
5 → 2
Calls
Call 1
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)))
Calls

6 calls:

TimeVariablePointExpression
1.0ms
im
@-inf
((+ (* re im) (* im re)) (* re im) re im (* im re))
1.0ms
re
@-inf
((+ (* re im) (* im re)) (* re im) re im (* im re))
1.0ms
re
@inf
((+ (* re im) (* im re)) (* re im) re im (* im re))
1.0ms
im
@inf
((+ (* re im) (* im re)) (* re im) re im (* im re))
1.0ms
re
@0
((+ (* re im) (* im re)) (* re im) re im (* im re))

rewrite45.0ms (5.3%)

Memory
35.4MiB live, 105.2MiB allocated; 12ms collecting garbage
Iterations

Useful iterations: 1 (0.0ms)

IterNodesCost
01235
01331
14519
019119
Stop Event
iter-limit
iter-limit
iter-limit
unsound
iter-limit
Counts
7 → 9
Calls
Call 1
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)))
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))

eval0.0ms (0%)

Memory
1.0MiB live, 1.0MiB allocated; 0ms collecting garbage
Compiler

Compiled 14 to 11 computations (21.4% saved)

prune1.0ms (0.1%)

Memory
3.4MiB live, 3.4MiB allocated; 0ms collecting garbage
Pruning

2 alts after pruning (1 fresh and 1 done)

PrunedKeptTotal
New314
Fresh000
Picked011
Done000
Total325
Accuracy
100.0%
Counts
5 → 2
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(+.f64 (*.f64 re im) (*.f64 im re))
5.2%
#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64))
Compiler

Compiled 12 to 12 computations (0% saved)

series2.0ms (0.3%)

Memory
5.8MiB live, 5.8MiB allocated; 0ms collecting garbage
Counts
2 → 1
Calls
Call 1
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))))
Calls

6 calls:

TimeVariablePointExpression
0.0ms
re
@-inf
((+ (* re im) (* im re)) 2)
0.0ms
im
@-inf
((+ (* re im) (* im re)) 2)
0.0ms
re
@inf
((+ (* re im) (* im re)) 2)
0.0ms
re
@0
((+ (* re im) (* im re)) 2)
0.0ms
im
@inf
((+ (* re im) (* im re)) 2)

rewrite103.0ms (12%)

Memory
-18.3MiB live, 66.9MiB allocated; 92ms collecting garbage
Iterations

Useful iterations: 1 (0.0ms)

IterNodesCost
0923
0915
1397
01877
Stop Event
iter-limit
iter-limit
iter-limit
unsound
saturated
Counts
3 → 3
Calls
Call 1
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))

eval0.0ms (0%)

Memory
0.2MiB live, 0.2MiB allocated; 0ms collecting garbage
Compiler

Compiled 0 to 2 computations (-∞% saved)

prune1.0ms (0.1%)

Memory
3.5MiB live, 3.5MiB allocated; 0ms collecting garbage
Pruning

2 alts after pruning (0 fresh and 2 done)

PrunedKeptTotal
New000
Fresh000
Picked011
Done011
Total022
Accuracy
100.0%
Counts
2 → 2
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(+.f64 (*.f64 re im) (*.f64 im re))
5.2%
#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64))
Compiler

Compiled 22 to 22 computations (0% saved)

regimes4.0ms (0.5%)

Memory
15.4MiB live, 15.4MiB allocated; 0ms collecting garbage
Counts
2 → 1
Calls
Call 1
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))
Calls

3 calls:

1.0ms
im
1.0ms
re
1.0ms
(+.f64 (*.f64 re im) (*.f64 im re))
Results
AccuracySegmentsBranch
100.0%1(+.f64 (*.f64 re im) (*.f64 im re))
100.0%1re
100.0%1im
Compiler

Compiled 7 to 9 computations (-28.6% saved)

regimes3.0ms (0.4%)

Memory
13.7MiB live, 13.7MiB allocated; 0ms collecting garbage
Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts
1 → 1
Calls
Call 1
Inputs
#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64))
Outputs
#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64))
Calls

3 calls:

1.0ms
(+.f64 (*.f64 re im) (*.f64 im re))
1.0ms
im
1.0ms
re
Results
AccuracySegmentsBranch
5.2%1(+.f64 (*.f64 re im) (*.f64 im re))
5.2%1re
5.2%1im
Compiler

Compiled 7 to 9 computations (-28.6% saved)

derivations2.0ms (0.3%)

Memory
7.2MiB live, 7.2MiB allocated; 0ms collecting garbage
Stop Event
done
Compiler

Compiled 10 to 10 computations (0% saved)

preprocess116.0ms (13.6%)

Memory
-35.2MiB live, 111.5MiB allocated; 85ms collecting garbage
Remove

(sort re im)

Compiler

Compiled 115 to 115 computations (0% saved)

end0.0ms (0%)

Memory
0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

Profiling

Loading profile data...