Metrics for math.square on complex, imaginary part

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.5MiB live, 0.5MiB allocated; 0ms collecting garbage

Algorithm

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

sample722.0ms (73.3%)

Memory

8.1MiB live, 1 068.8MiB allocated; 316ms collecting garbage

Samples

422.0ms

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 182.0ms

ival-mult!: 91.0ms (49.9% of total)

ival-add!: 89.0ms (48.8% of total)

adjust: 2.0ms (1.1% of total)

Bogosity

explain52.0ms (5.3%)

Memory

-2.7MiB live, 94.7MiB allocated; 11ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(*.f64 im re)`
-	-	`(+.f64 (.f64 re im) (.f64 im re))`
-	-	`(*.f64 re im)`
-	-	`re`
-	-	`im`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

20.0ms

512×

valid

Compiler

Compiled 41 to 19 computations (53.7% saved)

Precisions

Click to see histograms. Total time spent on operations: 9.0ms

ival-mult!: 8.0ms (86.6% of total)

ival-add!: 1.0ms (10.8% of total)

adjust: 0.0ms (0% of total)

preprocess54.0ms (5.5%)

Memory

9.6MiB live, 56.0MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	16	44
1	35	32
2	80	30
3	153	30
4	217	30
5	315	30
6	747	30
7	1602	30
8	3578	30

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(+.f64 (.f64 re im) (.f64 im re))

Symmetry

(negabs re)

(negabs im)

(sort re im)

Compiler

Compiled 14 to 10 computations (28.6% saved)

series6.0ms (0.6%)

Memory

10.1MiB live, 10.2MiB allocated; 0ms collecting garbage

Counts

5 → 5

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)))
#s(approx re #s(hole binary64 re))
#s(approx (* im re) #s(hole binary64 (* im re)))
#s(approx im #s(hole binary64 im))

Calls

6 calls:

Time	Variable		Point	Expression
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))

rewrite44.0ms (4.4%)

Memory

10.6MiB live, 59.6MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	15	48
0	19	44
1	50	32
0	198	32

Stop Event

1×	iter-limit
1×	iter-limit
1×	iter-limit
1×	unsound
1×	iter-limit

Counts

10 → 12

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)))
#s(approx re #s(hole binary64 re))
#s(approx (* im re) #s(hole binary64 (* im 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 (* im re) (*.f64 im re))
#s(approx re re)
#s(approx (* im re) (*.f64 im re))
#s(approx im im)

eval1.0ms (0.1%)

Memory: 2.5MiB live, 2.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 99 to 23 computations (76.8% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	12	1	13
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	12	2	14

Accuracy

100.0%

Counts

14 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(+.f64 (.f64 re im) (.f64 im re))
▶	5.0%	#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64))

Compiler

Compiled 16 to 12 computations (25% saved)

series2.0ms (0.2%)

Memory

4.7MiB live, 4.7MiB 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:

Time	Variable		Point	Expression
0.0ms	re	@	-inf	((+ (* re im) (* im re)) 2)
0.0ms	im	@	-inf	((+ (* re im) (* im re)) 2)
0.0ms	re	@	0	((+ (* re im) (* im re)) 2)
0.0ms	re	@	inf	((+ (* re im) (* im re)) 2)
0.0ms	im	@	inf	((+ (* re im) (* im re)) 2)

rewrite29.0ms (2.9%)

Memory

-11.6MiB live, 34.9MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	9	23
0	9	15
1	39	7
0	187	7

Stop Event

1×	iter-limit
1×	iter-limit
1×	iter-limit
1×	unsound
1×	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.6MiB live, 0.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 18 to 7 computations (61.1% saved)

prune1.0ms (0.1%)

Memory

2.8MiB live, 2.8MiB allocated; 0ms collecting garbage

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	2	0	2
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	2	2	4

Accuracy

100.0%

Counts

4 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(+.f64 (.f64 re im) (.f64 im re))
✓	5.0%	#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64))

Compiler

Compiled 32 to 22 computations (31.3% saved)

regimes4.0ms (0.4%)

Memory

11.4MiB live, 11.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

Accuracy	Segments	Branch
100.0%	1	`(+.f64 (.f64 re im) (.f64 im re))`
100.0%	1	`re`
100.0%	1	`im`

Compiler

Compiled 9 to 9 computations (0% saved)

regimes6.0ms (0.6%)

Memory

-34.7MiB live, 11.8MiB allocated; 3ms 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:

4.0ms	re
1.0ms	(+.f64 (.f64 re im) (.f64 im re))
1.0ms	im

Results

Accuracy	Segments	Branch
5.0%	1	`(+.f64 (.f64 re im) (.f64 im re))`
5.0%	1	`re`
5.0%	1	`im`

Compiler

Compiled 9 to 9 computations (0% saved)

derivations2.0ms (0.2%)

Memory

3.2MiB live, 3.2MiB allocated; 0ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 16 to 10 computations (37.5% saved)

preprocess60.0ms (6.1%)

Memory: 6.8MiB live, 101.5MiB allocated; 14ms collecting garbage
Remove: (sort re im)
Compiler: Compiled 178 to 130 computations (27% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample722.0ms (73.3%)

explain52.0ms (5.3%)

preprocess54.0ms (5.5%)

series6.0ms (0.6%)

rewrite44.0ms (4.4%)

eval1.0ms (0.1%)

prune2.0ms (0.2%)

series2.0ms (0.2%)

rewrite29.0ms (2.9%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes4.0ms (0.4%)

regimes6.0ms (0.6%)

derivations2.0ms (0.2%)

preprocess60.0ms (6.1%)

end0.0ms (0%)

Profiling