any +base

any :: (a -> Bool) -> [a] -> Bool
base Prelude, base Data.List
Applied to a predicate and a list, any determines if any element of the list satisfies the predicate. For the result to be False, the list must be finite; True, however, results from a True value for the predicate applied to an element at a finite index of a finite or infinite list.
Any :: Bool -> Any
base Data.Monoid
newtype Any
base Data.Monoid
Boolean monoid under disjunction.
any :: Foldable t => (a -> Bool) -> t a -> Bool
base Data.Foldable
Determines whether any element of the structure satisfies the predicate.
eTOOMANYREFS :: Errno
base Foreign.C.Error
getAny :: Any -> Bool
base Data.Monoid
many :: ReadP a -> ReadP [a]
base Text.ParserCombinators.ReadP
Parses zero or more occurrences of the given parser.
many :: Alternative f => f a -> f [a]
base Control.Applicative
many1 :: ReadP a -> ReadP [a]
base Text.ParserCombinators.ReadP
Parses one or more occurrences of the given parser.
manyTill :: ReadP a -> ReadP end -> ReadP [a]
base Text.ParserCombinators.ReadP
manyTill p end parses zero or more occurrences of p, until end succeeds. Returns a list of values returned by p.
skipMany :: ReadP a -> ReadP ()
base Text.ParserCombinators.ReadP
Like many, but discards the result.
skipMany1 :: ReadP a -> ReadP ()
base Text.ParserCombinators.ReadP
Like many1, but discards the result.
withMany :: (a -> (b -> res) -> res) -> [a] -> ([b] -> res) -> res
base Foreign.Marshal.Utils
Replicates a withXXX combinator over a list of objects, yielding a list of marshalled objects