Metrics for Diagrams.Tangent:$catParam from diagrams-lib-1.3.0.3, F

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%	100%	0%	0%	0%	0%	0
100%	100%	0%	0%	0%	0%	0%	1

Compiler

Compiled 7 to 6 computations (14.3% saved)

sample443.0ms (57.6%)

Memory

-5.4MiB live, 659.6MiB allocated; 117ms collecting garbage

Samples

241.0ms

8 256×

valid

Precisions

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

ival-mult!: 89.0ms (98.1% of total)

adjust: 2.0ms (2.2% of total)

Bogosity

preprocess7.0ms (0.9%)

Memory

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

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	8	18
1	21	15
2	49	15
3	70	15
4	85	15
5	123	15
6	145	15

Stop Event

1×

saturated

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.7%	(.f64 (.f64 x #s(literal 3 binary64)) x)

Symmetry

(abs x)

Compiler

Compiled 8 to 8 computations (0% saved)

series3.0ms (0.4%)

Memory

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

Counts

4 → 3

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 3 binary64)) x)
(*.f64 x #s(literal 3 binary64))
x
#s(literal 3 binary64)

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

Calls

3 calls:

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

rewrite66.0ms (8.7%)

Memory

-8.1MiB live, 37.5MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	31
0	15	31
1	28	31
0	73	31

Stop Event

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

Counts

7 → 11

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 3 binary64)) x)
(*.f64 x #s(literal 3 binary64))
x
#s(literal 3 binary64)
#s(approx (* (* x 3) x) #s(hole binary64 (* 3 (pow x 2))))
#s(approx (* x 3) #s(hole binary64 (* 3 x)))
#s(approx x #s(hole binary64 x))

Outputs
(.f64 (.f64 x x) #s(literal 3 binary64))
(.f64 (.f64 #s(literal 3 binary64) x) x)
(.f64 #s(literal 3 binary64) (.f64 x x))
(.f64 x (.f64 #s(literal 3 binary64) x))
(*.f64 #s(literal 3 binary64) x)
(*.f64 x #s(literal 3 binary64))
x
#s(literal 3 binary64)
#s(approx (* (* x 3) x) (.f64 (.f64 x x) #s(literal 3 binary64)))
#s(approx (* x 3) (*.f64 #s(literal 3 binary64) x))
#s(approx x x)

eval1.0ms (0.1%)

Memory: 1.0MiB live, 1.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 28 to 19 computations (32.1% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	8	1	9
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	8	2	10

Accuracy

99.9%

Counts

10 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.8%	(.f64 (.f64 x x) #s(literal 3 binary64))
✓	99.7%	(.f64 (.f64 x #s(literal 3 binary64)) x)

Compiler

Compiled 8 to 8 computations (0% saved)

series2.0ms (0.2%)

Memory

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

Counts

4 → 3

Calls

Call 1

Inputs
(.f64 (.f64 x x) #s(literal 3 binary64))
(*.f64 x x)
x
#s(literal 3 binary64)

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

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	inf	((* (* x x) 3) (* x x) x 3)
1.0ms	x	@	-inf	((* (* x x) 3) (* x x) x 3)
0.0ms	x	@	0	((* (* x x) 3) (* x x) x 3)

rewrite22.0ms (2.8%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	31
0	14	31
1	31	31
0	97	31

Stop Event

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

Counts

7 → 30

Calls

Call 1

Inputs
(.f64 (.f64 x x) #s(literal 3 binary64))
(*.f64 x x)
x
#s(literal 3 binary64)
#s(approx (* (* x x) 3) #s(hole binary64 (* 3 (pow x 2))))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx x #s(hole binary64 x))

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

eval2.0ms (0.3%)

Memory: 5.8MiB live, 5.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 112 to 72 computations (35.7% saved)

prune7.0ms (0.9%)

Memory

-38.0MiB live, 8.6MiB allocated; 3ms collecting garbage

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	27	0	27
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	27	2	29

Accuracy

99.9%

Counts

29 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.8%	(.f64 (.f64 x x) #s(literal 3 binary64))
✓	99.7%	(.f64 (.f64 x #s(literal 3 binary64)) x)

Compiler

Compiled 14 to 14 computations (0% saved)

regimes3.0ms (0.3%)

Memory

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

Counts

2 → 1

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 3 binary64)) x)
(.f64 (.f64 x x) #s(literal 3 binary64))

Outputs
(.f64 (.f64 x x) #s(literal 3 binary64))

Calls

2 calls:

1.0ms	x
1.0ms	(.f64 (.f64 x #s(literal 3 binary64)) x)

Results

Accuracy	Segments	Branch
99.8%	1	`(.f64 (.f64 x #s(literal 3 binary64)) x)`
99.8%	1	`x`

Compiler

Compiled 5 to 5 computations (0% saved)

regimes2.0ms (0.3%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 3 binary64)) x)

Outputs
(.f64 (.f64 x #s(literal 3 binary64)) x)

Calls

2 calls:

1.0ms	x
1.0ms	(.f64 (.f64 x #s(literal 3 binary64)) x)

Results

Accuracy	Segments	Branch
99.7%	1	`(.f64 (.f64 x #s(literal 3 binary64)) x)`
99.7%	1	`x`

Compiler

Compiled 5 to 5 computations (0% saved)

derivations1.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 6 to 6 computations (0% saved)

preprocess209.0ms (27.2%)

Memory: -46.1MiB live, 79.2MiB allocated; 126ms collecting garbage
Remove: (abs x)
Compiler: Compiled 26 to 26 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample443.0ms (57.6%)

preprocess7.0ms (0.9%)

series3.0ms (0.4%)

rewrite66.0ms (8.7%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

series2.0ms (0.2%)

rewrite22.0ms (2.8%)

eval2.0ms (0.3%)

prune7.0ms (0.9%)

regimes3.0ms (0.3%)

regimes2.0ms (0.3%)

derivations1.0ms (0.1%)

preprocess209.0ms (27.2%)

end0.0ms (0%)

Profiling