Safe Haskell | None |
---|---|
Language | Haskell2010 |
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.
- newtype UUSet a = UUSet {
- unUUSet :: [a]
- (\\) :: Eq a => UUSet a -> UUSet a -> UUSet a
- null :: Eq a => UUSet a -> Bool
- size :: UUSet a -> Int
- member :: Eq a => a -> UUSet a -> Bool
- notMember :: Eq a => a -> UUSet a -> Bool
- lookup :: Eq a => a -> UUSet a -> Maybe a
- isSubsetOf :: Eq a => UUSet a -> UUSet a -> Bool
- isProperSubsetOf :: Eq a => UUSet a -> UUSet a -> Bool
- empty :: UUSet a
- singleton :: a -> UUSet a
- insert :: Eq a => a -> UUSet a -> UUSet a
- delete :: Eq a => a -> UUSet a -> UUSet a
- union :: Eq a => UUSet a -> UUSet a -> UUSet a
- difference :: Eq a => UUSet a -> UUSet a -> UUSet a
- intersection :: Eq a => UUSet a -> UUSet a -> UUSet a
- filter :: (a -> Bool) -> UUSet a -> UUSet a
- partition :: (a -> Bool) -> UUSet a -> (UUSet a, UUSet a)
- map :: (a -> b) -> UUSet a -> UUSet b
- mapMaybe :: (a -> Maybe b) -> UUSet a -> UUSet b
Documentation
Pronounced "Unordered Unique Set"
Functor UUSet Source | |
Mergeable UUSet Source | |
Eq a => CanBeProperSubset (UUSet a) Source | |
Eq a => CanBeSubset (UUSet a) Source | |
HasSize (UUSet a) Source | |
HasEmpty (UUSet a) Source | |
Eq a => HasIntersection (UUSet a) Source | |
Eq a => HasDifference (UUSet a) Source | |
Eq a => HasUnion (UUSet a) Source | |
HasSingleton (UUSet a) a Source |