Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. data AllDistinct

    comfort-array Data.Array.Comfort.Shape

    No documentation available.

  2. AllDistinct :: AllDistinct

    comfort-array Data.Array.Comfort.Shape

    No documentation available.

  3. type family AllFieldsFinal self (a :: Type -> Type) :: Bool

    generic-arbitrary Test.QuickCheck.Arbitrary.Generic

    No documentation available.

  4. type All2 (c :: k -> Constraint) = All All c

    sop-core Data.SOP

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

    All2 Eq '[ '[ Int ], '[ Bool, Char ] ]
    is equivalent to the constraint 
    (Eq Int, Eq Bool, Eq Char)
    Example: A type signature such as 
    f :: All2 Eq xss => SOP I xs -> ...
    means that f can assume that all elements of the sum of product satisfy Eq. Since 0.4.0.0, this is merely a synonym for 'All (All c)'.

  5. type family AllN (h :: k -> Type -> l -> Type) (c :: k -> Constraint) :: l -> Constraint

    sop-core Data.SOP

    A generalization of All and All2. The family AllN expands to All or All2 depending on whether the argument is indexed by a list or a list of lists.

  6. class (SListI xs, SListI ys, SameShapeAs xs ys, SameShapeAs ys xs, AllZipF c xs ys) => AllZip (c :: a -> b -> Constraint) (xs :: [a]) (ys :: [b])

    sop-core Data.SOP

    Require a constraint pointwise for every pair of elements from two lists. Example: The constraint 

    AllZip (~) '[ Int, Bool, Char ] '[ a, b, c ]
    is equivalent to the constraint 
    (Int ~ a, Bool ~ b, Char ~ c)

  7. class (AllZipF AllZip f xss yss, SListI xss, SListI yss, SameShapeAs xss yss, SameShapeAs yss xss) => AllZip2 (f :: a -> b -> Constraint) (xss :: [[a]]) (yss :: [[b]])

    sop-core Data.SOP

    Require a constraint pointwise for every pair of elements from two lists of lists.

  8. type family AllZipN (h :: k -> Type -> l -> Type) (c :: k1 -> k2 -> Constraint) :: l1 -> l2 -> Constraint

    sop-core Data.SOP

    A generalization of AllZip and AllZip2. The family AllZipN expands to AllZip or AllZip2 depending on whther the argument is indexed by a list or a list of lists.

  9. type All2 (c :: k -> Constraint) = All All c

    sop-core Data.SOP.Constraint

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

    All2 Eq '[ '[ Int ], '[ Bool, Char ] ]
    is equivalent to the constraint 
    (Eq Int, Eq Bool, Eq Char)
    Example: A type signature such as 
    f :: All2 Eq xss => SOP I xs -> ...
    means that f can assume that all elements of the sum of product satisfy Eq. Since 0.4.0.0, this is merely a synonym for 'All (All c)'.

  10. type family AllF (c :: k -> Constraint) (xs :: [k])

    sop-core Data.SOP.Constraint

    Type family used to implement All.

Page 34 of many | Previous | Next