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

start0.0ms (0%)

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

analyze1.0ms (0.1%)

Memory

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

sample706.0ms (78.9%)

Memory

34.0MiB live, 540.5MiB allocated; 651ms collecting garbage

Samples

522.0ms

8 256×

valid

Precisions

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

ival-mult!: 44.0ms (60.4% of total)

ival-add!: 27.0ms (37.1% of total)

adjust: 1.0ms (1.4% of total)

Bogosity

preprocess21.0ms (2.4%)

Memory

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

series11.0ms (1.2%)

Memory

8.0MiB live, 8.0MiB allocated; 0ms 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
1.0ms	x	inf
1.0ms	y	inf
1.0ms	x	-inf
1.0ms	z	-inf
0.0ms	y	-inf

rewrite33.0ms (3.7%)

Memory

-25.6MiB live, 19.2MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	11	11
2	25	11
3	65	11
4	114	11
5	157	11
0	157	11

Stop Event

1×	iter-limit
1×	saturated
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.4%)

Memory: 9.2MiB live, 9.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 342 to 98 computations (71.3% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

5 alts after pruning (4 fresh and 1 done)

	Pruned	Kept	Total
New	33	4	37
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	33	5	38

Accuracy

100.0%

Counts

38 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.2%	(fma.f64 z y (*.f64 z x))
▶	98.8%	(fma.f64 z x (*.f64 z y))
✓	100.0%	(*.f64 (+.f64 x y) z)
▶	53.4%	(*.f64 #s(approx (+ x y) y) z)
▶	55.0%	#s(approx (* (+ x y) z) (*.f64 x z))

Compiler

Compiled 33 to 28 computations (15.2% saved)

series28.0ms (3.1%)

Memory

-27.7MiB live, 18.5MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	65	196

Stop Event

1×	iter-limit

Counts

11 → 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 x (*.f64 z y))
(*.f64 z 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 x) (* z y)) (.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
1.0ms	z	-inf
1.0ms	x	0
1.0ms	z	inf
1.0ms	x	-inf
1.0ms	y	-inf

rewrite11.0ms (1.2%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	45
0	19	43
1	36	43
2	71	43
3	116	43
4	149	43
5	153	43
6	160	43
7	167	43
0	167	43

Stop Event

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

Counts

11 → 60

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 x (*.f64 z y))
(*.f64 z 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)
(neg.f64 (neg.f64 #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 x) (.f64 (neg.f64 z) y))
(-.f64 (.f64 z y) (.f64 (neg.f64 z) x))
(+.f64 (.f64 z x) (.f64 z y))
(+.f64 (.f64 z y) (.f64 z x))
(*.f64 (neg.f64 z) (neg.f64 y))
(*.f64 (neg.f64 y) (neg.f64 z))
(*.f64 z y)
(*.f64 y z)
(neg.f64 (*.f64 (neg.f64 z) 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 x) (.f64 (neg.f64 z) y))
(-.f64 (.f64 z y) (.f64 (neg.f64 z) x))
(+.f64 (.f64 z x) (.f64 z y))
(+.f64 (.f64 z y) (.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))

eval4.0ms (0.5%)

Memory: 10.6MiB live, 10.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 498 to 130 computations (73.9% saved)

prune3.0ms (0.3%)

Memory

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

Pruning

5 alts after pruning (0 fresh and 5 done)

	Pruned	Kept	Total
New	50	0	50
Fresh	0	0	0
Picked	0	4	4
Done	0	1	1
Total	50	5	55

Accuracy

100.0%

Counts

55 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.2%	(fma.f64 z y (*.f64 z x))
✓	98.8%	(fma.f64 z x (*.f64 z y))
✓	100.0%	(*.f64 (+.f64 x y) z)
✓	53.4%	(*.f64 #s(approx (+ x y) y) z)
✓	55.0%	#s(approx (* (+ x y) z) (*.f64 x z))

Compiler

Compiled 33 to 28 computations (15.2% saved)

regimes36.0ms (4%)

Memory

-49.3MiB live, 63.7MiB allocated; 28ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

2 → 2

5 → 1

Calls

Call 1

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

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

Call 2

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)

Call 3

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

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

Calls

15 calls:

12.0ms	z
4.0ms	y
2.0ms	x
2.0ms	z
2.0ms	(+.f64 x y)

Results

Accuracy	Segments	Branch
55.0%	1	`z`
55.0%	1	`y`
55.0%	1	`x`
55.0%	1	`(+.f64 x y)`
55.0%	1	`(*.f64 (+.f64 x y) z)`
99.3%	2	`(+.f64 x y)`
99.3%	2	`(*.f64 (+.f64 x y) z)`
90.5%	2	`x`
81.8%	2	`y`
67.8%	5	`z`
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 66 to 69 computations (-4.5% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-6.727982980761727e-307	0.0

Compiler

Compiled 8 to 11 computations (-37.5% saved)

derivations1.0ms (0.2%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 38 to 14 computations (63.2% saved)

preprocess35.0ms (3.9%)

Memory: 38.6MiB live, 83.7MiB allocated; 5ms collecting garbage
Remove: (negabs z)
Compiler: Compiled 213 to 137 computations (35.7% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze1.0ms (0.1%)

sample706.0ms (78.9%)

preprocess21.0ms (2.4%)

series11.0ms (1.2%)

rewrite33.0ms (3.7%)

eval3.0ms (0.4%)

prune2.0ms (0.2%)

series28.0ms (3.1%)

rewrite11.0ms (1.2%)

eval4.0ms (0.5%)

prune3.0ms (0.3%)

regimes36.0ms (4%)

bsearch0.0ms (0%)

derivations1.0ms (0.2%)

preprocess35.0ms (3.9%)

end0.0ms (0%)

Profiling