Hoogle Search

Within LTS Haskell 24.50 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. unsafeFreezeSmallArray :: PrimMonad m => SmallMutableArray (PrimState m) a -> m (SmallArray a)

    primitive Data.Primitive.SmallArray

    Render a mutable array immutable. This operation performs no copying, so care must be taken not to modify the input array after freezing.

  2. unsafeThawSmallArray :: PrimMonad m => SmallArray a -> m (SmallMutableArray (PrimState m) a)

    primitive Data.Primitive.SmallArray

    Render an immutable array mutable. This operation performs no copying, so care must be taken with its use.

  3. writeSmallArray :: PrimMonad m => SmallMutableArray (PrimState m) a -> Int -> a -> m ()

    primitive Data.Primitive.SmallArray

    Write an element at the given idex in a mutable array. Note: this function does not do bounds checking.

  4. data SmallArray# (a :: TYPE 'BoxedRep l)

    ghc-prim GHC.Prim

    No documentation available.

  5. data SmallMutableArray# a (b :: TYPE 'BoxedRep l)

    ghc-prim GHC.Prim

    No documentation available.

  6. compactAllocateBlock# :: Word# -> Addr# -> State# RealWorld -> (# State# RealWorld, Addr# #)

    ghc-prim GHC.Prim

    Attempt to allocate a compact block with the capacity (in bytes) given by the first argument. The Addr# is a pointer to previous compact block of the CNF or nullAddr# to create a new CNF with a single compact block. The resulting block is not known to the GC until compactFixupPointers# is called on it, and care must be taken so that the address does not escape or memory will be leaked.

  7. setThreadAllocationCounter# :: Int64# -> State# RealWorld -> State# RealWorld

    ghc-prim GHC.Prim

    Sets the allocation counter for the current thread to the given value.

  8. getThreadAllocationCounter# :: State# RealWorld -> (# State# RealWorld, Int64# #)

    ghc-prim GHC.Prim.Ext

    Retrieves the allocation counter for the current thread.

  9. reallyUnsafePtrEquality :: a -> a -> Int#

    ghc-prim GHC.Prim.PtrEq

    Compare the underlying pointers of two values for equality. Returns 1 if the pointers are equal and 0 otherwise. The two values must be of the same type, of kind Type. See also reallyUnsafePtrEquality#, which doesn't have such restrictions.

  10. atomically# :: (State# RealWorld -> (# State# RealWorld, a_levpoly #)) -> State# RealWorld -> (# State# RealWorld, a_levpoly #)

    ghc-prim GHC.PrimopWrappers

    No documentation available.

Page 209 of many | Previous | Next