David Feuer

Add indexed maps and traversals

3

* Add indexed maps (lazy and strict) and traversals (general and `PrimMonad`-specialized) for `Array` and `SmallArray` to match the ones in `PrimArray`. * Add some missing `@since` annotations.

Unboxed array of Bool

11

I'd love to have bit vectors (i.e., unboxed arrays and mutable arrays of `Bool`) in here. The implementations of bit vectors around Hackage seem almost always to be pure and...

Add a default definition of primitive

1

Almost all `PrimMonad` instances are monad transformers of other `PrimMonad` instances. We can give `PrimState` a default definition and use `DefaultSignatures` to give `primitive` one as well. We can use...

Add PrimMonad instance for CatchT

23

`exceptions` defines a `CatchT` type that can be given a `PrimMonad` instance. Should we accept the dependency to add it?

Add support for weak references with unlifted keys

3

We should be able to write ```haskell mkWeakFromUnlifted :: (PrimUnlifted k, PrimMonad m, PrimState m ~ RealWorld) => k -> v -> IO () -> m (Weak v) ``` We...

Document why we can't derive Prim instances from Storable ones, and do what we can

1

We have `PrimStorable` to derive `Storable` instances from `Prim` instances. It would be very nice to be able to offer a `StorablePrim` to go the other way. Unfortunately, I don't...

Heterogeneous array creation

21

Create arbitrarily many arrays of arbitrarily many types from one `ST` action. Closes #103

Add strict array operations and perhaps arrays

8

Currently, `unordered-containers` has a `Data.HashMap.Array` module that's pretty similar to `Data.Primitive.SmallArray`. I'd love to stack `unordered-containers` on top of `primitive` to avoid this duplication. Aside from the bugs currently being...

This may look a bit strange.... ```haskell create :: (forall h f g. Applicative h => (forall x. f x -> h (g x)) -> t f -> h (t...