Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. fromList :: (PrimMonad m, C sh, Storable a) => sh -> [a] -> m (Array m sh a)

   comfort-array	Data.Array.Comfort.Storable.Mutable

   No documentation available.

2. fromList :: (PrimMonad m, C sh, Storable a) => sh -> [a] -> m (Array m sh a)

   comfort-array	Data.Array.Comfort.Storable.Mutable.Private

   No documentation available.

3. fromList :: (PrimMonad m, C sh, Storable a) => sh -> [a] -> m (Array m sh a)

   comfort-array	Data.Array.Comfort.Storable.Mutable.Unchecked

   No documentation available.

4. fromList :: (C sh, Storable a) => sh -> [a] -> Array sh a

   comfort-array	Data.Array.Comfort.Storable.Private

   No documentation available.

5. fromList :: (C sh, Storable a) => sh -> [a] -> Array sh a

   comfort-array	Data.Array.Comfort.Storable.Unchecked

   No documentation available.

6. fromList :: Measured v a => [a] -> FingerTree v a

   fingertree	Data.FingerTree

   O(n). Create a sequence from a finite list of elements. The opposite operation toList is supplied by the Foldable instance.

7. fromList :: Ord k => [(k, v)] -> PQueue k v

   fingertree	Data.PriorityQueue.FingerTree

   O(n). Create a priority queue from a finite list of priorities and values.

8. fromList :: IsList l => [Item l] -> l

   relude	Relude.Container.Reexport

   The fromList function constructs the structure l from the given list of Item l

9. fromList :: (Eq k, Hashable k) => [(k, v)] -> InsOrdHashMap k v

   insert-ordered-containers	Data.HashMap.Strict.InsOrd

   No documentation available.

10. fromList :: (Eq k, Hashable k) => [k] -> InsOrdHashSet k

    insert-ordered-containers	Data.HashSet.InsOrd

    No documentation available.

Page 8 of many | Previous | Next