Hoogle Search
Within LTS Haskell 24.35 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
monoidmap-examples Data.MonoidMap.Examples.Set.NonEmpty No documentation available.
isSubsetOf :: Ord v => NESet v -> NESet v -> Boolmonoidmap-examples Data.MonoidMap.Examples.Set.NonEmpty No documentation available.
nonEmptySet :: Set v -> Maybe (NESet v)monoidmap-examples Data.MonoidMap.Examples.Set.NonEmpty No documentation available.
-
monoidmap-examples Data.MonoidMap.Examples.Set.NonEmpty No documentation available.
-
more-containers Data.Multimap O(m * C) Returns a multiset of the map's keys with matching multiplicities.
keysSet :: forall (c :: Type -> Type) k v . Multimap c k v -> Set kmore-containers Data.Multimap O(m) Returns a set of the multimap's (distinct) keys.
-
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. -
more-containers Data.Multiset A strict implementation of a multiset. It is backed by a Map and inherits several of its properties and operation's complexities. In particular, the number of elements in a multiset must not exceed maxBound :: Int.
isProperSubsetOf :: Ord v => Multiset v -> Multiset v -> Boolmore-containers Data.Multiset O(m * log m) Checks whether the first subset is a strict subset of the second.
isSubsetOf :: Ord v => Multiset v -> Multiset v -> Boolmore-containers Data.Multiset O(m * log m) Checks whether the first subset is a subset of the second (potentially equal to it).