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. fromSet :: Set a -> MultiSet a

   multiset	Data.MultiSet

   O(n). Convert a Set to a multiset.

2. isProperSubsetOf :: Ord a => MultiSet a -> MultiSet a -> Bool

   multiset	Data.MultiSet

   O(n+m). Is this a proper subset? (ie. a subset but not equal).

3. isSubsetOf :: Ord a => MultiSet a -> MultiSet a -> Bool

   multiset	Data.MultiSet

   O(n+m). Is this a subset? (s1 `isSubsetOf` s2) tells whether s1 is a subset of s2.

4. toSet :: MultiSet a -> Set a

   multiset	Data.MultiSet

   O(n). Convert a multiset to a Set, removing duplicates.

5. maxSet :: Maxima a -> Set a

   partialord	Data.PartialOrd

   No documentation available.

6. minSet :: Minima a -> Set a

   partialord	Data.PartialOrd

   No documentation available.

7. traverseT :: Default (Traverse f) a b => a -> f b

   product-profunctors	Data.Profunctor.Product.Examples

   Use sequenceT instead. It has a better name.

8. eraseTypes :: forall (ins :: [Type]) (out :: [Type]) . Registry ins out -> Registry '[ERASED_TYPES] '[ERASED_TYPES]

   registry	Data.Registry.Registry

   Remove the parameters list of the registry and replace it with an empty type This makes it easier to read compilation errors where less types are being displayed On the other hand the resulting registry cannot be type-checked anymore when trying to get values out of it

9. class AreSubset (ins :: [Type]) (out :: [Type]) (targets :: [Type])

   registry	Data.Registry.Solver

   Compute if each element of a list of types is contained in another list when trying to append 2 registries together where target is the list of inputs of the first registry

10. class IsSameSet (types1 :: [Type]) (types2 :: [Type])

    registry	Data.Registry.Solver

    Compute if each element of a list of types is the same as another in a different order

Page 158 of many | Previous | Next