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. SESet :: Flags -> Expiration -> SESet

   memcache	Database.Memcache.Types

   No documentation available.

2. module Data.MonoidMap.Examples.MultiSet

   A multiset type, implemented in terms of MonoidMap. See: https://en.wikipedia.org/wiki/Multiset

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

   monoidmap-examples	Data.MonoidMap.Examples.MultiSet

   No documentation available.

4. data NESet v

   monoidmap-examples	Data.MonoidMap.Examples.Set.NonEmpty

   No documentation available.

5. isSubsetOf :: Ord v => NESet v -> NESet v -> Bool

   monoidmap-examples	Data.MonoidMap.Examples.Set.NonEmpty

   No documentation available.

6. nonEmptySet :: Set v -> Maybe (NESet v)

   monoidmap-examples	Data.MonoidMap.Examples.Set.NonEmpty

   No documentation available.

7. toSet :: NESet v -> Set v

   monoidmap-examples	Data.MonoidMap.Examples.Set.NonEmpty

   No documentation available.

8. keysMultiset :: forall (c :: Type -> Type) k v . (Collection c, Ord k) => Multimap c k v -> Multiset k

   more-containers	Data.Multimap

   O(m * C) Returns a multiset of the map's keys with matching multiplicities.

9. keysSet :: forall (c :: Type -> Type) k v . Multimap c k v -> Set k

   more-containers	Data.Multimap

   O(m) Returns a set of the multimap's (distinct) keys.

10. module Data.Multiset

    This modules provides a strict multiset implementation. To avoid collision with Prelude functions, it is recommended to import this module qualified:

    import qualified Data.Multiset as Mset
    

    All complexities below use m for the number of distinct elements and n for the total number of elements.

Page 199 of many | Previous | Next