Metrics for Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, C

start0.0ms (0%)

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

analyze54.0ms (5.4%)

Memory

-32.0MiB live, 12.2MiB allocated; 11ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
0%	0%	99.9%	0.1%	0%	0%	0%	1
0%	0%	99.9%	0.1%	0%	0%	0%	2
50%	50%	50%	0.1%	0%	0%	0%	3
50%	50%	50%	0.1%	0%	0%	0%	4
75%	74.9%	25%	0.1%	0%	0%	0%	5
75%	74.9%	25%	0.1%	0%	0%	0%	6
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	7
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	8
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	9
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	10
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	11
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	12

Compiler

Compiled 7 to 7 computations (0% saved)

sample559.0ms (56.8%)

Memory

19.3MiB live, 629.2MiB allocated; 103ms collecting garbage

Samples

344.0ms

8 256×

valid

Precisions

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

ival-div!: 47.0ms (49.6% of total)

ival-mult!: 46.0ms (48.6% of total)

adjust: 2.0ms (2.1% of total)

Bogosity

explain136.0ms (13.8%)

Memory

-11.3MiB live, 65.2MiB allocated; 111ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(*.f64 y #s(literal 3 binary64))`
-	-	`y`
-	-	`#s(literal 3 binary64)`
-	-	`(/.f64 x (*.f64 y #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

114.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-div!: 8.0ms (74.6% of total)

ival-mult!: 2.0ms (18.6% of total)

adjust: 0.0ms (0% of total)

preprocess11.0ms (1.1%)

Memory

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

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	14	32
1	32	30
2	56	30
3	82	30
4	111	30
5	127	30

Stop Event

1×

saturated

Alt Table

Click to see full alt table

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

Symmetry

(negabs x)

(negabs y)

Compiler

Compiled 10 to 10 computations (0% saved)

series15.0ms (1.5%)

Memory

-39.0MiB live, 11.6MiB allocated; 18ms collecting garbage

Counts

5 → 4

Calls

Call 1

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

Outputs
#s(approx (/ x (* y 3)) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx x #s(hole binary64 x))
#s(approx (* y 3) #s(hole binary64 (* 3 y)))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

Time	Variable		Point	Expression
9.0ms	x	@	-inf	((/ x (* y 3)) x (* y 3) y 3)
2.0ms	y	@	inf	((/ x (* y 3)) x (* y 3) y 3)
1.0ms	x	@	inf	((/ x (* y 3)) x (* y 3) y 3)
1.0ms	y	@	-inf	((/ x (* y 3)) x (* y 3) y 3)
1.0ms	y	@	0	((/ x (* y 3)) x (* y 3) y 3)

rewrite21.0ms (2.2%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	35
0	16	35
1	26	35
2	57	35
3	127	35
4	153	35
5	156	35
0	156	35

Stop Event

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

Counts

9 → 19

Calls

Call 1

Inputs
(/.f64 x (*.f64 y #s(literal 3 binary64)))
x
(*.f64 y #s(literal 3 binary64))
y
#s(literal 3 binary64)
#s(approx (/ x (* y 3)) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx x #s(hole binary64 x))
#s(approx (* y 3) #s(hole binary64 (* 3 y)))
#s(approx y #s(hole binary64 y))

Outputs
(/.f64 (/.f64 x #s(literal -3 binary64)) (neg.f64 y))
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 (/.f64 (neg.f64 x) y) #s(literal -3 binary64))
(/.f64 (neg.f64 x) (*.f64 #s(literal -3 binary64) y))
(/.f64 (/.f64 x y) #s(literal 3 binary64))
(/.f64 x (*.f64 #s(literal 3 binary64) y))
(neg.f64 (/.f64 (/.f64 x y) #s(literal -3 binary64)))
x
(*.f64 #s(literal -3 binary64) (neg.f64 y))
(*.f64 (neg.f64 y) #s(literal -3 binary64))
(*.f64 #s(literal 3 binary64) y)
(*.f64 y #s(literal 3 binary64))
(neg.f64 (*.f64 #s(literal -3 binary64) y))
y
#s(literal 3 binary64)
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx x x)
#s(approx (* y 3) (*.f64 #s(literal 3 binary64) y))
#s(approx y y)

eval6.0ms (0.6%)

Memory: -37.3MiB live, 5.2MiB allocated; 9ms collecting garbage
Compiler: Compiled 96 to 40 computations (58.3% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

4 alts after pruning (3 fresh and 1 done)

	Pruned	Kept	Total
New	12	3	15
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	12	4	16

Accuracy

100.0%

Counts

16 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.6%	(/.f64 (/.f64 x y) #s(literal 3 binary64))
▶	99.7%	(/.f64 (/.f64 x #s(literal 3 binary64)) y)
✓	99.7%	(/.f64 x (*.f64 y #s(literal 3 binary64)))
▶	99.6%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))

Compiler

Compiled 26 to 24 computations (7.7% saved)

series5.0ms (0.5%)

Memory

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

Counts

10 → 8

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
(*.f64 (/.f64 x y) #s(literal 1/3 binary64))
(/.f64 x y)
x
y
#s(literal 1/3 binary64)
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 x #s(literal 3 binary64))
#s(literal 3 binary64)
(/.f64 (/.f64 x y) #s(literal 3 binary64))

Outputs
#s(approx (/ x (* y 3)) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (* (/ x y) 1/3) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (/ x y) #s(hole binary64 (/ x y)))
#s(approx x #s(hole binary64 x))
#s(approx (/ (/ x 3) y) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (/ x 3) #s(hole binary64 (* 1/3 x)))
#s(approx (/ (/ x y) 3) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

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

rewrite12.0ms (1.2%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	27	100
0	34	100
1	52	100
2	99	100
3	151	100
4	172	100
5	174	100
0	174	100

Stop Event

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

Counts

18 → 44

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
(*.f64 (/.f64 x y) #s(literal 1/3 binary64))
(/.f64 x y)
x
y
#s(literal 1/3 binary64)
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 x #s(literal 3 binary64))
#s(literal 3 binary64)
(/.f64 (/.f64 x y) #s(literal 3 binary64))
#s(approx (/ x (* y 3)) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (* (/ x y) 1/3) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (/ x y) #s(hole binary64 (/ x y)))
#s(approx x #s(hole binary64 x))
#s(approx (/ (/ x 3) y) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (/ x 3) #s(hole binary64 (* 1/3 x)))
#s(approx (/ (/ x y) 3) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx y #s(hole binary64 y))

Outputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
(*.f64 (/.f64 #s(literal -1/3 binary64) y) (neg.f64 x))
(*.f64 #s(literal -1/3 binary64) (/.f64 (neg.f64 x) y))
(*.f64 (/.f64 #s(literal 1/3 binary64) y) x)
(*.f64 (neg.f64 x) (/.f64 #s(literal -1/3 binary64) y))
(*.f64 (/.f64 (neg.f64 x) y) #s(literal -1/3 binary64))
(*.f64 (/.f64 x y) #s(literal 1/3 binary64))
(*.f64 #s(literal 1/3 binary64) (/.f64 x y))
(*.f64 x (/.f64 #s(literal 1/3 binary64) y))
(/.f64 (*.f64 #s(literal 1/3 binary64) x) y)
(/.f64 (*.f64 #s(literal -1/3 binary64) x) (neg.f64 y))
(neg.f64 (*.f64 #s(literal -1/3 binary64) (/.f64 x y)))
(/.f64 (neg.f64 x) (neg.f64 y))
(/.f64 x y)
(neg.f64 (/.f64 (neg.f64 x) y))
x
y
#s(literal 1/3 binary64)
(/.f64 (neg.f64 x) (*.f64 #s(literal -3 binary64) y))
(/.f64 (/.f64 x #s(literal -3 binary64)) (neg.f64 y))
(/.f64 (/.f64 (neg.f64 x) y) #s(literal -3 binary64))
(/.f64 (/.f64 x y) #s(literal 3 binary64))
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 x (*.f64 #s(literal 3 binary64) y))
(neg.f64 (/.f64 (/.f64 x #s(literal -3 binary64)) y))
(/.f64 (neg.f64 x) #s(literal -3 binary64))
(/.f64 x #s(literal 3 binary64))
(neg.f64 (/.f64 x #s(literal -3 binary64)))
#s(literal 3 binary64)
(/.f64 (neg.f64 x) (*.f64 #s(literal -3 binary64) y))
(/.f64 (/.f64 x #s(literal -3 binary64)) (neg.f64 y))
(/.f64 (/.f64 (neg.f64 x) y) #s(literal -3 binary64))
(/.f64 (/.f64 x y) #s(literal 3 binary64))
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 x (*.f64 #s(literal 3 binary64) y))
(neg.f64 (/.f64 (/.f64 x #s(literal -3 binary64)) y))
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx (* (/ x y) 1/3) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx (/ x y) (/.f64 x y))
#s(approx x x)
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx y y)

eval3.0ms (0.3%)

Memory: 6.0MiB live, 5.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 301 to 86 computations (71.4% saved)

prune5.0ms (0.5%)

Memory

-38.8MiB live, 6.7MiB allocated; 3ms collecting garbage

Pruning

6 alts after pruning (2 fresh and 4 done)

	Pruned	Kept	Total
New	29	2	31
Fresh	0	0	0
Picked	0	3	3
Done	0	1	1
Total	29	6	35

Accuracy

100.0%

Counts

35 → 6

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.6%	(/.f64 (/.f64 x y) #s(literal 3 binary64))
✓	99.7%	(/.f64 (/.f64 x #s(literal 3 binary64)) y)
▶	99.6%	(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
✓	99.7%	(/.f64 x (*.f64 y #s(literal 3 binary64)))
✓	99.6%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
▶	99.5%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))

Compiler

Compiled 46 to 41 computations (10.9% saved)

series4.0ms (0.4%)

Memory

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

Counts

9 → 8

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))
(*.f64 (/.f64 #s(literal 1/3 binary64) y) x)
(/.f64 #s(literal 1/3 binary64) y)
#s(literal 1/3 binary64)
y
x
(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
#s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))
(*.f64 #s(literal 1/3 binary64) x)

Outputs
#s(approx (/ x (* y 3)) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (* (/ 1/3 y) x) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx x #s(hole binary64 x))
#s(approx (/ (/ x 3) y) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (/ x 3) #s(hole binary64 (* 1/3 x)))
#s(approx (* 1/3 x) #s(hole binary64 (* 1/3 x)))
#s(approx (/ 1/3 y) #s(hole binary64 (/ 1/3 y)))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

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

rewrite13.0ms (1.3%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	27	101
0	31	101
1	54	101
2	109	101
3	195	101
4	206	101
5	206	101
0	206	101

Stop Event

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

Counts

17 → 37

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))
(*.f64 (/.f64 #s(literal 1/3 binary64) y) x)
(/.f64 #s(literal 1/3 binary64) y)
#s(literal 1/3 binary64)
y
x
(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
#s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))
(*.f64 #s(literal 1/3 binary64) x)
#s(approx (/ x (* y 3)) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (* (/ 1/3 y) x) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx x #s(hole binary64 x))
#s(approx (/ (/ x 3) y) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (/ x 3) #s(hole binary64 (* 1/3 x)))
#s(approx (* 1/3 x) #s(hole binary64 (* 1/3 x)))
#s(approx (/ 1/3 y) #s(hole binary64 (/ 1/3 y)))
#s(approx y #s(hole binary64 y))

Outputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
(*.f64 (/.f64 (neg.f64 x) y) #s(literal -1/3 binary64))
(*.f64 (/.f64 #s(literal -1/3 binary64) y) (neg.f64 x))
(*.f64 (neg.f64 x) (/.f64 #s(literal -1/3 binary64) y))
(*.f64 #s(literal -1/3 binary64) (/.f64 (neg.f64 x) y))
(*.f64 (/.f64 #s(literal 1/3 binary64) y) x)
(*.f64 (/.f64 x y) #s(literal 1/3 binary64))
(*.f64 #s(literal 1/3 binary64) (/.f64 x y))
(*.f64 x (/.f64 #s(literal 1/3 binary64) y))
(/.f64 (*.f64 #s(literal -1/3 binary64) x) (neg.f64 y))
(/.f64 (*.f64 #s(literal 1/3 binary64) x) y)
(neg.f64 (*.f64 (/.f64 #s(literal -1/3 binary64) y) x))
(/.f64 #s(literal -1/3 binary64) (neg.f64 y))
(/.f64 #s(literal 1/3 binary64) y)
(neg.f64 (/.f64 #s(literal -1/3 binary64) y))
#s(literal 1/3 binary64)
y
x
(/.f64 (neg.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))) (neg.f64 y))
(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
(neg.f64 (/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) (neg.f64 y)))
#s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))
(neg.f64 (neg.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))))
(*.f64 (neg.f64 x) #s(literal -1/3 binary64))
(*.f64 #s(literal -1/3 binary64) (neg.f64 x))
(*.f64 #s(literal 1/3 binary64) x)
(*.f64 x #s(literal 1/3 binary64))
(neg.f64 (*.f64 #s(literal -1/3 binary64) x))
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx (* (/ 1/3 y) x) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx x x)
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))
(neg.f64 (neg.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))))
#s(approx (* 1/3 x) (*.f64 #s(literal 1/3 binary64) x))
#s(approx (/ 1/3 y) (/.f64 #s(literal 1/3 binary64) y))
#s(approx y y)

eval2.0ms (0.2%)

Memory: 5.3MiB live, 5.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 294 to 84 computations (71.4% saved)

prune3.0ms (0.3%)

Memory

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

Pruning

6 alts after pruning (0 fresh and 6 done)

	Pruned	Kept	Total
New	25	0	25
Fresh	0	0	0
Picked	0	2	2
Done	0	4	4
Total	25	6	31

Accuracy

100.0%

Counts

31 → 6

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.6%	(/.f64 (/.f64 x y) #s(literal 3 binary64))
✓	99.7%	(/.f64 (/.f64 x #s(literal 3 binary64)) y)
✓	99.6%	(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
✓	99.7%	(/.f64 x (*.f64 y #s(literal 3 binary64)))
✓	99.6%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
✓	99.5%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))

Compiler

Compiled 92 to 63 computations (31.5% saved)

regimes14.0ms (1.4%)

Memory

-29.6MiB live, 27.3MiB allocated; 7ms collecting garbage

Counts

6 → 1

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
(/.f64 x (*.f64 y #s(literal 3 binary64)))
(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 (/.f64 x y) #s(literal 3 binary64))

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

Calls

4 calls:

7.0ms	y
2.0ms	x
2.0ms	(*.f64 y #s(literal 3 binary64))
2.0ms	(/.f64 x (*.f64 y #s(literal 3 binary64)))

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes7.0ms (0.7%)

Memory

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

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
(/.f64 x (*.f64 y #s(literal 3 binary64)))
(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)

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

Calls

4 calls:

2.0ms	(*.f64 y #s(literal 3 binary64))
2.0ms	x
2.0ms	y
2.0ms	(/.f64 x (*.f64 y #s(literal 3 binary64)))

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes12.0ms (1.2%)

Memory

-31.0MiB live, 13.9MiB allocated; 12ms collecting garbage

Counts

2 → 1

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))

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

Calls

4 calls:

8.0ms	x
1.0ms	(*.f64 y #s(literal 3 binary64))
1.0ms	y
1.0ms	(/.f64 x (*.f64 y #s(literal 3 binary64)))

Results

Accuracy	Segments	Branch
99.6%	1	`(*.f64 y #s(literal 3 binary64))`
99.6%	1	`(/.f64 x (*.f64 y #s(literal 3 binary64)))`
99.6%	1	`x`
99.6%	1	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes4.0ms (0.4%)

Memory

11.5MiB live, 11.5MiB 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 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))

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

Calls

4 calls:

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

Results

Accuracy	Segments	Branch
99.5%	1	`(*.f64 y #s(literal 3 binary64))`
99.5%	1	`(/.f64 x (*.f64 y #s(literal 3 binary64)))`
99.5%	1	`x`
99.5%	1	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

derivations4.0ms (0.4%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 32 to 17 computations (46.9% saved)

preprocess93.0ms (9.4%)

Memory

-11.6MiB live, 78.4MiB allocated; 15ms collecting garbage

Remove

(negabs y)

(negabs x)

Compiler

Compiled 170 to 139 computations (18.2% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze54.0ms (5.4%)

sample559.0ms (56.8%)

explain136.0ms (13.8%)

preprocess11.0ms (1.1%)

series15.0ms (1.5%)

rewrite21.0ms (2.2%)

eval6.0ms (0.6%)

prune1.0ms (0.1%)

series5.0ms (0.5%)

rewrite12.0ms (1.2%)

eval3.0ms (0.3%)

prune5.0ms (0.5%)

series4.0ms (0.4%)

rewrite13.0ms (1.3%)

eval2.0ms (0.2%)

prune3.0ms (0.3%)

regimes14.0ms (1.4%)

regimes7.0ms (0.7%)

regimes12.0ms (1.2%)

regimes4.0ms (0.4%)

derivations4.0ms (0.4%)

preprocess93.0ms (9.4%)

end0.0ms (0%)

Profiling