primitive
                                
                                
                                
                                    primitive copied to clipboard
                            
                            
                            
                        This package provides various primitive memory-related operations.
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...
This is some notes to track a branch i'll push for review soon to improve documentation the original PR around splitting PrimMonad into PrimMonad and PrimBase can be found at...
I think we should include a write-up about what makes sense in a `Prim` instance. Some specific points I've thought of are what makes a valid `Prim` instance (laws), what...
The `Prim` typeclass has laws that we intuitively understand. We should state these more formally in the docs.
I would like to see primitive have more functions that work on MutablePrimArray. Below are some of the ones I've thought might be useful. EDIT: I have made this list...
WIP. I still need to handle `SmallArray`. I also need to make this work with `Either`, but the backwards-compatibility story there is more annoying because of the historical absence of...
Create arbitrarily many arrays of arbitrarily many types from one `ST` action. Closes #103
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...
Concerning the implementation of `byteArrayFromList`, @treeowl [writes](https://github.com/haskell/primitive/pull/118#pullrequestreview-108383810): > We have shrinking here, so we should probably benchmark an array doubling (or similar) option. Array doubling would let this be a...