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. newtype All

   ghc-internal	GHC.Internal.Data.Monoid

   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}
   

2. All :: Bool -> All

   ghc-internal	GHC.Internal.Data.Monoid

   No documentation available.

3. newtype All

   ghc-internal	GHC.Internal.Data.Semigroup.Internal

   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}
   

4. All :: Bool -> All

   ghc-internal	GHC.Internal.Data.Semigroup.Internal

   No documentation available.

5. newtype All

   numhask	NumHask.Prelude

   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}
   

6. All :: Bool -> All

   numhask	NumHask.Prelude

   No documentation available.

7. module Data.Parameterized.All

   This module provides All, a GADT that encodes universal quantification/parametricity over a type variable. The following is an example of a situation in which it might be necessary to use All (though it is a bit contrived):

   {-# LANGUAGE FlexibleInstances #-}
   {-# LANGUAGE GADTs #-}
   
   data F (x :: Bool) where
   FTrue :: F 'True
   FFalse :: F 'False
   FIndeterminate :: F b
   
   data Value =
   VAllF (All F)
   
   class Valuable a where
   valuation :: a -> Value
   
   instance Valuable (All F) where
   valuation = VAllF
   
   val1 :: Value
   val1 = valuation (All FIndeterminate)
   

   For a less contrived but more complex example, see this blog post: http://comonad.com/reader/2008/rotten-bananas/

8. newtype All (f :: k -> Type)

   parameterized-utils	Data.Parameterized.All

   No documentation available.

9. All :: (forall (x :: k) . () => f x) -> All (f :: k -> Type)

   parameterized-utils	Data.Parameterized.All

   No documentation available.

10. data All

    lens-family-core	Lens.Family

    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}
    

Page 4 of many | Previous | Next