Hoogle Search

Within LTS Haskell 24.31 (ghc-9.10.3)

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

  1. fromList :: Manifest r e => Comp -> [e] -> Vector r e

    massiv Data.Massiv.Vector

    Convert a flat list into a vector

  2. fromList :: Ord k => [(k, v)] -> OMap k v

    th-desugar Language.Haskell.TH.Desugar.OMap

    No documentation available.

  3. fromList :: Ord k => [(k, v)] -> OMap k v

    th-desugar Language.Haskell.TH.Desugar.OMap.Strict

    No documentation available.

  4. fromList :: Ord a => [a] -> OSet a

    th-desugar Language.Haskell.TH.Desugar.OSet

    No documentation available.

  5. fromList :: (Ord a, Ord b) => [(a, b)] -> Bimap a b

    bimap Data.Bimap

    O(n*log n). Build a map from a list of pairs. If there are any overlapping pairs in the list, the later ones will override the earlier ones. Version: 0.2

  6. fromList :: forall (m :: MutabilityType Type) . [JSVal] -> GHCJSPure (SomeJSArray m)

    jsaddle JavaScript.Array

    No documentation available.

  7. fromList :: forall (m :: MutabilityType Type) . [JSVal] -> GHCJSPure (SomeJSArray m)

    jsaddle JavaScript.Array.Internal

    No documentation available.

  8. fromList :: Dimension -> Dimension -> [a] -> T a

    numeric-prelude MathObj.Matrix

    No documentation available.

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

    numhask NumHask.Prelude

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

  10. fromList :: Ord k => [(k, v)] -> OMap k v

    ordered-containers Data.Map.Ordered

    If a key appears multiple times, the first occurrence is used for ordering and the last occurrence is used for its value. The library author welcomes comments on whether this default is sane.

Page 11 of many | Previous | Next