Data.EnumMapSet

Based on Data.IntSet.

Documentation

type EnumMapSet k = EnumMapMap k ()

data K k

Keys are terminated with the K type

 singleKey :: K Int
 singleKey = K 5

Constructors

K !k

Instances

Eq k => Eq (K k)

Show k => Show (K k)

Enum k => IsEmm (K k)

Enum k => IsEmm (K k)

Enum k => IsEmm (K k)

Show v => Show (EnumMapMap (K k) v)

Show v => Show (EnumMapMap (K k) v)

NFData v => NFData (EnumMapMap (K k) v)

NFData v => NFData (EnumMapMap (K k) v)

data k :& t

Multiple keys are joined by the (:&) constructor and terminated with K.

 multiKey :: Int :& Int :& K Int
 multiKey = 5 :& 6 :& K 5

Constructors

!k :& !t

Instances

(Eq k, Eq t) => Eq (:& k t)

(Show v, Show (EnumMapMap t v)) => Show (EnumMapMap (:& k t) v)

(Show k, Show t) => Show (:& k t)

(NFData v, NFData (EnumMapMap t v)) => NFData (EnumMapMap (:& k t) v)

(Enum k, IsEmm t) => IsEmm (:& k t)

IsSplit (:& k t) Z

IsSplit (:& k t) Z

(IsSplit t n, Enum k) => IsSplit (:& k t) (N n)

Query

null :: IsEmm k => EnumMapSet k -> Bool

size :: IsEmm k => EnumMapSet k -> Int

member :: IsEmm k => k -> EnumMapSet k -> Bool

Construction

empty :: IsEmm k => EnumMapSet k

singleton :: IsEmm k => k -> EnumMapSet k

insert :: IsEmm k => k -> EnumMapSet k -> EnumMapSet k

delete :: IsEmm k => k -> EnumMapSet k -> EnumMapSet k

Combine

union :: IsEmm k => EnumMapSet k -> EnumMapSet k -> EnumMapSet k

difference :: IsEmm k => EnumMapSet k -> EnumMapSet k -> EnumMapSet k

intersection :: IsEmm k => EnumMapSet k -> EnumMapSet k -> EnumMapSet k

Map

map :: (IsEmm k1, IsEmm k2) => (k1 -> k2) -> EnumMapSet k1 -> EnumMapSet k2

map f s is the set obtained by applying f to each element of s.

It's worth noting that the size of the result may be smaller if, for some (x,y), x /= y && f x == f y

Folds

foldr :: IsEmm k => (k -> t -> t) -> t -> EnumMapSet k -> t

Lists

toList :: IsEmm k => EnumMapSet k -> [k]

fromList :: IsEmm k => [k] -> EnumMapSet k