Hoogle Search

Within LTS Haskell 24.46 (ghc-9.10.3)

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

Exact lookup

1. 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.

2. 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?

3. ComplementSet :: Set a -> RCSet a

   sbv	Data.SBV

   No documentation available.

4. 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.

5. KSet :: Kind -> Kind

   sbv	Data.SBV

   No documentation available.

6. 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.

7. RegularSet :: Set a -> RCSet a

   sbv	Data.SBV

   No documentation available.

8. type SSet a = SBV RCSet a

   sbv	Data.SBV

   Symbolic Set. Note that we use RCSet, which supports both regular sets and complements, i.e., those obtained from the universal set (of the right type) by removing elements. Similar to SArray the contents are stored with object equality, which makes a difference if the underlying type contains IEEE Floats.

9. isSet :: HasKind a => a -> Bool

   sbv	Data.SBV

   No documentation available.

10. sSet :: (Ord a, SymVal a) => String -> Symbolic (SSet a)

    sbv	Data.SBV

    Declare a named SSet. NB. For a version which generalizes over the underlying monad, see sSet

Page 159 of many | Previous | Next