Data.Union

Immutable disjoint set forests.

Documentation

data Union a

An immutable disjoint set forest.

newtype Node

A node in a disjoint set forest.

Constructors

Node

Fields

• fromNode :: Int

Instances

Eq Node

Defined in Data.Union.Type

Methods

(==) :: Node -> Node -> Bool

(/=) :: Node -> Node -> Bool

Ord Node

Defined in Data.Union.Type

Methods

compare :: Node -> Node -> Ordering

(<) :: Node -> Node -> Bool

(<=) :: Node -> Node -> Bool

(>) :: Node -> Node -> Bool

(>=) :: Node -> Node -> Bool

max :: Node -> Node -> Node

min :: Node -> Node -> Node

Ix Node

Defined in Data.Union.Type

Methods

range :: (Node, Node) -> [Node]

index :: (Node, Node) -> Node -> Int

unsafeIndex :: (Node, Node) -> Node -> Int

inRange :: (Node, Node) -> Node -> Bool

rangeSize :: (Node, Node) -> Int

unsafeRangeSize :: (Node, Node) -> Int

size :: Union l -> Int

Get the number of nodes in the forest.

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

Look up the representative of a node, and its label.

lookupFlattened :: Union a -> Node -> (Node, a)

Version of lookup that assumes the forest to be flattened. (cf. flatten.)

Do not use otherwise: It will give wrong results!