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.
foldMany :: forall t (m :: Type -> Type) a b . (IsStream t, Monad m) => Fold m a b -> t m a -> t m bstreamly Streamly.Prelude Apply a Fold repeatedly on a stream and emit the fold outputs in the output stream. To sum every two contiguous elements in a stream:
>>> f = Fold.take 2 Fold.sum >>> Stream.toList $ Stream.foldMany f $ Stream.fromList [1..10] [3,7,11,15,19]
On an empty stream the output is empty:>>> Stream.toList $ Stream.foldMany f $ Stream.fromList [] []
Note Stream.foldMany (Fold.take 0) would result in an infinite loop in a non-empty stream.-
streamly Streamly.Prelude Like concatMap but uses an Unfold for stream generation. Unlike concatMap this can fuse the Unfold code with the inner loop and therefore provide many times better performance.
parseAnyfromText :: N3Parser a -> Maybe QName -> Text -> Either String aswish Swish.RDF.Parser.N3 Function to supply initial context and parse supplied term.
manyTill :: Parser s a -> Parser s b -> Parser s [a]swish Swish.RDF.Parser.Utils Accept zero or more runs of the parser ending with the delimiter.
skipMany :: Parser s a -> Parser s ()swish Swish.RDF.Parser.Utils Run the parser many times and ignore the result.
skipMany1 :: Parser s a -> Parser s ()swish Swish.RDF.Parser.Utils Run the parser many1 times and ignore the result.
-
swish Swish.RDF.Vocabulary.XSD xsd:anyURI from http://www.w3.org/TR/xmlschema-2/#anyURI.
-
synthesizer-alsa Synthesizer.ALSA.Storable.Play Play a signal and write it to multiple files. The Functor f may be Maybe for no or one file to write, or [] for many files to write.
many :: Alternative f => f a -> f [a]threepenny-gui Graphics.UI.Threepenny.Core Zero or more.
Examples
>>> many (putStr "la") lalalalalalalalala... * goes on forever *
>>> many Nothing Just []
>>> take 5 <$> many (Just 1) * hangs forever *
Note that this function can be used with Parsers based on Applicatives. In that case many parser will attempt to parse parser zero or more times until it fails.matchManyToOne :: (b -> a -> Bool) -> Pattern a -> Pattern b -> Pattern (Bool, b)tidal Sound.Tidal.Boot Mark values in the first pattern which match with at least one value in the second pattern.