Hoogle Search
Within LTS Haskell 24.67 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
primitive Data.Primitive.SmallArray No documentation available.
SmallArray :: SmallArray# a -> SmallArray aprimitive Data.Primitive.SmallArray No documentation available.
-
primitive Data.Primitive.SmallArray No documentation available.
SmallMutableArray :: SmallMutableArray# s a -> SmallMutableArray s aprimitive Data.Primitive.SmallArray No documentation available.
cloneSmallArray :: SmallArray a -> Int -> Int -> SmallArray aprimitive Data.Primitive.SmallArray Create a copy of a slice of an immutable array. Note: The provided array should contain the full subrange specified by the two Ints, but this is not checked.
-
primitive Data.Primitive.SmallArray Create a copy of a slice of a mutable array. Note: The provided array should contain the full subrange specified by the two Ints, but this is not checked.
-
primitive Data.Primitive.SmallArray Copy a slice of an immutable array into a mutable array. Note: this function does not do bounds or overlap checking.
-
primitive Data.Primitive.SmallArray Copy a slice of one mutable array into another. Note: this function does not do bounds or overlap checking.
createSmallArray :: Int -> a -> (forall s . () => SmallMutableArray s a -> ST s ()) -> SmallArray aprimitive Data.Primitive.SmallArray Create an array of the given size with a default value, apply the monadic function and freeze the result. If the size is 0, return emptySmallArray (rather than a new copy thereof).
createSmallArray 0 _ _ = emptySmallArray createSmallArray n x f = runSmallArray $ do mary <- newSmallArray n x f mary pure mary
emptySmallArray :: SmallArray aprimitive Data.Primitive.SmallArray The empty SmallArray.