Metrics for math.square on complex, imaginary part

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.2MiB live, 0.2MiB 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)

sample588.0ms (38.3%)

Memory

55.3MiB live, 605.6MiB allocated; 113ms collecting garbage

Samples

364.0ms

8 256×

valid

Precisions

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

ival-mult: 114.0ms (72.4% of total)

ival-add: 33.0ms (21% of total)

ival-true: 5.0ms (3.2% of total)

ival-assert: 3.0ms (1.9% of total)

adjust: 2.0ms (1.3% of total)

Bogosity

explain73.0ms (4.7%)

Memory

-24.8MiB live, 70.6MiB allocated; 19ms 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

31.0ms

512×

valid

Compiler

Compiled 41 to 19 computations (53.7% saved)

Precisions

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

ival-mult: 7.0ms (72.2% of total)

ival-add: 2.0ms (20.6% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

preprocess266.0ms (17.3%)

Memory

8.3MiB live, 193.5MiB allocated; 23ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	15	43
1	36	27
2	81	25
3	154	25
4	218	25
5	316	25
6	748	25
7	1596	25
8	3572	25
0	5	7
0	8	7
1	14	5
2	30	5
3	53	5
4	94	5
5	197	5
6	506	5
7	1248	5
8	4772	5
9	7672	5
0	8315	5

Stop Event

1×	iter limit
1×	node limit
1×	iter limit
1×	node limit

Calls

Call 1

Inputs
(+.f64 (.f64 re im) (.f64 im re))

Outputs
(+.f64 (.f64 re im) (.f64 im re))
(.f64 #s(literal 2 binary64) (.f64 im re))

Symmetry

(negabs im)

(negabs re)

(sort re im)

Compiler

Compiled 7 to 5 computations (28.6% saved)

eval0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 7 to 5 computations (28.6% saved)

series6.0ms (0.4%)

Memory

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

Counts

5 → 4

Calls

Call 1

Inputs
(+.f64 (.f64 re im) (.f64 im re))
(*.f64 re im)
re
im
(*.f64 im re)

Outputs
(* 2 (* im re))
(* im re)
re
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))

simplify158.0ms (10.3%)

Memory

-12.6MiB live, 173.3MiB allocated; 24ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	10
1	12	10
2	36	10
3	85	10
4	246	10
5	838	10
6	4563	10
0	8912	10

Stop Event

1×	iter limit
1×	node limit

Counts

4 → 2

Calls

Call 1

Inputs
(* 2 (* im re))
(* im re)
re
im

Outputs
(* 2 (* im re))
(.f64 (.f64 im re) #s(literal 2 binary64))
(* im re)
(*.f64 im re)
re
im

rewrite37.0ms (2.4%)

Memory

12.3MiB live, 54.2MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	5	15
0	8	15
1	32	11
0	153	11

Stop Event

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

Counts

5 → 24

Calls

Call 1

Inputs
(+.f64 (.f64 re im) (.f64 im re))
(*.f64 re im)
re
im
(*.f64 im re)

Outputs
(.f64 #s(literal 2 binary64) (.f64 im re))
(*.f64 im (+.f64 re re))
(*.f64 re (-.f64 im (neg.f64 im)))
(*.f64 re (+.f64 im im))
(/.f64 (-.f64 (pow.f64 (.f64 im re) #s(literal 3 binary64)) (pow.f64 (.f64 (neg.f64 im) re) #s(literal 3 binary64))) (+.f64 (pow.f64 (.f64 im re) #s(literal 2 binary64)) (+.f64 (pow.f64 (.f64 im re) #s(literal 2 binary64)) (.f64 (.f64 im re) (*.f64 (neg.f64 im) re)))))
(/.f64 (neg.f64 (.f64 #s(literal 2 binary64) (pow.f64 (.f64 im re) #s(literal 3 binary64)))) (neg.f64 (+.f64 #s(literal 0 binary64) (pow.f64 (*.f64 im re) #s(literal 2 binary64)))))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (.f64 #s(literal 2 binary64) (pow.f64 (.f64 im re) #s(literal 3 binary64))) (+.f64 #s(literal 0 binary64) (pow.f64 (*.f64 im re) #s(literal 2 binary64))))
(fma.f64 im re (*.f64 (neg.f64 (neg.f64 im)) re))
(fma.f64 im re (*.f64 im re))
(fma.f64 re im (*.f64 (neg.f64 (neg.f64 im)) re))
(fma.f64 re im (*.f64 im re))
(-.f64 (/.f64 (pow.f64 (.f64 im re) #s(literal 2 binary64)) #s(literal 0 binary64)) (/.f64 (pow.f64 (.f64 im re) #s(literal 2 binary64)) #s(literal 0 binary64)))
(-.f64 (.f64 im re) (.f64 (neg.f64 re) im))
(-.f64 (.f64 im re) (.f64 (neg.f64 im) re))
(+.f64 (/.f64 (pow.f64 (.f64 im re) #s(literal 3 binary64)) (+.f64 #s(literal 0 binary64) (pow.f64 (.f64 im re) #s(literal 2 binary64)))) (/.f64 (pow.f64 (.f64 im re) #s(literal 3 binary64)) (+.f64 #s(literal 0 binary64) (pow.f64 (.f64 im re) #s(literal 2 binary64)))))
(+.f64 (.f64 im re) (.f64 (neg.f64 (neg.f64 im)) re))
(+.f64 (.f64 im re) (.f64 im re))
(*.f64 im re)
(*.f64 re im)
re
im
(*.f64 im re)
(*.f64 re im)

eval2.0ms (0.1%)

Memory: 4.8MiB live, 4.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 257 to 55 computations (78.6% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	25	1	26
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	26	1	27

Accuracy

100.0%

Counts

27 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 4 computations (20% saved)

series3.0ms (0.2%)

Memory

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

Counts

4 → 4

Calls

Call 1

Inputs
(*.f64 im (+.f64 re re))
im
(+.f64 re re)
re

Outputs
(* 2 (* im re))
(* 2 re)
re
im

Calls

6 calls:

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

simplify285.0ms (18.5%)

Memory

-29.0MiB live, 190.7MiB allocated; 263ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	10
1	15	10
2	39	10
3	96	10
4	230	10
5	795	10
6	4700	10
0	8101	10

Stop Event

1×	iter limit
1×	node limit

Counts

4 → 2

Calls

Call 1

Inputs
(* 2 (* im re))
(* 2 re)
re
im

Outputs
(* 2 (* im re))
(.f64 (.f64 re im) #s(literal 2 binary64))
(* 2 re)
(*.f64 #s(literal 2 binary64) re)
re
im

rewrite23.0ms (1.5%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	22	10
0	137	10

Stop Event

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

Counts

4 → 26

Calls

Call 1

Inputs
(*.f64 im (+.f64 re re))
im
(+.f64 re re)
re

Outputs
(.f64 (.f64 im #s(literal 2 binary64)) re)
(.f64 #s(literal 2 binary64) (.f64 re im))
(.f64 (.f64 #s(literal 2 binary64) re) im)
(*.f64 re (+.f64 im im))
(.f64 im (.f64 #s(literal 2 binary64) re))
(/.f64 (*.f64 #s(literal 0 binary64) im) #s(literal 0 binary64))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) (pow.f64 re #s(literal 3 binary64))) im) (fma.f64 re re #s(literal 0 binary64)))
(/.f64 (*.f64 im #s(literal 0 binary64)) #s(literal 0 binary64))
(/.f64 (.f64 im (.f64 #s(literal 2 binary64) (pow.f64 re #s(literal 3 binary64)))) (fma.f64 re re #s(literal 0 binary64)))
(/.f64 (-.f64 (.f64 (.f64 re im) (.f64 re im)) (.f64 (.f64 re im) (.f64 re im))) (-.f64 (.f64 re im) (.f64 re im)))
(/.f64 (+.f64 (pow.f64 (.f64 re im) #s(literal 3 binary64)) (pow.f64 (.f64 re im) #s(literal 3 binary64))) (fma.f64 (.f64 re im) (.f64 re im) (-.f64 (.f64 (.f64 re im) (.f64 re im)) (.f64 (.f64 re im) (.f64 re im)))))
(fma.f64 re im (*.f64 re im))
(fma.f64 im re (*.f64 re im))
(-.f64 (.f64 re im) (.f64 (neg.f64 re) im))
(-.f64 (.f64 re im) (.f64 (neg.f64 im) re))
(+.f64 (.f64 re im) (.f64 re im))
im
(*.f64 #s(literal 2 binary64) re)
(*.f64 re #s(literal 2 binary64))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 re #s(literal 3 binary64)))) (neg.f64 (fma.f64 re re #s(literal 0 binary64))))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 re #s(literal 3 binary64))) (fma.f64 re re #s(literal 0 binary64)))
(-.f64 (/.f64 (.f64 re re) #s(literal 0 binary64)) (/.f64 (.f64 re re) #s(literal 0 binary64)))
(+.f64 (/.f64 (pow.f64 re #s(literal 3 binary64)) (fma.f64 re re #s(literal 0 binary64))) (/.f64 (pow.f64 re #s(literal 3 binary64)) (fma.f64 re re #s(literal 0 binary64))))
(+.f64 re re)
re

eval26.0ms (1.7%)

Memory: -39.2MiB live, 6.1MiB allocated; 12ms collecting garbage
Compiler: Compiled 264 to 67 computations (74.6% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	29	0	29
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	29	1	30

Accuracy

100.0%

Counts

30 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 17 to 11 computations (35.3% saved)

regimes4.0ms (0.2%)

Memory

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

Accuracy

Total -0.0b remaining (-∞%)

Threshold costs -0b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
(*.f64 im (+.f64 re re))
(+.f64 (.f64 re im) (.f64 im re))

Outputs
(*.f64 im (+.f64 re 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)

simplify9.0ms (0.6%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	5

Stop Event

1×

saturated

Calls

Call 1

Inputs
(*.f64 im (+.f64 re re))

Outputs
(*.f64 im (+.f64 re re))

derivations1.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 5 to 4 computations (20% saved)

preprocess54.0ms (3.5%)

Memory

-29.4MiB live, 32.1MiB allocated; 11ms collecting garbage

Remove

(sort re im)

(negabs re)

(negabs im)

Compiler

Compiled 54 to 42 computations (22.2% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample588.0ms (38.3%)

explain73.0ms (4.7%)

preprocess266.0ms (17.3%)

eval0.0ms (0%)

prune0.0ms (0%)

series6.0ms (0.4%)

simplify158.0ms (10.3%)

rewrite37.0ms (2.4%)

eval2.0ms (0.1%)

prune1.0ms (0.1%)

series3.0ms (0.2%)

simplify285.0ms (18.5%)

rewrite23.0ms (1.5%)

eval26.0ms (1.7%)

prune1.0ms (0.1%)

regimes4.0ms (0.2%)

simplify9.0ms (0.6%)

derivations1.0ms (0.1%)

preprocess54.0ms (3.5%)

end0.0ms (0%)

Profiling