Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. fromList :: (Eq a, Hashable a) => [a] -> HashSet a

   unordered-containers	Data.HashSet.Internal

   Construct a set from a list of elements.

2. toList :: HashSet a -> [a]

   unordered-containers	Data.HashSet.Internal

   Return a list of this set's elements. The list is produced lazily.

3. newListArray :: (MArray a e m, Ix i) => (i, i) -> [e] -> m (a i e)

   array	Data.Array.Base

   Constructs a mutable array from a list of initial elements. The list gives the elements of the array in ascending order beginning with the lowest index. The first and second element of the tuple specifies the lowest and highest index, respectively.

4. newListArray :: (MArray a e m, Ix i) => (i, i) -> [e] -> m (a i e)

   array	Data.Array.MArray

   Constructs a mutable array from a list of initial elements. The list gives the elements of the array in ascending order beginning with the lowest index. The first and second element of the tuple specifies the lowest and highest index, respectively.

5. newListArray :: (MArray a e m, Ix i) => (i, i) -> [e] -> m (a i e)

   array	Data.Array.MArray.Safe

   Constructs a mutable array from a list of initial elements. The list gives the elements of the array in ascending order beginning with the lowest index. The first and second element of the tuple specifies the lowest and highest index, respectively.

6. putList :: Binary t => [t] -> Put

   binary	Data.Binary

   Encode a list of values in the Put monad. The default implementation may be overridden to be more efficient but must still have the same encoding format.

7. arrayFromList :: [a] -> Array a

   primitive	Data.Primitive.Array

   Create an array from a list.

8. arrayFromListN :: Int -> [a] -> Array a

   primitive	Data.Primitive.Array

   Create an array from a list of a known length. If the length of the list does not match the given length, this throws an exception.

9. byteArrayFromList :: Prim a => [a] -> ByteArray

   primitive	Data.Primitive.ByteArray

   Create a ByteArray from a list.

   byteArrayFromList xs = byteArrayFromListN (length xs) xs
   

10. byteArrayFromListN :: Prim a => Int -> [a] -> ByteArray

    primitive	Data.Primitive.ByteArray

    Create a ByteArray from a list of a known length. If the length of the list does not match the given length, this throws an exception.

Page 52 of many | Previous | Next