Hoogle Search
Within LTS Haskell 24.4 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
all :: ListLike full item => (item -> Bool) -> full -> BoolListLike Data.ListLike.Base True if all items satisfy the function
all :: Foldable t => (a -> Bool) -> t a -> Boolbasic-prelude BasicPrelude Determines whether all elements of the structure satisfy the predicate.
Examples
Basic usage:>>> all (> 3) [] True
>>> all (> 3) [1,2] False
>>> all (> 3) [1,2,3,4,5] False
>>> all (> 3) [1..] False
>>> all (> 3) [4..] * Hangs forever *
all :: Foldable t => (a -> Bool) -> t a -> Boolghc-lib-parser GHC.Prelude.Basic Determines whether all elements of the structure satisfy the predicate.
Examples
Basic usage:>>> all (> 3) [] True
>>> all (> 3) [1,2] False
>>> all (> 3) [1,2,3,4,5] False
>>> all (> 3) [1..] False
>>> all (> 3) [4..] * Hangs forever *
all :: forall t (m :: Type -> Type) a . (Foldable t, Monad m) => Predicate m a -> Predicate m (t a)skeletest Skeletest.Internal.Predicate A predicate checking if the input is a list-like type where all elements match the given predicate.
>>> [1, 2, 3] `shouldSatisfy` P.all (P.gt 0)
all :: forall t (m :: Type -> Type) a . (Foldable t, Monad m) => Predicate m a -> Predicate m (t a)skeletest Skeletest.Predicate A predicate checking if the input is a list-like type where all elements match the given predicate.
>>> [1, 2, 3] `shouldSatisfy` P.all (P.gt 0)
all :: (Contiguous arr, Element arr a) => (a -> Bool) -> arr a -> Boolcontiguous Data.Primitive.Contiguous No documentation available.
all :: Collection c => (Element c -> Bool) -> c -> Boolfoundation Foundation Determine is all elements of the collection satisfy the predicate
all :: Collection c => (Element c -> Bool) -> c -> Boolfoundation Foundation.Collection Determine is all elements of the collection satisfy the predicate
all :: (a -> Bool) -> [a] -> Boolprelude-compat Data.List2010 No documentation available.
all :: (a -> Bool) -> [a] -> Boolprelude-compat Prelude2010 No documentation available.