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.

Exact lookup

1. hAllow :: HeaderName

   http-types	Network.HTTP.Types.Header

   Allow

2. methodNotAllowed405 :: Status

   http-types	Network.HTTP.Types.Status

   Method Not Allowed 405

3. module Data.Primitive.SmallArray

   Small arrays are boxed (im)mutable arrays. The underlying structure of the Array type contains a card table, allowing segments of the array to be marked as having been mutated. This allows the garbage collector to only re-traverse segments of the array that have been marked during certain phases, rather than having to traverse the entire array. SmallArray lacks this table. This means that it takes up less memory and has slightly faster writes. It is also more efficient during garbage collection so long as the card table would have a single entry covering the entire array. These advantages make them suitable for use as arrays that are known to be small. The card size is 128, so for uses much larger than that, Array would likely be superior.

4. data SmallArray a

   primitive	Data.Primitive.SmallArray

   No documentation available.

5. SmallArray :: SmallArray# a -> SmallArray a

   primitive	Data.Primitive.SmallArray

   No documentation available.

6. data SmallMutableArray s a

   primitive	Data.Primitive.SmallArray

   No documentation available.

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

   primitive	Data.Primitive.SmallArray

   No documentation available.

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

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

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

Page 206 of many | Previous | Next