Hoogle Search

Within LTS Haskell 24.61 (ghc-9.10.3)

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

Exact lookup

1. fromList :: [Word8] -> ByteSet

   charset	Data.CharSet.ByteSet

   No documentation available.

2. fromList :: (Contiguous arr, Element arr a) => [a] -> arr a

   contiguous	Data.Primitive.Contiguous

   Convert a list into an array.

3. fromListMutable :: forall (arr :: Type -> Type) a m . (Contiguous arr, Element arr a, PrimMonad m) => [a] -> m (Mutable arr (PrimState m) a)

   contiguous	Data.Primitive.Contiguous

   Convert a list into a mutable array of the given length.

4. fromListMutableN :: forall (arr :: Type -> Type) a m . (Contiguous arr, Element arr a, PrimMonad m) => Int -> [a] -> m (Mutable arr (PrimState m) a)

   contiguous	Data.Primitive.Contiguous

   Given an Int that is representative of the length of the list, convert the list into a mutable array of the given length. Note: calls error if the given length is incorrect.

5. fromListN :: (Contiguous arr, Element arr a) => Int -> [a] -> arr a

   contiguous	Data.Primitive.Contiguous

   Given an Int that is representative of the length of the list, convert the list into a mutable array of the given length. Note: calls error if the given length is incorrect.

6. toList :: (Contiguous arr, Element arr a) => arr a -> [a]

   contiguous	Data.Primitive.Contiguous

   Convert an array to a list.

7. toListMutable :: forall (arr :: Type -> Type) a m . (Contiguous arr, Element arr a, PrimMonad m) => Mutable arr (PrimState m) a -> m [a]

   contiguous	Data.Primitive.Contiguous

   Convert a mutable array to a list.

8. unsafeFromListN :: (Contiguous arr, Element arr a) => Int -> [a] -> arr a

   contiguous	Data.Primitive.Contiguous

   Create an array from a list. If the given length does not match the actual length, this function has undefined behavior.

9. unsafeFromListReverseMutableN :: forall (arr :: Type -> Type) a m . (Contiguous arr, Element arr a, PrimMonad m) => Int -> [a] -> m (Mutable arr (PrimState m) a)

   contiguous	Data.Primitive.Contiguous

   Create a mutable array from a list, reversing the order of the elements. If the given length does not match the actual length, this function has undefined behavior.

10. unsafeFromListReverseN :: (Contiguous arr, Element arr a) => Int -> [a] -> arr a

    contiguous	Data.Primitive.Contiguous

    Create an array from a list, reversing the order of the elements. If the given length does not match the actual length, this function has undefined behavior.

Page 125 of many | Previous | Next