Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. fromList :: forall (m :: Type -> Type) a . Applicative m => Unfold m [a] a

    streamly-core Streamly.Internal.Data.Unfold

    Convert a list of pure values to a Stream

  2. fromList :: [a] -> Pattern a

    tidal-core Sound.Tidal.Core

    Turns a list of values into a pattern, playing one of them per cycle. The following are equivalent: 

    d1 $ n (fromList [0, 1, 2]) # s "superpiano"
d1 $ n "<0 1 2>" # s "superpiano"

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

    vector-stream Data.Stream.Monadic

    Convert a list to a Stream

  4. fromList :: Collection el coll => [el] -> coll

    Agda Agda.Termination.CallGraph

    No documentation available.

  5. fromList :: Ord a => [a] -> Bag a

    Agda Agda.Utils.Bag 

    fromList = unions . map singleton

  6. fromList :: (Ord k, Ord (Tag v), HasTag v) => [(k, v)] -> BiMap k v

    Agda Agda.Utils.BiMap

    Conversion from lists of pairs. Later entries take precedence over earlier ones. O(n log n). Precondition: See fromListPrecondition.

  7. fromList :: [Bool] -> BoolSet

    Agda Agda.Utils.BoolSet

    No documentation available.

  8. fromList :: PartialOrd a => [a] -> Favorites a

    Agda Agda.Utils.Favorites

    Construct favorites from elements of a partial order. The result depends on the order of the list if it contains equal elements, since earlier seen elements are favored over later seen equals. The first element of the list is seen first.

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

    Agda Agda.Utils.List1

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

  10. fromList :: Collection el coll => [el] -> coll

    Agda Agda.Utils.Singleton

    No documentation available.

Page 26 of many | Previous | Next