Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

  1. fromList :: (Eq k, Hashable k) => [(k, v)] -> HashMap k v

    unordered-containers Data.HashMap.Internal.Strict

    Construct a map with the supplied mappings. If the list contains duplicate mappings, the later mappings take precedence.

  2. fromList :: (Eq k, Hashable k) => [(k, v)] -> HashMap k v

    unordered-containers Data.HashMap.Lazy

    Construct a map with the supplied mappings. If the list contains duplicate mappings, the later mappings take precedence.

  3. fromList :: (Eq k, Hashable k) => [(k, v)] -> HashMap k v

    unordered-containers Data.HashMap.Strict

    Construct a map with the supplied mappings. If the list contains duplicate mappings, the later mappings take precedence.

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

    unordered-containers Data.HashSet

    Construct a set from a list of elements.

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

    unordered-containers Data.HashSet.Internal

    Construct a set from a list of elements.

  6. fromList :: [a] -> Deque a

    lens Control.Lens.Internal.Deque

    O(n) amortized. Construct a Deque from a list of values. 

    >>> fromList [1,2]
BD 1 [1] 1 [2]

  7. fromList :: HasCallStack => [a] -> NonEmpty a

    base-compat Data.List.NonEmpty.Compat

    Converts a normal list to a NonEmpty stream. Raises an error if given an empty list.

  8. fromList :: [a] -> DList a

    dlist Data.DList

    fromList xs is a DList representing the list xs. fromList obeys the laws: 

    toList . fromList = id
fromList . toList = id
    This function is implemented with ++. Repeated uses of fromList are just as inefficient as repeated uses of ++. If you find yourself doing some form of the following (possibly indirectly), you may not be taking advantage of the DList representation and library: 
    fromList . f . toList
    More likely, you will convert from a list, perform some operation on the DList, and convert back to a list: 
    toList . g . fromList

  9. fromList :: [a] -> DNonEmpty a

    dlist Data.DList.DNonEmpty

    fromList xs is a DNonEmpty representing the list xs. If xs is empty, an error is raised. fromList obeys the law: 

    fromList xs = fromNonEmpty (fromList xs)

  10. fromList :: [InstalledPackageInfo] -> InstalledPackageIndex

    Cabal Distribution.Simple.PackageIndex

    Build an index out of a bunch of packages. If there are duplicates by UnitId then later ones mask earlier ones.

Page 3 of many | Previous | Next