Hoogle Search

Within LTS Haskell 24.48 (ghc-9.10.3)

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

Exact lookup

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

   jsaddle	JavaScript.Array

   No documentation available.

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

   jsaddle	JavaScript.Array.Internal

   No documentation available.

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

   numeric-prelude	MathObj.Matrix

   No documentation available.

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

   numhask	NumHask.Prelude

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

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

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

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

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

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

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

    ListLike	Data.ListLike

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

Page 12 of many | Previous | Next