Hoogle Search

Within LTS Haskell 22.19 (ghc-9.6.4)

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

Exact lookup

1. newtype () => All

   base-compat-batteries	Data.Monoid.Compat

   Boolean monoid under conjunction (&&).

   >>> getAll (All True <> mempty <> All False)
   False
   

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

2. All :: Bool -> All

   base-compat-batteries	Data.Monoid.Compat

   No documentation available.

3. newtype () => All

   base-compat-batteries	Data.Semigroup.Compat

   Boolean monoid under conjunction (&&).

   >>> getAll (All True <> mempty <> All False)
   False
   

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

4. All :: Bool -> All

   base-compat-batteries	Data.Semigroup.Compat

   No documentation available.

5. class (AllF c xs, SListI xs) => All (c :: k -> Constraint) (xs :: [k])

   generics-sop	Generics.SOP

   Require a constraint for every element of a list. If you have a datatype that is indexed over a type-level list, then you can use All to indicate that all elements of that type-level list must satisfy a given constraint. Example: The constraint

   All Eq '[ Int, Bool, Char ]
   

   is equivalent to the constraint

   (Eq Int, Eq Bool, Eq Char)
   

   Example: A type signature such as

   f :: All Eq xs => NP I xs -> ...
   

   means that f can assume that all elements of the n-ary product satisfy Eq. Note on superclasses: ghc cannot deduce superclasses from All constraints. You might expect the following to compile

   class (Eq a) => MyClass a
   
   foo :: (All Eq xs) => NP f xs -> z
   foo = [..]
   
   bar :: (All MyClass xs) => NP f xs -> x
   bar = foo
   

   but it will fail with an error saying that it was unable to deduce the class constraint AllF Eq xs (or similar) in the definition of bar. In cases like this you can use Dict from Data.SOP.Dict to prove conversions between constraints. See this answer on SO for more details.

6. newtype () => All

   relude	Relude.Monoid

   Boolean monoid under conjunction (&&).

   >>> getAll (All True <> mempty <> All False)
   False
   

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

7. All :: Bool -> All

   relude	Relude.Monoid

   No documentation available.

8. newtype () => All

   Cabal-syntax	Distribution.Compat.Semigroup

   Boolean monoid under conjunction (&&).

   >>> getAll (All True <> mempty <> All False)
   False
   

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

9. All :: Bool -> All

   Cabal-syntax	Distribution.Compat.Semigroup

   No documentation available.

10. data All

    first-class-families	Fcf.Class.Foldable

    Whether all elements of the list satisfy a predicate. Note: this identifier conflicts with All (from Data.Monoid).

    Example

    >>> :kind! Eval (All (Flip (<) 6) [0,1,2,3,4,5])
    Eval (All (Flip (<) 6) [0,1,2,3,4,5]) :: Bool
    = True
    

    >>> :kind! Eval (All (Flip (<) 5) [0,1,2,3,4,5])
    Eval (All (Flip (<) 5) [0,1,2,3,4,5]) :: Bool
    = False
    

Page 2 of many | Previous | Next