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 :: Foldable t => (a -> Bool) -> t a -> BoolLambdaHack Game.LambdaHack.Core.Prelude 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 -> BoolLambdaHack Game.LambdaHack.Core.Prelude 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 :: Bits b => (Bool -> Bool) -> b -> Boolbitwise Data.Bits.Bitwise True when the predicate is true for all bits.
all :: Foldable t => (a -> Bool) -> t a -> Boolcabal-install-solver Distribution.Solver.Compat.Prelude 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 -> Boolihaskell IHaskellPrelude 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 -> Boolincipit-base Incipit.Foldable 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 :: RandomGen g => g -> [([Pitch], [Pitch])]reactive-midyim Reactive.Banana.MIDI.Training No documentation available.
all :: Generator c => (Elem c -> Bool) -> c -> Boolreducers Data.Generator.Combinators Efficiently mapReduce any Generator checking to see if all of its values match the supplied predicate
mapReduceWith getAll
all :: SymVal a => (SBV a -> SBool) -> SList a -> SBoolsbv Data.SBV.List Check all elements satisfy the predicate.
>>> let isEven x = x `sMod` 2 .== 0 >>> all isEven [2, 4, 6, 8, 10 :: Integer] True >>> all isEven [2, 4, 6, 1, 8, 10 :: Integer] False
all :: forall (m :: Type -> Type) a . Monad m => (a -> Bool) -> Fold m a Boolstreamly-core Streamly.Data.Fold Returns True if all elements of the input satisfy the predicate. Definition:
>>> all p = Fold.lmap p Fold.and
Example:>>> Stream.fold (Fold.all (== 0)) $ Stream.fromList [1,0,1] False