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.1%)

Memory

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

sample338.0ms (67.9%)

Memory

-7.0MiB live, 129.2MiB allocated; 12ms collecting garbage

Samples

189.0ms

8 256×

valid

Precisions

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

ival-mult!: 70.0ms (90.2% of total)

adjust: 7.0ms (9% of total)

Bogosity

explain34.0ms (6.7%)

Memory

2.2MiB live, 20.3MiB allocated; 0ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(.f64 (.f64 x #s(literal 3 binary64)) x)`
-	-	`#s(literal 3 binary64)`
-	-	`(*.f64 x #s(literal 3 binary64))`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

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

Precision?

0/0

Recall?

0/0

Samples

14.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

ival-mult!: 5.0ms (95.4% of total)

adjust: 0.0ms (0% of total)

preprocess21.0ms (4.2%)

Memory

-1.4MiB live, 6.3MiB allocated; 1ms collecting garbage

Iterations

Useful iterations: 0 (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
0	4	5
0	6	5
1	9	5
2	12	5
3	16	5
4	37	5
5	73	5
6	105	5
7	123	5
8	123	5
0	123	5

Stop Event

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

Calls

Call 1

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

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

Symmetry

(abs 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 1 computations (-∞% saved)

prune0.0ms (0.1%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 4 computations (20% saved)

series3.0ms (0.6%)

Memory

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

rewrite33.0ms (6.6%)

Memory

-1.6MiB live, 5.8MiB 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.2%)

Memory: 0.8MiB live, 0.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 79 to 20 computations (74.7% saved)

prune2.0ms (0.3%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	12	1	13
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	12	2	14

Accuracy

99.9%

Counts

14 → 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 10 to 8 computations (20% saved)

series2.0ms (0.3%)

Memory

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

rewrite25.0ms (5%)

Memory

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

eval11.0ms (2.2%)

Memory: -5.5MiB live, 2.3MiB allocated; 1ms collecting garbage
Compiler: Compiled 223 to 73 computations (67.3% saved)

prune2.0ms (0.5%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

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

Accuracy

99.9%

Counts

34 → 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 20 to 14 computations (30% saved)

regimes2.0ms (0.5%)

Memory

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

Accuracy

Total -0.1b remaining (-67.6%)

Threshold costs -0.1b (-67.6%)

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 6 to 5 computations (16.7% saved)

simplify13.0ms (2.7%)

Memory

-3.4MiB live, 5.0MiB allocated; 1ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	5

Stop Event

1×

saturated

Calls

Call 1

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

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

derivations0.0ms (0%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 5 to 4 computations (20% saved)

preprocess10.0ms (2%)

Memory: -1.1MiB live, 6.6MiB allocated; 0ms collecting garbage
Remove: (abs x)
Compiler: Compiled 40 to 32 computations (20% saved)

end0.0ms (0%)

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

Iter	Nodes	Cost
0	8	18
1	21	15
2	49	15
3	70	15
4	85	15
5	123	15
6	145	15
0	4	5
0	6	5
1	9	5
2	12	5
3	16	5
4	37	5
5	73	5
6	105	5
7	123	5
8	123	5
0	123	5

Iter	Nodes	Cost
0	8	18
1	21	15
2	49	15
3	70	15
4	85	15
5	123	15
6	145	15
0	4	5
0	6	5
1	9	5
2	12	5
3	16	5
4	37	5
5	73	5
6	105	5
7	123	5
8	123	5
0	123	5

start0.0ms (0%)

analyze0.0ms (0.1%)

sample338.0ms (67.9%)

explain34.0ms (6.7%)

preprocess21.0ms (4.2%)

eval0.0ms (0%)

prune0.0ms (0.1%)

series3.0ms (0.6%)

rewrite33.0ms (6.6%)

eval1.0ms (0.2%)

prune2.0ms (0.3%)

series2.0ms (0.3%)

rewrite25.0ms (5%)

eval11.0ms (2.2%)

prune2.0ms (0.5%)

regimes2.0ms (0.5%)

simplify13.0ms (2.7%)

derivations0.0ms (0%)

preprocess10.0ms (2%)

end0.0ms (0%)

Profiling

Iter	Nodes	Cost
0	8	18
1	21	15
2	49	15
3	70	15
4	85	15
5	123	15
6	145	15
0	4	5
0	6	5
1	9	5
2	12	5
3	16	5
4	37	5
5	73	5
6	105	5
7	123	5
8	123	5
0	123	5