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.

  1. data SmallArray a

    primitive Data.Primitive.SmallArray

    No documentation available.

  2. SmallArray :: SmallArray# a -> SmallArray a

    primitive Data.Primitive.SmallArray

    No documentation available.

  3. data SmallMutableArray s a

    primitive Data.Primitive.SmallArray

    No documentation available.

  4. SmallMutableArray :: SmallMutableArray# s a -> SmallMutableArray s a

    primitive Data.Primitive.SmallArray

    No documentation available.

  5. cloneSmallArray :: SmallArray a -> Int -> Int -> SmallArray a

    primitive 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.

  6. cloneSmallMutableArray :: PrimMonad m => SmallMutableArray (PrimState m) a -> Int -> Int -> m (SmallMutableArray (PrimState m) a)

    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.

  7. copySmallArray :: PrimMonad m => SmallMutableArray (PrimState m) a -> Int -> SmallArray a -> Int -> Int -> m ()

    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.

  8. copySmallMutableArray :: PrimMonad m => SmallMutableArray (PrimState m) a -> Int -> SmallMutableArray (PrimState m) a -> Int -> Int -> m ()

    primitive Data.Primitive.SmallArray

    Copy a slice of one mutable array into another. Note: this function does not do bounds or overlap checking.

  9. createSmallArray :: Int -> a -> (forall s . () => SmallMutableArray s a -> ST s ()) -> SmallArray a

    primitive 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
    

  10. emptySmallArray :: SmallArray a

    primitive Data.Primitive.SmallArray

    The empty SmallArray.

Page 206 of many | Previous | Next