Hoogle Search

Within LTS Haskell 24.60 (ghc-9.10.3)

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

Exact lookup

1. class IsSubset (ins :: [Type]) (out :: [Type]) target

   registry	Data.Registry.Solver

   Compute if each element of a list of types is contained in another list when trying to add the function target

2. type family Subset (r1 :: Row k) (r2 :: Row k)

   row-types	Data.Row

   Is the first row a subset of the second? Or, does the second row contain every binding that the first one does?

3. type family Subset (r1 :: Row k) (r2 :: Row k)

   row-types	Data.Row.Internal

   Is the first row a subset of the second? Or, does the second row contain every binding that the first one does?

4. type family Subset (r1 :: Row k) (r2 :: Row k)

   row-types	Data.Row.Records

   Is the first row a subset of the second? Or, does the second row contain every binding that the first one does?

5. eraseToHashMap :: forall c (r :: Row Type) s b . (IsString s, Eq s, Hashable s, Forall r c) => (forall a . c a => a -> b) -> Rec r -> HashMap s b

   row-types	Data.Row.Records

   Turns a record into a HashMap from values representing the labels to the values of the record.

6. type family Subset (r1 :: Row k) (r2 :: Row k)

   row-types	Data.Row.Variants

   Is the first row a subset of the second? Or, does the second row contain every binding that the first one does?

7. ComplementSet :: Set a -> RCSet a

   sbv	Data.SBV

   No documentation available.

8. type ConstraintSet = Symbolic ()

   sbv	Data.SBV

   A constraint set is a symbolic program that returns no values. The idea is that the constraints/min-max goals will serve as the collection of constraints that will be used for sat/optimize calls.

9. KSet :: Kind -> Kind

   sbv	Data.SBV

   No documentation available.

10. data RCSet a

    sbv	Data.SBV

    A RCSet is either a regular set or a set given by its complement from the corresponding universal set.

Page 159 of many | Previous | Next