Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

1. toList :: HashMap k v -> [(k, v)]

   unordered-containers	Data.HashMap.Strict

   Return a list of this map's elements. The list is produced lazily. The order of its elements is unspecified, and it may change from version to version of either this package or of hashable.

2. fromList :: Hashable a => [a] -> HashSet a

   unordered-containers	Data.HashSet

   Construct a set from a list of elements.

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

   unordered-containers	Data.HashSet

   Return a list of this set's elements. The list is produced lazily. The order of its elements is unspecified, and it may change from version to version of either this package or of hashable.

4. fromList :: Hashable a => [a] -> HashSet a

   unordered-containers	Data.HashSet.Internal

   Construct a set from a list of elements.

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

   unordered-containers	Data.HashSet.Internal

   Return a list of this set's elements. The list is produced lazily. The order of its elements is unspecified, and it may change from version to version of either this package or of hashable.

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

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

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

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

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

    primitive	Data.Primitive.Array

    Create an array from a list.

Page 52 of many | Previous | Next