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.

Exact lookup

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

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

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

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

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

   ListLike	Data.ListLike

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

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

   ListLike	Data.ListLike.Base

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

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

   brick	Data.IMap

   No documentation available.

8. fromList :: Enum a => [a] -> EnumSet a

   ghc-lib-parser	GHC.Data.EnumSet

   No documentation available.

9. fromList :: Word -> [a] -> FlatBag a

   ghc-lib-parser	GHC.Data.FlatBag

   Store the list in a flattened memory representation, avoiding the memory overhead of a linked list. The size n needs to be smaller or equal to the length of the list. If it is smaller than the length of the list, overflowing elements are discarded. It is undefined behaviour to set n to be bigger than the length of the list.

10. fromList :: forall (m :: Type -> Type) a . Monad m => [a] -> Stream m a ()

    ghc-lib-parser	GHC.Data.Stream

    Turn a list into a Stream, by yielding each element in turn.

Page 12 of many | Previous | Next