Hoogle Search
Within LTS Haskell 24.40 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
splitLeafMany :: Key key => Int -> (Map key val -> a) -> Map key val -> Index key ahaskey-btree Data.BTree.Primitives.Leaf Split a leaf many times. This function ensures that the for each returned leaf, the amount of items maxLeafItems (and= minLeafItems, except when the original leaf had less than minLeafItems items.
-
haskey-btree Data.BTree.Primitives.Leaf Split a leaf many times until the predicate is satisfied. This function ensures that the for each returned leaf, the predicate is satisfied, or returns Nothing when it can't be satisfied.
insertMany :: Key k => Map k v -> Tree k v -> Tree k vhaskey-btree Data.BTree.Pure Insert a bunch of key-value pairs simultaneously.
manyN :: Int -> Parser a -> Parser [a]hweblib Network.Parser.Rfc2234 Match a parser at least N times.
manyNtoM :: Int -> Int -> Parser a -> Parser [a]hweblib Network.Parser.Rfc2234 Match a parser at least N times, but no more than M times.
tryAny :: forall (r :: EffectRow) a . Member (Embed IO) r => IO a -> Sem r (Either Text a)incipit-core Incipit.Exception Run an IO via Embed and catch all exceptions, returning Either.
tryAny_ :: forall (r :: EffectRow) . Member (Embed IO) r => IO () -> Sem r ()incipit-core Incipit.Exception manyReverse :: Parser a -> Parser [a]json-stream Data.JsonStream.Parser Identical to fmap reverse . many but more efficient. If you don't care about the order of the results but plan to fully evaluate the list, this can be slightly more efficient than many as it avoids the accumulating thunks.
-
language-c Language.C.Analysis.SemRep No documentation available.
addIdMany :: MonadMPD m => Path -> Maybe Position -> m [Id]libmpd Network.MPD.Commands.Extensions Recursive addId. For directories, it will use the given position for the first file in the directory and use the successor for the remaining files. It returns a list of playlist ids for the songs added.