David Feuer
David Feuer
Addresses #64
This doesn't relate to the LLRB trees, per se, but you only implement the first of Okasaki's two optimizations. The follow-up ensures that only the colors of nodes along the...
`getCommentsInfo` fails when passed a list over 100 elements long. I would think it should instead break up the list into as many 100-element requests as necessary.
Using individual bits seems wasteful. Why not use `HashMap`-like sparse `SmallArray`s to increase the branching factor? The `Prefix` thing looks like it's on its way to being path compression, but...
The `UnsafeST` module says it's all about working around [https://ghc.haskell.org/trac/ghc/ticket/5916]. That ticket has now been closed thanks to the new `runRW#` primop. You should probably use that when available. You...
I propose an `NFData` method (by some name) ```haskell whnfIsNf :: proxy a -> Bool whnfIsNf _ = False ``` Then we can have, for example, ```haskell instance NFData Integer...
If we have `f :: b -> Void` and `g :: a -> b`, we can get `f . g :: a -> Void`. But if we do this recursively,...
If a type has a `Foldable` instance, then we can force it from left to right or from right to left. Fixes #17
It's possible to define a reasonable `NFData` instance for any `Foldable` type. We can offer a suitable `rnf` to help. ``` haskell data Unit = Unit instance Monoid Unit where...
The title pretty much speaks for itself—using tabs for layout is usually not the greatest idea, so Happy shouldn't be producing code that does so. The simplest way to do...