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.

Exact lookup

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

   ordered-containers	Data.Map.Ordered.Strict

   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.

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

   ordered-containers	Data.Set.Ordered

   If a value occurs multiple times, only the first occurrence is used.

3. fromList :: [a] -> Maybe (PointedList a)

   pointedlist	Data.List.PointedList

   Possibly create a Just PointedList if the provided list has at least one element; otherwise, return Nothing. The provided list's head will be the focus of the list, and the rest of list will follow on the right side.

4. fromList :: [a] -> Maybe (PointedList a)

   pointedlist	Data.List.PointedList.Circular

   Possibly create a Just PointedList if the provided list has at least one element; otherwise, return Nothing. The provided list's head will be the focus of the list, and the rest of list will follow on the right side.

5. fromList :: (Hashable k, Ord k, Ord p) => [(k, p, v)] -> HashPSQ k p v

   psqueues	Data.HashPSQ

   O(n*min(n,W)) Build a queue from a list of (key, priority, value) tuples. If the list contains more than one priority and value for the same key, the last priority and value for the key is retained.

6. fromList :: Ord p => [(Int, p, v)] -> IntPSQ p v

   psqueues	Data.IntPSQ

   O(n*min(n,W)) Build a queue from a list of (key, priority, value) tuples. If the list contains more than one priority and value for the same key, the last priority and value for the key is retained.

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

   psqueues	Data.OrdPSQ

   O(n*log n) Build a queue from a list of (key, priority, value) tuples. If the list contains more than one priority and value for the same key, the last priority and value for the key is retained.

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

   ListLike	Data.ListLike

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

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

   ListLike	Data.ListLike.Base

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

10. fromList :: [(Int, Run a)] -> IMap a

    brick	Data.IMap

    No documentation available.

Page 12 of many | Previous | Next