containers
containers copied to clipboard
Assorted concrete container types
CLC has approved the proposal to export `liftA2` from `Prelude` (https://github.com/haskell/core-libraries-committee/issues/50). This is a PR to future proof for that change, while minimising warnings.
See https://hackage.haskell.org/package/containers-0.6.6/changelog. Some changes that aren't mentioned: * https://github.com/haskell/containers/pull/817 * https://github.com/haskell/containers/pull/800 * https://github.com/haskell/containers/pull/756
I am not experienced with using specialized containers. I work on code written by others and observe that I cannot `read` successfully an output produced with `show`. The gist of...
In #814, @treeowl asked for functions like these: ```haskell unsafeToSet :: (k -> a -> b) -> Map k a -> Set b unsafeToMap :: (b -> (k, a)) ->...
It seems that I cannot silence the warning ``` Warning: In the use of ‘MD.showTree’ (imported from Data.IntMap, but defined in containers-0.5.10.2:Data.IntMap.Internal.DeprecatedDebug): Deprecated: "These debugging functions will be removed from...
## Patch Description This PR adds 2 new functions to containers: `Data.Map.between`, and `Data.Set.between`. These functions will consume a map/set (respectively), and will filter the map/set so that the keys/values...
`Data.Sequence` as a data structure supports binary search, but it looks like no methods are currently exposed for doing so. (Well, not exactly binary search, but you know what I...
All time bounds are amortized (as in the Hinze/Paterson paper) but API docs mention that word only once "An amortized running time is given for each operation". A casual reader...