readme update

README.md

@@ -76,25 +76,61 @@ julia> ax.set_ylabel("y-axis [tan(y)]")
 This code makes use of caching and computes the envelope for each point to be drawn.
 Hence it is memory friendly and is quite fast.
 Benchmarking with 100,000 points.
-```
-julia> using BenchmarkTools
+```julia
+using BenchmarkTools
 for i = 1:n
     if iseven(i)
         xy[1,i] = missing
     else
         xy[2,i] = missing
     end
 end
-julia> @benchmark irsample!(xy,knots,prob)
+@benchmark irsample!(xy,knots,prob)
+```
+```
+BenchmarkTools.Trial: 
+  memory estimate:  29.86 MiB
+  allocs estimate:  600029
+  --------------
+  minimum time:     43.686 ms (4.48% GC)
+  median time:      46.023 ms (4.69% GC)
+  mean time:        48.114 ms (7.55% GC)
+  maximum time:     112.981 ms (51.23% GC)
+  --------------
+  samples:          104
+  evals/sample:     1
+```
+```julia
+using BenchmarkTools
+@benchmark irsample(knots,prob,n)
+```
+```
+BenchmarkTools.Trial: 
+  memory estimate:  37.66 MiB
+  allocs estimate:  735487
+  --------------
+  minimum time:     27.273 ms (6.16% GC)
+  median time:      29.676 ms (11.63% GC)
+  mean time:        31.125 ms (11.67% GC)
+  maximum time:     100.308 ms (62.43% GC)
+  --------------
+  samples:          161
+  evals/sample:     1
+```
+```julia
+using BenchmarkTools
+@benchmark irsample(X,sin.(X),n)
+```
+```
 BenchmarkTools.Trial: 
-  memory estimate:  107.72 KiB
-  allocs estimate:  21
+  memory estimate:  7.19 MiB
+  allocs estimate:  143
   --------------
-  minimum time:     664.329 μs (0.00% GC)
-  median time:      738.891 μs (0.00% GC)
-  mean time:        792.704 μs (1.73% GC)
-  maximum time:     56.139 ms (98.27% GC)
+  minimum time:     6.809 ms (0.00% GC)
+  median time:      7.327 ms (0.00% GC)
+  mean time:        7.811 ms (5.67% GC)
+  maximum time:     76.786 ms (87.52% GC)
   --------------
-  samples:          6271
+  samples:          640
   evals/sample:     1
 ```