Metrics for Data.Histogram.Bin.LogBinD:$cbinSizeN from histogram-fill-0.8.4.1

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.7MiB live, 0.7MiB 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 6 computations (14.3% saved)

sample513.0ms (63.1%)

Memory

46.6MiB live, 951.7MiB allocated; 43ms collecting garbage

Samples

292.0ms

8 256×

valid

Precisions

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

ival-mult: 75.0ms (60.5% of total)

ival-sub: 44.0ms (35.5% of total)

ival-assert: 3.0ms (2.4% of total)

adjust: 2.0ms (1.6% of total)

Bogosity

explain52.0ms (6.4%)

Memory

-39.4MiB live, 106.3MiB allocated; 5ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`y`
-	-	`(-.f64 (*.f64 x y) x)`
-	-	`(*.f64 x y)`
-	-	`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

22.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

ival-mult: 7.0ms (67.2% of total)

ival-sub: 2.0ms (19.2% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

preprocess13.0ms (1.6%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	38
1	19	38
0	4	5
0	6	5
1	7	5
0	7	5

Stop Event

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

Calls

Call 1

Inputs
(-.f64 (*.f64 x y) x)

Outputs
(-.f64 (*.f64 x y) x)
(-.f64 (*.f64 y x) x)

Compiler

Compiled 5 to 4 computations (20% saved)

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(-.f64 (*.f64 x y) x)

Compiler

Compiled 5 to 4 computations (20% saved)

series4.0ms (0.5%)

Memory

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

Counts

4 → 10

Calls

Call 1

Inputs
(-.f64 (*.f64 x y) x)
(*.f64 x y)
x
y

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

Calls

6 calls:

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

rewrite53.0ms (6.5%)

Memory

-9.0MiB live, 85.8MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	32	110
0	34	104
1	139	101
0	1044	101

Stop Event

1×	iter limit
1×	iter limit
1×	node limit
1×	iter limit

Counts

14 → 21

Calls

Call 1

Inputs
(-.f64 (*.f64 x y) x)
(*.f64 x y)
x
y
#s(approx (- (* x y) x) #s(hole binary64 (* x (- y 1))))
#s(approx (* x y) #s(hole binary64 (* x y)))
#s(approx x #s(hole binary64 x))
#s(approx (- (* x y) x) #s(hole binary64 (* -1 (* x (+ 1 (* -1 y))))))
#s(approx (- (* x y) x) #s(hole binary64 (* -1 x)))
#s(approx (- (* x y) x) #s(hole binary64 (- (* x y) x)))
#s(approx y #s(hole binary64 y))
#s(approx (- (* x y) x) #s(hole binary64 (* x y)))
#s(approx (- (* x y) x) #s(hole binary64 (* y (+ x (* -1 (/ x y))))))
#s(approx (- (* x y) x) #s(hole binary64 (* -1 (* y (+ (* -1 x) (/ x y))))))

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

eval2.0ms (0.3%)

Memory: 5.5MiB live, 5.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 264 to 60 computations (77.3% saved)

prune5.0ms (0.6%)

Memory

-38.1MiB live, 9.7MiB allocated; 1ms collecting garbage

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	22	1	23
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	22	2	24

Accuracy

100.0%

Counts

24 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (*.f64 x y) x)
▶	100.0%	#s(approx (- (* x y) x) (*.f64 (-.f64 y #s(literal 1 binary64)) x))

Compiler

Compiled 16 to 12 computations (25% saved)

series5.0ms (0.6%)

Memory

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

Counts

6 → 20

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite57.0ms (7%)

Memory

-13.2MiB live, 83.2MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	51	230
0	53	217
1	197	212
0	1450	212

Stop Event

1×	iter limit
1×	iter limit
1×	node limit
1×	iter limit

Counts

26 → 63

Calls

Call 1

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

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

eval5.0ms (0.6%)

Memory: 13.2MiB live, 13.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 988 to 193 computations (80.5% saved)

prune29.0ms (3.6%)

Memory

15.4MiB live, 63.1MiB allocated; 0ms collecting garbage

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	55	0	55
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	55	2	57

Accuracy

100.0%

Counts

57 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (*.f64 x y) x)
✓	100.0%	#s(approx (- (* x y) x) (*.f64 (-.f64 y #s(literal 1 binary64)) x))

Compiler

Compiled 32 to 22 computations (31.3% saved)

regimes4.0ms (0.5%)

Memory

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

Accuracy

Total -0.0b remaining (-100%)

Threshold costs -0b (-100%)

Counts

2 → 1

Calls

Call 1

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

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

Calls

3 calls:

1.0ms	x
1.0ms	y
1.0ms	(-.f64 (*.f64 x y) x)

Results

Accuracy	Segments	Branch
100.0%	1	`(-.f64 (*.f64 x y) x)`
100.0%	1	`x`
100.0%	1	`y`

Compiler

Compiled 7 to 8 computations (-14.3% saved)

simplify57.0ms (7.1%)

Memory

-30.4MiB live, 68.6MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	11
1	13	11
2	20	11
3	33	11
4	66	11
5	293	11
6	3014	11
7	6608	11

Stop Event

1×	node limit

Calls

Call 1

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

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

derivations4.0ms (0.5%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 11 to 8 computations (27.3% saved)

preprocess9.0ms (1%)

Memory: 20.3MiB live, 20.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 32 to 24 computations (25% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample513.0ms (63.1%)

explain52.0ms (6.4%)

preprocess13.0ms (1.6%)

eval0.0ms (0%)

prune0.0ms (0%)

series4.0ms (0.5%)

rewrite53.0ms (6.5%)

eval2.0ms (0.3%)

prune5.0ms (0.6%)

series5.0ms (0.6%)

rewrite57.0ms (7%)

eval5.0ms (0.6%)

prune29.0ms (3.6%)

regimes4.0ms (0.5%)

simplify57.0ms (7.1%)

derivations4.0ms (0.5%)

preprocess9.0ms (1%)

end0.0ms (0%)

Profiling