Data.Set.Unordered.Many

Documentation

newtype UMSet a

Unordered sets with duplicate elements. The semantics for "unordering" is based on the idea that we will not know what order the elements are in at any point, and we are free to re-order elements in any way.

Most binary functions are algorithmically heavier on the right arguments.

Pronounced "Unordered Many Set"

Constructors

UMSet

Fields

• unUMSet :: [a]

Instances

Functor UMSet

Methods

fmap :: (a -> b) -> UMSet a -> UMSet b

(<$) :: a -> UMSet b -> UMSet a

Mergeable UMSet

Methods

mergeMap :: CommutativeId m => (a -> m) -> UMSet a -> m

merge :: (a -> b -> b) -> b -> UMSet a -> b

HasInsert a (UMSet a)

Methods

insert :: a -> UMSet a -> UMSet a

Eq a => HasDelete a (UMSet a)

Methods

delete :: a -> UMSet a -> UMSet a

HasSingleton a (UMSet a)

Methods

singleton :: a -> UMSet a

Eq a => Eq (UMSet a)

Methods

(==) :: UMSet a -> UMSet a -> Bool

(/=) :: UMSet a -> UMSet a -> Bool

Show a => Show (UMSet a)

Methods

showsPrec :: Int -> UMSet a -> ShowS

show :: UMSet a -> String

showList :: [UMSet a] -> ShowS

Arbitrary a => Arbitrary (UMSet a)

Methods

arbitrary :: Gen (UMSet a)

shrink :: UMSet a -> [UMSet a]

Eq a => CanBeProperSubset (UMSet a)

Methods

isProperSubsetOf :: UMSet a -> UMSet a -> Bool

Eq a => CanBeSubset (UMSet a)

Methods

isSubsetOf :: UMSet a -> UMSet a -> Bool

HasSize (UMSet a)

Methods

size :: UMSet a -> Int

HasEmpty (UMSet a)

Methods

empty :: UMSet a

Eq a => HasDifference (UMSet a)

Methods

difference :: UMSet a -> UMSet a -> UMSet a

Eq a => HasIntersection (UMSet a)

Methods

intersection :: UMSet a -> UMSet a -> UMSet a

Eq a => HasUnion (UMSet a)

Methods

union :: UMSet a -> UMSet a -> UMSet a

Operators

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

Query

null :: UMSet a -> Bool

O(1)

size :: UMSet a -> Int

O(n)

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

O(n)

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

O(n)

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

O(n)

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

O(n*m)

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

O(n*(m^3))

Construction

empty :: UMSet a

O(1)

singleton :: a -> UMSet a

O(1)

insert :: a -> UMSet a -> UMSet a

O(1)

delete :: Eq a => a -> UMSet a -> UMSet a

O(n)

Combine

union :: UMSet a -> UMSet a -> UMSet a

O(n)

difference :: Eq a => UMSet a -> UMSet a -> UMSet a

O(n*m)

intersection :: Eq a => UMSet a -> UMSet a -> UMSet a

O(n*(m^4)) - Combines all elements of both

Filter

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

O(n)

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

O(n)

Map

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

O(n)

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

O(?)