union-find-array-0.1.0.3: union find data structure
Safe HaskellNone
LanguageHaskell2010

Data.Union.Type

Synopsis

Documentation

data Union a Source #

An immutable disjoint set forest.

Constructors

Union 

Fields

newtype Node Source #

A node in a disjoint set forest.

Constructors

Node 

Fields

Instances

Instances details
Eq Node Source # 
Instance details

Defined in Data.Union.Type

Methods

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

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

Ord Node Source # 
Instance details

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 Source # 
Instance details

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 #