Hoogle Search
Within LTS Haskell 24.28 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
parListOrdered :: forall (m :: Type -> Type) a . MonadAsync m => [Stream m a] -> Stream m astreamly Streamly.Internal.Data.Stream.Prelude Like parListLazy but with ordered on.
>>> parListOrdered = Stream.parList (Stream.ordered True)
fromList :: IsList l => [Item l] -> lstreamly Streamly.Internal.Data.Stream.Serial The fromList function constructs the structure l from the given list of Item l
toList :: IsList l => l -> [Item l]streamly Streamly.Internal.Data.Stream.Serial The toList function extracts a list of Item l from the structure l. It should satisfy fromList . toList = id.
-
strict-base-types Data.Maybe.Strict Analogous to maybeToList in Data.Maybe.
partCompareListMaybe :: Eq a => [Maybe a] -> [Maybe a] -> Maybe Orderingswish Data.Ord.Partial Part-ordering comparison on lists of Maybe values.
partCompareListSubset :: Eq a => [a] -> [a] -> Maybe Orderingswish Data.Ord.Partial Part-ordering comparison on lists based on subset relationship
module Data.Tensort.Utils.
RandomizeList This module prvodies the randomizeList function, which randomizes the order of elements in sortable lists.
randomizeList :: Ord a => Int -> [a] -> [a]tensort Data.Tensort.Utils.RandomizeList Takes a seed for random generation and a list and returns a new list with the same elements as the input list but in a random order.
Examples
>>> randomizeList 143 ([4, 8, 15, 16, 23, 42] :: [Int]) [16,23,4,8,15,42]
>>> randomizeList 143 ([(2,4),(3,8),(0,15),(1,16),(5,23),(4,42)] :: [(Int, Int)]) [(1,16),(5,23),(2,4),(3,8),(0,15),(4,42)]
textListToCStringArray :: [Text] -> (Ptr CString -> IO a) -> IO atext-misc-yj Data.Text.Foreign.MiscYj No documentation available.
bitsList :: FiniteBits bs => bs -> [bs]tools-yj Data.Bits.ToolsYj No documentation available.