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.

  1. 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 *
    

  2. 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 *
    

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

    bitwise Data.Bits.Bitwise

    True when the predicate is true for all bits.

  4. 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 *
    

  5. 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 *
    

  6. 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 *
    

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

    reactive-midyim Reactive.Banana.MIDI.Training

    No documentation available.

  8. 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
    

  9. all :: SymVal a => (SBV a -> SBool) -> SList a -> SBool

    sbv 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
    

  10. all :: forall (m :: Type -> Type) a . Monad m => (a -> Bool) -> Fold m a Bool

    streamly-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
    

Page 20 of many | Previous | Next