Metrics for Text.Parsec.Token:makeTokenParser from parsec-3.1.9, B

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.4MiB live, 0.4MiB 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 7 to 7 computations (0% saved)

sample889.0ms (39.5%)

Memory

24.4MiB live, 952.0MiB allocated; 410ms collecting garbage

Samples

368.0ms

8 256×

valid

Precisions

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

ival-mult!: 58.0ms (54.5% of total)

ival-add!: 47.0ms (44.1% of total)

adjust: 1.0ms (0.9% of total)

Bogosity

preprocess21.0ms (0.9%)

Memory

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

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	22	53
1	52	51
2	127	51
3	324	51
4	431	51
5	431	51

Stop Event

1×

saturated

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 (+.f64 x y) z)

Symmetry

(negabs z)

(sort x y)

Compiler

Compiled 10 to 10 computations (0% saved)

series27.0ms (1.2%)

Memory

-34.1MiB live, 12.0MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	56	181

Stop Event

1×	iter-limit

Counts

5 → 16

Calls

Call 1

Inputs
(*.f64 (+.f64 x y) z)
(+.f64 x y)
x
y
z

Outputs
#s(approx (* (+ x y) z) (*.f64 y z))
#s(approx (* (+ x y) z) (fma.f64 x z (*.f64 y z)))
#s(approx (+ x y) y)
#s(approx (+ x y) (+.f64 x y))
#s(approx x x)
#s(approx (* (+ x y) z) (*.f64 x z))
#s(approx (* (+ x y) z) (.f64 x (+.f64 z (/.f64 (.f64 y z) x))))
#s(approx (+ x y) (*.f64 x (+.f64 #s(literal 1 binary64) (/.f64 y x))))
#s(approx (* (+ x y) z) (.f64 #s(literal -1 binary64) (.f64 x (fma.f64 #s(literal -1 binary64) z (.f64 #s(literal -1 binary64) (/.f64 (.f64 y z) x))))))
#s(approx (+ x y) (.f64 #s(literal -1 binary64) (.f64 x (-.f64 (*.f64 #s(literal -1 binary64) (/.f64 y x)) #s(literal 1 binary64)))))
#s(approx (* (+ x y) z) (.f64 y (+.f64 z (/.f64 (.f64 x z) y))))
#s(approx (+ x y) (*.f64 y (+.f64 #s(literal 1 binary64) (/.f64 x y))))
#s(approx (* (+ x y) z) (.f64 #s(literal -1 binary64) (.f64 y (fma.f64 #s(literal -1 binary64) z (.f64 #s(literal -1 binary64) (/.f64 (.f64 x z) y))))))
#s(approx (+ x y) (.f64 #s(literal -1 binary64) (.f64 y (-.f64 (*.f64 #s(literal -1 binary64) (/.f64 x y)) #s(literal 1 binary64)))))
#s(approx (* (+ x y) z) (*.f64 z (+.f64 x y)))
#s(approx z z)

Calls

9 calls:

Time	Variable		Point	Expression
1.0ms	x	@	inf	((* (+ x y) z) (+ x y) x y z)
1.0ms	y	@	inf	((* (+ x y) z) (+ x y) x y z)
1.0ms	x	@	-inf	((* (+ x y) z) (+ x y) x y z)
1.0ms	z	@	-inf	((* (+ x y) z) (+ x y) x y z)
1.0ms	y	@	-inf	((* (+ x y) z) (+ x y) x y z)

rewrite273.0ms (12.1%)

Memory

36.1MiB live, 222.3MiB allocated; 17ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	28	11
2	69	11
3	218	11
4	452	11
5	903	11
6	3594	11
0	8247	11
1	14029	11

Stop Event

1×	saturated
1×	node-limit
1×	iter-limit

Counts

5 → 25

Calls

Call 1

Inputs
(*.f64 (+.f64 x y) z)
(+.f64 x y)
x
y
z

Outputs
(*.f64 (neg.f64 z) (-.f64 (neg.f64 x) y))
(*.f64 (-.f64 (neg.f64 x) y) (neg.f64 z))
(*.f64 z (+.f64 y x))
(*.f64 (+.f64 y x) z)
(neg.f64 (*.f64 (-.f64 (neg.f64 x) y) z))
(fma.f64 (neg.f64 z) (neg.f64 x) (*.f64 z y))
(fma.f64 (neg.f64 z) (neg.f64 y) (*.f64 z x))
(fma.f64 (neg.f64 x) (neg.f64 z) (*.f64 z y))
(fma.f64 (neg.f64 y) (neg.f64 z) (*.f64 z x))
(fma.f64 z y (*.f64 z x))
(fma.f64 z x (*.f64 z y))
(fma.f64 y z (*.f64 z x))
(fma.f64 x z (*.f64 z y))
(-.f64 (.f64 z y) (.f64 (neg.f64 x) z))
(-.f64 (.f64 z x) (.f64 (neg.f64 y) z))
(+.f64 (.f64 z y) (.f64 z x))
(+.f64 (.f64 z x) (.f64 z y))
(neg.f64 (-.f64 (neg.f64 x) y))
(-.f64 y (neg.f64 x))
(-.f64 x (neg.f64 y))
(+.f64 y x)
(+.f64 x y)
x
y
z

eval3.0ms (0.1%)

Memory: 7.7MiB live, 7.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 162 to 98 computations (39.5% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

4 alts after pruning (3 fresh and 1 done)

	Pruned	Kept	Total
New	34	3	37
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	34	4	38

Accuracy

100.0%

Counts

38 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.6%	(fma.f64 z y (*.f64 z x))
✓	100.0%	(*.f64 (+.f64 x y) z)
▶	56.1%	(*.f64 #s(approx (+ x y) y) z)
▶	53.1%	#s(approx (* (+ x y) z) (*.f64 x z))

Compiler

Compiled 23 to 23 computations (0% saved)

series13.0ms (0.6%)

Memory

-24.1MiB live, 21.2MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	65	196

Stop Event

1×	iter-limit

Counts

9 → 17

Calls

Call 1

Inputs
#s(approx (* (+ x y) z) (*.f64 x z))
(*.f64 x z)
x
z
(*.f64 #s(approx (+ x y) y) z)
#s(approx (+ x y) y)
y
(fma.f64 z y (*.f64 z x))
(*.f64 z x)

Outputs
#s(approx (* (+ x y) z) (*.f64 y z))
#s(approx (* (+ x y) z) (fma.f64 x z (*.f64 y z)))
#s(approx (* x z) (*.f64 x z))
#s(approx x x)
#s(approx (+ x y) y)
#s(approx (+ x y) (+.f64 x y))
#s(approx (* (+ x y) z) (.f64 x (+.f64 z (/.f64 (.f64 y z) x))))
#s(approx (+ x y) (*.f64 x (+.f64 #s(literal 1 binary64) (/.f64 y x))))
#s(approx (* (+ x y) z) (.f64 #s(literal -1 binary64) (.f64 x (fma.f64 #s(literal -1 binary64) z (.f64 #s(literal -1 binary64) (/.f64 (.f64 y z) x))))))
#s(approx (+ x y) (.f64 #s(literal -1 binary64) (.f64 x (-.f64 (*.f64 #s(literal -1 binary64) (/.f64 y x)) #s(literal 1 binary64)))))
#s(approx (* (+ x y) z) (.f64 y (+.f64 z (/.f64 (.f64 x z) y))))
#s(approx (+ x y) (*.f64 y (+.f64 #s(literal 1 binary64) (/.f64 x y))))
#s(approx (* (+ x y) z) (.f64 #s(literal -1 binary64) (.f64 y (fma.f64 #s(literal -1 binary64) z (.f64 #s(literal -1 binary64) (/.f64 (.f64 x z) y))))))
#s(approx (+ x y) (.f64 #s(literal -1 binary64) (.f64 y (-.f64 (*.f64 #s(literal -1 binary64) (/.f64 x y)) #s(literal 1 binary64)))))
#s(approx (* (+ x y) z) (*.f64 z (+.f64 x y)))
#s(approx z z)
#s(approx (+ (* z y) (* z x)) (.f64 #s(literal -1 binary64) (.f64 z (fma.f64 #s(literal -1 binary64) x (*.f64 #s(literal -1 binary64) y)))))

Calls

9 calls:

Time	Variable		Point	Expression
3.0ms	x	@	inf	((* (+ x y) z) (* x z) x z (* (+ x y) z) (+ x y) y (+ (* z y) (* z x)) (* z x))
1.0ms	z	@	-inf	((* (+ x y) z) (* x z) x z (* (+ x y) z) (+ x y) y (+ (* z y) (* z x)) (* z x))
1.0ms	x	@	0	((* (+ x y) z) (* x z) x z (* (+ x y) z) (+ x y) y (+ (* z y) (* z x)) (* z x))
1.0ms	x	@	-inf	((* (+ x y) z) (* x z) x z (* (+ x y) z) (+ x y) y (+ (* z y) (* z x)) (* z x))
1.0ms	z	@	inf	((* (+ x y) z) (* x z) x z (* (+ x y) z) (+ x y) y (+ (* z y) (* z x)) (* z x))

rewrite682.0ms (30.3%)

Memory

-10.7MiB live, 185.2MiB allocated; 431ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	36
0	16	35
1	62	35
2	156	35
3	343	35
4	522	35
5	864	35
6	3551	35
0	8204	35
1	14012	35

Stop Event

1×	saturated
1×	node-limit
1×	iter-limit

Counts

9 → 37

Calls

Call 1

Inputs
#s(approx (* (+ x y) z) (*.f64 x z))
(*.f64 x z)
x
z
(*.f64 #s(approx (+ x y) y) z)
#s(approx (+ x y) y)
y
(fma.f64 z y (*.f64 z x))
(*.f64 z x)

Outputs
#s(approx (* (+ x y) z) (*.f64 z x))
(*.f64 (neg.f64 x) (neg.f64 z))
(*.f64 (neg.f64 z) (neg.f64 x))
(*.f64 z x)
(*.f64 x z)
(neg.f64 (*.f64 (neg.f64 z) x))
x
z
(*.f64 (neg.f64 #s(approx (+ x y) y)) (neg.f64 z))
(*.f64 (neg.f64 z) (neg.f64 #s(approx (+ x y) y)))
(*.f64 #s(approx (+ x y) y) z)
(*.f64 z #s(approx (+ x y) y))
(neg.f64 (*.f64 (neg.f64 z) #s(approx (+ x y) y)))
#s(approx (+ x y) y)
y
(*.f64 (-.f64 (neg.f64 x) y) (neg.f64 z))
(*.f64 (neg.f64 z) (-.f64 (neg.f64 x) y))
(*.f64 z (+.f64 y x))
(*.f64 (+.f64 y x) z)
(neg.f64 (*.f64 (-.f64 (neg.f64 x) y) z))
(fma.f64 (neg.f64 x) (neg.f64 z) (*.f64 z y))
(fma.f64 (neg.f64 z) (neg.f64 x) (*.f64 z y))
(fma.f64 (neg.f64 z) (neg.f64 y) (*.f64 z x))
(fma.f64 (neg.f64 y) (neg.f64 z) (*.f64 z x))
(fma.f64 z y (*.f64 z x))
(fma.f64 z x (*.f64 z y))
(fma.f64 y z (*.f64 z x))
(fma.f64 x z (*.f64 z y))
(-.f64 (.f64 z y) (.f64 (neg.f64 z) x))
(-.f64 (.f64 z x) (.f64 (neg.f64 z) y))
(+.f64 (.f64 z y) (.f64 z x))
(+.f64 (.f64 z x) (.f64 z y))
(*.f64 (neg.f64 x) (neg.f64 z))
(*.f64 (neg.f64 z) (neg.f64 x))
(*.f64 z x)
(*.f64 x z)
(neg.f64 (*.f64 (neg.f64 z) x))

eval4.0ms (0.2%)

Memory: 10.1MiB live, 10.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 202 to 119 computations (41.1% saved)

prune3.0ms (0.1%)

Memory

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

Pruning

4 alts after pruning (0 fresh and 4 done)

	Pruned	Kept	Total
New	44	0	44
Fresh	0	0	0
Picked	0	3	3
Done	0	1	1
Total	44	4	48

Accuracy

100.0%

Counts

48 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.6%	(fma.f64 z y (*.f64 z x))
✓	100.0%	(*.f64 (+.f64 x y) z)
✓	56.1%	(*.f64 #s(approx (+ x y) y) z)
✓	53.1%	#s(approx (* (+ x y) z) (*.f64 x z))

Compiler

Compiled 37 to 36 computations (2.7% saved)

regimes257.0ms (11.4%)

Memory

-23.5MiB live, 21.3MiB allocated; 5ms collecting garbage

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (* (+ x y) z) (*.f64 x z))
(*.f64 #s(approx (+ x y) y) z)
(*.f64 (+.f64 x y) z)
(fma.f64 z y (*.f64 z x))

Outputs
(*.f64 (+.f64 x y) z)

Calls

5 calls:

249.0ms	(+.f64 x y)
2.0ms	z
2.0ms	y
2.0ms	x
2.0ms	(*.f64 (+.f64 x y) z)

Results

Accuracy	Segments	Branch
100.0%	1	`(+.f64 x y)`
100.0%	1	`(*.f64 (+.f64 x y) z)`
100.0%	1	`x`
100.0%	1	`y`
100.0%	1	`z`

Compiler

Compiled 11 to 18 computations (-63.6% saved)

regimes7.0ms (0.3%)

Memory

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

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (* (+ x y) z) (*.f64 x z))
(*.f64 #s(approx (+ x y) y) z)

Outputs
#s(approx (* (+ x y) z) (*.f64 x z))
(*.f64 #s(approx (+ x y) y) z)

Calls

5 calls:

1.0ms	z
1.0ms	y
1.0ms	(+.f64 x y)
1.0ms	x
1.0ms	(*.f64 (+.f64 x y) z)

Results

Accuracy	Segments	Branch
98.1%	2	`(+.f64 x y)`
98.1%	2	`(*.f64 (+.f64 x y) z)`
85.4%	2	`x`
85.9%	2	`y`
65.7%	5	`z`

Compiler

Compiled 11 to 18 computations (-63.6% saved)

regimes5.0ms (0.2%)

Memory

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

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (* (+ x y) z) (*.f64 x z))

Outputs
#s(approx (* (+ x y) z) (*.f64 x z))

Calls

5 calls:

1.0ms	(+.f64 x y)
1.0ms	x
1.0ms	y
1.0ms	z
1.0ms	(*.f64 (+.f64 x y) z)

Results

Accuracy	Segments	Branch
53.1%	1	`z`
53.1%	1	`x`
53.1%	1	`y`
53.1%	1	`(+.f64 x y)`
53.1%	1	`(*.f64 (+.f64 x y) z)`

Compiler

Compiled 11 to 18 computations (-63.6% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-1.0779205619354066e-283	0.0

Compiler

Compiled 8 to 11 computations (-37.5% saved)

derivations1.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 15 to 14 computations (6.7% saved)

preprocess63.0ms (2.8%)

Memory

2.9MiB live, 57.5MiB allocated; 7ms collecting garbage

Remove

(sort x y)

(negabs z)

Compiler

Compiled 128 to 123 computations (3.9% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample889.0ms (39.5%)

preprocess21.0ms (0.9%)

series27.0ms (1.2%)

rewrite273.0ms (12.1%)

eval3.0ms (0.1%)

prune2.0ms (0.1%)

series13.0ms (0.6%)

rewrite682.0ms (30.3%)

eval4.0ms (0.2%)

prune3.0ms (0.1%)

regimes257.0ms (11.4%)

regimes7.0ms (0.3%)

regimes5.0ms (0.2%)

bsearch0.0ms (0%)

derivations1.0ms (0.1%)

preprocess63.0ms (2.8%)

end0.0ms (0%)

Profiling