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

    ghc-internal GHC.Internal.Data.List

    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) -> [a] -> Bool

    ghc-internal GHC.Internal.Data.OldList

    Applied to a predicate and a list, all determines if all elements of the list satisfy the predicate. For the result to be True, the list must be finite; False, however, results from a False value for the predicate applied to an element at a finite index of a finite or infinite list.

    Examples

    >>> 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 :: (a -> Bool) -> [a] -> Bool

    ghc-internal GHC.Internal.List

    Applied to a predicate and a list, all determines if all elements of the list satisfy the predicate. For the result to be True, the list must be finite; False, however, results from a False value for the predicate applied to an element at a finite index of a finite or infinite list.

    Examples

    >>> 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 :: (Char -> Bool) -> JSString -> Bool

    jsaddle Data.JSString

    O(n) all p t determines whether all characters in the JSString t satisify the predicate p. Subject to fusion.

  5. all :: (Char -> Bool) -> Stream Char -> Bool

    jsaddle Data.JSString.Internal.Fusion.Common

    O(n) all p xs determines if all characters in the Text xs satisfy the predicate p. Properties 

    all f . stream = all f

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

    numeric-prelude NumericPrelude

    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

    numeric-prelude NumericPrelude.Base

    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

    numhask NumHask.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

    numhask NumHask.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 *

  10. all :: ListLike full item => (item -> Bool) -> full -> Bool

    ListLike Data.ListLike

    True if all items satisfy the function

Page 17 of many | Previous | Next