David Feuer
David Feuer
The `Traversable` class includes a method ```haskell class Traversable t where ... mapM :: Monad m => (a -> m b) -> t a -> m (t b) ``` This...
It seems impossible (or extremely difficult) to offer `Lift` instances for GHC versions before 8.0. Old versions of `template-haskell` depended on `containers`, making it impossible to depend on them. There...
An attempt was made in #670, but it proved to have some subtle bug in #783 and had to be reverted. It would be nice to fix and reinstate.
* Export a type for `(Int,+)` finger trees. * Export more `Data.Sequence` internals. * Offer a module of `Data.Sequence` internals intended for external use, that should obey the PVP. *...
Make `fromList` and `fromListWithKey` for `IntMap` smarter. Rather than rebuilding the path from the root for each element, insert as many elements as possible into each subtree before backing out.
`unfoldTreeM_BF` and `unfoldForestM_BF` previously used a queue-based algorithm from a note by Okasaki. That same note indicates that the level-wise approach tends to be slightly faster, and my own informal...
For GHC, this should let us create a sequence out of an array without having any stray pointers to the array in the sequence.
Additionally, use coercions to speed up folds.
This ticket summarizes things that should be done either before or soon after the enormous `IntMap` replacement in #340. ### Before merge - [x] Reinstate the export list in `Data.IntMap.Internal`....
This makes it extremely difficult to know when a change is good, bad, or even valid.