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.3MiB live, 0.3MiB 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 (55.2%)

Memory

31.2MiB live, 978.2MiB allocated; 154ms collecting garbage

Samples

451.0ms

8 256×

valid

Precisions

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

ival-mult: 196.0ms (84% of total)

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

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

adjust: 2.0ms (0.9% of total)

Bogosity

explain109.0ms (8.3%)

Memory

-62.3MiB live, 112.0MiB allocated; 88ms 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

22.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% 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)

preprocess264.0ms (20.2%)

Memory

41.3MiB live, 181.4MiB allocated; 30ms collecting garbage

Iterations

Useful iterations: 1 (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
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 re)

(negabs im)

(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.4MiB live, 0.4MiB 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

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

rewrite42.0ms (3.2%)

Memory

-28.5MiB live, 18.1MiB allocated; 5ms 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: 1.3MiB live, 1.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 99 to 23 computations (76.8% saved)

prune2.0ms (0.1%)

Memory

2.1MiB live, 2.1MiB 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

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

rewrite27.0ms (2%)

Memory

17.2MiB live, 17.2MiB allocated; 0ms 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.4MiB live, 0.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 18 to 7 computations (61.1% saved)

prune1.0ms (0.1%)

Memory

1.8MiB live, 1.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)

regimes16.0ms (1.2%)

Memory

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

13.0ms	(+.f64 (.f64 re im) (.f64 im re))
1.0ms	im
1.0ms	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)

regimes3.0ms (0.3%)

Memory

7.1MiB live, 7.1MiB 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	im
1.0ms	re
1.0ms	(+.f64 (.f64 re im) (.f64 im re))

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)

simplify54.0ms (4.1%)

Memory

5.9MiB live, 49.2MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	10	16
1	17	14
2	35	14
3	64	14
4	146	14
5	773	14
6	6070	14

Stop Event

1×	node limit

Calls

Call 1

Inputs
(+.f64 (.f64 re im) (.f64 im re))
#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64))

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

derivations2.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 16 to 10 computations (37.5% saved)

preprocess56.0ms (4.3%)

Memory

-14.8MiB live, 81.7MiB allocated; 24ms collecting garbage

Remove

(sort re im)

(negabs im)

(negabs re)

Compiler

Compiled 130 to 90 computations (30.8% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample722.0ms (55.2%)

explain109.0ms (8.3%)

preprocess264.0ms (20.2%)

eval0.0ms (0%)

prune0.0ms (0%)

series6.0ms (0.4%)

rewrite42.0ms (3.2%)

eval1.0ms (0.1%)

prune2.0ms (0.1%)

series2.0ms (0.2%)

rewrite27.0ms (2%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes16.0ms (1.2%)

regimes3.0ms (0.3%)

simplify54.0ms (4.1%)

derivations2.0ms (0.1%)

preprocess56.0ms (4.3%)

end0.0ms (0%)

Profiling