Data.Set.Ordered.Many

Documentation

newtype OMSet a

Ordered sets with duplicate elements.

Constructors

OMSet

Fields

unOMSet :: [a]

Instances

Functor OMSet

Mergeable OMSet

Eq a => CanBeProperSubset (OMSet a)

Eq a => CanBeSubset (OMSet a)

HasSize (OMSet a)

HasEmpty (OMSet a)

Ord a => HasIntersection (OMSet a)

Eq a => HasDifference (OMSet a)

Sorting a => HasUnion (OMSet a)

HasSingleton (OMSet a) a

Operators

(\\) :: Eq a => OMSet a -> OMSet a -> OMSet a

Query

null :: Eq a => OMSet a -> Bool

O(1)

size :: OMSet a -> Int

O(n)

member :: Eq a => a -> OMSet a -> Bool

O(n)

notMember :: Eq a => a -> OMSet a -> Bool

O(n)

lookup :: Eq a => a -> OMSet a -> Maybe a

O(n)

isSubsetOf :: Eq a => OMSet a -> OMSet a -> Bool

O(n*m)

isProperSubsetOf :: Eq a => OMSet a -> OMSet a -> Bool

O(n*(m^3))

Construction

empty :: OMSet a

O(1)

singleton :: a -> OMSet a

O(1)

insert :: Ord a => a -> OMSet a -> OMSet a

O(n)

delete :: Eq a => a -> OMSet a -> OMSet a

O(n)

Combine

union :: Sorting a => OMSet a -> OMSet a -> OMSet a

O(n+m)

difference :: Eq a => OMSet a -> OMSet a -> OMSet a

O(n*m)

intersection :: Ord a => OMSet a -> OMSet a -> OMSet a

O(min(n,m)) - Combines all elements of both

Filter

filter :: (a -> Bool) -> OMSet a -> OMSet a

O(n)

partition :: (a -> Bool) -> OMSet a -> (OMSet a, OMSet a)

O(n)

Map

map :: (a -> b) -> OMSet a -> OMSet b

O(n)

mapMaybe :: (a -> Maybe b) -> OMSet a -> OMSet b

O(?)