Hoogle Search
Within LTS Haskell 24.45 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
conduit Conduit Check that at least one element in the chunked stream returns True. Subject to shortcut logic: at the first True, consumption of the stream will stop.
-
conduit Data.Conduit.Combinators Check that at least one element in the chunked stream returns True. Subject to shortcut logic: at the first True, consumption of the stream will stop. Subject to fusion
anyS :: forall (m :: Type -> Type) a . Monad m => (a -> Bool) -> StreamConsumer a m Boolconduit Data.Conduit.Combinators.Stream No documentation available.
anyOf :: Getting Any s a -> (a -> Bool) -> s -> Boolmicrolens Lens.Micro Returns True if any value returned by a getter (any getter, including lenses, traversals, and folds) satisfies a predicate.
>>> anyOf each (=='x') ['x','x'] True >>> anyOf each (=='x') ['x','y'] True >>> anyOf each (=='x') ['y','y'] False
anyByte :: ByteArray byteArray => Parser byteArray Word8memory Data.ByteArray.Parse Get the next byte from the parser
anySingle :: MonadParsec e s m => m (Token s)megaparsec Text.Megaparsec Parse and return a single token. It's a good idea to attach a label to this parser.
anySingle = satisfy (const True)
See also: satisfy, anySingleBut.anySingleBut :: MonadParsec e s m => Token s -> m (Token s)megaparsec Text.Megaparsec Match any token but the given one. It's a good idea to attach a label to this parser.
anySingleBut t = satisfy (/= t)
See also: single, anySingle, satisfy.-
megaparsec Text.Megaparsec.Byte.Binary Parse a big-endian number. You may wish to call this with a visible type application:
number <- anyBE (Just "big-endian 32 bit word") @Word32
-
megaparsec Text.Megaparsec.Byte.Binary Parse a little-endian number. You may wish to call this with a visible type application:
number <- anyLE (Just "little-endian 32 bit word") @Word32
anyM :: Monad m => (a -> m Bool) -> [a] -> m Boolextra Control.Monad.Extra A version of any lifted to a monad. Retains the short-circuiting behaviour.
anyM Just [False,True ,undefined] == Just True anyM Just [False,False,undefined] == undefined \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)