Data.Set.Unordered.Unique

Unique, unordered sets. 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.

Documentation

newtype UUSet a

Pronounced "Unordered Unique Set"

Constructors

UUSet

Fields

unUUSet :: [a]

Instances

Functor UUSet

Mergeable UUSet

Eq a => CanBeProperSubset (UUSet a)

Eq a => CanBeSubset (UUSet a)

HasSize (UUSet a)

HasEmpty (UUSet a)

Eq a => HasIntersection (UUSet a)

Eq a => HasDifference (UUSet a)

Eq a => HasUnion (UUSet a)

HasSingleton (UUSet a) a

Operators

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

Query

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

O(1)

size :: UUSet a -> Int

O(n)

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

O(n)

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

O(n)

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

O(n)

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

O(n*m)

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

O(n*(m^2))

Construction

empty :: UUSet a

O(1)

singleton :: a -> UUSet a

O(1)

insert :: Eq a => a -> UUSet a -> UUSet a

O(n)

delete :: Eq a => a -> UUSet a -> UUSet a

O(n)

Combine

union :: Eq a => UUSet a -> UUSet a -> UUSet a

O(n*m)

difference :: Eq a => UUSet a -> UUSet a -> UUSet a

O(n*m)

intersection :: Eq a => UUSet a -> UUSet a -> UUSet a

O(n*m)

Filter

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

O(n)

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

O(n) - Guaranteed to be disjoint

Map

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

O(n)

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

O(?)