Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

Exact lookup

1. module Data.Tuple.All

   No documentation available.

2. newtype All

   verset	Verset

   Boolean monoid under conjunction (&&).

   All x <> All y = All (x && y)
   

   Examples

   >>> All True <> mempty <> All False)
   All {getAll = False}
   

   >>> mconcat (map (\x -> All (even x)) [2,4,6,7,8])
   All {getAll = False}
   

   >>> All True <> mempty
   All {getAll = True}
   

3. All :: Bool -> All

   verset	Verset

   No documentation available.

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

   base	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

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

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

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

   base	GHC.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 *
   

8. all :: (Word8 -> Bool) -> ByteString -> Bool

   bytestring	Data.ByteString

   O(n) Applied to a predicate and a ByteString, all determines if all elements of the ByteString satisfy the predicate.

9. all :: (Char -> Bool) -> ByteString -> Bool

   bytestring	Data.ByteString.Char8

   Applied to a predicate and a ByteString, all determines if all elements of the ByteString satisfy the predicate.

10. all :: (Word8 -> Bool) -> ByteString -> Bool

    bytestring	Data.ByteString.Lazy

    O(n) Applied to a predicate and a ByteString, all determines if all elements of the ByteString satisfy the predicate.

Page 10 of many | Previous | Next