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.

  1. fromList :: Ord a => [a] -> MaxQueue a

    pqueue Data.PQueue.Max

    Constructs a priority queue from an unordered list.

  2. fromList :: Ord a => [a] -> MinQueue a

    pqueue Data.PQueue.Min

    Constructs a priority queue from an unordered list.

  3. fromList :: Ord k => [(k, a)] -> MaxPQueue k a

    pqueue Data.PQueue.Prio.Max

    Build a priority queue from the list of (key, value) pairs.

  4. fromList :: Ord k => [(k, a)] -> MinPQueue k a

    pqueue Data.PQueue.Prio.Min

    Constructs a priority queue from an unordered list.

  5. fromList :: Corecursive (->) t (XNor a) => [a] -> t

    yaya Yaya.Applied

    An implementation of toList for Corecursive fixed-points of XNor.

  6. fromList :: (Contiguous arr, Element arr a) => [a] -> arr a

    contiguous Data.Primitive.Contiguous

    Convert a list into an array.

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

    dhall Dhall.Map

    Create a Map from a list of key-value pairs 

    >>> fromList [("B",1),("A",2)]  -- The map preserves order
fromList [("B",1),("A",2)]

>>> fromList [("A",1),("A",2)]  -- For duplicates, later values take precedence
fromList [("A",2)]
    Note that this handling of duplicates means that fromList is not a monoid homomorphism: 
    >>> fromList [(1, True)] <> fromList [(1, False)]
fromList [(1,True)]

>>> fromList ([(1, True)] <> [(1, False)])
fromList [(1,False)]

  8. fromList :: Ord a => [a] -> Set a

    dhall Dhall.Set

    Convert a list to a Set, remembering the element order

  9. fromList :: [(Expr, a)] -> Triexpr a

    express Data.Express.Triexpr

    Constructs a Triexpr form a list of key Exprs and associated values.

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

    foundation Foundation

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

Page 14 of many | Previous | Next