Data.Set.Class

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 Union a

Constructors

Union

Fields

unUnion :: a

Instances

HasSingletonWith k x a => HasSingletonWith k x (Union a)

HasTotalWith k a => HasTotalWith k (Union a)

HasEmptyWith k a => HasEmptyWith k (Union a)

HasSingleton x a => HasSingleton x (Union a)

(HasUnion s, HasEmpty s) => Monoid (Union s)

HasUnion s => Commutative (Union s)

(Commutative (Union s), HasEmpty s) => CommutativeId (Union s)

CanBeProperSubset a => CanBeProperSubset (Union a)

CanBeSubset a => CanBeSubset (Union a)

HasSize a => HasSize (Union a)

HasTotal a => HasTotal (Union a)

HasEmpty a => HasEmpty (Union a)

HasComplement a => HasComplement (Union a)

HasIntersection a => HasIntersection (Union a)

HasDifference a => HasDifference (Union a)

HasUnion a => HasUnion (Union a)

newtype Intersection a

Constructors

Intersection

Fields

unIntersection :: a

Instances

HasSingletonWith k x a => HasSingletonWith k x (Intersection a)

HasTotalWith k a => HasTotalWith k (Intersection a)

HasEmptyWith k a => HasEmptyWith k (Intersection a)

HasSingleton x a => HasSingleton x (Intersection a)

(HasIntersection s, HasTotal s) => Monoid (Intersection s)

HasIntersection s => Commutative (Intersection s)

(Commutative (Intersection s), HasTotal s) => CommutativeId (Intersection s)

CanBeProperSubset a => CanBeProperSubset (Intersection a)

CanBeSubset a => CanBeSubset (Intersection a)

HasSize a => HasSize (Intersection a)

HasTotal a => HasTotal (Intersection a)

HasEmpty a => HasEmpty (Intersection a)

HasComplement a => HasComplement (Intersection a)

HasIntersection a => HasIntersection (Intersection a)

HasDifference a => HasDifference (Intersection a)

HasUnion a => HasUnion (Intersection a)

newtype XUnion a

Constructors

XUnion

Fields

unXUnion :: a

Instances

HasSingletonWith k x a => HasSingletonWith k x (XUnion a)

HasTotalWith k a => HasTotalWith k (XUnion a)

HasEmptyWith k a => HasEmptyWith k (XUnion a)

HasSingleton x a => HasSingleton x (XUnion a)

(HasXUnion s, HasEmpty s, HasUnion s, HasIntersection s, HasDifference s) => Monoid (XUnion s)

(HasXUnion s, HasUnion s, HasIntersection s, HasDifference s) => Commutative (XUnion s)

CanBeProperSubset a => CanBeProperSubset (XUnion a)

CanBeSubset a => CanBeSubset (XUnion a)

HasSize a => HasSize (XUnion a)

HasTotal a => HasTotal (XUnion a)

HasEmpty a => HasEmpty (XUnion a)

HasComplement a => HasComplement (XUnion a)

HasIntersection a => HasIntersection (XUnion a)

HasDifference a => HasDifference (XUnion a)

HasUnion a => HasUnion (XUnion a)

class HasUnion s where

Methods

union :: s -> s -> s

Instances

HasUnion IntSet

HasUnion (IntMap a)

Ord a => HasUnion (Set a)

Ord a => HasUnion (FiniteSet a)

Eq a => HasUnion (UUSet a)

Eq a => HasUnion (UMSet a)

Sorting a => HasUnion (OMSet a)

(Hashable a, Eq a) => HasUnion (HashSet a)

HasUnion (Predicate a)

HasUnion a => HasUnion (XUnion a)

HasUnion a => HasUnion (Intersection a)

HasUnion a => HasUnion (Union a)

Ord k => HasUnion (Map k a)

(Hashable k, Eq k) => HasUnion (HashMap k a)

Ord k => HasUnion (SetWith k a)

unions :: (Foldable f, HasUnion s, HasEmpty s) => f s -> s

class HasDifference s where

Methods

difference :: s -> s -> s

Instances

HasDifference IntSet

HasDifference (IntMap a)

Ord a => HasDifference (Set a)

Ord a => HasDifference (FiniteSet a)

Eq a => HasDifference (UUSet a)

Eq a => HasDifference (UMSet a)

Eq a => HasDifference (OMSet a)

(Hashable a, Eq a) => HasDifference (HashSet a)

HasDifference (Predicate a)

HasDifference a => HasDifference (XUnion a)

HasDifference a => HasDifference (Intersection a)

HasDifference a => HasDifference (Union a)

Ord k => HasDifference (Map k a)

(Hashable k, Eq k) => HasDifference (HashMap k a)

Ord k => HasDifference (SetWith k a)

class HasIntersection s where

Methods

intersection :: s -> s -> s

Instances

HasIntersection IntSet

HasIntersection (IntMap a)

Ord a => HasIntersection (Set a)

Ord a => HasIntersection (FiniteSet a)

Eq a => HasIntersection (UUSet a)

Eq a => HasIntersection (UMSet a)

Ord a => HasIntersection (OMSet a)

(Hashable a, Eq a) => HasIntersection (HashSet a)

HasIntersection (Predicate a)

HasIntersection a => HasIntersection (XUnion a)

HasIntersection a => HasIntersection (Intersection a)

HasIntersection a => HasIntersection (Union a)

Ord k => HasIntersection (Map k a)

(Hashable k, Eq k) => HasIntersection (HashMap k a)

Ord k => HasIntersection (SetWith k a)

intersections :: (Foldable f, HasIntersection s, HasTotal s) => f s -> s

class HasXUnion s where

Methods

xunion :: s -> s -> s

Instances

(HasUnion s, HasIntersection s, HasDifference s) => HasXUnion s

class HasComplement s where

Methods

complement :: s -> s

Instances

Ord a => HasComplement (FiniteSet a)

HasComplement (Predicate a)

HasComplement a => HasComplement (XUnion a)

HasComplement a => HasComplement (Intersection a)

HasComplement a => HasComplement (Union a)

class HasSingleton s a where

Methods

singleton :: a -> s

Instances

HasSingleton IntSet Key

HasSingleton x a => HasSingleton x (XUnion a)

HasSingleton x a => HasSingleton x (Intersection a)

HasSingleton x a => HasSingleton x (Union a)

HasSingleton [a] a

HasSingleton (Set a) a

HasSingleton (Seq a) a

HasSingleton (UUSet a) a

HasSingleton (UMSet a) a

HasSingleton (OMSet a) a

Hashable a => HasSingleton (HashSet a) a

Eq a => HasSingleton (Predicate a) a

class HasSingletonWith s k a where

Methods

singletonWith :: k -> a -> s

Instances

HasSingletonWith k x a => HasSingletonWith k x (XUnion a)

HasSingletonWith k x a => HasSingletonWith k x (Intersection a)

HasSingletonWith k x a => HasSingletonWith k x (Union a)

HasSingletonWith (IntMap a) Key a

HasSingletonWith (FiniteSet a) (Set a) a

HasSingletonWith (Map k a) k a

Hashable k => HasSingletonWith (HashMap k a) k a

Ord k => HasSingletonWith (SetWith k a) (a -> k) a

class HasEmpty s where

Methods

empty :: s

Instances

HasEmpty IntSet

HasEmpty [a]

HasEmpty (IntMap a)

HasEmpty (Set a)

HasEmpty (Seq a)

HasEmpty (UUSet a)

HasEmpty (UMSet a)

HasEmpty (OMSet a)

HasEmpty (HashSet a)

HasEmpty (Predicate a)

HasEmpty a => HasEmpty (XUnion a)

HasEmpty a => HasEmpty (Intersection a)

HasEmpty a => HasEmpty (Union a)

HasEmpty (Map k a)

HasEmpty (HashMap k a)

class HasEmptyWith s k where

Methods

emptyWith :: k -> s

Instances

HasEmptyWith k a => HasEmptyWith k (XUnion a)

HasEmptyWith k a => HasEmptyWith k (Intersection a)

HasEmptyWith k a => HasEmptyWith k (Union a)

HasEmptyWith (FiniteSet a) (Set a)

HasEmptyWith (SetWith k a) (a -> k)

class HasTotal s where

Methods

total :: s

Instances

HasTotal (Predicate a)

HasTotal a => HasTotal (XUnion a)

HasTotal a => HasTotal (Intersection a)

HasTotal a => HasTotal (Union a)

class HasTotalWith s k where

Methods

totalWith :: k -> s

Instances

HasTotalWith k a => HasTotalWith k (XUnion a)

HasTotalWith k a => HasTotalWith k (Intersection a)

HasTotalWith k a => HasTotalWith k (Union a)

HasTotalWith (FiniteSet a) (FiniteSet a)

class HasSize s where

Methods

size :: s -> Int

Instances

HasSize IntSet

HasSize [a]

HasSize (IntMap a)

HasSize (Set a)

HasSize (Seq a)

HasSize (FiniteSet a)

HasSize (UUSet a)

HasSize (UMSet a)

HasSize (OMSet a)

HasSize (HashSet a)

HasSize a => HasSize (XUnion a)

HasSize a => HasSize (Intersection a)

HasSize a => HasSize (Union a)

HasSize (Map k a)

HasSize (HashMap k a)

HasSize (SetWith k a)

class CanBeSubset s where

Methods

isSubsetOf :: s -> s -> Bool

Instances

CanBeSubset IntSet

Eq a => CanBeSubset (IntMap a)

Ord a => CanBeSubset (Set a)

Ord a => CanBeSubset (FiniteSet a)

Eq a => CanBeSubset (UUSet a)

Eq a => CanBeSubset (UMSet a)

Eq a => CanBeSubset (OMSet a)

CanBeSubset a => CanBeSubset (XUnion a)

CanBeSubset a => CanBeSubset (Intersection a)

CanBeSubset a => CanBeSubset (Union a)

(Eq k, Ord k, Eq a) => CanBeSubset (Map k a)

(Ord k, Eq a) => CanBeSubset (SetWith k a)

class CanBeProperSubset s where

Methods

isProperSubsetOf :: s -> s -> Bool

Instances

CanBeProperSubset IntSet

Eq a => CanBeProperSubset (IntMap a)

Ord a => CanBeProperSubset (Set a)

Ord a => CanBeProperSubset (FiniteSet a)

Eq a => CanBeProperSubset (UUSet a)

Eq a => CanBeProperSubset (UMSet a)

Eq a => CanBeProperSubset (OMSet a)

CanBeProperSubset a => CanBeProperSubset (XUnion a)

CanBeProperSubset a => CanBeProperSubset (Intersection a)

CanBeProperSubset a => CanBeProperSubset (Union a)

(Eq k, Ord k, Eq a) => CanBeProperSubset (Map k a)

(Ord k, Eq a) => CanBeProperSubset (SetWith k a)