STMContainers.Multimap

Documentation

data Multimap k v

A multimap, based on an STM-specialized hash array mapped trie.

Basically it's just a wrapper API around Map k (Set v).

Instances

Typeable (* -> * -> *) Multimap

type Association k v = (Key k, Value v)

A constraint for associations.

type Key k = Key k

A constraint for keys.

type Value v = Element v

A constraint for values.

new :: STM (Multimap k v)

Construct a new multimap.

newIO :: IO (Multimap k v)

Construct a new multimap in IO.

This is useful for creating it on a top-level using unsafePerformIO, because using atomically inside unsafePerformIO isn't possible.

insert :: Association k v => v -> k -> Multimap k v -> STM ()

Insert an item.

delete :: Association k v => v -> k -> Multimap k v -> STM ()

Delete an item by a value and a key.

deleteByKey :: Key k => k -> Multimap k v -> STM ()

Delete all values associated with a key.

lookup :: Association k v => v -> k -> Multimap k v -> STM Bool

Look up an item by a value and a key.

focus :: Association k v => StrategyM STM () r -> v -> k -> Multimap k v -> STM r

Focus on an item with a strategy by a value and a key.

This function allows to perform simultaneous lookup and modification.

The strategy is over a unit since we already know, which value we're focusing on and it doesn't make sense to replace it, however we still can decide wether to keep or remove it.

null :: Multimap k v -> STM Bool

Check on being empty.

stream :: Multimap k v -> ListT STM (k, v)

Stream associations.

Amongst other features this function provides an interface to folding via the fold function.

streamKeys :: Multimap k v -> ListT STM k

Stream keys.

streamByKey :: Association k v => k -> Multimap k v -> ListT STM v

Stream values by a key.