setops-0.1: Uniform names (and Unicode operators) for set operations on data structures.

Data.SetOps

Synopsis

Documentation

class Member a b | b -> a whereSource

Methods

member :: a -> b -> BoolSource

Instances

Member Int IntSet 
Ord a => Member a (Set a) 
Eq a => Member a [a] 
Member Key (IntMap v) 
Ord k => Member k (Map k v) 

(∈) :: Member a b => a -> b -> BoolSource

(∉) :: Member a b => a -> b -> BoolSource

(∋) :: Member a b => b -> a -> BoolSource

(∌) :: Member a b => b -> a -> BoolSource

class ProperSubsetOf a whereSource

Methods

isProperSubsetOf :: a -> a -> BoolSource

Instances

(⊂) :: ProperSubsetOf a => a -> a -> BoolSource

(⊄) :: ProperSubsetOf a => a -> a -> BoolSource

(⊃) :: ProperSubsetOf a => a -> a -> BoolSource

(⊅) :: ProperSubsetOf a => a -> a -> BoolSource

class SubsetOf a whereSource

Methods

isSubsetOf :: a -> a -> BoolSource

Instances

SubsetOf IntSet 
Eq v => SubsetOf (IntMap v) 
Ord a => SubsetOf (Set a) 
(Ord k, Eq v) => SubsetOf (Map k v) 

(⊆) :: SubsetOf a => a -> a -> BoolSource

(⊈) :: SubsetOf a => a -> a -> BoolSource

(⊇) :: SubsetOf a => a -> a -> BoolSource

(⊉) :: SubsetOf a => a -> a -> BoolSource

class Union a whereSource

Methods

union :: a -> a -> aSource

Instances

Union IntSet 
Eq a => Union [a] 
Union (IntMap v) 
Ord a => Union (Set a) 
Ord k => Union (Map k v) 

(∪) :: Union a => a -> a -> aSource

class Intersection a whereSource

Methods

intersection :: a -> a -> aSource

Instances

(∩) :: Intersection a => a -> a -> aSource

class Empty a whereSource

Methods

empty :: aSource

Instances

Empty IntSet 
Empty [a] 
Empty (IntMap v) 
Empty (Set a) 
Empty (Map k v) 

(∅) :: Empty a => aSource

.

class Singleton a b | b -> a whereSource

Methods

singleton :: a -> bSource

Instances

Singleton Int IntSet 
Ord a => Singleton a (Set a) 
Singleton a [a] 
Singleton (Key, v) (IntMap v) 
Ord k => Singleton (k, v) (Map k v) 

class Insert a b | b -> a whereSource

Methods

insert :: a -> b -> bSource

Instances

Insert Int IntSet 
Ord a => Insert a (Set a) 
Ord a => Insert a [a] 
Insert (Key, v) (IntMap v) 
Ord k => Insert (k, v) (Map k v)