Safe Haskell | None |
---|---|
Language | Haskell2010 |
Convenience operators overloaded for arbitrary use. There are no laws associated with these classes, just duck-typed so we don't have to use the qualified versions of each function.
Documentation
newtype Intersection a Source
HasUnion IntSet Source | |
HasUnion (IntMap a) Source | |
Ord a => HasUnion (Set a) Source | |
HasUnion (Predicate a) Source | |
(Hashable a, Eq a) => HasUnion (HashSet a) Source | |
Ord a => HasUnion (FiniteSet a) Source | |
Eq a => HasUnion (UUSet a) Source | |
Eq a => HasUnion (UMSet a) Source | |
Sorting a => HasUnion (OMSet a) Source | |
HasUnion a => HasUnion (XUnion a) Source | |
HasUnion a => HasUnion (Intersection a) Source | |
HasUnion a => HasUnion (Union a) Source | |
Ord k => HasUnion (Map k a) Source | |
(Hashable k, Eq k) => HasUnion (HashMap k a) Source | |
Ord k => HasUnion (SetWith k a) Source | |
(Ord k, HasUnion (c a)) => HasUnion (SetsWith k c a) Source |
class HasDifference s where Source
difference :: s -> s -> s Source
HasDifference IntSet Source | |
HasDifference (IntMap a) Source | |
Ord a => HasDifference (Set a) Source | |
HasDifference (Predicate a) Source | |
(Hashable a, Eq a) => HasDifference (HashSet a) Source | |
Ord a => HasDifference (FiniteSet a) Source | |
Eq a => HasDifference (UUSet a) Source | |
Eq a => HasDifference (UMSet a) Source | |
Eq a => HasDifference (OMSet a) Source | |
HasDifference a => HasDifference (XUnion a) Source | |
HasDifference a => HasDifference (Intersection a) Source | |
HasDifference a => HasDifference (Union a) Source | |
Ord k => HasDifference (Map k a) Source | |
(Hashable k, Eq k) => HasDifference (HashMap k a) Source | |
Ord k => HasDifference (SetWith k a) Source | |
(Ord k, Eq (c a), HasEmpty (c a), HasDifference (c a)) => HasDifference (SetsWith k c a) Source |
(\\) :: HasDifference s => s -> s -> s Source
class HasIntersection s where Source
intersection :: s -> s -> s Source
HasIntersection IntSet Source | |
HasIntersection (IntMap a) Source | |
Ord a => HasIntersection (Set a) Source | |
HasIntersection (Predicate a) Source | |
(Hashable a, Eq a) => HasIntersection (HashSet a) Source | |
Ord a => HasIntersection (FiniteSet a) Source | |
Eq a => HasIntersection (UUSet a) Source | |
Eq a => HasIntersection (UMSet a) Source | |
Ord a => HasIntersection (OMSet a) Source | |
HasIntersection a => HasIntersection (XUnion a) Source | |
HasIntersection a => HasIntersection (Intersection a) Source | |
HasIntersection a => HasIntersection (Union a) Source | |
Ord k => HasIntersection (Map k a) Source | |
(Hashable k, Eq k) => HasIntersection (HashMap k a) Source | |
Ord k => HasIntersection (SetWith k a) Source | |
(Ord k, Eq (c a), HasEmpty (c a), HasIntersection (c a)) => HasIntersection (SetsWith k c a) Source |
intersections :: (Foldable f, HasIntersection s, HasTotal s) => f s -> s Source
class HasXUnion s where Source
(HasUnion s, HasIntersection s, HasDifference s) => HasXUnion s Source |
class HasComplement s where Source
complement :: s -> s Source
HasComplement (Predicate a) Source | |
Ord a => HasComplement (FiniteSet a) Source | |
HasComplement a => HasComplement (XUnion a) Source | |
HasComplement a => HasComplement (Intersection a) Source | |
HasComplement a => HasComplement (Union a) Source |
class HasSingleton a s where Source
HasSingleton Key IntSet Source | |
HasSingleton a (UUSet a) Source | |
HasSingleton a (UMSet a) Source | |
HasSingleton a (OMSet a) Source | |
Eq a => HasSingleton a (Predicate a) Source | |
Hashable a => HasSingleton a (HashSet a) Source | |
HasSingleton a (Seq a) Source | |
HasSingleton a [a] Source | |
HasSingleton a (Set a) Source | |
HasSingleton x a => HasSingleton x (XUnion a) Source | |
HasSingleton x a => HasSingleton x (Intersection a) Source | |
HasSingleton x a => HasSingleton x (Union a) Source |
class HasSingletonWith k a s where Source
singletonWith :: k -> a -> s Source
HasSingletonWith k x a => HasSingletonWith k x (XUnion a) Source | |
HasSingletonWith k x a => HasSingletonWith k x (Intersection a) Source | |
HasSingletonWith k x a => HasSingletonWith k x (Union a) Source | |
HasSingletonWith Key a (IntMap a) Source | |
Hashable k => HasSingletonWith k a (HashMap k a) Source | |
HasSingletonWith k a (Map k a) Source | |
HasSingletonWith (Set a) a (FiniteSet a) Source | |
Ord k => HasSingletonWith (a -> k) a (SetWith k a) Source | |
(Ord k, HasUnion (c a), HasSingleton a (c a)) => HasSingletonWith (a -> k) a (SetsWith k c a) Source |
class HasDelete a s where Source
HasDelete Key IntSet Source | |
Ord a => HasDelete a (FiniteSet a) Source | |
Eq a => HasDelete a (UUSet a) Source | |
Eq a => HasDelete a (UMSet a) Source | |
Eq a => HasDelete a (OMSet a) Source | |
Eq a => HasDelete a (Predicate a) Source | |
(Hashable a, Eq a) => HasDelete a (HashSet a) Source | |
Eq a => HasDelete a [a] Source | |
Ord a => HasDelete a (Set a) Source | |
HasDelete x a => HasDelete x (XUnion a) Source | |
HasDelete x a => HasDelete x (Intersection a) Source | |
HasDelete x a => HasDelete x (Union a) Source | |
HasDelete Key (IntMap a) Source | |
Ord k => HasDelete a (SetWith k a) Source | |
(Hashable k, Eq k) => HasDelete k (HashMap k a) Source | |
Ord k => HasDelete k (Map k a) Source | |
(Ord k, Eq (c a), HasEmpty (c a), HasDelete a (c a)) => HasDelete a (SetsWith k c a) Source |
class HasInsert a s where Source
HasInsert Key IntSet Source | |
Ord a => HasInsert a (FiniteSet a) Source | |
Eq a => HasInsert a (UUSet a) Source | |
HasInsert a (UMSet a) Source | |
Ord a => HasInsert a (OMSet a) Source | |
Eq a => HasInsert a (Predicate a) Source | |
(Hashable a, Eq a) => HasInsert a (HashSet a) Source | |
HasInsert a [a] Source | |
Ord a => HasInsert a (Set a) Source | |
HasInsert x a => HasInsert x (XUnion a) Source | |
HasInsert x a => HasInsert x (Intersection a) Source | |
HasInsert x a => HasInsert x (Union a) Source | |
Ord k => HasInsert a (SetWith k a) Source | |
(Ord k, HasUnion (c a), HasSingleton a (c a)) => HasInsert a (SetsWith k c a) Source |
class HasInsertWith k a s where Source
insertWith :: k -> a -> s -> s Source
HasInsertWith k x a => HasInsertWith k x (XUnion a) Source | |
HasInsertWith k x a => HasInsertWith k x (Intersection a) Source | |
HasInsertWith k x a => HasInsertWith k x (Union a) Source | |
HasInsertWith Key a (IntMap a) Source | |
(Hashable k, Eq k) => HasInsertWith k a (HashMap k a) Source | |
Ord k => HasInsertWith k a (Map k a) Source |
HasEmpty IntSet Source | |
HasEmpty [a] Source | |
HasEmpty (IntMap a) Source | |
HasEmpty (Set a) Source | |
HasEmpty (Seq a) Source | |
HasEmpty (Predicate a) Source | |
HasEmpty (HashSet a) Source | |
HasEmpty (UUSet a) Source | |
HasEmpty (UMSet a) Source | |
HasEmpty (OMSet a) Source | |
HasEmpty a => HasEmpty (XUnion a) Source | |
HasEmpty a => HasEmpty (Intersection a) Source | |
HasEmpty a => HasEmpty (Union a) Source | |
HasEmpty (Map k a) Source | |
HasEmpty (HashMap k a) Source |
class HasEmptyWith k s where Source
HasEmptyWith k a => HasEmptyWith k (XUnion a) Source | |
HasEmptyWith k a => HasEmptyWith k (Intersection a) Source | |
HasEmptyWith k a => HasEmptyWith k (Union a) Source | |
HasEmptyWith (Set a) (FiniteSet a) Source | |
HasEmptyWith (a -> k) (SetWith k a) Source | |
HasEmptyWith (a -> k) (SetsWith k c a) Source |
class HasTotalWith k s where Source
HasTotalWith k a => HasTotalWith k (XUnion a) Source | |
HasTotalWith k a => HasTotalWith k (Intersection a) Source | |
HasTotalWith k a => HasTotalWith k (Union a) Source | |
HasTotalWith (FiniteSet a) (FiniteSet a) Source |
HasSize IntSet Source | |
HasSize [a] Source | |
HasSize (IntMap a) Source | |
HasSize (Set a) Source | |
HasSize (Seq a) Source | |
HasSize (HashSet a) Source | |
HasSize (FiniteSet a) Source | |
HasSize (UUSet a) Source | |
HasSize (UMSet a) Source | |
HasSize (OMSet a) Source | |
HasSize a => HasSize (XUnion a) Source | |
HasSize a => HasSize (Intersection a) Source | |
HasSize a => HasSize (Union a) Source | |
HasSize (Map k a) Source | |
HasSize (HashMap k a) Source | |
HasSize (SetWith k a) Source | |
HasSize (SetsWith k c a) Source |
class CanBeSubset s where Source
isSubsetOf :: s -> s -> Bool Source
CanBeSubset IntSet Source | |
Eq a => CanBeSubset (IntMap a) Source | |
Ord a => CanBeSubset (Set a) Source | |
Ord a => CanBeSubset (FiniteSet a) Source | |
Eq a => CanBeSubset (UUSet a) Source | |
Eq a => CanBeSubset (UMSet a) Source | |
Eq a => CanBeSubset (OMSet a) Source | |
CanBeSubset a => CanBeSubset (XUnion a) Source | |
CanBeSubset a => CanBeSubset (Intersection a) Source | |
CanBeSubset a => CanBeSubset (Union a) Source | |
(Eq k, Ord k, Eq a) => CanBeSubset (Map k a) Source | |
(Ord k, Eq a) => CanBeSubset (SetWith k a) Source | |
(Ord k, Eq (c a), CanBeSubset (c a)) => CanBeSubset (SetsWith k c a) Source |
class CanBeProperSubset s where Source
isProperSubsetOf :: s -> s -> Bool Source
CanBeProperSubset IntSet Source | |
Eq a => CanBeProperSubset (IntMap a) Source | |
Ord a => CanBeProperSubset (Set a) Source | |
Ord a => CanBeProperSubset (FiniteSet a) Source | |
Eq a => CanBeProperSubset (UUSet a) Source | |
Eq a => CanBeProperSubset (UMSet a) Source | |
Eq a => CanBeProperSubset (OMSet a) Source | |
CanBeProperSubset a => CanBeProperSubset (XUnion a) Source | |
CanBeProperSubset a => CanBeProperSubset (Intersection a) Source | |
CanBeProperSubset a => CanBeProperSubset (Union a) Source | |
(Eq k, Ord k, Eq a) => CanBeProperSubset (Map k a) Source | |
(Ord k, Eq a) => CanBeProperSubset (SetWith k a) Source | |
(Ord k, Eq (c a), CanBeSubset (c a)) => CanBeProperSubset (SetsWith k c a) Source |