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 :: (C sh, Storable a) => sh -> [a] -> Array sh a

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

   No documentation available.

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

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

   No documentation available.

3. vectorFromList :: Storable a => [a] -> Array (ZeroBased Int) a

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

   No documentation available.

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

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

   No documentation available.

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

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

   No documentation available.

6. vectorFromList :: Storable a => [a] -> Array (ZeroBased Int) a

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

   No documentation available.

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

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

9. module Data.AssocList

   Simple key value assocciation list implemented as unordered list of pairs

10. type AssocList k v = [(k, v)]

    hxt	Data.AssocList

    No documentation available.

Page 79 of many | Previous | Next