Metrics for Physics.ForceLayout:coulombForce from force-layout-0.4.0.2

start0.0ms (0%)

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

analyze19.0ms (1.9%)

Memory

-21.9MiB live, 22.7MiB allocated; 10ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
0%	0%	99.9%	0.1%	0%	0%	0%	1
0%	0%	99.9%	0.1%	0%	0%	0%	2
50%	50%	50%	0.1%	0%	0%	0%	3
50%	50%	50%	0.1%	0%	0%	0%	4
75%	74.9%	25%	0.1%	0%	0%	0%	5
75%	74.9%	25%	0.1%	0%	0%	0%	6
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	7
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	8
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	9
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	10
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	11
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	12

Compiler

Compiled 7 to 6 computations (14.3% saved)

sample754.0ms (73.8%)

Memory

37.6MiB live, 881.4MiB allocated; 273ms collecting garbage

Samples

500.0ms	8 255×	0	valid
0.0ms	1×	1	valid

Precisions

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

ival-mult!: 161.0ms (78.3% of total)

ival-div!: 43.0ms (20.9% of total)

adjust: 2.0ms (1% of total)

Bogosity

explain78.0ms (7.6%)

Memory

-22.3MiB live, 70.5MiB allocated; 8ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Example	Underpredictions	Example	Subexpression
39	-	3	(1.1877655672509394e-18 -1.1195751559328537e-157)	`(/.f64 x (*.f64 y y))`
0	-	0	-	`y`
0	-	0	-	`(*.f64 y y)`
0	-	0	-	`x`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`/.f64`	`(/.f64 x (*.f64 y y))`	n/o	19	0
↳	`(*.f64 y y)`	overflow	77
`/.f64`	`(/.f64 x (*.f64 y y))`	n/u	17	0
↳	`(*.f64 y y)`	underflow	55

Confusion

	Predicted +	Predicted -
+	36	3
-	0	217

Precision

1.0

Recall

0.9230769230769231

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	36	0	3
-	0	0	217

Precision?

1.0

Recall?

0.9230769230769231

Freqs

test

number	freq
0	220
1	36

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Samples

53.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

ival-div!: 39.0ms (92.3% of total)

ival-mult!: 3.0ms (7.1% of total)

adjust: 0.0ms (0% of total)

preprocess18.0ms (1.7%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	32
1	40	32
2	93	32
3	140	32
4	176	32
0	4	5
0	6	5
1	12	5
2	29	5
3	55	5
4	77	5
5	90	5
6	98	5
0	98	5

Stop Event

1×	iter limit
1×	saturated
1×	iter limit
1×	saturated

Calls

Call 1

Inputs
(/.f64 x (*.f64 y y))

Outputs
(/.f64 x (*.f64 y y))

Symmetry

(abs y)

(negabs x)

Compiler

Compiled 5 to 4 computations (20% 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
▶	86.7%	(/.f64 x (*.f64 y y))

Compiler

Compiled 5 to 4 computations (20% saved)

series5.0ms (0.5%)

Memory

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

Counts

4 → 4

Calls

Call 1

Inputs
(/.f64 x (*.f64 y y))
x
(*.f64 y y)
y

Outputs
#s(approx (/ x (* y y)) #s(hole binary64 (/ x (pow y 2))))
#s(approx x #s(hole binary64 x))
#s(approx (* y y) #s(hole binary64 (pow y 2)))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((/ x (* y y)) x (* y y) y)
1.0ms	x	@	inf	((/ x (* y y)) x (* y y) y)
1.0ms	x	@	0	((/ x (* y y)) x (* y y) y)
1.0ms	y	@	inf	((/ x (* y y)) x (* y y) y)
1.0ms	y	@	-inf	((/ x (* y y)) x (* y y) y)

rewrite40.0ms (3.9%)

Memory

-17.8MiB live, 26.8MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	34
0	14	34
1	33	34
0	106	34

Stop Event

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

Counts

8 → 31

Calls

Call 1

Inputs
(/.f64 x (*.f64 y y))
x
(*.f64 y y)
y
#s(approx (/ x (* y y)) #s(hole binary64 (/ x (pow y 2))))
#s(approx x #s(hole binary64 x))
#s(approx (* y y) #s(hole binary64 (pow y 2)))
#s(approx y #s(hole binary64 y))

Outputs
(/.f64 (/.f64 x (neg.f64 y)) (neg.f64 y))
(/.f64 (/.f64 x (fabs.f64 y)) (fabs.f64 y))
(/.f64 (neg.f64 (/.f64 x y)) (neg.f64 y))
(/.f64 (neg.f64 (neg.f64 x)) (*.f64 y y))
(/.f64 (/.f64 x y) y)
(/.f64 (neg.f64 x) (*.f64 (neg.f64 y) y))
(/.f64 x (*.f64 y y))
(neg.f64 (/.f64 (neg.f64 x) (*.f64 y y)))
(neg.f64 (/.f64 x (*.f64 (neg.f64 y) y)))
x
(*.f64 (neg.f64 (neg.f64 y)) (neg.f64 (neg.f64 y)))
(*.f64 (neg.f64 (fabs.f64 y)) (neg.f64 (fabs.f64 y)))
(*.f64 (fabs.f64 (fabs.f64 y)) (fabs.f64 (fabs.f64 y)))
(*.f64 (exp.f64 (log.f64 y)) (exp.f64 (log.f64 y)))
(*.f64 (neg.f64 y) (neg.f64 y))
(*.f64 (fabs.f64 y) (fabs.f64 y))
(*.f64 y y)
(pow.f64 (exp.f64 (log.f64 y)) #s(literal 2 binary64))
(pow.f64 (neg.f64 y) #s(literal 2 binary64))
(pow.f64 (fabs.f64 y) #s(literal 2 binary64))
(pow.f64 (*.f64 y y) #s(literal 1 binary64))
(pow.f64 y #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 y) y))
(fabs.f64 (*.f64 y y))
(exp.f64 (*.f64 (log.f64 y) #s(literal 2 binary64)))
(+.f64 (cosh.f64 (.f64 (log.f64 y) #s(literal 2 binary64))) (sinh.f64 (.f64 (log.f64 y) #s(literal 2 binary64))))
y
#s(approx (/ x (* y y)) (/.f64 x (*.f64 y y)))
#s(approx x x)
#s(approx (* y y) (*.f64 y y))
#s(approx y y)

eval3.0ms (0.3%)

Memory: 5.4MiB live, 5.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 234 to 75 computations (67.9% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	32	1	33
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	32	2	34

Accuracy

99.9%

Counts

34 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.8%	(/.f64 (/.f64 x y) y)
✓	86.7%	(/.f64 x (*.f64 y y))

Compiler

Compiled 10 to 8 computations (20% saved)

series6.0ms (0.6%)

Memory

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

Counts

4 → 4

Calls

Call 1

Inputs
(/.f64 (/.f64 x y) y)
(/.f64 x y)
x
y

Outputs
#s(approx (/ (/ x y) y) #s(hole binary64 (/ x (pow y 2))))
#s(approx (/ x y) #s(hole binary64 (/ x y)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

Time	Variable		Point	Expression
2.0ms	x	@	-inf	((/ (/ x y) y) (/ x y) x y)
1.0ms	x	@	inf	((/ (/ x y) y) (/ x y) x y)
1.0ms	y	@	-inf	((/ (/ x y) y) (/ x y) x y)
1.0ms	x	@	0	((/ (/ x y) y) (/ x y) x y)
1.0ms	y	@	inf	((/ (/ x y) y) (/ x y) x y)

rewrite28.0ms (2.8%)

Memory

-21.4MiB live, 29.6MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	34
0	15	34
1	32	34
0	100	34

Stop Event

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

Counts

8 → 20

Calls

Call 1

Inputs
(/.f64 (/.f64 x y) y)
(/.f64 x y)
x
y
#s(approx (/ (/ x y) y) #s(hole binary64 (/ x (pow y 2))))
#s(approx (/ x y) #s(hole binary64 (/ x y)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))

Outputs
(/.f64 (neg.f64 (neg.f64 x)) (neg.f64 (*.f64 (neg.f64 y) y)))
(/.f64 (/.f64 (neg.f64 x) y) (neg.f64 y))
(/.f64 (neg.f64 x) (*.f64 (neg.f64 y) y))
(/.f64 (/.f64 x y) (neg.f64 (neg.f64 y)))
(/.f64 (/.f64 x y) y)
(/.f64 x (*.f64 y y))
(neg.f64 (/.f64 (/.f64 (neg.f64 x) y) y))
(neg.f64 (/.f64 (neg.f64 x) (*.f64 y y)))
(neg.f64 (/.f64 (/.f64 x y) (neg.f64 y)))
(neg.f64 (/.f64 x (*.f64 (neg.f64 y) y)))
(/.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 y)))
(/.f64 (neg.f64 x) (neg.f64 y))
(/.f64 x y)
(neg.f64 (/.f64 (neg.f64 x) y))
x
y
#s(approx (/ (/ x y) y) (/.f64 (/.f64 x y) y))
#s(approx (/ x y) (/.f64 x y))
#s(approx x x)
#s(approx y y)

eval2.0ms (0.2%)

Memory: 4.9MiB live, 4.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 152 to 43 computations (71.7% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	22	0	22
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	22	2	24

Accuracy

99.9%

Counts

24 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.8%	(/.f64 (/.f64 x y) y)
✓	86.7%	(/.f64 x (*.f64 y y))

Compiler

Compiled 20 to 14 computations (30% saved)

regimes5.0ms (0.5%)

Memory

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

Counts

2 → 1

Calls

Call 1

Inputs
(/.f64 x (*.f64 y y))
(/.f64 (/.f64 x y) y)

Outputs
(/.f64 (/.f64 x y) y)

Calls

4 calls:

1.0ms	y
1.0ms	x
1.0ms	(*.f64 y y)
1.0ms	(/.f64 x (*.f64 y y))

Results

Accuracy	Segments	Branch
99.8%	1	`(*.f64 y y)`
99.8%	1	`(/.f64 x (*.f64 y y))`
99.8%	1	`x`
99.8%	1	`y`

Compiler

Compiled 10 to 11 computations (-10% saved)

regimes7.0ms (0.7%)

Memory

-32.1MiB live, 11.9MiB allocated; 6ms collecting garbage

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
(/.f64 x (*.f64 y y))

Outputs
(/.f64 x (*.f64 y y))

Calls

4 calls:

4.0ms	(*.f64 y y)
1.0ms	y
1.0ms	x
1.0ms	(/.f64 x (*.f64 y y))

Results

Accuracy	Segments	Branch
86.7%	1	`(*.f64 y y)`
86.7%	1	`(/.f64 x (*.f64 y y))`
86.7%	1	`x`
86.7%	1	`y`

Compiler

Compiled 10 to 11 computations (-10% saved)

simplify10.0ms (0.9%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	10

Stop Event

1×

saturated

Calls

Call 1

Inputs
(/.f64 (/.f64 x y) y)
(/.f64 x (*.f64 y y))

Outputs
(/.f64 (/.f64 x y) y)
(/.f64 x (*.f64 y y))

derivations1.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 10 to 6 computations (40% saved)

preprocess43.0ms (4.2%)

Memory

-0.5MiB live, 45.2MiB allocated; 4ms collecting garbage

Remove

(negabs x)

(abs y)

Compiler

Compiled 80 to 60 computations (25% saved)

end0.0ms (0%)

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

Iter	Nodes	Cost
0	13	32
1	40	32
2	93	32
3	140	32
4	176	32
0	4	5
0	6	5
1	12	5
2	29	5
3	55	5
4	77	5
5	90	5
6	98	5
0	98	5

Iter	Nodes	Cost
0	13	32
1	40	32
2	93	32
3	140	32
4	176	32
0	4	5
0	6	5
1	12	5
2	29	5
3	55	5
4	77	5
5	90	5
6	98	5
0	98	5

start0.0ms (0%)

analyze19.0ms (1.9%)

sample754.0ms (73.8%)

explain78.0ms (7.6%)

preprocess18.0ms (1.7%)

eval0.0ms (0%)

prune0.0ms (0%)

series5.0ms (0.5%)

rewrite40.0ms (3.9%)

eval3.0ms (0.3%)

prune2.0ms (0.2%)

series6.0ms (0.6%)

rewrite28.0ms (2.8%)

eval2.0ms (0.2%)

prune2.0ms (0.1%)

regimes5.0ms (0.5%)

regimes7.0ms (0.7%)

simplify10.0ms (0.9%)

derivations1.0ms (0.1%)

preprocess43.0ms (4.2%)

end0.0ms (0%)

Profiling

Iter	Nodes	Cost
0	13	32
1	40	32
2	93	32
3	140	32
4	176	32
0	4	5
0	6	5
1	12	5
2	29	5
3	55	5
4	77	5
5	90	5
6	98	5
0	98	5