Jaro

I totally understand, in the meantime I am doing some more experiments.

> I could imagine some interesting combinators for merging graphs, but I don't know what would be best or most useful yet. It might be useful to look at what...

I get "Sorry, This video does not exist." when trying to view that video. I'm currently trying to write a NFA/DFA library so I want to decorate the edges of...

I now realize that it might be because I do not have a proprietary content decryption module installed on my computers. Is there any DRM-free way of viewing this video?...

The doctests take longer than the nofib tests on my machine. I think that is because it has to recompile all modules before it can run the doctests.

[Blackscholes](https://github.com/AccelerateHS/accelerate/blob/ad84c28914db0d1ed54888d6d030b5476cb64f7c/src/Data/Array/Accelerate/Test/NoFib/Spectral/BlackScholes.hs) is the test that takes the longest on my machine (about 2 seconds). It doesn't seem like it would benefit from using `Data.Vector.Unboxed` because it is basically only a...

**See the big edit at the bottom** So, I think we could generate random arrays much more quickly using `generate` and for example the murmur hash of the `toIndex`ed shape...

I have some benchmark results: ``` benchmarking xnasamx Native/1000 time 49.86 μs (47.14 μs .. 52.45 μs) 0.982 R² (0.980 R² .. 0.986 R²) mean 49.14 μs (47.46 μs .....

We might be able to use the [recently announced](https://mail.haskell.org/pipermail/haskell-cafe/2020-August/132570.html) [doctest-extract](https://hackage.haskell.org/package/doctest-extract-0.0/candidate) package to improve the speed of the doctests. About the hedgehog tests, yeah I've looked into it a little bit...

That looks great, probably even better than that nasam function. I didn't know PractRand included those generators.