Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

1. module Data.MultiSet

   An efficient implementation of multisets, also sometimes called bags. A multiset is like a set, but it can contain multiple copies of the same element. Unless otherwise specified all insert and remove opertions affect only a single copy of an element. For example the minimal element before and after deleteMin could be the same, only with one less occurrence. Since many function names (but not the type name) clash with Prelude names, this module is usually imported qualified, e.g.

   import Data.MultiSet (MultiSet)
   import qualified Data.MultiSet as MultiSet
   

   The implementation of MultiSet is based on the Data.Map module. Note that the implementation is left-biased -- the elements of a first argument are always preferred to the second, for example in union or insert. Of course, left-biasing can only be observed when equality is an equivalence relation instead of structural equality. In the complexity of functions n refers to the number of distinct elements, t is the total number of elements.

2. data MultiSet a

   multiset	Data.MultiSet

   A multiset of values a. The same value can occur multiple times.

3. fromSet :: Set a -> MultiSet a

   multiset	Data.MultiSet

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

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

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

6. toSet :: MultiSet a -> Set a

   multiset	Data.MultiSet

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

7. maxSet :: Maxima a -> Set a

   partialord	Data.PartialOrd

   No documentation available.

8. minSet :: Minima a -> Set a

   partialord	Data.PartialOrd

   No documentation available.

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

   product-profunctors	Data.Profunctor.Product.Examples

   Use sequenceT instead. It has a better name.

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

Page 158 of many | Previous | Next