Control.Monad.Union.Class

Documentation

class Monad m => MonadUnion l m | m -> l where

Methods

new :: l -> m Node

Add a new node, with a given label.

lookup :: Node -> m (Node, l)

Find the node representing a given node, and its label.

merge :: (l -> l -> (l, a)) -> Node -> Node -> m (Maybe a)

Merge two sets. The first argument is a function that takes the labels of the corresponding sets' representatives and computes a new label for the joined set. Returns Nothing if the given nodes are in the same set already.

annotate :: Node -> l -> m ()

Re-label a node.

flatten :: m ()

Flatten the disjoint set forest for faster lookups.

Instances

(MonadUnion l m, MonadTrans t, Monad (t m)) => MonadUnion l (t m)

Defined in Control.Monad.Union.Class

Methods

new :: l -> t m Node

lookup :: Node -> t m (Node, l)

merge :: (l -> l -> (l, a)) -> Node -> Node -> t m (Maybe a)

annotate :: Node -> l -> t m ()

flatten :: t m ()

MonadUnion l (UnionM l)

Defined in Control.Monad.Union

Methods

new :: l -> UnionM l Node

lookup :: Node -> UnionM l (Node, l)

merge :: (l -> l -> (l, a)) -> Node -> Node -> UnionM l (Maybe a)

annotate :: Node -> l -> UnionM l ()

flatten :: UnionM l ()