Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.UnionFind.Mutable

Description

A union-Find tree or a disjoint set.

Typical problems

Typical 012 - Red Painting (★4)

Synopsis

newtype MUnionFind s = MUnionFind (MVector s MUFNode)
type IOUnionFind = MUnionFind RealWorld
type STUnionFind s = MUnionFind s
data MUFNode
- = MUFChild !Int
- | MUFRoot !Int
newMUF :: PrimMonad m => Int -> m (MUnionFind (PrimState m))
rootMUF :: (HasCallStack, PrimMonad m) => MUnionFind (PrimState m) -> Int -> m Int
sameMUF :: (HasCallStack, PrimMonad m) => MUnionFind (PrimState m) -> Int -> Int -> m Bool
_unwrapMUFRoot :: MUFNode -> Int
unifyMUF :: (HasCallStack, PrimMonad m) => MUnionFind (PrimState m) -> Int -> Int -> m Bool
unifyMUF_ :: (HasCallStack, PrimMonad m) => MUnionFind (PrimState m) -> Int -> Int -> m ()
sizeMUF :: (HasCallStack, PrimMonad m) => MUnionFind (PrimState m) -> Int -> m Int
clearMUF :: PrimMonad m => MUnionFind (PrimState m) -> m ()
groupRootsMUF :: (HasCallStack, PrimMonad m) => MUnionFind (PrimState m) -> m (Vector Int)
groupsMUF :: (HasCallStack, PrimMonad m) => MUnionFind (PrimState m) -> m (IntMap [Int])

Documentation

newtype MUnionFind s #

Dense, mutable Union-Find tree (originally by `@pel`)

>>> stree <- newMUF 3
>>> sameMUF stree 0 2
False
>>> unifyMUF stree 0 2
True
>>> sameMUF stree 0 2
True
>>> unifyMUF stree 0 2
False

Show MUFNode #
Instance details Defined in Data.UnionFind.Mutable Methods showsPrec :: Int -> MUFNode -> ShowS # show :: MUFNode -> String # showList :: [MUFNode] -> ShowS #
Eq MUFNode #
Instance details Defined in Data.UnionFind.Mutable Methods (==) :: MUFNode -> MUFNode -> Bool # (/=) :: MUFNode -> MUFNode -> Bool #
Unbox MUFNode #
Instance details Defined in Data.UnionFind.Mutable
Vector Vector MUFNode #
Instance details Defined in Data.UnionFind.Mutable Methods basicUnsafeFreeze :: Mutable Vector s MUFNode -> ST s (Vector MUFNode) # basicUnsafeThaw :: Vector MUFNode -> ST s (Mutable Vector s MUFNode) # basicLength :: Vector MUFNode -> Int # basicUnsafeSlice :: Int -> Int -> Vector MUFNode -> Vector MUFNode # basicUnsafeIndexM :: Vector MUFNode -> Int -> Box MUFNode # basicUnsafeCopy :: Mutable Vector s MUFNode -> Vector MUFNode -> ST s () # elemseq :: Vector MUFNode -> MUFNode -> b -> b #
MVector MVector MUFNode #
Instance details Defined in Data.UnionFind.Mutable Methods basicLength :: MVector s MUFNode -> Int # basicUnsafeSlice :: Int -> Int -> MVector s MUFNode -> MVector s MUFNode # basicOverlaps :: MVector s MUFNode -> MVector s MUFNode -> Bool # basicUnsafeNew :: Int -> ST s (MVector s MUFNode) # basicInitialize :: MVector s MUFNode -> ST s () # basicUnsafeReplicate :: Int -> MUFNode -> ST s (MVector s MUFNode) # basicUnsafeRead :: MVector s MUFNode -> Int -> ST s MUFNode # basicUnsafeWrite :: MVector s MUFNode -> Int -> MUFNode -> ST s () # basicClear :: MVector s MUFNode -> ST s () # basicSet :: MVector s MUFNode -> MUFNode -> ST s () # basicUnsafeCopy :: MVector s MUFNode -> MVector s MUFNode -> ST s () # basicUnsafeMove :: MVector s MUFNode -> MVector s MUFNode -> ST s () # basicUnsafeGrow :: MVector s MUFNode -> Int -> ST s (MVector s MUFNode) #
IsoUnbox MUFNode (Bool, Int) #
Instance details Defined in Data.UnionFind.Mutable Methods toURepr :: MUFNode -> (Bool, Int) # fromURepr :: (Bool, Int) -> MUFNode #
newtype Vector MUFNode #
Instance details Defined in Data.UnionFind.Mutable newtype Vector MUFNode = V_MUFNode (Vector (Bool, Int))
newtype MVector s MUFNode #
Instance details Defined in Data.UnionFind.Mutable newtype MVector s MUFNode = MV_MUFNode (MVector s (Bool, Int))