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.2MiB live, 0.2MiB 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)

sample459.0ms (68.4%)

Memory

-18.7MiB live, 551.2MiB allocated; 137ms collecting garbage

Samples

311.0ms

8 256×

valid

Precisions

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

ival-mult!: 108.0ms (98.8% of total)

adjust: 1.0ms (0.9% of total)

Bogosity

preprocess102.0ms (15.2%)

Memory

-8.8MiB live, 37.3MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	8	18
1	21	15
2	50	15
3	71	15
4	91	15
5	137	15
6	253	15
7	1125	15
8	4005	15

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Symmetry

(abs x)

Compiler

Compiled 8 to 8 computations (0% saved)

series3.0ms (0.5%)

Memory

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

rewrite25.0ms (3.7%)

Memory

33.3MiB live, 33.3MiB allocated; 0ms 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.7MiB live, 1.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 26 to 17 computations (34.6% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

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

Accuracy

99.9%

Counts

9 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 8 to 8 computations (0% saved)

series2.0ms (0.3%)

Memory

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

rewrite50.0ms (7.5%)

Memory

-18.9MiB live, 28.1MiB allocated; 2ms 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) (fabs.f64 x)) (fabs.f64 x))
(.f64 (.f64 #s(literal 3 binary64) (neg.f64 x)) (neg.f64 x))
(.f64 (.f64 #s(literal 3 binary64) x) x)
(.f64 (fabs.f64 x) (.f64 (fabs.f64 x) #s(literal 3 binary64)))
(.f64 (neg.f64 x) (.f64 (neg.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 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)))
(*.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)))
(*.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)))
(*.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)))
(*.f64 (fabs.f64 x) (fabs.f64 x))
(*.f64 (neg.f64 x) (neg.f64 x))
(*.f64 x x)
(pow.f64 (exp.f64 (log.f64 x)) #s(literal 2 binary64))
(pow.f64 (fabs.f64 x) #s(literal 2 binary64))
(pow.f64 (neg.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 x (neg.f64 x)))
(neg.f64 (*.f64 (neg.f64 x) 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: 4.3MiB live, 4.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 110 to 70 computations (36.4% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	26	0	26
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	26	2	28

Accuracy

99.9%

Counts

28 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 14 to 14 computations (0% saved)

regimes2.0ms (0.4%)

Memory

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

Accuracy

Total -0.1b remaining (-100%)

Threshold costs -0.1b (-100%)

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 #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.8%	1	`(.f64 (.f64 x #s(literal 3 binary64)) x)`
99.8%	1	`x`

Compiler

Compiled 5 to 5 computations (0% saved)

derivations0.0ms (0%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 4 to 4 computations (0% saved)

preprocess22.0ms (3.3%)

Memory: -22.1MiB live, 25.0MiB allocated; 12ms collecting garbage
Remove: (abs x)
Compiler: Compiled 16 to 16 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample459.0ms (68.4%)

preprocess102.0ms (15.2%)

series3.0ms (0.5%)

rewrite25.0ms (3.7%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

series2.0ms (0.3%)

rewrite50.0ms (7.5%)

eval2.0ms (0.3%)

prune2.0ms (0.2%)

regimes2.0ms (0.4%)

derivations0.0ms (0%)

preprocess22.0ms (3.3%)

end0.0ms (0%)

Profiling