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

Defined in Data.Set.Unordered.Unique

Methods

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

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

Mergeable UUSet

Defined in Data.Set.Unordered.Unique

Methods

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

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

Eq a => HasInsert a (UUSet a)

Defined in Data.Set.Class

Methods

insert :: a -> UUSet a -> UUSet a

Eq a => HasDelete a (UUSet a)

Defined in Data.Set.Class

Methods

delete :: a -> UUSet a -> UUSet a

HasSingleton a (UUSet a)

Defined in Data.Set.Class

Methods

singleton :: a -> UUSet a

Eq a => Eq (UUSet a)

Defined in Data.Set.Unordered.Unique

Methods

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

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

Show a => Show (UUSet a)

Defined in Data.Set.Unordered.Unique

Methods

showsPrec :: Int -> UUSet a -> ShowS

show :: UUSet a -> String

showList :: [UUSet a] -> ShowS

(Arbitrary a, Eq a) => Arbitrary (UUSet a)

Defined in Data.Set.Unordered.Unique

Methods

arbitrary :: Gen (UUSet a)

shrink :: UUSet a -> [UUSet a]

Eq a => CanBeProperSubset (UUSet a)

Defined in Data.Set.Class

Methods

isProperSubsetOf :: UUSet a -> UUSet a -> Bool

Eq a => CanBeSubset (UUSet a)

Defined in Data.Set.Class

Methods

isSubsetOf :: UUSet a -> UUSet a -> Bool

HasSize (UUSet a)

Defined in Data.Set.Class

Methods

size :: UUSet a -> Int

HasEmpty (UUSet a)

Defined in Data.Set.Class

Methods

empty :: UUSet a

Eq a => HasDifference (UUSet a)

Defined in Data.Set.Class

Methods

difference :: UUSet a -> UUSet a -> UUSet a

Eq a => HasIntersection (UUSet a)

Defined in Data.Set.Class

Methods

intersection :: UUSet a -> UUSet a -> UUSet a

Eq a => HasUnion (UUSet a)

Defined in Data.Set.Class

Methods

union :: UUSet a -> UUSet a -> UUSet a

Operators

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

Query

null :: 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(?)

Orphan instances

MonadBase Gen Gen

Methods

liftBase :: Gen α -> Gen α