| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Set.Ordered.Many
- newtype OMSet a = OMSet {
- unOMSet :: [a]
- (\\) :: Eq a => OMSet a -> OMSet a -> OMSet a
- null :: Eq a => OMSet a -> Bool
- size :: OMSet a -> Int
- member :: Eq a => a -> OMSet a -> Bool
- notMember :: Eq a => a -> OMSet a -> Bool
- lookup :: Eq a => a -> OMSet a -> Maybe a
- isSubsetOf :: Eq a => OMSet a -> OMSet a -> Bool
- isProperSubsetOf :: Eq a => OMSet a -> OMSet a -> Bool
- empty :: OMSet a
- singleton :: a -> OMSet a
- insert :: Ord a => a -> OMSet a -> OMSet a
- delete :: Eq a => a -> OMSet a -> OMSet a
- union :: Sorting a => OMSet a -> OMSet a -> OMSet a
- difference :: Eq a => OMSet a -> OMSet a -> OMSet a
- intersection :: Ord a => OMSet a -> OMSet a -> OMSet a
- filter :: (a -> Bool) -> OMSet a -> OMSet a
- partition :: (a -> Bool) -> OMSet a -> (OMSet a, OMSet a)
- map :: (a -> b) -> OMSet a -> OMSet b
- mapMaybe :: (a -> Maybe b) -> OMSet a -> OMSet b
Documentation
Ordered sets with duplicate elements.
Instances
| Monad OMSet Source | |
| Functor OMSet Source | |
| MonadFix OMSet Source | |
| Applicative OMSet Source | |
| Foldable OMSet Source | |
| Traversable OMSet Source | |
| Mergeable OMSet Source | |
| Ord a => HasInsert a (OMSet a) Source | |
| Eq a => HasDelete a (OMSet a) Source | |
| HasSingleton a (OMSet a) Source | |
| Eq a => Eq (OMSet a) Source | |
| Show a => Show (OMSet a) Source | |
| Eq a => CanBeProperSubset (OMSet a) Source | |
| Eq a => CanBeSubset (OMSet a) Source | |
| HasSize (OMSet a) Source | |
| HasEmpty (OMSet a) Source | |
| Ord a => HasIntersection (OMSet a) Source | |
| Eq a => HasDifference (OMSet a) Source | |
| Sorting a => HasUnion (OMSet a) Source |
Operators
Query
Construction
Combine
intersection :: Ord a => OMSet a -> OMSet a -> OMSet a Source
O(min(n,m)) - Combines all elements of both