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 :: forall (m :: Type -> Type) a . Monad m => (a -> Bool) -> Fold m a Bool

    streamly-core Streamly.Internal.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
    

  2. all :: Monad m => (a -> Bool) -> Stream m a -> m Bool

    streamly-core Streamly.Internal.Data.Stream

    No documentation available.

  3. all :: Monad m => (a -> Bool) -> StreamK m a -> m Bool

    streamly-core Streamly.Internal.Data.StreamK

    No documentation available.

  4. all :: Features

    binaryen Binaryen.Features

    No documentation available.

  5. all :: AsEnumSet a => (a -> Bool) -> EnumSet a -> Bool

    bitwise-enum Data.Enum.Set

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

  6. all :: (FiniteBits w, Num w, Enum a) => (a -> Bool) -> EnumSet w a -> Bool

    bitwise-enum Data.Enum.Set.Base

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

  7. all :: [Code]

    ca-province-codes Data.CAProvinceCodes

    A list of every Province/Territory Code.

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

    calligraphy Calligraphy.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 *
    

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

    clash-prelude Clash.HaskellPrelude

    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 *
    

  10. all :: (Boolean b, Foldable t) => (a -> b) -> t a -> b

    cond Data.Algebra.Boolean

    The logical conjunction of the mapping of a function over several values.

Page 21 of many | Previous | Next