Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. all :: Foldable t => (a -> Bool) -> t a -> Bool

   mixed-types-num	Numeric.MixedTypes.PreludeHiding

   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 *
   

2. all :: (a -> Bool) -> NonEmptyVector a -> Bool

   nonempty-vector	Data.Vector.NonEmpty

   O(n) Check if all elements satisfy the predicate.

3. all :: Foldable t => (a -> Bool) -> t a -> Bool

   LambdaHack	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 *
   

4. all :: Foldable t => (a -> Bool) -> t a -> Bool

   LambdaHack	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 *
   

5. all :: Bits b => (Bool -> Bool) -> b -> Bool

   bitwise	Data.Bits.Bitwise

   True when the predicate is true for all bits.

6. all :: Foldable t => (a -> Bool) -> t a -> Bool

   cabal-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 *
   

7. all :: Foldable t => (a -> Bool) -> t a -> Bool

   ihaskell	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 *
   

8. all :: Foldable t => (a -> Bool) -> t a -> Bool

   incipit-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 *
   

9. all :: RandomGen g => g -> [([Pitch], [Pitch])]

   reactive-midyim	Reactive.Banana.MIDI.Training

   No documentation available.

10. all :: Generator c => (Elem c -> Bool) -> c -> Bool

    reducers	Data.Generator.Combinators

    Efficiently mapReduce any Generator checking to see if all of its values match the supplied predicate

    mapReduceWith getAll
    

Page 20 of many | Previous | Next