Hoogle Search
Within LTS Haskell 24.36 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
sList :: (SymVal a, MonadSymbolic m) => String -> m (SList a)sbv Data.SBV.Trans Generalization of sList
sLists :: (SymVal a, MonadSymbolic m) => [String] -> m [SList a]sbv Data.SBV.Trans Generalization of sLists
fromList :: Unbox a => [a] -> Array astreamly-core Streamly.Data.Array Create an Array from a list. The list must be of finite size.
fromListN :: Unbox a => Int -> [a] -> Array astreamly-core Streamly.Data.Array Create an Array from the first N elements of a list. The array is allocated to size N, if the list terminates before N elements then the array may hold less than N elements.
toList :: Unbox a => Array a -> [a]streamly-core Streamly.Data.Array Convert an Array into a list.
-
streamly-core Streamly.Data.Array.Generic No documentation available.
fromListN :: Int -> [a] -> Array astreamly-core Streamly.Data.Array.Generic No documentation available.
-
streamly-core Streamly.Data.Array.Generic No documentation available.
toList :: forall (m :: Type -> Type) a . Monad m => Fold m a [a]streamly-core Streamly.Data.Fold Folds the input stream to a list. Warning! working on large lists accumulated as buffers in memory could be very inefficient, consider using Streamly.Data.Array instead.
>>> toList = Fold.foldr' (:) []
toListRev :: forall (m :: Type -> Type) a . Monad m => Fold m a [a]streamly-core Streamly.Data.Fold Buffers the input stream to a list in the reverse order of the input. Definition:
>>> toListRev = Fold.foldl' (flip (:)) []
Warning! working on large lists accumulated as buffers in memory could be very inefficient, consider using Streamly.Array instead.