Hoogle Search
Within LTS Haskell 24.57 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
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.
addMany :: MonadMPD m => PlaylistName -> [Path] -> m ()libmpd Network.MPD.Commands.Extensions Add a list of songs/folders to a playlist. Should be more efficient than running add many times.
sAny :: (a -> Bool) -> SFlow a Boolmidair Midair.Handy Return True if any input signals have passed the predicate, False otherwise
sAnyHS :: (a -> Bool) -> Maybe Bool -> SFlow a Boolmidair Midair.Handy Hotswap version of sAny