-
Currently, `deflate` algorithm use an Oakasaki's queue and it could be more interesting to find a data-structure which concatenation is fast with same semantic of Queue.
Then, in the `blocklz` algo…
-
As i know functional programming is slower than oop to update list with million records because they make a copy of list and then update that copy. How do you handle thus issue on bosque to improve pe…
-
The dependency in [EdisonCore](http://hackage.haskell.org/package/EdisonCore) was removed in [this](770fa53e9bee462484e74a6d3017962e6c731b9b) commit because #3725. In relation to the use of this libra…
-
The link to "Combinatory Logic/Flattening Combinators: Surviving Without Parentheses by Chris Okasaki (2003)" takes me to what appears to be Westpoint's homepage, instead of the paper.
-
I have nothing against using the PCollections library but the CHAMP algorithm is the current state of the art for JVM based immutable collection implementations:
https://blog.acolyer.org/2015/11/27/h…
-
Hi,
There seems to be a bug in the code for the red-black-tree. For example, this causes an exception:
> delete "foo" (insert "foo" (insert "bar" E))
> *** Exception: Main.hs:(84,1)-(87,59): No…
-
see:
https://gist.github.com/johnynek/5f4f97772595e2f65092cf51d186d6f2
it's a lot of work for everyone to send a complete PR. I want to get an idea if this is interesting to the maintainers befo…
-
This is a slightly longer version of the proposal posted on Twitter: https://twitter.com/peterastephens/status/806710260815822849
Originally I was thinking the x64 implementation would need to emit…
-
Hi,
I have very much enjoyed your videos on youtube, though I haven't been able to catch any live streams.
I was trying to understand your implementation of catenable deques in Unaligned.hs, but…
-
Some (merge and insert) of the given complexities for the [pairing heap implementation](http://fsprojects.github.io/FSharpx.Collections/reference/fsharpx-collections-experimental-pairingheapmodule.htm…